Minimum Delay Routing in Multihop Wireless Networks
Abstract
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. © 2011 Springer-Verlag.
Recommended Citation
M. X. Cheng et al., "Minimum Delay Routing in Multihop Wireless Networks," Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6843 LNCS, pp. 146 - 156, Springer, Sep 2011.
The definitive version is available at https://doi.org/10.1007/978-3-642-23490-3_13
Department(s)
Computer Science
International Standard Book Number (ISBN)
978-364223489-7
International Standard Serial Number (ISSN)
1611-3349; 0302-9743
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Springer, All rights reserved.
Publication Date
05 Sep 2011
Comments
National Science Foundation, Grant CNS-0831831