TY - GEN
T1 - Statistical QoS provisioning in mobile ad hoc networks
AU - Dong, Xihua
AU - Wu, Dapeng
AU - Liu, Yu
AU - Zhou, Chi
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2010
Y1 - 2010
N2 - In this work, we establish a general framework for investigating statistical QoS provisioning in mobile ad hoc networks. Though the throughput and average delay in wireless ad hoc works have been has been intensively studied in the literature, statistical delay guarantee provisioning in large scale ad hoc networks has not received enough attention. A realtime application, e.g., interactive game and realtime video, requires stringent delay (delay bound) but may allow a small probability of outage (deadline violation probability). This motivates us to study the relationship among throughput, delay bound and deadline violation probability.We propose to use a triplet (T,B,R), where T,B,R denote throughput, delay bound and deadline violation probability (or, equivalently, the reliability index) respectively, to describe the delay constrained performance of a mobile ad hoc network. Both i.i.d. mobility model and random walk model are adopted to illustrate the tradeoffs among these performance metrics. Since the relation between delay bound and deadline violation probability can be interpreted as a description of the reliability of delay-sensitive communications, our results provide insights into understanding the delay constrained performance of large scale wireless ad hoc networks. © 2010 IEEE.
AB - In this work, we establish a general framework for investigating statistical QoS provisioning in mobile ad hoc networks. Though the throughput and average delay in wireless ad hoc works have been has been intensively studied in the literature, statistical delay guarantee provisioning in large scale ad hoc networks has not received enough attention. A realtime application, e.g., interactive game and realtime video, requires stringent delay (delay bound) but may allow a small probability of outage (deadline violation probability). This motivates us to study the relationship among throughput, delay bound and deadline violation probability.We propose to use a triplet (T,B,R), where T,B,R denote throughput, delay bound and deadline violation probability (or, equivalently, the reliability index) respectively, to describe the delay constrained performance of a mobile ad hoc network. Both i.i.d. mobility model and random walk model are adopted to illustrate the tradeoffs among these performance metrics. Since the relation between delay bound and deadline violation probability can be interpreted as a description of the reliability of delay-sensitive communications, our results provide insights into understanding the delay constrained performance of large scale wireless ad hoc networks. © 2010 IEEE.
KW - Ad hoc networks
KW - Capacity
KW - Deadline violation probability
KW - Delay
KW - Reliability
KW - Scaling law
UR - http://www.scopus.com/inward/record.url?scp=79952572157&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-79952572157&origin=recordpage
U2 - 10.1109/MSN.2010.26
DO - 10.1109/MSN.2010.26
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9780769543154
T3 - Proceedings - 2010 6th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2010
SP - 128
EP - 133
BT - Proceedings - 2010 6th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2010
T2 - 2010 6th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2010
Y2 - 20 December 2010 through 22 December 2010
ER -