PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On constructing minimum spanning trees in k-dimensional spaces and related problems
On constructing minimum spanning trees in k-dimensional spaces and related problems
Hot topic: physical-layer network coding
Proceedings of the 12th annual international conference on Mobile computing and networking
Retransmission and backoff strategies for wireless broadcasting
Ad Hoc Networks
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mesh networks: commodity multihop ad hoc networks
IEEE Communications Magazine
Ad hoc networking with directional antennas: a complete system solution
IEEE Journal on Selected Areas in Communications
On channel-discontinuity-constraint routing in wireless networks
Ad Hoc Networks
| Hi-index | 0.00 |
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to improve spatial throughput. In such networks, given a source and destination, it is of interest to compute an optimal path and channel assignment on every link in the path such that the path bandwidth is the same as that of the link bandwidth and such a path satisfies the constraint that no two consecutive links on the path are assigned the same channel, referred to as "Channel Discontinuity Constraint" (CDC). CDC-paths are also quite useful for TDMA system, where preferably every consecutive links along a path are assigned different time slots. This paper contains several contributions. We first present an O(N2) distributed algorithm for discovering the shortest CDC-path between given source and destination. For use in wireless networks, we explain how spatial properties can be used for dramatically expedite the algorithm. This improves the running time of the O(N3) centralized algorithm of Ahuja et al. for finding the minimum-weight CDC-path. Our second result is a generalized t-spanner for CDC-path; For any θ 0 we show how to construct a sub-network containing only O(N/θ) edges, such that that length of shortest CDC-paths between arbitrary sources and destinations increases by only a factor of at most (1-2 sin θ/2)-2. This scheme can be implemented in a distributed manner using the ideas of [3] with a message complexity of O(n log n) and it is highly dynamic, so addition/deletion of nodes are easily handled in a distributed manner. An important conclusion of this scheme is in the case of directional antennas are used. In this case, it is enough to consider only the two closest nodes in each cone.