Rate feasibility under medium access contention constraints

Wireless nodes within the same vicinity contend for accessing the shared medium. The contention constraints on sharing the medium depend on the medium access control (MAC) protocol. For example, in IEEE 802.11 MAC protocol-based networks, if node i is in communication with node j, then all nodes within the same transmission range of i or j cannot communicate. On the other hand, if nodes within each other's transmission range can use different frequencies (e.g., FDMA) or different codes (e.g., CDMA), then neighbor nodes can communicate simultaneously. Furthermore, if nodes are equipped with two radios (e.g., WINS sensor networks), then nodes not only can communicate concurrently but also can receive while they are transmitting. In this paper, we prove a sufficient condition under which a flow rate vector is feasible given the MAC protocol. We also prove that the sufficient condition is necessary for some MAC protocols such as those used by WINS sensor and Bluetooth [Marsan, M., 2002] networks. We give illustrative and real examples for which these conditions apply.

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

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

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

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

[5]  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.

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

[7]  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).

[8]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .