Upgrading Wireless Networks with Selection Combining
نویسنده
چکیده
A selection combining scheme is considered as an upgrade solution to existing wireless networks. The upgrade requires the use of a new radio frequency front end at the receiver with three antennas instead of one. An approach to guarding the system from diversity loss caused by antennas proximity is proposed. As an example, the upgrade of mobile units in an IS-136 network is analyzed. Performance is evaluated by computing the bit error rate, outage probability, average signal to noise ratio and mean switching rate of the considered scheme. Index Terms – Diversity methods, fading channels.
منابع مشابه
Performance Analysis of Wireless Cooperative Networks with Iterative Incremental Relay Selection
In this paper, an iterative incremental relay selection (IIRS) scheme is considered for wireless cooperative networks in order to increase the reliability of transmission. Different from the conventional incremental relay selection which incrementally selects a best relay for only one iteration; the IIRS scheme iteratively applies the incremental relaying and relay selection processes. To evalu...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملSelection Combining Upgrade Schemes for Mobile Units in Wireless Networks
Selection combining is considered for upgrading the performance of mobile units in wireless networks. Three upgrade schemes are considered: 2 antennas array, 3 antennas array in circular geometrical setting and 3 antennas in linear geometrical setting. The problem of diversity loss due to antennas proximity is addressed and an approach for decreasing the loss is proposed. The approach is based ...
متن کاملCombining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کامل