View Item 

A novel spatial TDMA scheduler for concurrent transmit/receive wireless mesh networks

Access Status
Open access
Authors
Chin, Kwan-wu
Soh, Sieteng
Meng, C.
Date
2010
Type
Conference Paper

Metadata
Show full item record
Citation
Chin, K. and Soh, Sieteng and Meng, C. 2010. A novel spatial TDMA scheduler for concurrent transmit/receive wireless mesh networks, in Rahayu, W., Xhafa, F. & Denko, M. (ed), AINA 2010 24th IEEE International conference on Advanced information networking and applications, Apr 20 2010, pp. 481-488. Perth, Western Australia: IEEE Computer Society.
Source Title
Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
Source Conference
AINA 2010 24th IEEE International conference on Advanced information networking and applications
ISBN
Faculty
School of Science and Computing
Department of Computing
Faculty of Science and Engineering
Remarks

Copyright © 2010 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI
Collection
Abstract

The success of wireless mesh networks hinges on their ability to support bandwidth intensive, multi-media applications. A key approach to increasing network capacity is to equip wireless routers with smart antennas. These routers, therefore, are capable of focusing their transmission on specific neighbours whilst causing little interference to other nodes. This, however, assumes there is a link scheduling algorithm that activates links in a way that maximizes network capacity. To this end, we propose a novel link activation algorithm that maximally creates a bipartite graph, which is then used to derive the link activation schedule of each router. We have verified the proposed algorithm on various topologies with increasing node degrees as well as node numbers. From extensive simulation studies, we find that our algorithm outperforms existing algorithms in terms of the number of links activated per slot, superframe length, computation time, route length and end-to-end delay.