A fuzzy decision scheme for relay selection in cooperative wireless sensor network

In energy‐constrained military wireless sensor networks, minimizing the bit error rate (BER) with little compromise on network lifetime is one of the most challenging issues. This paper presents a new relay selection based on fuzzy logic (RSFL) scheme which provides balance between these parameters. The proposed scheme considers node's residual energy and path loss of the relay‐destination link as the input parameters for the selection of the relay node. The relay node selection by fuzzy logic is based on prioritizing higher residual energy and minimum path loss. To evaluate the performance on wireless sensor network, we compare the proposed scheme with the three existing relay selection strategies, ie, random, maximum residual energy based relay selection (MaxRes), and minimum energy consumption based relay selection (MinEnCon). The simulation results of the proposed scheme in terms of network lifetime, BER, Network Survivability Index (NSI), and average energy of network nodes have been presented and compared with different relay selection schemes. The simulation results show that the proposed RSFL scheme has the lowest BER, moderate network lifetime, average energy, and NSI.     

Energy efficiency based joint cell selection and power allocation scheme for HetNets

Heterogeneous networks (HetNets) composed of overlapped cells with different sizes are expected to improve the transmission performance of data service significantly. User equipments (UEs) in the overlapped area of multiple cells might be able to access various base stations (BSs) of the cells, resulting in various transmission performances due to cell heterogeneity. Hence, designing optimal cell selection scheme is of particular importance for it may affect user quality of service (QoS) and network performance significantly. In this paper, we jointly consider cell selection and transmit power allocation problem in a HetNet consisting of multiple cells. For a single UE case, we formulate the energy efficiency of the UE, and propose an energy efficient optimization scheme which selects the optimal cell corresponding to the maximum energy efficiency of the UE. The problem is then extended to multiple UEs case. To achieve joint performance optimization of all the UEs, we formulate an optimization problem with the objective of maximizing the sum energy efficiency of UEs subject to QoS and power constraints. The formulated nonlinear fractional optimization problem is equivalently transformed into two subproblems, i.e., power allocation subproblem of each UE-cell pair, and cell selection subproblem of UEs. The two subproblems are solved respectively through applying Lagrange dual method and Kuhn–Munkres (K-M) algorithm. Numerical results demonstrate the efficiency of the proposed algorithm.     

An Adaptive Cluster-Based Routing Mechanism for Energy Conservation in Mobile Ad Hoc Networks

In recent years, many studies have proposed various ways to strengthen wireless networks’ performance. In this paper, we identify some drawbacks arising from protocol improved location-aided routing (ILAR). Nodes around the borders of a given broadcast coverage might quickly and easily move out, resulting in a broken routing path. Another problem in ILAR is that, although it may have a better forwarding node available for use a relay node could fail. Therefore we propose a novel routing protocol integrated power balance scheme to help resolve the problems mentioned above. Furthermore, the scheme employs position information and a power-saving scheme to balance the energy of each node and to lengthen the entire network’s life. To achieve these goals, there must be a reduction in the simultaneous loading of networks. Therefore, we also propose a cluster-based routing mechanism in mobile ad hoc networks. This mechanism can reduce the loading of networks, energy conservation, and increase the lifetime of nodes and networks.     

Residual energy based multi-relay selection and power allocation scheme in two-way relay network

In this paper, we have proposed a multi-relay selection and power allocation scheme for two-way relay network which aims to maximize the sum-rate of two-way relay system. First, to prolong network lifetime, a multi-relay selection strategy is proposed in which both channel state information （CSI） and remaining energy （RE） are considered. Next, a multi-relay power allocation algorithm based on convex optimization （MRPA-CO） is presented. To reduce the computational complexity, it can be divided into two steps： terminal nodes power allocation （TNPA） and relay nodes power allocation （RNPA）. Simulation results indicate that the proposed relay selection strategy can significantly prolong network lifetime compared to other relay selection strategies which consider CSI only, and the MRPA-CO algorithm has great advantage over equal power allocation （EPA） on sum-rate in two-way relay network.     

A distributed cooperative relaying optimization scheme for secondary transmission in Cognitive Radio networks

In Cognitive Radio (CR) networks, cooperative communication has been recently regarded as a key technology for improving the spectral utilization efficiency and ensuring the Quality of Service (QoS) for Primary Users (PUs). In this paper, we propose a distributed joint relay selection and power allocation scheme for cooperative secondary transmission, taking both Instantaneous Channel State Information (I-CSI) and residual energy into consideration, where secondary source and destination may have different available spectrum. Specifically, we formulate the cognitive relay network as a restless bandit system, where the channel and energy state transition is characterized by the finite-state Markov chain. The proposed policy has indexability property that dramatically reduces the compu-tation and implementation complexity. Analytical and simulation results demonstrate that our pro-posed scheme can efficiently enhance overall system reward, while guaranteeing a good tradeoff between achievable date rate and average network lifetime.     

基于能量定价的协作OFDM系统网络寿命优化算法

 本文研究两跳协作多中继正交频分复用(OFDM)系统的网络寿命优化问题.为使网络寿命最大化,基于对节点能量的定价提出一种穷举算法,即首先列举所有的子载波配对与中继选择联合决策;在每种决策下利用拉格朗日法求解最优功率分配,使得网络在满足一定吞吐量的前提下消耗能量总价值最小;然后选择损耗能量价值最小的联合决策.由于穷举算法受到计算复杂度的限制,进而基于子载波的单位信噪比(SNR)代价将中继选择与子载波配对分步优化,提出两种低复杂度算法.仿真结果表明,本文各算法的网络寿命性能比已有算法均有显著提高.     

Adaptive Path Selection Scheme with Combining for Multiple Relaying Cooperative Communications Networks

In future communications, cooperative communications with relay networks will be one of the most effective schemes to enlarge the coverage area and to boost the data rate. In the recent research results, the path selection, power allocation, and relay protocols on relay networks are the most important factors to improve the system performance. However, the channel quality of the direct transmission path and the relaying path has an influential effect on the performance of relay networks. Therefore, in this paper, we propose a best relaying path selection (BRPS) scheme to obtain the path diversity to improve the system capacity and data rate for cooperative networks (CNs). Simulation results show that the more the relay nodes are selected, the lower the bit error rate (BER) is. The proposed BRPS scheme obtains a high concession between both BER and system capacity for CNs.     

Novel Research on Cognitive Pilot Channel in Cognitive Wireless Network

With the irreversible trend of the convergence and cooperation among heterogeneous wireless networks, the need for network information awareness of user equipments (UEs) becomes increasingly imperative in the Cognitive Wireless Network (CWN). As one of the candidate solutions for network information delivery for UEs, the Cognitive Pilot Channel (CPC) concept has been brought forward recently, providing UEs with the necessary network information for network selection by using the public signaling channel. Furthermore, the coverage area of CPC is divided into meshes and terminals could receive corresponding information according to their location in mesh. In this paper, an optimal mesh division scheme in CPC is brought forward, trying to analyze the impacts of different parameters such as the delivery information accuracy, information loss and position accuracy to the mesh division scheme. In order to improve the on-demand CPC delivery efficiency, an optimized multicast CPC scheme is designed and evaluated, which remarkably reduces the time delay of information delivery. Numeric experimental results validate the rationality and effectiveness of the proposed scheme and strategy.     

DABPR: a large-scale internet of things-based data aggregation back pressure routing for disaster management

In this paper, we propose a data aggregation back pressure routing (DABPR) scheme, which aims to simultaneously aggregate overlapping routes for efficient data transmission and prolong the lifetime of the network. The DABPR routing algorithm is structured into five phases in which event data is sent from the event areas to the sink nodes. These include cluster-head selection, maximization of event detection reliability, data aggregation, scheduling, and route selection with multi attributes decision making metrics phases. The scheme performs data aggregation on redundant data at relay nodes in order to decrease both the size and rate of message exchanges to minimize communication overhead and energy consumption. The proposed scheme is assessed in terms of packet delivery, network lifetime, ratio, energy consumption, and throughput, and compared with two other well-known protocols, namely “information-fusion-based role assignment (InFRA)” and “data routing for in-network aggregation (DRINA)”, which intrinsically are cluster and tree-based routing schemes designed to improve data aggregation efficiency by maximizing the overlapping routes. Meticulous analysis of the simulated data showed that DABPR achieved overall superior proficiency and more reliable performance in all the evaluated performance metrics, above the others. The proposed DABPR routing scheme outperformed its counterparts in the average energy consumption metric by 64.78% and 51.41%, packet delivery ratio by 28.76% and 16.89% and network lifetime by 42.72% and 20.76% compared with InFRA and DRINA, respectively.

     

虚拟两天线蜂窝网络中考虑中继公平性的协作博弈调度方法(英文)

In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for scheduling in the wireless relay networks with two-virtual-antenna array mode. After defining the metric of relay channel capacity, we form a cooperative game for scheduling and present the interpretation of three different utilization objectives physically and mathematically. Then, a Nash Bargaining Solution (NBS) is utilized for resource allocation considering the traffic load fairness for relays. After proving the existence and uniqueness of NBS in Cooperative Game (CG-NBS), we are able to resolve the resource allocation problem in the cellular relay network by the relay selection and subcarrier assignment policy and the power allocation algorithm for both RSs and UEs. Simulation results reveal that the proposed CG-NBS scheme achieves better tradeoff between relay fairness and system throughput than the conventional Maximal Rate Optimization and Maximal Minimal Fairness methods.     

Energy-efficient joint relay node selection and power allocation over multihop relaying cellular networks toward LTE-Advanced

Cooperative relaying is emerging as an effective technology to fulfill requirements on high data rate coverage in next-generation cellular networks,like long term evolution-advanced (LTE-Advanced).In this paper,we propose a distributed joint relay node (RN) selection and power allocation scheme over multihop relaying cellular networks toward LTE-Advanced,taking both the wireless channel state and RNs’ residual energy into consideration.We formulate the multihop relaying cellular network as a restless bandit system.The first-order finite-state Markov chain is used to characterize the time-varying channel and residual energy state transitions.With this stochastic optimization formulation,the optimal policy has indexability property that dramatically reduces the computational complexity.Simulation results demonstrate that the proposed scheme can efficiently enhance the expected system reward,compared with other existing algorithms.     

Optimized mobile sink based grid coverage-aware sensor deployment and link quality based routing in wireless sensor networks

Mobile sink (MS) has been used in wireless sensor networks (WSN) to increase the network lifetime by changing the location over time. The major quality of service given by WSN is coverage energy consumption (EC) and network lifetime. There are many methods implemented for enhance the coverage hole restoration and reduce the EC. We propose a novel MSCOLER (MS based Coverage Optimization and Link-stability Estimation Routing) protocol for Optimal Coverage restoration and Link stability Estimation. An optimization algorithm is used to optimize the coverage hole and move the redundant node besides the hole. During the routing process, link quality based routing is used to discover the relay nodes with the estimation of link stability to enhance the entire network lifetime and practically make the perfect transmission distance for energy saving. Experimental results demonstrate that proposed protocol can solve the coverage restoration problem, decrease the EC and reduce the network lifetime. The performance is evaluated regarding Average of residual energy (ARE), Receiving packets ratio (RPR), Moving energy consumption (MEC), Network lifetime (NL), Percentage of coverage (%C) and Average Energy Consumption (AEC).     

Optimal placement and routing strategies for resilient two‐tiered sensor networks

In hierarchical sensor networks using relay nodes, sensor nodes are arranged in clusters and higher powered relay nodes can be used as cluster heads. The lifetime of such a network is determined primarily by the lifetime of the relay nodes. In this paper, we propose two new integer linear programs (ILPs) formulations for optimal data gathering, which maximize the lifetime of the upper tier relay node network. Unlike most previous approaches considered in the literature, our formulations can generate optimal solutions under the non‐flow‐splitting model. Experimental results demonstrate that our approach can significantly extend network lifetime, compared to traditional routing schemes, for the non‐flow‐splitting model. The lifetime can be further enhanced by periodic updates of the routing strategy based on the residual energy at each relay node. The proposed rescheduling scheme can be used to handle single or multiple relay node failures. We have also presented a very simple and straightforward algorithm for the placement of relay nodes. The placement algorithm guarantees that all the sensor nodes can communicate with at least one relay node and that the relay node network is at least 2‐connected. This means that failure of a single relay node will not disconnect the network, and data may be routed around the failed node. The worst case performance of the placement algorithm is bounded by a constant with respect to any optimum placement algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

衰落信道下基于中继选择与功率控制的节能协作通信

In order to save energy and make more efficient use of wireless channel, this article puts forward an energy saving cooperative relaying scheme which actuates the cooperative transmission only when the feedback from the destination indicates failure of the direct transmission. The proposed scheme selects the optimal relay and its corresponding transmission power in each time slot based on channel condition and residual energy with the objective of minimizing energy consumption and extending network lifetime. In the study, the finitestate Markov channel model is used to characterize the correlation structure of channel fading in wireless networks, and the procedure of relay selection and transmission power decision is formulated as a Markov decision process. Numerical and simulation results show that the proposed scheme consumes less energy and prolongs the network lifetime.     

Energy-Aware Routing Algorithm for Wireless Sensor Networks with Optimal Relay Detecting

Efficient and reliable routing plays a key role in wireless sensor networks in which routing design with regard to network availability and node lifetime needs to be deliberately considered. When multi-hop relay transmission is frequently applied to reduce a source node’s energy consumption and improve network capacity, a key issue affecting the nodes’ participation in the transmission is the problem of suitably determining the next hop in order to prolong each node’s lifetime and to maintain the energy-balancing of the whole network. In this study, we propose an energy-aware routing scheme by taking the Cauchy operator, node’s residual energy and routing distance into account. Based on Cauchy inequation, we achieve a relationship between the routing distance and the energy usage in the routing. By fixing a relay selection parameter and then identifying the next hop appropriately, we obtain a balancing energy-aware routing algorithm. Numerical results are provided to verify the lifetime and equilibrium of the energy distribution by comparing with them with those of a traditional approach.     

On relay selection for decode-and-forward relaying

In this letter, we consider a multi-relay network operating in decode-and-forward mode. We propose a novel relay selection method with a low implementation complexity. Unlike the competing schemes, it requires neither error detection methods at relay nodes nor feedback information at the source. We derive a closed-form symbol error rate (SER) expression for multi-relay network under consideration and demonstrate that the proposed selection method is able to extract the full diversity. Extensive Monte Carlo simulations are also presented to confirm the derived SER expressions and to compare the performance of the proposed scheme with its competitors.     

Energy‐efficient multiple‐domain bidirectional scheme for G.hn applications

This paper presents an energy‐efficient relaying scheme for G.hn standard. We propose a multi‐domain bidirectional communication network with network coding at the physical layer in order to increase network coverage. The logical link control stack was also modified and supplemented with additional functionality. This reduces the power consumption in the network and enhances the performance while reducing collisions for inter‐domain network access. We consider domain selection to minimize the total energy consumption of the network and present optimal power allocation for the given QoS of each end node. Energy efficiency is evaluated in terms of transmit energy per bit for relay networks with bidirectional symmetric and asymmetric traffic flows. Simulation results show that the proposed multi‐domain bidirectional communication provides improved performance and higher energy savings than the single‐domain unidirectional network, especially in powerline communication channel, which is the worst medium of the three G.hn media. Finally, it was demonstrated that improved energy efficiency can be achieved with appropriate domain selection. Copyright © 2015 John Wiley & Sons, Ltd.     

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

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

Outage probability improvement using a conditional cooperative mechanism in heterogeneous wireless networks

The self-similarity nature of network traffic has been discovered to be a ubiquitous phenomenon in communication networks; meanwhile, heterogeneous wireless cooperative relay networks have received considerable interests in both academia and industry fields. The mechanism of cooperative relay selection is very essential for the design of heterogeneous wireless relay networks. In this paper, based on the self-similar nature of network traffic in heterogeneous wireless cooperative relay network, we propose a new relay selection mechanism called conditional relay selection which can effectively decrease the system outage probability. Compared to conventional relay selection mechanism, the proposed mechanism considers the traffic queue condition of the relay nodes rather than just comparing the signal-to-noise ratio (SNR). Through extensive comparisons with traditional cooperative relay selection mechanisms, the proposed scheme can significantly improve the system outage probability.     

Improving physical layer security via cooperative diversity in energy‐constrained cognitive radio networks with multiple eavesdroppers

In this paper, a scheme that exploits cooperative diversity of multiple relays to provide physical layer security against an eavesdropping attack is concerned. Relay‐based cognitive radio network (CRN) faces issues multiple issues other than the same as faced by conventional wireless communications. If the nodes in a CRN are able to harvest energy and then spend less energy than the total energy available, we can ensure a perpetual lifetime for the network. In this paper, an energy‐constrained CRN is considered where relay nodes are able to harvest energy. A cooperative diversity‐based relay and subchannel‐selection algorithm is proposed, which selects a relay and a subchannel to achieve the maximum secrecy rate while keeping the energy consumed under a certain limit. A transmission power factor is also selected by the algorithm, which ensures long‐term operation of the network. The power allocation problem at the selected relay and at the source also satisfies the maximum‐interference constraint with the primary user (PU). The proposed scheme is compared with a variant of the proposed scheme where the relays are assumed to have an infinite battery capacity (so maximum transmission power is available in every time slot) and is compared with a scheme that uses jamming for physical layer security. The simulation results show that the infinite battery‐capacity scheme outperforms the jamming‐based physical layer security scheme, thus validating that cooperative diversity‐based schemes are suitable to use when channel conditions are better employed, instead of jamming for physical layer security.