Variable Weight Sequences for Adaptive Scheduled Access in MANETs
Scheduling access to a shared channel in mobile ad hoc networks must address numerous competing requirements, for example on throughput, delay, and fairness. It must address disparate and dynamic traffic demands as well as losses due to collisions with neighbouring transmitters. It must address changes in the topology of the network that arise from mobility. Topology transparent scheduling schemes have been proposed as a means to support reasonable delay guarantees, minimum throughput guarantees, and to a lesser extent fairness concerns. Sequences based on codes and combinatorial designs have been explored that support topology transparent scheduling for mobile ad hoc networks. However, all of the schemes proposed provide every node with the same (or essentially the same) channel access, by assigning each node a transmission frame in which the number of transmission slots (‘weight’) is the same. In order to mitigate effects of losses due to collision, it is important to limit the set of frame schedules that are permitted; but at the same time, using frames with differing weights can improve throughput without sacrificing fairness. Combinatorial requirements for variable weight frame schedules are determined based on these observations.
Keywordsmedium access control topology-transparent scheduling variable weight sequences adaptation mobile ad hoc networks
Unable to display preview. Download preview PDF.
- 1.Awduche, D.O., Ganz, A.: MAC protocol for wireless networks in tactical environments. In: Proc. Military Communications Conference 1996 (MILCOM 1996), pp. 923–927 (1996)Google Scholar
- 7.Colbourn, C.J., Syrotiuk, V.R.: Scheduled persistence for medium access control in sensor networks. In: Proc. First IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2004), pp. 264–273 (2004)Google Scholar
- 9.Du, D.-Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications, 2nd edn. Series on Applied Mathematics, vol. 12. World Scientific (2000)Google Scholar
- 11.Füredi, Z., Ruszinkó, M.: Superimposed codes are almost big distance ones. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), p. 118 (1997)Google Scholar
- 15.Lutz, J., Colbourn, C.J., Syrotiuk, V.R.: Apples and oranges: Comparing schedule- and contention-based medium access control. In: Proceedings of the 13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2010), Bodrum, Turkey, pp. 319–326 (October 2010)Google Scholar
- 16.Lutz, J., Colbourn, C.J., Syrotiuk, V.R.: Topological persistences for medium access control (submitted, 2012)Google Scholar
- 17.Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier Inc. (2004)Google Scholar
- 25.Zheng, R., Hou, C.-J., Sha, L.: Asynchronous wakeup for ad hoc networks. In: Proceedings of the International Conference on Mobile Ad Hoc Networking and Computing (Mobihoc 2003), pp. 35–45 (2003)Google Scholar