Opportunistic routing using Wireless Sensor Networks

Wireless Sensor Networks (WSN) are used in our daily life for monitoring and controlling application because of it’s unique features such as low power consumption, reduced cost, and implementation with ease. To improve the lifetime of wireless sensor networks energy efficient routing protocol is very necessary to choose in the network layer of WSN. A comparative analysis based on performance and energy consumption referring to opportunistic routing algorithm is done. It is being evaluated in terms of energy consumed, packets lost, flow rate and throughput. We see that Opportunistic routing algorithm performs way better than the entire traditional routing algorithm. The results provided show that Opportunistic routing give significant improvement in power consumption

Poster Abstract: Opportunistic RPL

Sensor nodes constituting Wireless Sensor Networks (WSN) are often battery- operated and have limited resources. To save energy, nodes sleep most of the time, and wake up periodically to handle communication. Such radio duty cycling poses a basic trade-off between energy and latency. In previous work, we have shown that opportunistic routing is an efficient way to achieve low-latency yet energy efficient data collection in WSN (ORW [3]). In this paper, we extend this approach to the context of low-power IP networks, where nodes need to be addressed individually and where traffic patterns are irregular. We present ORPL, an opportunistic extension of RPL, the stan- dard, state-of-the-art routing protocol for low-power IP networks. We discuss our preliminary results obtained with Contiki in a 137-node testbed

Multi-hop Route Discovery Using Opportunistic Routing for Wireless Sensor Networks

In wireless sensor networks multi-hop routing is often used because of the limited transmission range of sensor nodes. Opportunistic Routing is a multi-hop routing for wireless sensor networks. In this routing, the neighbors of sender node overhear the transmission and f``orm multiple hops from source to the destination for transfer of information. The neighbor nodes set participating in the routing are included in the forwarder list in the order of priority. The node with highest priority is allowed to forward the packet it hears. A new protocol by Energy Efficient Selective Opportunistic Routing (EESOR), is implemented in this paper that reduces the size of forwarder list by applying a condition that the forwarding node is nearer to the destination. The path followed by acknowledgment packet follows opportunistic routing, assuring reliability of transmission and energy balancing. NS2 is the simulator used to implement the algorithm and results of simulation show that proposed EESOR protocol performs better than existing Energy Efficient Opportunistic Routing (EEOR) protocol with respect to parameters End-to-End Delay, Throughput, Routing Overhead and Network Lifetime

MEGOR: Multi-constrained Energy efficient Geographic Opportunistic Routing in Wireless Sensor Network

Providing better energy efficient network is the important critical issues in Wireless Sensor Networks. We presented Multi-constrained Energy efficient Geographic Opportunistic Routing algorithm that enhance the network lifetime based on efficient Geographic Opportunistic Routing. Geographic Opportunistic Routing algorithm uses single path multi hop routing technique in which packets are effectively routed from source to the sink node in a given geographical region. Proposed algorithm is devised with unique parameters viz., Single hop Packet Progress, Packet Reception Ratio, Residual Energy and Energy Density to select intermediate next nodes to forward the packet to sink node. The MEGOR exhibits better results in terms of delay, reliability, energy efficiency and network lifetime when compared with earlier state_of_art works

Low Power, Low Delay: Opportunistic Routing meets Duty Cycling

Traditionally, routing in wireless sensor networks consists of two steps: First, the routing protocol selects a next hop, and, second, the MAC protocol waits for the intended destination to wake up and receive the data. This design makes it difficult to adapt to link dynamics and introduces delays while waiting for the next hop to wake up. In this paper we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. In a dutycycled setting, packets are addressed to sets of potential receivers and forwarded by the neighbor that wakes up first and successfully receives the packet. This reduces delay and energy consumption by utilizing all neighbors as potential forwarders. Furthermore, this increases resilience to wireless link dynamics by exploiting spatial diversity. Our results show that ORW reduces radio duty-cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art

Let the Tree Bloom: Scalable Opportunistic Routing with ORPL

Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks. However, applications are now considered where nodes are not only periodic data sources, but rather addressable end points generating traffic with arbitrary patterns. We present ORPL, an opportunistic routing protocol that supports any-to-any, on-demand traffic. ORPL builds upon RPL, the standard protocol for low-power IPv6 networks. By combining RPL's tree-like topology with opportunistic routing, ORPL forwards data to any destination based on the mere knowledge of the nodes' sub-tree. We use bitmaps and Bloom filters to represent and propagate this information in a space-efficient way, making ORPL scale to large networks of addressable nodes. Our results in a 135-node testbed show that ORPL outperforms a number of state-of-the-art solutions including RPL and CTP, conciliating a sub-second latency and a sub-percent duty cycle. ORPL also increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task

Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks

For improving the efficiency and the reliability of the opportunistic routing algorithm, in this paper, we propose the cross-layer and reliable opportunistic routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the improved efficiency fuzzy logic and humoral regulation inspired topology control into the opportunistic routing algorithm. In CBRT, the inputs of the fuzzy logic system are the relative variance (rv) of the metrics rather than the values of the metrics, which reduces the number of fuzzy rules dramatically. Moreover, the number of fuzzy rules does not increase when the number of inputs increases. For reducing the control cost, in CBRT, the node degree in the candidate relays set is a range rather than a constant number. The nodes are divided into different categories based on their node degree in the candidate relays set. The nodes adjust their transmission range based on which categories that they belong to. Additionally, for investigating the effection of the node mobility on routing performance, we propose a link lifetime prediction algorithm which takes both the moving speed and moving direction into account. In CBRT, the source node determines the relaying priorities of the relaying nodes based on their utilities. The relaying node which the utility is large will have high priority to relay the data packet. By these innovations, the network performance in CBRT is much better than that in ExOR, however, the computation complexity is not increased in CBRT.Comment: 14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 201