Selection diversity forwarding in a multihop packet radio network with fading channel and capture
ACM SIGMOBILE Mobile Computing and Communications Review
Exploiting Path Diversity in the Link Layer in Wireless Ad Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
XORs in the air: practical wireless network coding
IEEE/ACM Transactions on Networking (TON)
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
DCAR: Distributed Coding-Aware Routing in Wireless Networks
IEEE Transactions on Mobile Computing
The κ factor: inferring protocol performance using inter-link reception correlation
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Network coding-aware routing in wireless networks
IEEE/ACM Transactions on Networking (TON)
Polynomial Time and Provably Efficient Network Coding Scheme for Lossy Wireless Networks
MASS '11 Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
Capacity of wireless erasure networks
IEEE Transactions on Information Theory
Guest editorial- Cooperative communications and networking
IEEE Journal on Selected Areas in Communications
CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding
ICNP '08 Proceedings of the 2008 IEEE International Conference on Network Protocols
| Hi-index | 0.00 |
There is growing interest in recent years in routing methods for wireless networks that leverage the broadcast nature of the wireless medium and the ability of nodes to overhear their neighbors' transmissions. Such methods include opportunistic routing (OR), which generally choose the next hop on a routing path only after the outcome of the previous transmission is known; and wireless network coding (NC), which linearly combines packets from different flows coexisting in the network. In this paper, we study the potential benefits of forwarding schemes that combine elements from both the OR and NC approaches, when traffic on a bidirectional unicast connection between two nodes is relayed by multiple common neighbors. We present a theoretically optimal scheme that provides a lower bound on the expected number of transmissions required to communicate a packet in both directions as a function of link error probabilities, and demonstrate that this bound can be up to 20% lower than with either OR or NC employed alone even in a small network. Using simulation, we further explore the control overhead in a direct implementation of the scheme with a simple coordination mechanism and show that the optimal bound can be closely approached for a wide range of link error rates.