TY - GEN
T1 - LOR
T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010
AU - Li, Yanhua
AU - Zou, Debin
AU - Wang, Hao
AU - Zhou, Zheng
AU - Liu, Yuan An
AU - Qiao, Yan
PY - 2010
Y1 - 2010
N2 - As the wireless network scales up in size and complexity, the need to study the scalability and behaviors of these networks and their protocols becomes essential. Opportunistic routing utilizes broadcast nature of wireless network, and significantly increases the unicast throughput. However, all of the current opportunistic routing protocols have to rely on the whole topology information. This indeed restricts to applying the opportunistic routing to large-scale wireless networks, due to the huge cost of the control overheads needed for building a network graph at each node. In this paper, we propose the localized opportunistic routing (LOR) protocol, which utilizes the distributed minimum transmission selection (MTS) algorithm to partition the topology into several nested close-node-sets (CNS) with local information. It can locally realize the optimal opportunistic routing for large-scale wireless networks with low control overhead cost. Extensive simulation results show that in large-scale wireless environments, LOR can dramatically improve the performances over ExOR, MORE, in terms of control overhead, end-to-end delay and throughputs.
AB - As the wireless network scales up in size and complexity, the need to study the scalability and behaviors of these networks and their protocols becomes essential. Opportunistic routing utilizes broadcast nature of wireless network, and significantly increases the unicast throughput. However, all of the current opportunistic routing protocols have to rely on the whole topology information. This indeed restricts to applying the opportunistic routing to large-scale wireless networks, due to the huge cost of the control overheads needed for building a network graph at each node. In this paper, we propose the localized opportunistic routing (LOR) protocol, which utilizes the distributed minimum transmission selection (MTS) algorithm to partition the topology into several nested close-node-sets (CNS) with local information. It can locally realize the optimal opportunistic routing for large-scale wireless networks with low control overhead cost. Extensive simulation results show that in large-scale wireless environments, LOR can dramatically improve the performances over ExOR, MORE, in terms of control overhead, end-to-end delay and throughputs.
UR - http://www.scopus.com/inward/record.url?scp=79551631514&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79551631514&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2010.5683488
DO - 10.1109/GLOCOM.2010.5683488
M3 - Conference contribution
AN - SCOPUS:79551631514
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 6 December 2010 through 10 December 2010
ER -