Introduction to algorithms
A MAC protocol for full exploitation of directional antennas in ad-hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
A unified MAC layer framework for ad-hoc networks with smart antennas
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Deafness: A MAC Problem in Ad Hoc Networks when using Directional Antennas
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Medium Access Control in Ad Hoc Networks with MIMO Links: Optimization Considerations and Algorithms
IEEE Transactions on Mobile Computing
Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks
WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
Algorithmic aspects of communication in ad-hoc networks with smart antennas
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
On exploiting diversity and spatial reuse in relay-enabled wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 14th ACM international conference on Mobile computing and networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Cross-layer optimization for wireless mesh networks with smart antennas
Computer Communications
Hi-index | 0.00 |
A smart adaptive antenna has multiple Degrees of Freedom (DOFs), which can be used for intended communications and interference suppression. In this paper, we study routing and scheduling in wireless backhaul networks with smart antennas. In a wireless backhaul network, a spanning tree rooted at the gateway node is usually constructed for routing. We formally define the Interference aware Tree Construction Problem (ITCP) which offers full consideration for interference impact and DOF availability, and present an algorithm to optimally solve it in polynomial time. As for scheduling, we first present a polynomial-time, optimal algorithm for a special case in which the number of DOFs in each node is large enough to suppress all potential secondary interference. An effective heuristic algorithm is then presented for the scheduling problem in the general case. Extensive simulation results have been presented to justify the efficiency of the proposed algorithms.