DDRP: An efficient data‐driven routing protocol for wireless sensor networks with mobile sinks

Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd.     

Probabilistic routing protocol for a hybrid wireless underground sensor networks

A wireless underground sensor network (WUSN) is defined as a network of wireless sensor devices in which all sensor devices are deployed completely underground (network sinks or any devices specifically for relay between sensors and a sink may be aboveground). In hybrid wireless underground sensor network (HWUSN), communication between nodes is implemented from underground‐to‐air or air‐to‐underground, not underground‐to‐underground. This paper proposes a novel hybrid underground probabilistic routing protocol that provides an efficient means of communication for sensor nodes in HWUSN. In addition, signal propagation based on the shadowing model for underground medium is developed. The proposed routing protocol ensures high packet throughput, prolongs the lifetime of HWUSN and the random selection of the next hop with multi‐path forwarding contributes to built‐in security. Moreover, the proposed mechanism utilizes an optimal forwarding (OF) decision that takes into account of the link quality, and the remaining power of next hop sensor nodes. The performance of proposed routing protocol has been successfully studied and verified through the simulation and real test bed. Copyright © 2011 John Wiley & Sons, Ltd.     

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.

     

Simulation‐based real‐time routing protocol with load distribution in wireless sensor networks

In wireless sensor networks (WSNs), sensors gather information about the physical world and the base station makes decision and then performs appropriate actions upon the environment. This technology enables a user to effectively sense and monitor from a distance in real‐time. WSNs demand real‐time forwarding which means messages in the network are delivered according to their end‐to‐end deadlines (packet lifetime). This paper proposes a novel real‐time routing protocol with load distribution (RTLD) that ensures high packet throughput with minimized packet overhead and prolongs the lifetime of WSN. The routing depends on optimal forwarding (OF) decision that takes into account of the link quality (LQ), packet delay time and the remaining power of next hop sensor nodes. The proposed mechanism has been successfully studied through simulation work. Copyright © 2009 John Wiley & Sons, Ltd.     

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.

     

Adaptive energy aware cluster-based routing protocol for wireless sensor networks

Wireless sensor networks (WSNs) have grown excessively due to their various applications and low installation cost. In WSN, the main concern is to reduce energy consumption among nodes while maintaining timely and reliable data forwarding. However, most of the existing energy aware routing protocols incur unbalanced energy consumption, which results in inefficient load balancing and compromised network lifetime. Therefore, the main target of this research paper is to present adaptive energy aware cluster-based routing (AECR) protocol for improving energy conservation and data delivery performance. Our proposed AECR protocol differs from other energy efficient routing schemes in some aspects. Firstly, it generates balance sized clusters based on nodes distribution and avoids random clusters formation. Secondly, it optimizes both intra-cluster and inter-cluster routing paths for improving data delivery performance while balancing data traffic on constructed forwarding routes and at the end, in order to reduce the excessive energy consumption and improving load distribution, the role of Cluster Head (CH) is shifted dynamically among nodes by exploit of network conditions. Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.

     

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.     

An energy aware event-driven routing protocol for cognitive radio sensor networks

Cognitive radio sensor network (CRSN) is an intelligent and reasonable combination of cognitive radio technology and wireless sensor networks. It poses significant challenges to the design of topology maintenance techniques due to dynamic primary-user activities, which in turn decreases the data delivery performance of the network as well as it’s lifetime. This paper aims to provide a solution to the CRSN clustering and routing problem using an energy aware event-driven routing protocol (ERP) for CRSN. Upon detection of an event, the ERP determines eligible nodes for clustering according to local positions of CRSN nodes between the event and the sink and their residual energy levels. Cluster-heads are selected from the eligible nodes according to their residual energy values, available channels, neighbors and distance to the sink. In ERP, cluster formation is based on relative spectrum awareness such that channels with lower primary user appearance probability are selected as common data channels for clusters. For data routing, ERP employs hop-by-hop data forwarding approach through the CHs and primary/secondary gateways towards the sink. Through extensive simulations, we demonstrate that the proposed ERP provides with better network performances compared to those of the state-of-the-art protocols under a dynamic spectrum-aware data transmission environment.     

Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks

In this paper, a distributed traffic-balancing routing algorithm is proposed for multi-sink wireless sensor networks that effectively distributes traffic from sources to sinks. Each node has a gradient field that is used to decide on a neighbor node to reach a sink. The node’s gradient index contains (1) the distance cost from a source to a respective sink, and (2) traffic information from neighboring nodes. The proposed algorithm considers the traffic being faced by surrounding neighbors before forwarding packets to any sink using gradient search for routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The key objective of this work is to achieve traffic-balancing by detecting congested areas along the route and distributing packets along paths that have idle and underloaded nodes. Extensive simulations conducted to evaluate the performance of the proposed scheme indicate that it effectively reduces the overall packet delay, energy consumption and improves the packet delivery ratio under heavy traffic.     

EFT: a high throughput routing metric for IEEE 802.11s wireless mesh networks

In this paper, we present a throughput-maximizing routing metric, referred to as expected forwarding time (EFT), for IEEE 802.11s-based wireless mesh networks. Our study reveals that most of the existing routing metrics select the paths with minimum aggregate transmission time of a packet. However, we show by analyses that, due to the shared nature of the wireless medium, other factors, such as transmission time of the contending nodes and their densities and loads, also affect the performance of routing metrics. We therefore first identify the factors that hinder the forwarding time of a packet. Furthermore, we add a new dimension to our metric by introducing traffic priority into our routing metric design, which, to the best of our knowledge, is completely unaddressed by existing studies. We also show how EFT can be incorporated into the hybrid wireless mesh protocol (HWMP), the path selection protocol used in the IEEE 802.11s draft standard. Finally, we study the performance of EFT through simulations under different network scenarios. Simulation results show that EFT outperforms other routing metrics in terms of average network throughput, end-to-end delay, and packet loss rate.     

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协议通过数据源节点S泛洪广播RREQ消息请求到任意目标节点D的路由,而在无线体域网络中,只有一个sink目标节点,除最短跳数路由上的节点外,其他参与RREQ接收和转发的节点浪费了能量。提出了一种能量平衡的无线体域网络AODV多播路由发现协议,通过在节点广播的hello消息中增加到sink的最小跳数hops、到sink的下一跳节点next和节点本身是否具备转发能力isforward 3 个参数,只选择能到达sink节点的邻居节点参与转发RREQ消息,变广播为多播,有效地降低了路由发现的能量开销,并通过能量平衡延长了WBAN的使用寿命。性能分析与模拟实验表明,该协议在RREQ数量、数据传输率和能量消耗等方面优于相似协议EAAODV。     

Outage Probability Analysis of Multi-relay Cooperative Decode-and-Forward System Over Generalized η–μ and κ–μ Fading Channels

In present scenario of wireless sensor networks and communications, efficient sensed data transmission among nodes is being a great confrontation because of the impulsive and volatile nature of sensors in the network. For providing that and enhancing network lifetime, there are several approaches are developed, specifically using clustering techniques. Still, there are requirements for energy based efficient routing in WSN. With that note, this paper develops anEnergy Aware Efficient Data Aggregation (EAEDAR) and Data Re-Schedulingwith the incorporation of clustering techniques. Moreover, the model used energy based cluster formation and cluster head selection for increasing the network stability and data delivery rate. The model comprises four main phases, namely, Energy factor based cluster formation, Aggregator_SN (Sensor Node) Selection, Efficient Data Aggregation (EDA) and Data Re-Scheduling based on delay and processing time. Furthermore, the model is updated with respect to the status of the nodes and links, for providing consistent network with improved reliable data transmissions. The simulation results portrays the effectiveness of the proposed model over other compared works in terms of the performance factors such as, throughput, packet delivery ratio, network lifetime, transmission delay and packet drop.

     

Intelligent beaconless geographical forwarding for urban vehicular environments

A Vehicular Ad hoc Network is a type of wireless ad hoc network that facilitates ubiquitous connectivity between vehicles in the absence of fixed infrastructure. Source based geographical routing has been proven to perform well in unstable vehicular networks. However, these routing protocols leverage beacon messages to update the positional information of all direct neighbour nodes. As a result, high channel congestion or problems with outdated neighbour lists may occur. To this end, we propose a street-aware, Intelligent Beaconless (IB) geographical forwarding protocol based on modified 802.11 Request To Send (RTS)/ Clear To Send frames, for urban vehicular networks. That is, at the intersection, each candidate junction node leverage digital road maps as well as distance to destination, power signal strength of the RTS frame and direction routing metrics to determine if it should elect itself as a next relay node. For packet forwarding between Intersections, on the other hand, the candidate node considers the relative direction to the packet carrier node and power signal strength of the RTS frame as routing metrics to elect itself based on intelligently combined metrics. After designing the IB protocol, we implemented it and compared it with standard protocols. The simulation results show that the proposed protocol can improve average delay and successful packet delivery ratio in realistic wireless channel conditions and urban vehicular scenarios.     

IM2PR: interference-minimized multipath routing protocol for wireless sensor networks

With respect to the inherent advantages of multipath routing, nowadays multipath routing is known as an efficient mechanism to provide even network resource utilization and efficient data transmission in different networks. In this context, several multipath routing protocols have been developed over the past years. However, due to the time-varying characteristics of low-power wireless communications and broadcast nature of radio channel, performance benefits of traffic distribution over multiple paths in wireless sensor networks are less obvious. Motivated by the drawbacks of the existing multipath routing protocols, this paper presents an Interference-Minimized MultiPath Routing protocol (IM2PR) which aims to discover a sufficient number of minimum interfering paths with high data transmission quality between each event area and sink node in order to provide efficient event data packet forwarding in event-driven wireless sensor networks. Extensive performance evaluations show that IM2PR presents improvements over the Micro Sensor Multipath Routing Protocol and Energy-Efficient data Routing Protocol as follows: 50 and 70 % in term of packet reception ratio at the sink, 44 and 80 % in term of goodput, 33 and 40 % in term of packet delivery latency, 40 and 57 % in term of energy consumption, 50 and 60 % in term of packet delivery overhead.     

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.     

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.

     

Analysis of tree‐based multicast routing in wireless sensor networks with varying network metrics

Wireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. Routing protocols act as an interface between the lower and higher layers of the network protocol stack. Depending on the size of target nodes, routing techniques are classified into unicast, multicast and broadcast protocols. In this article, we give analysis and performance evaluation of tree‐based multicast routing in wireless sensor networks with varying network metrics. Geographic multicast routing (GMR) and its variations are used extensively in sensor networks. Multicast routing protocols considered in the analytical model are GMR, distributed GMR, demand scalable GMR, hierarchical GMR, destination clustering GMR and sink‐initiated GMR. Simulations are given with comparative analysis based on varying network metrics such as multicast group size, number of sink nodes, average multicast latency, number of clusters, packet delivery ratio, energy cost ratio and link failure rate. Analytical results indicate that wireless sensor network multicast routing protocols operate on the node structure (such as hierarchical, clustered, distributed, dense and sparse networks) and application specific parameters. Simulations indicate that hierarchical GMR is used for generic multicast applications and that destination clustering GMR and demand scalable GMR are used for distributed multicast applications. Copyright © 2012 John Wiley & Sons, Ltd.     

Wireless Sensor Network Path Optimization Using Sensor Node Coverage Area Calculation Approach

The proposed work is based on the path optimization approach for wireless sensor network (WSN). Path optimization is achieved by using the NSG 2.1 Tool, TCL Script file and NS2 simulator to improve the quality of service (QoS). Path optimization approach finds best suitable path between sensor nodes of WSN. The routing approach is not only the solution to improve the quality but also improves the WSN performance. The node cardinally is taken under consideration using the ad-hoc on demand distance vector routing protocol mechanism. Ad hoc approach emphasize on sensor nodes coverage area performance along with simulation time. NSG 2.1 Tool calculates the sensor node packet data delivery speed which can facilitate inter-node communication successfully. An experimental result verified that the proposed design is the best possible method which can escape from slow network response while covering maximum sensor nodes. It achieves coverage support in sensor node deployment. The result outcomes show best path for transferring packet from one sensor node to another node. The coverage area of sensor node gives the percentage of average coverage ratio of each node with respect to the simulation time.

     

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.