A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.     

基于限制广播域和节点剩余能量的按需路由算法研究

按需路由协议AODV的路由发现使用洪泛方式的扩散法,导致网络超负荷运行和拥塞,而且在选择转发路由时,总是选择最少跳数的路由,造成无线传感网络中节点能量不均,减少网络寿命.本文提出了AODV-DE算法,该算法引入广播域的概念,限制RREQ分组的转发范围,同时避免使用剩余能量低的节点转发数据分组,选择路由路径时选择总剩余能量最多的路径进行信息的传送.仿真结果表明,AODV-DE协议在路由开销、网络寿命和端到端的延迟这三个方面表现出了优势.     

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.     

An adaptive‐aware energy and queue improvement of AOMDV

Because the node energy and network resources in the wireless sensor network (WSN) are very finite, it is necessary to distribute data traffic reasonably and achieve network load balancing. Ad hoc on‐demand multipath distance vector (AOMDV) is a widely used routing protocol in WSN, but it has some deficiencies: establishes the route by only using hop counts as the routing criterion without considering other factors such as energy consumption and network load; forwards route request in fixed delay resulting in building the nonoptimal path; and cannot update the path status after built paths. For the deficiency of AOMDV, this paper proposes a multipath routing protocol adaptive energy and queue AOMDV (AEQAOMDV) based on adaptively sensing node residual energy and buffer queue length. When sending a routing request, the forwarding delay of the routing request is adaptively adjusted by both the residual energy and the queue length of the intermediate node; when establishing routes, a fitness is defined as a routing criterion according to the link energy and the queue load, predicting the available duration of the node based on the energy consumption rate and adjusting the weight of the routing criterion by the available duration of the node; after the routes are established, the path information status are updated via periodically broadcasting Hello that carries the path information with the minimum fitness, making the source node update the path information periodically. By using NS‐2, simulations demonstrate that compared with AOMDV, AEQAOMDV has obvious improvements in increasing packet delivery ratio, reducing network routing overhead, reducing route discovery frequency, and decreasing the network delay. And AEQAOMDV is more suitable for WSN.     

移动自组织网络中能源信息熵的需求多路径路由协议(英文)

This paper provides a critical review of energy entropy theory in Mobile Ad Hoc Networks (MANETs) and proposes an Energy Entropy on Ad Hoc On-demand Distance Vector Multipath (EEAODVM) routing protocol. The essential idea of the protocol is to find every route which can minimize the node residual energy in the process of selecting path. It balances individual node battery energy utilization and hence prolongs the entire network lifetime. The results of simulation show that, with the proposed EEAODVM routing...     

一种负载均衡且能量高效的水下传感网络分簇协议

针对水下无线传感网络能量效率低、生命周期短的问题,提出了一种负载均衡且能量高效的水下分簇（load balanced and energy efficient underwater clustering,LBEEUC）协议。该算法在分簇过程中首先根据节点的经验负载来确定节点所在区域簇头的比例,使经验负载大的区域分布较多的簇头,分担数据转发的任务,均衡网络的能耗;其次在节点入簇时,在簇内设置中继节点,用于均衡远离簇头节点的传输能耗,并提前进行数据融合,减少数据冗余;最后在建立簇间路由时,利用Q 学习算法根据路径消耗的总能量最小的原则选择最优传输路径。仿真结果表明,本算法有效地均衡了网络的能耗,提高了能量利用效率,进而提高了网络的生存时间。     

Energy Efficient QoS Aware Hierarchical KF-MAC Routing Protocol in Manet

The paper proposes an energy efficient quality of services (QoS) aware hierarchical KF-MAC routing protocol in mobile ad-hoc networks. The proposed KF-MAC (K-means cluster formation firefly cluster head selection based MAC routing) protocol reduces the concentration of QoS parameters when the node transmits data from source to destination. At first, K-means clustering technique is utilized for clustering the network into nodes. Then the clustered nodes are classified and optimized by the firefly optimization algorithm to find cluster heads for the clustered nodes. The transmission of data begins in the network nodes and TDMA based MAC routing does communication. The observation on KF-MAC protocol performs well for QoS parameters such as bandwidth, delay, bit error rate and jitter. The evaluation of proposed protocol based on a simulation study concludes that the proposed protocol provides a better result in contrast to the existing fuzzy based energy aware routing protocol and modified dynamic source routing protocol. With KF-MAC protocol, the collision free data transmission with low average energy consumption is achieved.     

EOMR: An Energy-Efficient Optimal Multi-path Routing Protocol to Improve QoS in Wireless Sensor Network for IoT Applications

The wireless sensor network based IoT applications mainly suffers from end to end delay, loss of packets during transmission, reduced lifetime of sensor nodes due to loss of energy. To address these challenges, we need to design an efficient routing protocol that not only improves the network performance but also enhances the Quality of Service. In this paper, we design an energy-efficient routing protocol for wireless sensor network based IoT application having unfairness in the network with high traffic load. The proposed protocol considers three-factor to select the optimal path, i.e., lifetime, reliability, and the traffic intensity at the next-hop node. Rigorous simulation has been performed using NS-2. Also, the performance of the proposed protocol is compared with other contemporary protocols. The results show that the proposed protocol performs better concerning energy saving, packet delivery ratio, end-to-end delay, and network lifetime compared to other protocols.

     

Cross‐layer design for topology control and routing in MANETs

A mobile ad hoc network (MANET) is a self‐organized and adaptive wireless network formed by dynamically gathering mobile nodes. Since the topology of the network is constantly changing, the issue of routing packets and energy conservation become challenging tasks. In this paper, we propose a cross‐layer design that jointly considers routing and topology control taking mobility and interference into account for MANETs. We called the proposed protocol as Mobility‐aware Routing and Interference‐aware Topology control (MRIT) protocol. The main objective of the proposed protocol is to increase the network lifetime, reduce energy consumption, and find stable end‐to‐end routes for MANETs. We evaluate the performance of the proposed protocol by comprehensively simulating a set of random MANET environments. The results show that the proposed protocol reduces energy consumption rate, end‐to‐end delay, interference while preserving throughput and network connectivity. Copyright © 2010 John Wiley & Sons, Ltd.     

Fuzzy chessboard clustering and artificial bee colony routing method for energy‐efficient heterogeneous wireless sensor networks

Energy is an extremely critical resource for battery‐powered wireless sensor networks (WSNs), thus making energy‐efficient protocol design a key challenging problem. However, uneven energy consumption is an inherent problem in WSNs caused by multi‐hop routing and many‐to‐one traffic pattern among sensors. In this paper, we therefore propose a new clustering method called fuzzy chessboard clustering (FFC), which is capable to overcome the bottleneck problem and addressing the uneven energy consumption problem in heterogeneous WSNs. We also propose an energy‐efficient routing method called artificial bee colony routing method (ABCRM) to find the optimal routing path for the heterogeneous WSNs. ABCRM seeks to investigate the problems of balancing energy consumption and maximization of network lifetime. To demonstrate the effectiveness of FCC‐ABCRM in terms of lessening end‐to‐end delay, balancing energy consumption, and maximization of heterogeneous network lifetime, we compare our method with three approaches namely, chessboard clustering approach, PEGASIS, and LEACH. Simulation results show that the network lifetime achieved by FCC‐ABCRM could be increased by nearly 25%, 45%, and 60% more than that obtained by chessboard clustering, PEGASIS, and LEACH, respectively. Copyright © 2013 John Wiley & Sons, Ltd.     

一种面向无线视频传感器网络的多径QoS保障路由协议

针对无线视频传感器网络网络带宽有限、网络拓扑结构动态不稳定的特点,以及视频传输对实时性的要求,设计并实现了一种面向WVSN的多径QoS保障路由协议-EDQMR协议,该协议不仅考虑了跳数、时延、节点之间的距离等约束条件,也同时将节点剩余能量作为约束条件,以路径能量的消耗最小为代价函数进行最优路径的选择,不仅考虑单个节点的能耗,也均衡了整个网络的能耗.仿真结果表明,与现有的AOMDV协议相比,在时延满足需求的前提下,本文提出的EDQMR协议可以显著提高数据包的传输成功率,并能有效延长网络的工作寿命.     

A novel method for multipath routing using cross layer approach in vehicular adhoc networks

Vehicular Adhoc Network (VANET) is playing a vital role in recent research. Designing an effective routing protocol for VANET is a challenging task as the VANET nodes move very fast. The design of the routing protocol normally is particular to the specific topology. This paper proposes CLMR, a multipath routing protocol based on cross layer design and also using Redundant Array Inexpensive Disks (RAID). Cross layer is designed among application, network, Media Access Control, and physical layers. It is employed to reduce the end to end delay in network, and RAID is used to minimize the number of re‐transmissions. Three variations of RAID 1 are implemented—Distributed Parity along Single path, Double Distributed Parity, and Distributed Parity among Multiple paths. Multipath routing protocol based on cross layer‐Distributed Parity along Single path recovers 1 packet loss per parity packet along the corresponding path, CLMR‐Double Distributed Parity recovers 2 packets per parity packet along the corresponding path, and CLMR‐Distributed Parity among Multiple paths recovers the packets of the failed path. The evaluation is carried out to test the Quality of Service parameters‐end to end delay, throughput, packet delivery ratio, and number of retransmissions. The results projected show that the CLMR performs better when compared with the legacy protocol Adhoc On‐demand Multipath Distance Vector Routing.     

A novel slot scheduling technique for duty-cycle based data transmission for wireless sensor network

The duty cycling process involves turning a radio into an active and dormant state for conserving energy. It is a promising approach for designing routing protocols for a resource-constrained Wireless Sensor Networks (WSNs). In the duty cycle-based WSNs, the network lifetime is improved and the network transmission is increased as compared to conventional routing protocols. In this study, the active period of the duty cycle is divided into slots that can minimize the idle listening problem. The slot scheduling technique helps determine the most efficient node that uses the active period. The proposed routing protocol uses the opportunistic concept to minimize the sender waiting problem. Therefore, the forwarder set will be selected according to the node's residual active time and energy. Further, the optimum routing path is selected to achieve the minimum forwarding delay from the source to the destination. Simulation analysis reveals that the proposed routing scheme outperforms existing schemes in terms of the average transmission delay, energy consumption, and network throughput.     

Energy-aware redundancy-aware clustering in wireless sensor networks using Spined Loach Searching Optimization

Wireless sensor networks play dominant role in data communication in many engineering applications and faces lot of challenges in its implementation. Energy conservation is also significantly required in these systems as the sensor nodes are battery operated. Hence, the energy efficient-based technique needs to be implemented in data transmission. The most widely used methods are clustering-based data transmission and energy efficient routing detection. In clustering, the proper selection of cluster head (CH) node is important to ensure energy balancing. The CH node should have more residual energy as it does many transmissions in the network. Moreover, the location of CH node should be nearer to all member nodes in the cluster. The clustering process must also perform the job of avoiding unnecessary transmissions. By considering these factors, the CH node can be optimally selected using Spined Loach Searching Optimization algorithm. The food searching behavior and environmental suitability for spiny loach fish living are deliberated to develop this bio-inspired algorithm. In addition, the redundant transmissions inside the clusters can be reduced by employing a new technique called Least Difference Threshold Based Similarity Grouping. This work improves energy efficiency comparing with the conventional low energy adaptive clustering hierarchy protocol, and it is evaluated by setting the network in simulation environment. The network lifetime is increased; energy consumption, delay of transmission and the message cost are reduced.     

基于拥塞预知的WSN多径寻优路由协议

针对无线传感器网络中常出现传输拥塞的问题,该文提出了一种基于拥塞预知的多径寻优路由协议(MOPC)。该协议基于主动避免拥塞的设计思想,依据节点的拥塞预知度、剩余能量和最小跳数建立路径满意度模型,实现了最优路径的选取;通过设定最优路径上节点的转发满意度变化率阈值,实现局部路由的动态维护。仿真结果表明,该协议具有良好的实时性和可靠性,并能显著提高能量利用率,延长网络生命期。     

Investigation of maximum lifetime and minimum delay trade‐off in underwater sensor networks

Underwater acoustic sensor networks (UASNs) are subjected to harsh characteristics of underwater acoustic channel such as severe path losses, noise, and high propagation delays. Among these constraints, propagation delay (more generally, end‐to‐end delay) is the most dominating limitation especially for time‐critical UASN applications. Although the minimization of end‐to‐end delay can be achieved by using the minimum hop routing, this solution cannot lead prolonged lifetimes since nodes consume excessive energy for transmission over long links. On the other hand, the maximization of network lifetime is possible by using energy efficient paths, which consist of relatively short links but high number of hops. However, this solution results in long end‐to‐end delays. Hence, there is a trade‐off between maximizing the network lifetime and minimizing the end‐to‐end delay in UASNs. In this work, we develop a novel multi‐objective–optimization (MOO) model that jointly maximizes the network lifetime while minimizing the end‐to‐end delay. We systematically analyze the effects of limiting the end‐to‐end delay on UASN lifetime. Our results reveal that the minimum end‐to‐end delay routing solution results in at most 72.93% reduction in maximum network lifetimes obtained without any restrictions on the end‐to‐end delay. Nevertheless, relaxing the minimum end‐to‐end delay constraint at least by 30.91% yields negligible reductions in maximum network lifetimes.     

A Cross-Layer Routing Scheme Using Adaptive Retransmission Strategy for Wireless Mesh Networks

In this paper, we develop a link quality-based adaptive adjustment mechanism of the MAC maximum retransmission count to reduce collision probability of wireless Mesh networks. Based on statistics acquired in the link layer and the retransmission strategy, a multi-metric cross-layer on-demand routing scheme is proposed for wireless Mesh networks. The proposed scheme uses information such as available link bandwidth, node residual load rate and transmission efficiency of a path adequately to cross-layer routing. The network layer can adaptively select an optimal path to deliver packets based on the acquired statistics of the MAC layer. Extensive simulation results demonstrate that the proposed scheme can reduce link failure probability, improve network throughput, and decrease the end-to-end delay effectively.     

Fuzzy-based unequal clustering protocol for underwater wireless sensor networks

Underwater wireless sensor network (UWSN) is a network made up of underwater sensor nodes, anchor nodes, surface sink nodes or surface stations, and the offshore sink node. Energy consumption, limited bandwidth, propagation delay, high bit error rate, stability, scalability, and network lifetime are the key challenges related to underwater wireless sensor networks. Clustering is used to mitigate these issues. In this work, fuzzy-based unequal clustering protocol (FBUCP) is proposed that does cluster head selection using fuzzy logic as it can deal with the uncertainties of the harsh atmosphere in the water. Cluster heads are selected using linguistic input variables like distance to the surface sink node, residual energy, and node density and linguistic output variables like cluster head advertisement radius and rank of underwater sensor nodes. Unequal clustering is used to have an unequal size of the cluster which deals with the problem of excess energy usage of the underwater sensor nodes near the surface sink node, called the hot spot problem. Data gathered by the cluster heads are transmitted to the surface sink node using neighboring cluster heads in the direction of the surface sink node. Dijkstra's shortest path algorithm is used for multi-hop and inter-cluster routing. The FBUCP is compared with the LEACH-UWSN, CDBR, and FBCA protocols for underwater wireless sensor networks. A comparative analysis shows that in first node dies, the FBUCP is up to 80% better, has 64.86% more network lifetime, has 91% more number of packets transmitted to the surface sink node, and is up to 58.81% more energy efficient than LEACH-UWSN, CDBR, and FBCA.     

Time‐aware and energy‐efficient opportunistic routing with residual energy collection in wireless sensor networks

In 1‐dimensional queue wireless sensor networks, how to balance end‐to‐end latency and energy consumption is a challenging problem. However, traditional best path routing and existing opportunistic routing protocols do not address them well because relay hop counts are usually much more, and the link appears more unreliable compared with general mesh topology. In this work, we formulate these 2 problems as a multiobjective optimization problem. Specifically, we first classify network packets into types of time tolerant and time critical and introduce a residual energy collection mechanism of neighboring nodes for forwarder set selection. We then propose a time‐aware and energy‐efficient opportunistic routing protocol (TE‐OR) to optimize energy consumption and to reduce latency for time‐critical packets. We evaluate TE‐OR by different parameters and compare it with existing protocols. The performance results show that TE‐OR achieves a trade‐off between energy consumption and time delay and balances energy consumption among nodes while guaranteeing the latency of time‐critical packets is minimized.     

Energy‐efficient multihop routing in WSN using the hybrid optimization algorithm

The technical growth in the field of the wireless sensor networks (WSNs) has resulted in the process of collecting and forwarding the massive data between the nodes, which was a major challenge to the WSNs as it is associated with greater energy loss and delay. This resulted in the establishment of a routing protocol for the optimal selection of the multipath to progress the routing in WSNs. This paper proposes an energy‐efficient routing in WSNs using the hybrid optimization algorithm, cat–salp swarm algorithm (C‐SSA), which chooses the optimal hops in progressing the routing. Initially, the cluster heads (CHs) are selected using the low‐energy adaptive clustering hierarchy (LEACH) protocol that minimizes the traffic in the network. The CHs are engaged in the multihop routing, and the selection of the optimal paths is based on the proposed hybrid optimization, which chooses the optimal hops based on the energy constraints, such as energy, delay, intercluster distance, intracluster distance, link lifetime, delay, and distance. The simulation results prove that the proposed routing protocol acquired minimal delay of 0.3165 with 50 nodes and two hops, maximal energy of 0.1521 with 50 nodes and three hops, maximal number of the alive nodes as 39 with 100 nodes and two hops, and average throughput of 0.9379 with 100 nodes and three hops.