Abstract
In this chapter, we focus on stabilizing interference-free slot assignment to WMN nodes. These slot assignments allow each node to transmit its data while ensuring that it does not interfere with other nodes. We proceed as follows: First, we focus on infrastructure-only part where we only consider static infrastructure nodes. We present three algorithms in this category. The first two are based on communication topology and address centralized or distributed slot assignment. The third focuses on slot assignment where infrastructure nodes are deployed with some geometric distribution to cover the desired area. Subsequently, we extend this protocol for the case where there are mobile client nodes that are in the vicinity of the infrastructure nodes. And, finally, we present an algorithm for the case where a client node is only in the vicinity of other client nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F. Wang, X. Wang, W. 2005.Wireless mesh networks: A survey, Computer Networks, 47, 445–487,
A. Arora, Efficient reconfiguration of trees: A case study in the methodical design of nonmasking fault-tolerance, Proceedings of the Third International Symposium on Formal Techniques in Real Time and Fault-Tolerance, 110–127, 1994.
S. Bagchi and P. Das, A round-2 randomized leader election algorithm and latency for MDVM system, NWESP '05: Proceedings of the International Conference on Next Generation Web Services Practices, p. 103, 2005.
S. Dulman, P. Havinga, and J. Hurink, Wave leader election protocol for wireless sensor networks, International Symposium on Mobile Multimedia Systems and Applications (2003).
F. Gartner, A survey of self-stabilizing spanning tree construction algorithms, Swiss Federal Institute of Technology (EPFL) (2003).
N. Malpani, J. Welch, and N. Vaidya, Leader Election Algorithms for Mobile Ad Hoc Networks, Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (2000).
Chakrabarti G. Kulkarni, S.S. 2006.Load balancing and resource reservation in mobile ad-hoc networks, Ad Hoc Networks, 4(2), 186–203,
D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, Mobile Computing, vol. 353, 153–181, Kluwer, Dordrecht, (1996).
M.R. Pearlman, Z.J. Haas, P. Sholander, and S.S. Tabrizi, On the impact of alternate path routing for load balancing in mobile ad hoc networks, Proceeding of 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing, Mobihoc 2000, Boston, MA, USA, 3–10 August (2000).
Dijkstra, E.W. (1974).Self-stabilizing systems in spite of distributed control, Communications of the ACM, 17(11), 643–644,
S. Dolev, Self-Stabilization, MIT, Cambridge, MA, (2000).
E.L. Lloyd and S. Ramanathan, On the complexity of distance-2 coloring, Proceedings of the International Conference on Computing and Information, (1992).
Arumugam M. Kulkarni, S.S. 2006.Self-stabilizing deterministic time division multiple access for sensor networks, AIAA Journal of Aerospace Computing, Information, and Communication (JACIC), 3, 403–419,
Datta, A.K. Johnen, C. Petit, F. Villain, V. (2000).Self- stabilizing depth-first token circulation in arbitrary rooted networks, Distributed Computing, 13, 207–218,
C. Johnen, G. Alari, J. Beauquier, and A.K. Datta, Self- stabilizing depth-first token passing on rooted networks, Proceedings of the Workshop on Distributed Algorithms, (1997).
F. Petit, Fast self-stabilizing depth-first token circulation, Proceedings of the Workshop on Self-Stabilizing Systems, Springer, vol. LNCS:2194, 200–215, (2001).
F. Petit and V. Villain, Color optimal self-stabilizing depth-first token circulation, Proceedings of the Symposium on Parallel Architectures, Algorithms, and Networks, (1997).
Tanenbaum, A.S. (2003).Computer Networks Prentice Hall, Upper Saddle River, NJ,
Kulkarni S.S. Arumugam, M. (2006).SS-TDMA: A self- stabilizing MAC for sensor networks, Sensor Network Operations, Wiley-IEEE, New York, NY,
S.S. Kulkarni and U. Arumugam, Collision-free communication in sensor networks, Proceedings of the Sixth Symposium on Self-Stabilizing Systems (SSS), June (2003).
A.D. Amis and R. Prakash, Load-balancing clusters in wireless ad hoc networks,” ASSET, 2000.
S. Basagni, Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks, Proceedings of Vehicular Technology Conference, 1999.
J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, Discrete mobile centers, Proceedings of 17th ACM Symposium on Computational Geometry, (2001).
McDonald A.B. Znati, T. (1999).A mobility based framework for adaptive clustering in wireless ad-hoc networks, IEEE Journal on Selected Areas in Communications, 17(8), 1466–1487,
Demirbas, M. Arora, A. Mittal, V. Kulathumani, V. (2006).A fault-local self -stabilizing clustering service for wireless ad hoc networks, IEEE Transactions on Parallel and Distributed Systems, 17(9), 912–922,
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Arumugam, M., Jhumka, A., Abujarad, F., Kulkarni, S.S. (2009). Stabilizing Interference-Free Slot Assignment for Wireless Mesh Networks. In: Misra, S., Misra, S.C., Woungang, I. (eds) Guide to Wireless Mesh Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84800-909-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-84800-909-7_4
Publisher Name: Springer, London
Print ISBN: 978-1-84800-908-0
Online ISBN: 978-1-84800-909-7
eBook Packages: Computer ScienceComputer Science (R0)