DEC-MAC: delay- and energy-aware cooperative medium access control protocol for wireless sensor networks

This paper deals with two critical issues in wireless sensor networks: reducing the end-to-end packet delivery delay and increasing the network lifetime through the use of cooperative communications. Here, we propose a delay- and energy-aware cooperative medium access control (DEC-MAC) protocol, which trades off between the packet delivery delay and a node’s energy consumption while selecting a cooperative relay node. DEC-MAC attempts to balance the energy consumption of the sensor nodes by taking into account a node’s residual energy as part of the relay selection metric, thus increasing the network’s lifetime. The relay selection algorithm exploits the process of elimination and the complementary cumulative distribution function for determining the most optimal relay within the shortest time period. Our numerical analysis demonstrates that the DEC-MAC protocol is able to determine the optimal relay in no more than three mini slots. Our simulation results show that the DEC-MAC protocol improves the end-to-end packet delivery latency and the network lifetime significantly compared to the state-of-the-art protocols, LC-MAC and CoopMAC.     

UCRP—一种能量有效的WSN非均匀分簇路由协议

提出了一种新的能量有效的非均匀分簇路由协议—UCRP.根据距离基站的远近将网络分为大小不同的簇;簇内数据传输根据簇范围的大小采用单跳或多跳;簇间数据传输构建多跳路由,簇首选择下一跳节点时将能量与最小跳数路由算法相结合;最后在能量有效的前提下对LEACH协议易受到HELLO flooding攻击提出了安全设想.仿真结果表明:该协议能够有效地均衡簇首和全网能耗,延长网络生存时间.     

Energy Efficient Energy Hole Repelling (EEEHR) Algorithm for Delay Tolerant Wireless Sensor Network

Reducing energy consumption and increasing network lifetime are the major concerns in Wireless Sensor Network (WSN). Increase in network lifetime reduces the frequency of recharging and replacing batteries of the sensor node. The key factors influencing energy consumption are distance and number of bits transmitted inside the network. The problem of energy hole and hotspot inside the network make neighbouring nodes unusable even if the node is efficient for data transmission. Energy Efficient Energy Hole Repelling (EEEHR) routing algorithm is developed to solve the problem. Smaller clusters are formed near the sink and clusters of larger size are made with nodes far from the sink. This methodology promotes equal sharing of load repelling energy hole and hotspot issues. The opportunity of being a Cluster Head (CH) is given to a node with high residual energy, very low intra cluster distance in case of nodes far away from the sink and very low CH to sink distance for the nodes one hop from the sink. The proposed algorithm is compared with LEACH, LEACH-C and SEP routing protocol to prove its novel working. The proposed EEEHR routing algorithm provides improved lifetime, throughput and less packet drop. The proposed algorithm also reduces energy hole and hotspot problem in the network.     

An Improved Fuzzy Unequal Clustering Algorithm for Wireless Sensor Network

This paper introduces IFUC, which is an Improved Fuzzy Unequal Clustering scheme for large scale wireless sensor networks (WSNs).It aims to balance the energy consumption and prolong the network lifetime. Our approach focuses on energy efficient clustering scheme and inter-cluster routing protocol. On the one hand, considering each node’s local information such as energy level, distance to base station and local density, we use fuzzy logic system to determine each node’s chance of becoming cluster head and estimate the cluster head competence radius. On the other hand, we use Ant Colony Optimization (ACO) method to construct the energy-aware routing between cluster heads and base station. It reduces and balances the energy consumption of cluster heads and solves the hot spots problem that occurs in multi-hop WSN routing protocol to a large extent. The validation experiment results have indicated that the proposed clustering scheme performs much better than many other methods such as LEACH, CHEF and EEUC.     

Maximum lifetime routing in wireless sensor networks

A routing problem in static wireless ad hoc networks is considered as it arises in a rapidly deployed, sensor based, monitoring system known as the wireless sensor network. Information obtained by the monitoring nodes needs to be routed to a set of designated gateway nodes. In these networks, every node is capable of sensing, data processing, and communication, and operates on its limited amount of battery energy consumed mostly in transmission and reception at its radio transceiver. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver then the energy consumption rate per unit information transmission depends on the choice of the next hop node, i.e., the routing decision. We formulate the routing problem as a linear programming problem, where the objective is to maximize the network lifetime, which is equivalent to the time until the network partition due to battery outage. Two different models are considered for the information-generation processes. One assumes constant rates and the other assumes an arbitrary process. A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. The algorithm is amenable to distributed implementation. Simulation results with both information-generation process models show that the proposed algorithm can achieve network lifetime that is very close to the optimal network lifetime obtained by solving the linear programming problem.     

无线传感器网络路由协议的设计与实现

针对传统路由协议端到端时延长、丢包率过高的现实问题,提出了一种基于贪婪转发的能量感知多路径路由协议(Greedy Forward Energy-aware Multipath Routing Protocol,GFEMRP)。GFEMRP从传感器起始结点出发,如果遇到网络黑洞则选择周边转发方式,否则将选择吞吐量大、且更接近于目的结点的结点作为下一跳结点。利用了OMNET++5.0和INET框架对包括无线自组网按需平面距离向量路由协议(Ad hoc on-demand distance vector routing protocol,AODV),动态按需无线自组织网络(Dynamic MANET On-demand,DYMO),贪婪周边无状态路由无线网络(Greedy Perimeter Stateless Routing for Wireless Networks,GPSR)和GFEMRP协议在内的四种路由协议进行了仿真和比较,实验结果表明GFEMRP协议具有良好的端到端时延、丢包率等性能。     

Balance energy-efficient and real-time with reliable communication protocol for wireless sensor network

In many wireless sensor network applications, it should be considered that how to trade off the inherent conflict between energy efficient communication and desired quality of service such as real-time and reliability of transportation. In this paper, a novel routing protocols named balance energy-efficient and real-time with reliable communication (BERR) for wireless sensor networks (WSNs) are proposed, which considers the joint performances of real-time, energy efficiency and reliability. In BERR, a node, which is preparing to transmit data packets to sink node, estimates the energy cost, hop count value to sink node and reliability using local information gained from neighbor nodes. BERR considers not only each sender’ energy level but also that of its neighbor nodes, so that the better energy conditions a node has, the more probability it will be to be chosen as the next relay node. To enhance real-time delivery, it will choose the node with smaller hop count value to sink node as the possible relay candidate. To improve reliability, it adopts retransmission mechanism. Simulation results show that BERR has better performances in term of energy consumption, network lifetime, reliability and small transmitting delay.     

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.     

Design and Implementation of Routing Algorithm to Enhance Network Lifetime in WBAN

Today’s era is the era of smart and remote applications exploiting advancement in sensors, cloud, Internet of things etc. Major application is in healthcare monitoring and support using wireless body area network (WBAN) in which sensor nodes sense vital physiological parameters and send to server through sink i.e. smart phone nowadays for seamless monitoring. The most significant issue in such applications is energy efficiency which leads to enhanced network life time that ensures uninterrupted seamless services. From source to sink data transmission may occur considering three different scenarios: source to sink single hop direct data transmission irrespective of in-between node distance, source to sink multi hop data transmission in which transmission range of source node is fixed at a threshold to find next forwarder node and transmission range of source node is incremented by affixed value until data gets transmitted to sink. In this work WBAN having different network configurations based on fixed or random positions of nodes have been simulated. Different scenarios with fixed and varying number of nodes are framed and simulated using MATLAB 2020a for performance evaluation of proposed algorithm in terms of energy consumption, network lifetime, path loss etc. due to data transmission from source to sink. Experimental results show that incremental approach is better than direct one in terms of energy consumption, path loss and network lifetime. While selecting transmission range of a source node, it is considered to keep Specific Absorption Rate (SAR) lower to reduce impact on human tissue.

     

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

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

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

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

基于能量感知的Ad Hoc路由算法研究

针对移动adhoc网络终端能量资源受限对全网路由的影响,提出一种具有终端节点能量感知的路由协议(EARP,energy-awareroutingprotocol).该协议能够根据单个节点能量的使用情况以及全路径的能量消耗情况选择不同的传输路径,在路径断裂时,增加本地维护策略,有效减少了由此引起的发包重传情况,提高了路由效率.通过节点能级的设定,防止链路传输过程中由于能量耗尽而导致的路由断裂情况.经过NS2仿真实验与其他相关路由协议进行比较,结果表明在相同的实验环境下,该路由协议能够有效均衡负载,保护低能量节点,延长网络生存时间     

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.     

一种面向高速路车联网场景的自适应路由方法

车载自组织网络中节点的高速移动性使得网络拓扑频繁变化,造成路由效率低下.本文提出了一种面向高速路车联网场景的自适应路由方法.本方法采用了贪婪机会转发（GOF）算法,在选择下一跳转发节点时,同时考虑到目的节点的距离计算、节点间的链路状态以及下一跳的有效节点度状况来找出最优转发节点,并提出新的计算连通概率的方法.仿真实验和实际道路场景的测试表明,与相关算法相比在路由稳定性方面表现出较好的效果.     

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

Sensor node energy conservation is the primary design parameters in wireless sensor networks (WSNs). Energy efficiency in sensor networks directly prolongs the network lifetime. In the process of route discovery, each node cooperates to forward the data to the base station using multi‐hop routing. But, the nodes nearer to the base station are loaded more than the other nodes that lead to network portioning, packet loss and delay as a result nodes may completely loss its energy during the routing process. To rectify these issues, path establishment considers optimized substance particle selection, load distribution, and an efficient slot allocation scheme for data transmission between the sensor nodes in this paper. The selection of forwarders and conscious multi‐hop path is selected based on the route cost value that is derived directly by taking energy, node degree and distance as crucial metrics. Load distribution based slot allocation method ensures the balance of data traffic and residual energy of the node in areal‐time environment. The proposed LSAPSP simulation results show that our algorithm not only can balance the real‐time environment load and increase the network lifetime but also meet the needs of packet loss and delay.     

一种基于WSN时变性与节点剩余能量均衡的机会路由算法

为了解决数据报文在无线传感网络中动态路由以及网络内各节点剩余能量均衡问题,该文提出了一种机会路由算法。首先,利用热力学第2定律描述数据报文在无线传感器网络中动态路由的传输过程,其中,为了表征网络内各节点状态的时变性以及剩余能量,提出了机会熵模型;其次,以机会熵模型作为选择下一跳节点的理论依据,并结合蚁群优化(ACO)算法,设计并实现了考虑网络中各节点时变性与剩余能量均衡的机会路由算法(ACO for Time Dependent Opportunistic-routing Protocol, ATDOP),使得数据报文在转发过程时,能够有效地选择下一跳节点,从而使网络内各节点的通信资源和能量资源达到负载均衡。最后,通过实验证明,相对于已有的机会路由协议,ATDOP具有报文成功传输率高、网络有效吞吐量大以及网络工作寿命长等优点。     

Energy Efficient Cluster Based Routing Protocol for WSN Using Firefly Algorithm and Ant Colony Optimization

Maximizing network lifetime is the main goal of designing a wireless sensor network. Clustering and routing can effectively balance network energy consumption and prolong network lifetime. This paper presents a novel cluster-based routing protocol called EECRAIFA. In order to select the optimal cluster heads, Self-Organizing Map neural network is used to perform preliminary clustering on the network nodes, and then the relative reasonable level of the cluster, the cluster head energy, the average distance within the cluster and other factors are introduced into the firefly algorithm (FA) to optimize the network clustering. In addition, the concept of decision domain is introduced into the FA to further disperse cluster heads and form reasonable clusters. In the inter-cluster routing stage, the inter-cluster routing is established by an improved ant colony optimization (ACO). Considering factors such as the angle, distance and energy of the node, the heuristic function is improved to make the selection of the next hop more targeted. In addition, the coefficient of variation in statistics is introduced into the process of updating pheromones, and the path is optimized by combining energy and distance. In order to further improve the network throughput, a polling control mechanism based on busy/idle nodes is introduced during the intra-cluster communication phase. The simulation experiment results prove that under different application scenarios, EECRAIFA can effectively balance the network energy consumption, extend the network lifetime, and improve network throughput.

     

Energy equilibrium based on corona structure for wireless sensor networks

Although multi‐hop routing can reduce communication consumption and extend network scale, energy hole is unavoidable to appear because of the relay nodes being overloaded due to take more tasks. In this paper, we formulate the energy equilibrium problem as an optimal corona division, where data fusion and data slice are both considered in data gathering process. For a circular multi‐hop sensor network with uniform node distribution and constant data reporting, we demonstrate that the energy equilibrium of the whole network is unable to be realized no matter whether data fusion and data slice are adopted. However, the maximum energy equilibrium for a given circular area can be achieved only if the area increases in geometric progression from the outer corona to the neighbor inner corona except for the outermost one. Moreover, we use a zone‐based allocation scheme to guarantee energy equilibrium of intra‐corona. The approach for computing the optimal parameters is presented in terms of maximizing network lifetime. Based on the mathematical model, we propose an energy equilibrium routing based on corona structure (EERCS). Simulating results validate that EERCS can effectively achieve energy equilibrium and prolong the lifetime of network. Copyright © 2010 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.     

一种针对无线传感器网络LEACH协议的改进算法

针对传统LEACH协议在簇首选取的随意性,以及簇首节点将数据以单跳形式传输给汇聚节点造成能耗大的缺点。文中提出了改进协议,该算法在对簇头节点的选择时会将节点的剩余能量考虑进去,会在选择剩余能量最多,同时以其到汇聚节点距离小的节点作为下一跳来传输数据,以实现多个簇之间的路由数据传输。通过Matlab仿真可以知道,改进后的协议使整个传感器网络的能量消耗变得更加均衡,同时使整个网络的生存时间得到了15%的延长。