TY - GEN
T1 - Towards minimum delay broadcasting and multicasting in multihop wireless networks
AU - Cheng, Maggie X.
AU - Ye, Quanmin
N1 - Funding Information:
Acknowledgement. Maggie Cheng and Quanmin Ye are supported in part by National Science Foundation under grant CNS-0841388.
PY - 2011
Y1 - 2011
N2 - End-to-end delay is defined as the total time it takes for a single packet to reach the destination. End-to-end delay, along with end-to-end throughput, is a determinant factor of the user-experienced data transmission time. It is an important QoS metric for both unicast and multicast applications. In this paper, we focus on the delay performance of multicast and broadcast applications. In multihop wireless networks, end-to-end delay is a result of many factors including the length of a route (in hops) and the interference level of the links along the route. In fact, the sum of interference of links along a route is a good indicator of end-to-end delay. We propose a linear programming based routing scheme to achieve the minimum overall path interference. Through simulation, we show that the proposed routing scheme is better than the well-known shortest path tree based multicasting such as MOSPF.
AB - End-to-end delay is defined as the total time it takes for a single packet to reach the destination. End-to-end delay, along with end-to-end throughput, is a determinant factor of the user-experienced data transmission time. It is an important QoS metric for both unicast and multicast applications. In this paper, we focus on the delay performance of multicast and broadcast applications. In multihop wireless networks, end-to-end delay is a result of many factors including the length of a route (in hops) and the interference level of the links along the route. In fact, the sum of interference of links along a route is a good indicator of end-to-end delay. We propose a linear programming based routing scheme to achieve the minimum overall path interference. Through simulation, we show that the proposed routing scheme is better than the well-known shortest path tree based multicasting such as MOSPF.
UR - http://www.scopus.com/inward/record.url?scp=80051965856&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051965856&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22616-8_43
DO - 10.1007/978-3-642-22616-8_43
M3 - Conference contribution
AN - SCOPUS:80051965856
SN - 9783642226151
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 546
EP - 560
BT - Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings
T2 - 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011
Y2 - 4 August 2011 through 6 August 2011
ER -