TY - GEN
T1 - Local scheduling scheme for opportunistic routing
AU - Li, Yanhua
AU - Liu, Yuan An
AU - Li, Li
AU - Luo, Pengkui
PY - 2009
Y1 - 2009
N2 - Opportunistic routing is a new design trend of wireless routing, which can dramatically improve the end-toend 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.
AB - Opportunistic routing is a new design trend of wireless routing, which can dramatically improve the end-toend 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.
KW - Graph partitioning
KW - Opportunistic routing
KW - Wireless routing
UR - http://www.scopus.com/inward/record.url?scp=70349176426&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349176426&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2009.4917786
DO - 10.1109/WCNC.2009.4917786
M3 - Conference contribution
AN - SCOPUS:70349176426
SN - 9781424429486
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2009 IEEE Wireless Communications and Networking Conference, WCNC 2009 - Proceedings
T2 - 2009 IEEE Wireless Communications and Networking Conference, WCNC 2009
Y2 - 5 April 2009 through 8 April 2009
ER -