Sufficient conditions for flow admission control in wireless ad-hoc networks

Wireless nodes within the same vicinity contend with each other for accessing the shared wireless medium. The contention constraints for sharing the medium depend on the medium access control (MAC) protocol that administers the accessibility of the network. In a previous work, we derived a set of sufficient conditions under which rates of all the flows are feasible given a MAC protocol. In this paper, we derive a new set of sufficient conditions that are better than those developed earlier. We show that these conditions are useful in solving many problems such as linear programming-based routing and admission control for QoS routing. We also evaluate, compare and discuss the performance of the derived sufficient conditions through simulation studies.

[1]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[2]  Marco Ajmone Marsan,et al.  Optimizing the topology of Bluetooth wireless personal area networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Parameswaran Ramanathan,et al.  Rate feasibility under medium access contention constraints , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[6]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Jain-Shing Liu,et al.  QoS routing in ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

[8]  Chun-Hung Richard Lin,et al.  Admission control in time-slotted multihop mobile networks , 2001, IEEE J. Sel. Areas Commun..

[9]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Jian Li,et al.  Qos in mobile a hoc networks , 2003, IEEE Wireless Communications.

[11]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[12]  Leonidas Georgiadis,et al.  Efficient QoS routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  A. S. Krishnakumar,et al.  Quality-of-service in ad hoc carrier sense multiple access wireless networks , 1999, IEEE J. Sel. Areas Commun..

[14]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .

[15]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[16]  Chenxi Zhu,et al.  QoS routing for mobile ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.