Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Approximation algorithms
Smart Antennas for Wireless CDMA
Smart Antennas for Wireless CDMA
Transmission scheduling in ad hoc networks with directional antennas
Proceedings of the 8th annual international conference on Mobile computing and networking
On the capacity improvement of ad hoc wireless networks using directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Design and evaluation of a new MAC protocol for long-distance 802.11 mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Experiences in deploying a wireless mesh network testbed for traffic control
ACM SIGCOMM Computer Communication Review
MiniMesh: an opportunistic transmission protocol for the IEEE 802.15.3 MAC
ACM SIGMOBILE Mobile Computing and Communications Review
DIRC: increasing indoor wireless capacity using directional antennas
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Recently, in an effort to increase the capacity of Wireless Mesh Networks (WMNs), researchers have begun equipping routers with multiple interfaces/radios, and connecting each one to a directional or smart antenna. A key feature of these routers is their ability to transmit or receive from multiple neighbors simultaneously. Hence, they have orders of magnitude higher capacity than their omni-directional counterparts. This significant capacity increase, however, is predicated upon a link scheduling algorithm that maximizes the number of active links at any given point in time. This paper proposes a number of link activation algorithms that derive maximal bipartite graphs from general topologies. These algorithms provide different trade-offs in terms of computation time and optimality. A key highlight is a greedy algorithm that has a time complexity of O(|V|^2), where V is the set of routers. Apart from that, we outline two algorithms that use an approximation to the well known maximum cut problem, and also a brute force algorithm, which is capable of deriving an optimal link activation schedule. The output from our algorithms can then be used by a spatial Time Division Multiple Access (TDMA) Medium Access Control (MAC) protocol to schedule concurrent transmitting and receiving links. We have verified our algorithms on various topologies with increasing node degrees as well as node numbers. From extensive simulation studies, we find that our algorithms have good performance in terms of number of links activated, superframe length, and end-to-end packet delay.