On selection of candidates for opportunistic anypath forwarding

Authors:
Zifei Zhong;Junling Wang;Srihari Nelakuditi;Guor-Huar Lu
Affiliations:
Univ. of South Carolina, Columbia, SC;Univ. of South Carolina, Columbia, SC;Univ. of South Carolina, Columbia, SC;Univ. of Minnesota, Minneapolis, MN
Venue:
ACM SIGMOBILE Mobile Computing and Communications Review
Year:
2006

Citing 2
Cited 9

Opportunistic routing in multi-hop wireless networks

ACM SIGCOMM Computer Communication Review
MAC-layer anycasting in ad hoc networks

ACM SIGCOMM Computer Communication Review

On the performance modeling of opportunistic routing

MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
CORE: a coding-aware opportunistic routing mechanism for wireless mesh networks

IEEE Wireless Communications
Candidate selection algorithms in opportunistic routing

Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Modeling and comparison of candidate selection algorithms in opportunistic routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Review: Survey of network coding-aware routing protocols in wireless networks

Journal of Network and Computer Applications
A new multicast opportunistic routing protocol for wireless mesh networks

NETWORKING'11 Proceedings of the IFIP TC 6th international conference on Networking
Survey on diversity-based routing in wireless mesh networks: Challenges and solutions

Computer Communications
Polynomial-time algorithms for multirate anypath routing in wireless multihop networks

IEEE/ACM Transactions on Networking (TON)
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Opportunistic routing schemes that exploit the broadcast nature of wireless transmissions for selecting the best next-hop at that instant among a set of candidates are being actively explored [1-3]. These schemes which we refer to as opportunistic any-path forwarding (OAPF), reduce the number of transmissions needed for reliable packet delivery.