Local scheduling scheme for opportunistic routing

Authors:
Yanhua Li;Yuan-an Liu;Li Li;Pengkui Luo
Affiliations:
Beijing U. of Posts & Telecommunications, China;Beijing U. of Posts & Telecommunications, China;National U. of Defense Technology, Changsha, China;U. of Minnesota, Minneapolis
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 3
Cited 0

Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A high-throughput path metric for multi-hop wireless routing

Proceedings of the 9th annual international conference on Mobile computing and networking
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Opportunistic routing is a new design trend of wireless routing, which can dramatically improve the end-to-end throughput over traditional routing by judiciously utilizing the broadcasting nature of wireless network. However, the global scheduling scheme it adopts restricts its application in large-scale wireless network, due to the big waste of the end-to-end transmission latency and the computation cost. So, how to schedule the transmissions of different forwarders is essentially an important issue of the opportunistic routing scheme design. In this paper, we propose a graph partition based local scheduling (GPLS) scheme for opportunistic routing. It partitions the wireless topology into several subgraphs, and realizes the local forwarding in each subgraph. Simulation results show that our local forwarding scheme can significantly improve the network performances in large-scale network over existing opportunistic routing schemes, in terms of the end-to-end delay and the life time of the wireless node.