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

Authors:
Bechir Hamdaoui;Parameswaran Ramanathan
Affiliations:
University of Wisconsin, Madison, Wisconsin;University of Wisconsin, Madison, Wisconsin
Venue:
ACM SIGMOBILE Mobile Computing and Communications Review - Special Issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks.: The Digital Library version of this issue has a corrected special issue title compared to the one in the print version of the issue.
Year:
2005

Citing 7
Cited 1

Wireless integrated network sensors

Communications of the ACM
Qos in mobile a hoc networks

IEEE Wireless Communications
Quality-of-service in ad hoc carrier sense multiple access wireless networks

IEEE Journal on Selected Areas in Communications
QoS routing in ad hoc wireless networks

IEEE Journal on Selected Areas in Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm

IEEE Journal on Selected Areas in Communications
Distributed quality-of-service routing in ad hoc networks

IEEE Journal on Selected Areas in Communications
Admission control in time-slotted multihop mobile networks

IEEE Journal on Selected Areas in Communications

Quasi-decentralized control of process systems using wireless sensor networks with scheduled sensor transmissions

ACC'09 Proceedings of the 2009 conference on American Control Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.