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.     

Partial Relay Selection in Energy Harvesting Based NOMA Network with Imperfect CSI

The wireless body area network (WBAN) can effectively modify the health and lifestyle monitoring specifically where multiple body parameters are measured using biomedical sensor devices. However, power consumption and reliability are crucial issues in WBAN. Cooperative Communication usually prolongs the network lifetime of WBAN and allows reliable delivery of bio-medical packets. Hence, the main aim of this investigation is to propose a novel protocol Cooperative Energy efficient and Priority based Reliable routing protocol with Network coding (CEPRAN) to enhance the reliability and energy efficiency of WBAN using cooperative communication method. Firstly, to identify a relay node from the group of sensor nodes for data forwarding, an enhanced Cuckoo search optimization algorithm is proposed. Secondly, Cooperative Random Linear Network Coding approach is incorporated into the relay node to improve the packet transfer rate. CEPRAN is implemented in Ns-3 simulator and the experimental results prove that the proposed protocol outperforms the existing SIMPLE Protocol.

     

Multi relay node selection strategy for energy capture collaborative relay network

An energy capture cooperative relay network was studied.Unlike traditional cooperative relay networks,the relay nodes generally did not have a fixed energy supply but could carry out energy capture.For this network,a natural question was how to determine whether the relay nodes perform energy capture or data forwarding,and how to select the relay node to assist the information transmission between the source node and the destination node.Based on this problem,a multi-relay node selection scheme was proposed,which select the operation according to the energy of the current time slot of the relay node.In each time slot,the relay node that meet the battery threshold requirements was selected to assist in transmission.The Markov chain was used to model the charging and discharging process of the relay node battery,and the probability of interruption and throughput of the wireless network was obtained.And the value of the battery threshold when the throughput was maximized,that is,when the probability of network breakage was minimum was solved.Finally,the advantages of this scheme were verified by numerical experiments.     

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.     

Cooperative communications with relay selection for wireless networks: design issues and applications

Relay selection schemes for cooperative communications to achieve full cooperative diversity gains while maintaining spectral and energy efficiency have been extensively studied in a recent research. These schemes select only the best relay from multiple relaying candidates to cooperate with a communication link. In the present paper, we reviewed recently proposed cooperative communication protocols that integrate with relay selection mechanisms. The key design issues for relay selection mechanisms, for example, relaying candidate selection, optimal relay assignment, and cooperative transmission, were identified. We further discussed the challenges of optimal relay assignment in multi‐hop wireless sensor networks and presented the potential applications of cooperative communications with a relay selection in such networks. Future research directions were outlined, for example, the issues of service differentiation and system fairness in cooperative communication systems and the joint use of game theory and adaptive learning techniques in relaying candidate selection and optimal‐relay assignment mechanisms for efficient allocation of network resources. Copyright © 2011 John Wiley & Sons, Ltd.     

Distributed Cooperative Data Relaying for Diversity in Impulse-Based UWB Ad-Hoc Networks

In this paper we develop and investigate two families of efficient distributed cooperative data relaying schemes that can be adopted to forward data in the impulse-based ultra wide band wireless ad-hoc network composed of a pair of source and destination and multiple parallel two-hop relays. The new schemes combine the mechanism of the medium access control and physical layers in a cooperative and distributed way to either select the best relay from multiple available ones for data forwarding or optimally combine the synchronized data forwarding of all participating relays, such as to improve the data transfer diversity. For distributed cooperative routing, we propose efficient protocols for use at all relays to perform an enhanced ultra wide band pulse sensing multiple access with the backoff periods deterministically and optimally mapped from associated instantaneous source-relay-destination route qualities, to ensure that only the best relay can firstly and successfully forward its received data to the destination; For distributed cooperative beamforming, we propose efficient protocols for use at all relays to take advantages of the widely spread and independently distributed multiple paths of the fading ultra wide band channels in the synchronized data forwarding combination, to create an optimally combined route for source-destination data transfer. Performance analysis and simulation studies show the effectiveness and efficiency of our proposed schemes.     

Energy-balanced cooperative routing in multihop wireless networks

Cooperative communication (CC) allows multiple nodes to simultaneously transmit the same packet to the receiver so that the combined signal at the receiver can be correctly decoded. Since the CC can reduce the transmission power and extend the transmission coverage, it has been considered in minimum energy routing protocols to reduce the total energy consumption. However, previous research on cooperative routing only focuses on minimizing the total energy consumption from the source node to the destination node, which may lead to the unbalanced energy distribution among nodes. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among nodes. By introducing a new routing scheme which carefully selects cooperative relay nodes and assigns their transmission power, our cooperative routing method can balance the remaining energy among neighboring nodes to maximize the lifetime of the network. Simulation results demonstrate that the proposed cooperative routing algorithm significantly balances the energy distribution and prolongs the lifetime of the network.     

Trust establishment in cooperative wireless relaying networks

In cooperative wireless networks, relay nodes are employed to improve the performance of the network in terms of throughput and reliability. However, the presence of malicious relay nodes in the network may severely degrade the performance of the system. When a relay node behaves maliciously, there exists a possibility that such a node refuses to cooperate when it is selected for cooperation or deliberately drops the received packets. Trust establishment is a mechanism to detect misbehaving nodes in a network. In this paper, we propose a trust establishment method for cooperative wireless networks by using Bayesian framework. In contrast with the previous schemes proposed in wireless networks, this approach takes the channel state information and the relay selection decisions into account to derive a pure trust value for each relay node. The proposed method can be applied to any cooperative system with a general relay selection policy whose decisions in each cooperative transmission are independent of the previous ones. Moreover, it does not impose additional communication overhead on the system as it uses the available information in relay selection procedure. Copyright © 2012 John Wiley & Sons, Ltd.     

基于射频能量收集的无线中继网络资源分配

针对现有射频能量收集网络资源分配研究局限于单个数据源场景,无法适配于多数据源网络的问题,提出了一种适用于多数据源场景的射频能量收集中继网络传输协议框架,在该框架内节点可作为源节点或中继节点传输自身数据或转发数据,并在其他节点的数据传输过程中完成射频能量收集。以协议框架为基础,分别以系统吞吐量及用户公平性为优化目标设计两种资源分配方案。仿真表明,两种方案可有效改善网络吞吐量及资源分配公平性。     

Theoretical Limits for Time Delay Based Location Estimation in Cooperative Relay Networks

Node localization in wireless networks is crucial for supporting advanced location-based services and improving the performance of network algorithms such as routing schemes. In this paper, we study the fundamental limits for time delay based location estimation in cooperative relay networks. The theoretical limits are investigated by obtaining Cramer–Rao Lower Bound (CRLB) expressions for the unknown source location under different relaying strategies when the location of the destination is known and unknown. More specifically, the effects of amplify-and-forward and decode-and-forward relaying strategies on the location estimation accuracy are studied. Furthermore, the CRLB expressions are derived for the cases where the location of only source as well as both source and destination nodes are unknown considering the relays as reference nodes. In addition, the effects of the node topology on the location estimation accuracy of the source node are investigated. The results reveal that the relaying strategy at relay nodes, the number of relays, and the node topology can have significant impacts on the location accuracy of the source node. Additionally, knowing the location of the destination node is crucial for achieving accurate source localization in cooperative relay networks.     

Improving energy efficiency of incremental relay based cooperative communications in wireless body area networks

In this paper, we investigate the energy efficiency of an incremental relay based cooperative communication scheme in wireless body area networks (WBANs). We derive analytical expressions for the energy efficiency of direct and cooperative communication schemes taking into account the effect of packet error rate. The following communication scenarios specific to a WBAN are considered: (i) in‐body communication between an implant sensor node and the gateway, and (ii) on‐body communication between a body surface node and the gateway with line‐of‐sight (LOS) and non‐LOS channels. The results reveal a threshold behavior that separates regions where direct transmission is better from regions where incremental relay cooperation is more useful in terms of energy efficiency. It is observed that, compared with direct communication, incremental relay based cooperative communication schemes improves the energy efficiency significantly. Further, cooperation extends the source‐to‐destination hop length over, which energy efficient communication can be achieved as compared with direct communication. We also observe that, for both direct as well as cooperative transmission schemes in error prone channels, an optimal packet size exists that result in maximum energy efficiency. Copyright © 2013 John Wiley & Sons, Ltd.     

A genetic algorithm based approach for energy efficient routing in two-tiered sensor networks

Higher power relay nodes can be used as cluster heads in two-tiered sensor networks to achieve improved network lifetime. The relay nodes may form a network among themselves to route data towards the base station. In this model, the lifetime of a network is determined mainly by the lifetimes of these relay nodes. An energy-aware communication strategy can greatly extend the lifetime of such networks. However, integer linear program (ILP) formulations for optimal, energy-aware routing quickly become computationally intractable and are not suitable for practical networks. In this paper, we have proposed an efficient solution, based on a genetic algorithm (GA), for scheduling the data gathering of relay nodes, which can significantly extend the lifetime of a relay node network. For smaller networks, where the global optimum can be determined, our GA based approach is always able to find the optimal solution. Furthermore, our algorithm can easily handle large networks, where it leads to significant improvements compared to traditional routing schemes.     

Utility driven cooperative spectrum sensing scheduling for heterogeneous multi-channel cognitive radio networks

Owing to the spectrum scarcity and energy constrained devices in wireless networks arises the demand for an efficient spectrum sensing technique which improves both sensing performance and energy efficiency for cognitive radio networks. This paper proposes a cooperative spectrum sensing scheduling (CSSS) scheme for heterogeneous multi-channel cognitive radio networks with the objective of finding an efficient sensing schedule to enhance network utility while keeping the energy depletion at a lower level. We start with formulating the CSSS problem as an optimization problem, which captures both the energy-performance and performance opportunity trade-offs. We prove that the formulated CSSS problem is non-deterministic polynomial hard (NP-hard). To tackle the higher computational complexity of the formulated problem, we propose a greedy-based heuristic solution, which produces a sub-optimal result in polynomial time. To reduce energy consumption during spectrum sensing, we make secondary users to adaptively decide on the sensing duration based on the received signal-to-noise ratio (SNR), where higher SNR leads to lower sensing duration and vice-versa. For enhancing network throughput, SUs sense multiple channels in the order of their suitability for data transmission to explore as many numbers of channels as possible within the permitted maximum sensing time. We consider erroneous nature of reporting channel to make the cooperative decision robust against errors during reporting. Simulation based results show the effectiveness of the proposed scheme in terms of utility, energy overhead, and the number of channels explored compared to similar schemes from literature.

     

Optimal energy efficiency routing strategy based on community in mobile social network

An optimal energy efficiency routing strategy based on community was proposed,which minimized the network energy consumption under the given delay constraint.Firstly the expected energy consumption and delay of message delivery in the connected network were obtained through Markov chain.Then the comprehensive cost function for delivering message from source node to destination node was designed,which was combined with energy consumption and delay.Thus,the optimization function to comprehensive cost of relay node delivering message was obtained,and further the reward function of relay node was gotten.Finally the optimal expected reward of optimal relay node was achieved using the optimal stopping theory,so as to realize the optimal energy efficiency routing strategy.In simulations,the average energy consumption,the average delay and the average delivery ratio of routing optimization strategy were compared with those of other routing strategies in related literatures.The results show that the strategy proposed has smaller average energy consumption,shorter average delay and higher average delivery ratio,gaining better energy consumption optimization effect.     

一种改进的数据链协作MAC协议

针对基于TDMA（时分多址）的数据链网络协议在恶劣环境下时延大、业务突发性强等缺点,提出了一种改进的数据链协作MAC协议。在原有的协议中引入协作通信的思想,节点根据协作机制,利用自身时隙进行协作转发,并进一步加入中继优先权因子改进协作机制,中继节点根据节点的繁忙程度与信道条件来判定是否协作传输。通过对网络时延性能的研究与仿真,结果表明,改进后的协作协议性能优于传统的数据链协议。     

基于ERPMT改进启发式方法的WSN寿命最大化算法

针对传感器节点的电池容量限制导致无线传感网络寿命低的问题,基于容量最大化(CMAX)、线上最大化寿命(OML)两种启发式方法以及高效路由能量管理技术(ERPMT),提出了基于ERPMT改进启发式方法的无线传感网络寿命最大化算法。首先,通过启发式方法初始化每个传感器节点,将节点能量划分为传感器节点起源数据和其它节点数据延迟;然后利用加入的一种优先度量延迟一跳节点的能量消耗;最后,根据路径平均能量为每个路由分配一个优先级,并通过ERPMT实现最终的无线传感网络优化。针对不同分布类型网络寿命的实验验证了本文算法的有效性及可靠性,实验结果表明,相比较为先进的启发式方法CMAX及OML,本文算法明显增大了无线传感网络的覆盖范围,并且大大地延长了网络的寿命。     

无线网络中基于DSDV的最大化吞吐量的协作路由算法

为最大化无线自组织网络的吞吐量,提出一种自适应的协作路由算法。在算法中,协作分集技术与路由选择相结合,通过在路由的每一跳选择最佳的中继节点协作发送节点传输信息来改善网络吞吐量。首先通过目的序列距离矢量路由协议（DSDV）初步建立最短路由路径,在每条链路的发送节点和接收节点根据邻节点表选出公共邻居节点,建立候选中继集合;进一步,每一跳根据链路吞吐量,在候选中继集合中自适应选择最多两个中继来协助发送节点进行传输,并根据选出的中继节点数动态分配节点发射功率。在保证系统发射功率一定的情况下,最大化网络吞吐量。仿真结果表明,在相同的发射功率下,相对于非协作路由DSDV算法,采用固定数量中继的协作路由算法提高了整个网络的吞吐量,而自适应的协作路由算法可进一步提高吞吐量;同时仿真了网络吞吐量与网络规模和节点最大移动速度的变化关系。      

Energy Attentive and Pre-fault Recognize Mechanism for Distributed Wireless Sensor Network Using Fuzzy Logic Approach

Wireless sensor networks (WSNs) have been transforming over recent years with development in the design of smart real-time applications. However, it presents numerous challenges in terms of fault-tolerant communication, low latency, scalability, and transmission efficiency. It is extremely difficult for WSNs to detect runtime faults since they're unaware of the internal processes at work within the sensor node. As a result, valuable sensed information cannot reach its destination and performance starts degrading. Towards this objective, the proposed mechanism applies a novel pre-fault detection mechanism based on a fuzzy rule-based method for multilevel transmission in distributed sensor networks. The proposed mechanism uses a fuzzy rule set to make routing decisions. A fuzzy decision rule set is proposed to perform routing based on the fuzzy fault count status of a node. The proposed mechanism assists in identifying the fault in advance and determining the optimal routing path to save energy and improve network performance. In accordance with the node fault status, the data transmission rate is finalized to prevent further energy consumption. The results demonstrated that the proposed mechanism performed well on judgment evaluation metrics like the energy dissipation ratio, throughput, packet loss rate and communication delay.

     

A New Method to Find a High Reliable Route in IoT by Using Reinforcement Learning and Fuzzy Logic

Recently, Internet is moving quickly toward the interaction of objects, computing devices, sensors, and which are usually indicated as the Internet of things (IoT). The main monitoring infrastructure of IoT systems main monitoring infrastructure of IoT systems is wireless sensor networks. A wireless sensor network is composed of a large number of sensor nodes. Each sensor node has sensing, computing, and wireless communication capability. The sensor nodes send the data to a sink or a base station by using wireless transmission techniques However, sensor network systems require suitable routing structure to optimizing the lifetime. For providing reasonable energy consumption and optimizing the lifetime of WSNs, novel, efficient and economical schemes should be developed. In this paper, for enhancing network lifetime, a novel energy-efficient mechanism is proposed based on fuzzy logic and reinforcement learning. The fuzzy logic system and reinforcement learning is based on the remained energies of the nodes on the routes, the available bandwidth and the distance to the sink. This study also compares the performance of the proposed method with the fuzzy logic method and IEEE 802.15.4 protocol. The simulations of the proposed method which were carried out by OPNET (Optimum Network performance) indicated that the proposed method performed better than other protocols such as fuzzy logic and IEEE802.15.4 in terms of power consumption and network lifetime.

     

基于中断概率的多跳混合协作地理路由算法

为了减小无线传感器网络中路由的路径长度,该文提出基于中断概率的多跳混合协作地理路由(MHCGR)算法。首先对不同协作机制的链路进行分析,理论分析表明,在一定中断概率要求下,采用译码放大转发混合协作机制可以进一步扩大传输距离,并推导了每跳协作链路的理想最大协作传输距离和理想中继的位置。在无信标地理路由(BLGR)算法的基础上,MHCGR算法结合节点位置信息为每跳选择最佳的中继节点和转发节点,建立从源节点到目的节点的多跳协作路由。仿真表明,与ENBGCR算法和基于DF协作机制的MPCR算法两种协作地理路由算法相比,MHCGR算法可明显减少路由的跳数,改善路由的整体发射功率。