2,580 research outputs found
A novel cooperative opportunistic routing scheme for underwater sensor networks
Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance
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
An Extended Network Coding Opportunity Discovery Scheme in Wireless Networks
Network coding is known as a promising approach to improve wireless network
performance. How to discover the coding opportunity in relay nodes is really
important for it. There are more coding chances, there are more times it can
improve network throughput by network coding operation. In this paper, an
extended network coding opportunity discovery scheme (ExCODE) is proposed,
which is realized by appending the current node ID and all its 1-hop neighbors'
IDs to the packet. ExCODE enables the next hop relay node to know which nodes
else have already overheard the packet, so it can discover the potential coding
opportunities as much as possible. ExCODE expands the region of discovering
coding chance to n-hops, and have more opportunities to execute network coding
operation in each relay node. At last, we implement ExCODE over the AODV
protocol, and efficiency of the proposed mechanism is demonstrated with NS2
simulations, compared to the existing coding opportunity discovery scheme.Comment: 15 pages and 7 figure
SIMPLE: Stable Increased-throughput Multi-hop Protocol for Link Efficiency in Wireless Body Area Networks
In this work, we propose a reliable, power efficient and high throughput
routing protocol for Wireless Body Area Networks (WBANs). We use multi-hop
topology to achieve minimum energy consumption and longer network lifetime. We
propose a cost function to select parent node or forwarder. Proposed cost
function selects a parent node which has high residual energy and minimum
distance to sink. Residual energy parameter balances the energy consumption
among the sensor nodes while distance parameter ensures successful packet
delivery to sink. Simulation results show that our proposed protocol maximize
the network stability period and nodes stay alive for longer period. Longer
stability period contributes high packet delivery to sink which is major
interest for continuous patient monitoring.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
- …