TY - GEN
T1 - Minimum delay routing in multihop wireless networks
AU - Cheng, Maggie X.
AU - Gong, Xuan
AU - Wan, Peng Jun
N1 - Funding Information:
Acknowledgement. Maggie Cheng and Xuan Gong are supported in part by National Science Foundation under grant CNS-0841388, and Peng-Jun Wan is supported by NSF grants CNS-0831831 and CNS-0916666.
PY - 2011
Y1 - 2011
N2 - End-to-end delay is an important QoS metric in multihop wireless networks such as sensor networks and mesh networks. Along with throughput, end-to-end delay determines the user-experienced data transmission time. End-to-end delay refers to the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the route and the interference level along the route, and therefore both the routing scheme and the MAC layer scheduling scheme can affect end-to-end delay. We assume a deterministic scheduling scheme is used at the MAC layer. Since the actual delay depends on the MAC layer scheduling algorithm, at the network layer we try to reduce the interference on the path instead of the actual delay time. To find the routing solution that minimizes path interference, a sufficient condition on conflict-free transmission is established, which helps to quantify the interference on a link. A linear program based on the sufficient condition is developed to compute the routing solution. Through simulation, we show that the proposed routing scheme can effectively reduce end-to-end delay.
AB - End-to-end delay is an important QoS metric in multihop wireless networks such as sensor networks and mesh networks. Along with throughput, end-to-end delay determines the user-experienced data transmission time. End-to-end delay refers to the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the route and the interference level along the route, and therefore both the routing scheme and the MAC layer scheduling scheme can affect end-to-end delay. We assume a deterministic scheduling scheme is used at the MAC layer. Since the actual delay depends on the MAC layer scheduling algorithm, at the network layer we try to reduce the interference on the path instead of the actual delay time. To find the routing solution that minimizes path interference, a sufficient condition on conflict-free transmission is established, which helps to quantify the interference on a link. A linear program based on the sufficient condition is developed to compute the routing solution. Through simulation, we show that the proposed routing scheme can effectively reduce end-to-end delay.
UR - http://www.scopus.com/inward/record.url?scp=80052233020&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052233020&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-23490-3_13
DO - 10.1007/978-3-642-23490-3_13
M3 - Conference contribution
AN - SCOPUS:80052233020
SN - 9783642234897
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 146
EP - 156
BT - Wireless Algorithms, Systems, and Applications - 6th International Conference, WASA 2011, Proceedings
T2 - 6th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2011
Y2 - 11 August 2011 through 13 August 2011
ER -