Network planning for Type 1 and Type 1a relay nodes in LTE‐Advanced networks

In this paper, the planning problem of multiple evolved Node Bs (eNBs) and two types of relay nodes is defined base on linear programming. Type 1 relay nodes are placed in the center of eNB, and Type 1a relay nodes are deployed at cell edge. Three algorithms are proposed to investigate the Type 1a relay node placement and communication interference. All algorithms are designed on the basis of graph theory and analyzed in planning case and simulation results. The ultimate goal is to maximize the average throughput of all served users with minimum communication interference. Results showed that the proposed interference coordination algorithm not only provides the lowest construction cost with slightly fewer numbers of served users but also eliminates the communication interference with the highest average throughput. Most importantly, it achieves the best communication quality for next generation mobile networks. Copyright © 2015 John Wiley & Sons, Ltd.     

Expectation–maximization‐based joint data detection and channel estimation for a cellular multi‐carrier code division multiple access network using single‐hop relaying

This paper is concerned with channel estimation and data detection for a cellular multi‐carrier code division multiple access network using single‐hop relaying in the presence of frequency selective fading channels. The proposed expectation–maximization (EM) algorithm was used to jointly estimate both the coefficients of the channel between a relay and a base station and the data. EM algorithm is particularly suited to multi‐carrier code division multiple access systems because they have multi‐carrier signal format. The considered network uses single‐hop relaying technique to provide a higher quality transmission to the users with low quality channels. The base station (managing mechanism) gives them an opportunity to send their messages via the users with high quality channels in a time sharing mode. The performance of the proposed EM algorithm, with and without hopping and with cooperative communication technique, was analyzed by a computer simulation, and the results are presented. Copyright © 2011 John Wiley & Sons, Ltd.     

An efficient and fair cooperative approach for resource management in wireless networks

In cellular networks, the implementation of various resource management processes, such as bandwidth reservation and location updates, has been based on the one‐to‐one resource management information exchange paradigm, between the mobile nodes and the base stations. In this paper, we design and demonstrate the use of a distributed cooperative scheme that can be applied in the future wireless networks to improve the energy consumption for the routine management processes of mobile terminals, by adopting the peer‐to‐peer communication concept of wireless ad hoc networks. In our approach, the network is subdivided into one‐hop ad hoc clusters where the members of each cluster cooperate to perform the required management functions, and conventional individual direct report transmissions of the mobile terminals to the base stations are replaced by two‐hop transmissions. The performance evaluation and the corresponding numerical results presented in this paper confirm that our proposed scheme reduces significantly the overall system energy consumption when compared with the conventional one‐to‐one direct information management exchange approach. Furthermore the issue of fairness in dynamically selecting the various cluster heads in successive operational cycles of the proposed scheme is analyzed, and an enhanced algorithm is proposed and evaluated, which improves significantly the cluster head selection fairness, in order to balance the energy consumption among the various mobile terminals. Copyright © 2005 John Wiley & Sons, Ltd.     

Load‐balanced data gathering in Internet of Things using an energy‐aware cuckoo‐search algorithm

This paper deals with the lifetime problem in the Internet of Things. We first propose an efficient cluster‐based scheme named “Cuckoo‐search Clustering with Two‐hop Routing Tree (CC‐TRT)” to develop a two‐hop load‐balanced data aggregation routing tree in the network. CC‐TRT uses a modified energy‐aware cuckoo‐search algorithm to fairly select the best cluster head (CH) for each cluster. The applied cuckoo‐search algorithm makes the CH role to rotate between different sensors round by round. Subsequently, we extend the CC‐TRT scheme to present two methods for constructing multi‐hop data aggregation routing trees, named “Cuckoo‐search Clustering with Multi‐Hop Routing Tree (CC‐MRT)” and “Cuckoo‐search Clustering with Weighted Multi‐hop Routing Tree (CC‐WMRT).” Both CC‐MRT and CC‐WMRT rely on a two‐level structure; they not only use an energy‐aware cuckoo‐search algorithm to fairly select the best CHs but also adopt a load‐balanced high‐level routing tree to route the aggregated data of CHs to the sink node. However, CC‐WMRT slightly has a better performance thanks to its low‐level routing strategy. As an advantage, the proposed schemes balance the energy consumption among different sensors. Numerical results show the efficiency of the CC‐TRT, CC‐MRT, and CC‐WMRT algorithms in terms of the number of transmissions, remaining energy, energy consumption variance, and network lifetime.     

Parallel relay‐assisted three‐phase MIMO space division multiple access transmission for multi‐hop throughput improvement

Multi‐hop communications equipped with parallel relay nodes is an emerging network scenario visible in environments with high node density. Conventional interference‐free medium access control (MAC) has little capability in utilizing such parallel relays because it essentially prohibits the existence of co‐channel interference and limits the feasibility of concurrent communications. This paper aims at presenting a cooperative multi‐input multi‐output (MIMO) space division multiple access (SDMA) design that uses each hop's parallel relay nodes to improve multi‐hop throughput performance. Specifically, we use MIMO and SDMA to enable concurrent transmissions (from multiple Tx nodes to single/multiple Rx nodes) and suppress simultaneous links' co‐channel interference. As a joint physical layer (MAC/PHY) solution, our design has multiple MAC modules including load balancing that uniformly splits traffic packets at parallel relay nodes and multi‐hop scheduling taking co‐channel interference into consideration. Meanwhile, our PHY layer modules include distributive channel sounding that exchanges channel information in a decentralized manner and link adaptation module estimating instantaneous link rate per time frame. Simulation results validate that compared with interference‐free MAC or existing Mitigating Interference using Multiple Antennas (MIMA‐MAC), our proposed design can improve end‐to‐end throughput by around 30% to 50%. In addition, we further discuss its application on extended multi‐hop topology. Copyright © 2012 John Wiley & Sons, Ltd.     

A distributed,multi‐hop,adaptive, tree‐based energy‐balanced routing approach

To accomplish the primary objective of data sensing and collection of wireless sensor networks (WSN), the design of an energy efficient routing algorithm is very important. However, the energy constrained sensing nodes along with the intrinsic properties of the (WSN) environment makes the routing a challenging task. To overcome this routing dilemma, an improved distributed, multi‐hop, adaptive, tree‐based energy‐balanced (DMATEB) routing scheme is proposed in this paper. In this scheme, a relay node is selected in view of minimum distance and high energy from a current sensing node. Further, the parent node is chosen among the selected relay nodes on the basis of high residual energy and less power consumption with due consideration of its associated child nodes. As each sensing node itself selects its parent among the available alternatives, the proposed scheme offers a distributive and adaptive approach. Moreover, the proposed system does not overload any selected parent of a particular branch as it starts acting as a child whenever its energy lowers among the other available relay nodes. This leads to uniform energy utilization of nodes that offers a better energy balance mechanism and improves the network lifespan by 20% to 30% as compared with its predecessors.     

基于两跳匹配的OFDMA中继网络联合资源分配算法

针对OFDMA中继网络的两跳特性,提出一种基于两跳匹配的中继网络联合资源分配算法。首先根据中继网络的两跳性建立两跳速率匹配模型,然后利用对偶分解理论将中继网络资源分配的主问题分解为：中继选择、子载波分配和功率分配三个主要的子问题并进行联合优化,同时基于中继网络两跳性在子载波分配的过程中考虑两跳子载波配对,以逼近系统最优解。最后为了保证算法的公平性,考虑子载波分配因子约束以优化子载波分配。仿真结果表明：所提算法将中继选择、两跳子载波配对与功率分配联合优化以进一步提升系统吞吐量,同时引入子载波分配因子约束,保证了算法的公平性。     

两跳蜂窝移动系统中继信道分配策略

在频率复用因子为1的两跳固定中继节点的蜂窝移动通信系统中,基于现实移动业务分布的时变性和非均匀性,提出了新的中继信道分配策略。与传统的中继信道分配策略相比,该策略不需要BS之间的协作,也能严格控制相邻小区之间同频RS的干扰距离,降低同信道干扰,在较低的系统复杂度下,实现了无线资源的有效利用。     

Multi‐interface cognitive radio for enhanced routing in multi‐hop cellular networks

Multi‐hop cellular network (MCN) is a wireless communication architecture that combines the benefits of conventional single‐hop cellular networks and multi‐hop ad hoc relaying networks. The route selection in MCN depends on the availability of intermediate nodes and their neighborhood connectivity. Cognitive radio (CR) is an emerging communication paradigm that exploits the available radio frequencies opportunistically for the effective utilization of the radio frequency spectrum. The incorporation of CR and mobile ad hoc network routing protocols in MCN could potentially improve the spectrum utilization and the routing performance of MCN. This paper firstly presents the proposed model for the multi‐interface CR mobile node with transceiver synchronization and then investigates its opportunistic spectrum utilization and routing performance in MCN. Copyright © 2015 John Wiley & Sons, Ltd.     

A downlink beamforming assisted by locally positioned communication devices

Recently, multiple cell types with overlapping coverage have been deployed simultaneously to increase cellular network capacity. Cross‐tier interference is one of the key technical challenges in the use of this method. A simple and practical beamforming scheme assisted by locally positioned communication devices for the downlink of a multi‐cell wireless hierarchical cell structure system is proposed in this paper to maximize the capacity of the embedded small cell and simultaneously ensure minimal impact on the performance of existing macrocells. The locally positioned communication devices can be implemented with low complexity and at low cost and can continuously provide helpful and accurate information to base stations for the proper configuration of geographical cell coverage, allowing neighboring cells to cooperate effectively with each other. Simulation results verify that the proposed scheme can provide a significant gain over conventional systems not using the proposed algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

A structured Solar System satellite relay constellation network topology design for Earth‐Mars deep space communications

The deep space exploration missions require high quality of communication performance between the Earth stations and various deep space explorers, such as Mars orbiters and rovers. Due to the difficulties on improving the point‐to‐point physical wireless link capacity, it is necessary to study the relay network communications under the structured idea. In this paper, the structured Solar System satellite relay constellation network is proposed for Earth‐Mars deep space communications, including the mission background, mathematic model, topology design, and performance analysis. The satellite relay constellation could be modelled as a 2‐dimensional structure with multiple concentric circle loops and multiple relate satellites on each loop. With the different optimal objectives as shortest path, minimum hops and minimum nodes required under the constraint threshold distance for each hop, both the Monte Carlo method and modified Shortest Path First algorithms are studied to work out the optimal network topology designs. Simulation results show that, our network topology design could satisfy the requirements on continuous dual‐directional end‐to‐end communications between the Earth and Mars over the whole mission life period and guarantee the performance of end‐to‐end multihop links above the lowest boundary.     

A novel residual energy‐based distributed clustering and routing approach for performance study of wireless sensor network

Non‐uniform energy consumption during operation of a cluster‐based routing protocol for large‐scale wireless sensor networks (WSN) is major area of concern. Unbalanced energy consumption in the wireless network results in early node death and reduces the network lifetime. This is because nodes near the sink are overloaded in terms of data traffic compared with the far away nodes resulting in node deaths. In this work, a novel residual energy–based distributed clustering and routing (REDCR) protocol has been proposed, which allows multi‐hop communication based on cuckoo‐search (CS) algorithm and low‐energy adaptive‐clustering–hierarchy (LEACH) protocol. LEACH protocol allows choice of possible cluster heads by rotation at every round of data transmission by a newly developed objective function based on residual energy of the nodes. The information about the location and energy of the nodes is forwarded to the sink node where CS algorithm is implemented to choose optimal number of cluster heads and their positions in the network. This approach helps in uniform distribution of the cluster heads throughout the network and enhances the network stability. Several case studies have been performed by varying the position of the base stations and by changing the number of nodes in the area of application. The proposed REDCR protocol shows significant improvement by an average of 15% for network throughput, 25% for network scalability, 30% for network stability, 33% for residual energy conservation, and 60% for network lifetime proving this approach to be more acceptable one in near future.     

基于负载均衡的中继选择和频谱转移联合优化策略

针对负载失衡或热点覆盖无线中继网络,提出一种基于负载均衡的自适应中继选择和频谱转移联合优化策略。定义了一种衡量一个站点对周围同频站点干扰程度的干扰容量,为某站点对其他站点的干扰提供了量化分析指标。当用户申请接入时,首先根据各条链路的信道状况选择首选接入站点和备选接入站点,当首选接入站点负载过重而无足够资源使其接入时,对接入备选站点和从与首选站点同扇区的其他站点向首选站点进行频谱转移的性能进行比较,选择一种维持系统性能较好的方式接入。仿真结果表明,所提算法在中心小区的频谱效率和阻塞率都优于单一的基于负载均衡的中继选择策略和单一的基于负载均衡的频谱转移策略,并且平均干扰容量也最低,对周围小区的系统性能影响较小。     

Performance evaluation of multicast relay network using LDPC and convolutional channel codes along-with XOR network coding

In this paper,we have compared the performance of joint network channel coding(JNCC) for multicast relay network using low density parity check(LDPC) codes and Convolutional codes as channel codes while exclusive or(XOR) network coding used at the intermediate relay nodes.Multicast relay transmission is a type of transmission scheme in which two fixed relay nodes contribute in the second hop of end-to-end transmission between base transceiver station(BTS) and a pair of mobile stations.We have considered one way and two way multicast scenarios to evaluate the bit error rate(BER) and throughput performance.It has been shown that when using XOR network coding at the intermediate relay nodes,the same transmission becomes possible in less time slots hence throughput performance can be improved.Moreover we have also discussed two possible scenarios in the proposed system model,in which both diversity and multiplexing gain has been considered.It is worth notifying that BER and throughput achieved for LDPC codes is better than Convolutional codes for all the schemes discussed.     

Secure Connectivity Probability of Multi‐hop Clustered Randomize‐and‐Forward Networks

This work investigates secure cluster‐aided multi‐hop randomize‐and‐forward networks. We present a hop‐by‐hop multi‐hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop‐by‐hop transmission scheme. For comparison, we also analyze SCPs of traditional end‐to‐end transmission schemes with two relay‐selection policies. We perform simulations, and our analytical results verify that the proposed hop‐by‐hop scheme is superior to end‐to‐end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop‐by‐hop scheme achieves near‐optimal performance in terms of the SCP.     

Distributed fuzzy approach to unequal clustering and routing algorithm for wireless sensor networks

Due to inherent issue of energy limitation in sensor nodes, the energy conservation is the primary concern for large‐scale wireless sensor networks. Cluster‐based routing has been found to be an effective mechanism to reduce the energy consumption of sensor nodes. In clustered wireless sensor networks, the network is divided into a set of clusters; each cluster has a coordinator, called cluster head (CH). Each node of a cluster transmits its collected information to its CH that in turn aggregates the received information and sends it to the base station directly or via other CHs. In multihop communication, the CHs closer to the base station are burdened with high relay load; as a result, their energy depletes much faster as compared with other CHs. This problem is termed as the hot spot problem. In this paper, a distributed fuzzy logic‐based unequal clustering approach and routing algorithm (DFCR) is proposed to solve this problem. Based on the cluster design, a multihop routing algorithm is also proposed, which is both energy efficient and energy balancing. The simulation results reinforce the efficiency of the proposed DFCR algorithm over the state‐of‐the‐art algorithms, ie, energy‐aware fuzzy approach to unequal clustering, energy‐aware distributed clustering, and energy‐aware routing algorithm, in terms of different performance parameters like energy efficiency and network lifetime.     

Hybrid channel estimation for MIMO relay systems with Doppler offset influences

The design of the channel estimation method in a multiple‐input multiple‐output (MIMO) relay system plays a highly crucial role in deciding the overall system performance. For the realistic scenarios specifically, with fast time‐varying channel conditions due to highly mobile communicating nodes, the degree of accuracy to which the channel estimates are obtained for MIMO relay systems influences the communication system reliability significantly. However, most of the channel estimation approaches proposed in literature for MIMO relay systems assume that the Doppler offset contributed by highly mobile nodes is already known to the receiver, ignoring the resulting nonlinear system dynamics. Hence, a novel hybrid algorithm is proposed to address the issue of time‐varying channel estimation under fast‐fading channel condition with Doppler offset influences contributed by high‐mobility communicating nodes for a 1‐way 2‐hop MIMO amplify‐and‐forward relaying system. The problem is first formulated as a nonlinear state‐space model, and then an algorithm is developed to estimate the individual source‐to‐relay and relay‐to‐destination channels in the presence of the associated dynamic Doppler offset. In the proposed method, a set of superimposed orthogonal pilots is used for aiding in the updation of the channel gains, since Kalman filter–based updation may lead to accumulation of estimation and prediction error. A detailed computational complexity analysis of the proposed hybrid algorithm is presented, which shows that the algorithm has moderate computational complexity with a good performance in fast time‐varying channel conditions with high node mobility in a dual‐hop MIMO relay system.     

Probabilistic routing protocol for a hybrid wireless underground sensor networks

A wireless underground sensor network (WUSN) is defined as a network of wireless sensor devices in which all sensor devices are deployed completely underground (network sinks or any devices specifically for relay between sensors and a sink may be aboveground). In hybrid wireless underground sensor network (HWUSN), communication between nodes is implemented from underground‐to‐air or air‐to‐underground, not underground‐to‐underground. This paper proposes a novel hybrid underground probabilistic routing protocol that provides an efficient means of communication for sensor nodes in HWUSN. In addition, signal propagation based on the shadowing model for underground medium is developed. The proposed routing protocol ensures high packet throughput, prolongs the lifetime of HWUSN and the random selection of the next hop with multi‐path forwarding contributes to built‐in security. Moreover, the proposed mechanism utilizes an optimal forwarding (OF) decision that takes into account of the link quality, and the remaining power of next hop sensor nodes. The performance of proposed routing protocol has been successfully studied and verified through the simulation and real test bed. Copyright © 2011 John Wiley & Sons, Ltd.     

Extending P2PMesh: topology‐aware schemes for efficient peer‐to‐peer data sharing in wireless mesh networks

Wireless mesh networks (WMNs) have emerged as a promising technology that provides low‐cost broadband access to the Internet for fixed and mobile wireless end users. An orthogonal evolution in computer networking has been the rise of peer‐to‐peer (P2P) applications such as P2P data sharing. It is of interest to enable effective P2P data sharing in this type of networks. Conventional P2P data sharing systems are not cognizant of the underlying network topology and therefore suffer from inefficiency. We argue for dual‐layer mesh network architecture with support from wireless mesh routers for P2P applications. The main contribution of this paper is P2PMesh: a topology‐aware system that provides combined architecture and efficient schemes for enabling efficient P2P data sharing in WMNs. The P2PMesh architecture utilizes three schemes: (i) an efficient content lookup that mitigates traffic load imbalance at mesh routers; (ii) an efficient establishment of download paths; and (iii) a data transfer protocol for multi‐hop wireless networks with limited capacity. We note here that the path establishment and data transfer schemes are specific to P2P traffic and that other traffic would use routes determined by the default routing protocol in the WMN. Simulation results suggest that P2PMesh has the potential to improve the performance of P2P applications in a wireless multi‐hop setting; specifically, we focused on data sharing, but other P2P applications can also be supported by this approach. Copyright © 2011 John Wiley & Sons, Ltd.     

无线网络多网协同下的规划优化

本文首先探究了无线网络规划中多网通信的特点以及无线网络多网协同下规划设计的原则,重点分析了增强多网协同下的无线网络规划优化的措施,以此来降低移动通信的建设成本,提高网络质量与安全.