Selection diversity forwarding in a multihop packet radio network with fading channel and capture
ACM SIGMOBILE Mobile Computing and Communications Review
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
MAC-layer anycasting in ad hoc networks
ACM SIGCOMM Computer Communication Review
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
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
TinyNode: a comprehensive platform for wireless sensor network applications
Proceedings of the 5th international conference on Information processing in sensor networks
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
IEEE Transactions on Wireless Communications - Part 1
Practical relay networks: a generalization of hybrid-ARQ
IEEE Journal on Selected Areas in Communications
Candidate selection algorithms in opportunistic routing
Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Survey Paper: Opportunistic routing - A review and the challenges ahead
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new multicast opportunistic routing protocol for wireless mesh networks
NETWORKING'11 Proceedings of the IFIP TC 6th international conference on Networking
Low power, low delay: opportunistic routing meets duty cycling
Proceedings of the 11th international conference on Information Processing in Sensor Networks
Polynomial-time algorithms for multirate anypath routing in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
Interpolating between random walks and shortest paths: a path functional approach
SocInfo'12 Proceedings of the 4th international conference on Social Informatics
On the number of candidates in opportunistic routing for multi-hop wireless networks
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
Let the tree Bloom: scalable opportunistic routing with ORPL
Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems
QMOR: QoS-Aware Multi-sink Opportunistic Routing for Wireless Multimedia Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each node a group of candidate relays for a particular destination. This paper addresses the least-cost anypath routing (LCAR) problem: how to assign a set of candidate relays at each node for a given destination such that the expected cost of forwarding a packet to the destination is minimized. The key is the following tradeoff: On one hand, increasing the number of candidate relays decreases the forwarding cost, but on the other, it increases the likelihood of "veering" away from the shortest-path route. Prior proposals based on single-path routing metrics or geographic coordinates do not explicitly consider this tradeoff and, as a result, do not always make optimal choices. The LCAR algorithm and its framework are general and can be applied to a variety of networks and cost models. We show how LCAR can incorporate different aspects of underlying coordination protocols, for example a link-layer protocol that randomly selects which receiving node will forward a packet, or the possibility that multiple nodes mistakenly forward a packet. In either case, the LCAR algorithm finds the optimal choice of candidate relays that takes into account these properties of the link layer. Finally, we apply LCAR to low-power, low-rate wireless communication and introduce a new wireless link-layer technique to decrease energy transmission costs in conjunction with anypath routing. Simulations show significant reductions in transmission cost to opportunistic routing using single-path metrics. Furthermore, LCAR routes are more robust and stable than those based on single-path distances due to the integrative nature of the LCAR's route cost metric.