DFR: an efficient directional flooding‐based routing protocol in underwater sensor networks

Unlike terrestrial sensor networks, underwater sensor networks (UWSNs) have salient features such as a long propagation delay, narrow bandwidth, and high packet loss over links. Hence, path setup‐based routing protocols proposed for terrestrial sensor networks are not applicable because a large latency of the path establishment is observed, and packet delivery is not reliable in UWSNs. Even though routing protocols such as VBF (vector based forwarding) and HHVBF (hop‐by‐hop VBF) were introduced for UWSNs, their performance in terms of reliability deteriorates at high packet loss. In this paper, we therefore propose a directional flooding‐based routing protocol, called DFR, in order to achieve reliable packet delivery. DFR performs a so‐called controlled flooding, where DFR changes the number of nodes which participate in forwarding a packet according to their link quality. When a forwarding node has poor link quality to its neighbor nodes geographically advancing toward the sink, DFR allows more nodes to participate in forwarding the packet. Otherwise, a few nodes are enough to forward the packet reliably. In addition, we identify two types of void problems which can occur during the controlled flooding and introduce their corresponding solutions. Our simulation study using ns‐2 simulator proves that DFR is more suitable for UWSNs, especially when links are prone to packet loss. Copyright © 2011 John Wiley & Sons, Ltd.     

Actor-oriented directional anycast routing in wireless sensor and actor networks with smart antennas

Current routing protocols in wireless sensor and actor networks (WSANs) shows a lack of unification for different traffic patterns because the communication for sensor to actor and that for actor to actor are designed separately. Such a design poses a challenge for interoperability between sensors and actors. With the presence of rich-resource actor nodes, we argue that to improve network lifetime, the problem transforms from reducing overall network energy consumption to reducing energy consumption of constrained sensor nodes. To reduce energy consumption of sensor nodes, especially in challenging environments with coverage holes/obstacles, we propose that actor nodes should share forwarding tasks with sensor nodes. To enable such a feature, efficient interoperability between sensors and actors is required, and thus a unified routing protocol for both sensors and actors is needed. This paper explores capabilities of directional transmission with smart antennas and rich-resource actors to design a novel unified actor-oriented directional anycast routing protocol (ADA) which supports arbitrary traffic in WSANs. The proposed routing protocol exploits actors as main routing anchors as much as possible because they have better energy and computing power compared to constraint sensor nodes. In addition, a directional anycast routing approach is also proposed to further reduce total delay and energy consumption of overall network. Through extensive experiments, we show that ADA outperforms state-of-the-art protocols in terms of packet delivery latency, network lifetime, and packet reliability. In addition, by offer fault tolerant features, ADA also performs well in challenging environments where coverage holes and obstacles are of concerns.     

基于博弈的协作路由算法

协作虚拟多输入多输出（VMIMO）传输是一种有效的无线传输性能优化技术。将物理层协作VMIMO技术和网络层路由选择技术相结合,设计跨层VMIMO路由选择方案可以利用VMIMO的分集增益,显著地降低网络传输能耗。如何设计VMIMO协作路由协议抵抗无线网络的自私节点和欺骗行为,保证高数据转发率和低传输能耗成为路由设计中的重大挑战。为了提高自私网络的VMIMO路由性能,提出了一种基于重复路由博弈的VMIMO协作路由算法。该算法将网络划分成多个Group、Group间使用VMIMO传输数据。将Group间路由选择过程建模为重复路由博弈过程。为了提高数据转发的成功率,提出适用度函数评估节点参与数据分组转发的信誉。以此为基础,提出基于适用度的路由选择子算法和路由转发子算法。理论证明所提重复路由博弈可达到帕累托最优。仿真实验结果表明本算法可以促进自私节点相互合作,可获得较高的数据转发率,较好地减少数据传输时延以及能量消耗。     

Energy‐efficient void avoidance geographic routing protocol for underwater sensor networks

Underwater wireless sensor networks (UWSNs) consist of a group of sensors that send the information to the sonobuoys at the surface level. Void area, however, is one of the challenges faced by UWSNs. When a sensor falls in a void area of communication, it causes problems such as high latency, power consumption, or packet loss. In this paper, an energy‐efficient void avoidance geographic routing protocol (EVAGR) has been proposed to handle the void area with low amount of energy consumption. In this protocol, a suitable set of forwarding nodes is selected using a weight function, and the data packets are forwarded to the nodes inside the set. The weight function includes the consumed energy and the depth of the candidate neighboring nodes, and candidate neighboring node selection is based on the packet advancement of the neighboring nodes toward the sonobuoys. Extensive simulation experiments were performed to evaluate the efficiency of the proposed protocol. Simulation results revealed that the proposed protocol can effectively achieve better performance in terms of energy consumption, packet drop, and routing overhead compared with the similar routing protocol.     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

Multipath Security Aware Routing Protocol for MANET Based on Trust Enhanced Cluster Mechanism for Lossless Multimedia Data Transfer

The dynamic nature of mobile nodes of ad hoc network is mostly affected by security problems which reduce data forwarding rate in multimedia sources. Due to the rapid growth of wireless applications, the different multitalented routing protocols are proposed in recent years. But the recent protocols are not efficient for multimedia applications, till now, specific security aware routing protocols are not proposed for multimedia data transfers. In this paper, we proposed trust enhanced cluster based multipath routing (TECM) algorithm. We use energy efficient PSO algorithm used to create cluster formation and cluster head, super cluster head are selected from trust values, which compute form proposed TECM algorithm. The multi trust factors are used for trust computation, such as frame/packet loss ratio, frame/packet forward energy, frame/packet receiving energy, routing overhead, received signal strength, frame/packet forward rate, average forward delay and protocol deviation flag. We then combine proposed TECM algorithm with standard multipath OLSR protocol (TECM-OLSR) to analyze the performance of proposed algorithm. The simulated results show that proposed TECM-OLSR protocol is very effective in terms of loss and delivery rate, delay, routing overhead and network lifetime compare to FPNT-OLSR.     

Cluster Based Routing Protocol for Mobile Nodes in Wireless Sensor Network

Mobility of sensor nodes in wireless sensor network (WSN) has posed new challenges particularly in packet delivery ratio and energy consumption. Some real applications impose combined environments of fixed and mobile sensor nodes in the same network, while others demand a complete mobile sensors environment. Packet loss that occurs due to mobility of the sensor nodes is one of the main challenges which comes in parallel with energy consumption. In this paper, we use cross layer design between medium access control (MAC) and network layers to overcome these challenges. Thus, a cluster based routing protocol for mobile sensor nodes (CBR-Mobile) is proposed. The CBR-Mobile is mobility and traffic adaptive protocol. The timeslots assigned to the mobile sensor nodes that had moved out of the cluster or have not data to send will be reassigned to incoming sensor nodes within the cluster region. The protocol introduces two simple databases to achieve the mobility and traffic adaptively. The proposed protocol sends data to cluster heads in an efficient manner based on received signal strength. In CBR-Mobile protocol, cluster based routing collaborates with hybrid MAC protocol to support mobility of sensor nodes. Schedule timeslots are used to send the data message while the contention timeslots are used to send join registration messages. The performance of proposed CBR-Mobile protocol is evaluated using MATLAB and was observed that the proposed protocol improves the packet delivery ratio, energy consumption, delay and fairness in mobility environment compared to LEACH-Mobile and AODV protocols.     

异构传感器网络中汇聚节点位置优化路由算法

在异构无线传感器网络模型下,针对采集节点发送数据能量消耗过高及路由时分组丢失率过大等情况,对数据汇聚节点的位置优化及路由进行了研究,提出了移动汇聚节点位置优化路由算法（MLOYIH）。先根据蚁群算法的原理对移动节点与静态节点进行分组,再在组内寻找适合的位置放置汇聚节点,最后根据供电情况,选择合适的跳算进行路由。经过仿真实验与性能分析表明,MLOYIH算法与传统算法比较,能量消耗降低到64%,分组丢失率不高于3%。     

Signal power random fading based interference-aware routing for wireless sensor networks

Power loss and interference coexist in wireless transmissions where random uncertainty is aggravated due to the mobility of sensor nodes. A probability interference model was proposed, based on the physical model and random fading of the received signal power, to depict the uncertainty of wireless interference. In addition, an interference-aware routing metric was designed, in which interference, routing convergence and residual energies of nodes were integrated. Furthermore, an interference-aware probabilistic routing algorithm was proposed for mobile wireless sensor networks, and its correctness and time and space complexities were proved. The NS-2 simulation experiments showed that the proposed algorithm can achieve higher packet delivery ratio than Greedy Perimeter Stateless Routing in various cases like the pause time and maximum moving speed. Simultaneously, the energy consumption of a packet and average delay were taken into consideration to better meet the needs of mobile scenarios with higher reliability.     

基于三维胞元空间的能量高效性多通道协作路由算法

针对无线传感器网络中因空洞引起路由效率降低的问题,该文提出了基于3维胞元空间的能量高效性多通道协助路由算法(3D-EEMCR)。该算法根据能量损耗模型,权衡考虑节点的剩余能量和位置信息来选举胞父节点,从而平衡网络能耗;另外,算法采用主通道和辅助通道相互协助的周边路由模式完成空洞区域的路由。仿真结果表明,3D-EEMCR相比3D-GPR(Grid Position-based Routing)和3D-CSR(Cell Space Routing)能够有效提高消息包的发送率,降低网络的平均能耗,延长网络的生存周期。     

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.

     

Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

In recent research, link stability is getting tremendous attention in mobile adhoc networks (MANETs), because of several impediments that occur in a reliable and robust network. Link stability metric is used to improve network performance in terms of end-to-end delay, data success delivery ratio (DSDR) and available route time (ART). Energy consumption, bandwidth and communication delay of major concern in ad hoc networks. A high mobility of MANET nodes reduces the reliability of network communication. In a dynamic networks, high mobility of the nodes makes it very difficult to predict the dynamic routing topology and hence cause route/link failures. Multicast in MANETs is an emerging trend that effectively improves the performance while lowering the energy consumption and bandwidth usage. Multicast routing protocol transmits a packet to multicast a group at a given time instant to achieve a better utilization of resources. In this paper, node mobility is considered to map better their movement in the network. So, the links with long active duration time can be identified as a stable link for route construction. Variation in signal strength is used to identify whether the direction of the node is towards or away from estimating node. We consider signal strength as QoS metric to calculate link stability for route construction. Efforts are made to identify the link with highly probable longer lifetime as the best suitable link between two consecutive nodes. We predict the movement time of nodes that define the route path to the node destination. Exata/cyber simulator is used for network simulation. The simulation results of the proposed routing protocol are compared with on-demand multicast routing protocol and E-ODMRP, which works on minimum hop count path. Analysis of our simulation results has shown improvement of various routing performance metrics such as DSDR, ART, routing overhead and packet drop ratio.     

A fuzzy multicriteria decision‐making‐based CH selection and hybrid routing protocol for WSN

One of the famous approaches to decision making is named as multicriteria decision making (MCDM). In order to solve the MCDM issues, a better way is provided by the fuzzy logic. Expendability, cost, maintenance, availability of software, and performance characteristics are such problems considered by the decision. The precise estimation of the pertinent data is one of the vital phases in DM systems. This paper presents a fuzzy MCDM‐based cluster head (CH) selection and hybrid routing protocol to solve the most common issues. In this research article, the generalized intuitionistic fuzzy soft set (GIFSS) approach is utilized to select the optimal CH, and hybrid shark smell optimization (SSO), and a genetic algorithm (GA) is introduced for the effective routing. Initially, the wireless sensor network (WSN) system and energy models are designed, and then the nodes are grouped into several clusters. Next, based on the GIFSS, the CH nodes are selected, and finally, an effective routing is placed based on the hybrid optimizations. The implementation is performed on the NS2 platform, and the performances are evaluated by packet delivery ratio (PDR), delay, packet loss ratio (PLR), network lifetime, bit error rate (BER), energy consumption, throughput, and jitter. The existing approaches named energy centers examining using particle swarm optimization (EC‐PSO), variable dimension‐based PSO (VD‐PSO), energy‐efficient PSO‐based CH selection (PSO‐ECHS), low‐energy adaptive clustering hierarchy‐sugeno fuzzy (LEACH‐SF), SSO, and GA are compared with the proposed strategy. According to the implemented outcomes, it displays the proposed strategy and gives improved outcomes than the others.     

Betweenness centrality based connectivity aware routing algorithm for prolonging network lifetime in wireless sensor networks

Network lifetime is the key design parameter for wireless sensor network protocols. In recent years, based on energy efficient routing techniques numerous methods have been proposed for enhancing network lifetime. These methods have mainly considered residual energy, number of hops and communication cost as route selection metrics. This paper introduces a method for further improvement in the network lifetime by considering network connectivity along with energy efficiency for the selection of data transmission routes. The network lifetime is enhanced by preserving highly connected nodes at initial rounds of data communication to ensure network connectivity during later rounds. Bassed on the above mentioned concept, a connectivity aware routing algorithm: CARA has been proposed. In the proposed algorithm, connectivity factor of a node is calculated on the basis of Betweenness centrality of a node and energy efficient routes are found by using fuzzy logic and ant colony optimization. The simulation results show that the proposed algorithm CARA performs better than other related state-of-the-art energy efficient routing algorithms viz. FML, EEABR and FACOR in terms of network lifetime, connectivity, energy dissipation, load balancing and packet delivery ratio.     

DBLAR：A DISTANCE-BASED LOCATION-AIDED ROUTING FOR MANET

In location-aided routing of Mobile Ad hoc NETworks (MANET), nodes mobility and the inaccuracy of location information may result in constant flooding, which will reduce the network performance. In this paper, a Distance-Based Location-Aided Routing (DBLAR) for MANET has been proposed. By tracing the location information of destination nodes and referring to distance change between nodes to adjust route discovery dynamically, the proposed routing algorithm can avoid flooding in the whole networks. Besides, Distance Update Threshold (DUT) is set up to reach the balance between real-time ability and update overhead of location information of nodes, meanwhile, the detection of relative distance vector can achieve the goal of adjusting forwarding condition. Simulation results reveal that DBLAR performs better than LAR1 in terms of packet successful delivery ratio, average end-to-end delay and routing-load, and the set of DUT and relative distance vector has a significant impact on this algorithm.     

Energy‐aware geographic routing in wireless sensor networks with anchor nodes

Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

无线多媒体传感器网络中一种改进路由算法

随着网络负载增加,经典的TPGF( Two-Phase geographic Greedy Forwarding)算法难以找到节点分离路径,会导致网络吞吐量、投递率以及端到端时延性能下降。此外,当网络拓扑变动不大时, TPGF中每条路径所包含节点要消耗比其他节点更多的能量,会导致其过快死亡,从而影响网络性能。为此,将联合网络编码技术引入 TPGF,提出一种编码与能量感知的 TPGF 路由算法( NE-TPGF)。该算法综合考虑节点的地理位置、编码机会、剩余能量等因素,同时利用联合网络编码技术进一步扩展编码结构,充分利用网络编码优势来建立相对最优的传输路径。仿真结果表明, NE-TPGF能够增加编码机会,提高网络吞吐量和投递率,降低端到端时延,并且还有利于减少和平衡节点的能量消耗。     

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

Efficient Patient Care Through Wireless Body Area Networks—Enhanced Technique for Handling Emergency Situations with Better Quality of Service

Wireless body area networks (WBAN) is a wireless network of sensors placed in and around the human body for monitoring the patient conditions remotely. The goal of WBAN networks is to report the patient condition to the monitoring system with maximum reliability and minimum delay and deliver the life critical data in the emergency situation with utmost priority. The proposed MAC protocol is aimed at delivery of emergency packets with maximum reliability and minimum delay through the introduction of mini slots in the beacon enabled superframe for exclusive transmission of the same. To improve the packet delivery ratio of the normal packets and decrease the energy consumption of the low data rate nodes, a packet rate based scheduled slot allocation is added to this protocol. Extensive simulations show that the proposed protocol is able to achieve nearly 98% packet delivery ratio and less than 100 ms delay for emergency packets. By varying the number of allocated scheduled slots based on the packet rate of the nodes, the proposed protocol has shown improved performance in the packet delivery ratio (93%) of normal packets as compared to IEEE 802.15.6 (85%), also the energy consumption of low data rate nodes has decreased by 64%. The results show that the proposed protocol is successful in realizing much better delay and packet delivery values for emergency and normal packets.     

AODV能量优化策略

针对传统的AODV路由协议采用扩展环路由搜索算法导致的路由开销较大,没有考虑节点能量的问题,提出一种新的算法。此算法在路由请求过程中能够根据以前搜索中得到的信息,让多余的节点处于静默状态,不参与下一次的路由发现。并且综合考虑节点能量,尽可能地让低能量节点处于静默状态,从而达到均衡节点能量使用的目的。仿真结果表明改进算法有效延长了网络生存时间,提高了包投递率。