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
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
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
Channel Assignment on Strongly-Simplicial Graphs
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
On constructing minimum spanning trees in k-dimensional spaces and related problems
On constructing minimum spanning trees in k-dimensional spaces and related problems
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
Proceedings of the 9th annual international conference on Mobile computing and networking
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Generalized Edge Coloring for Channel Assignment in Wireless Networks
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Hot topic: physical-layer network coding
Proceedings of the 12th annual international conference on Mobile computing and networking
Geometric spanners with applications in wireless networks
Computational Geometry: Theory and Applications
Paths and trails in edge-colored graphs
Theoretical Computer Science
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
On channel-discontinuity-constraint routing in wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
IEEE Journal on Selected Areas in Communications
DMesh: Incorporating Practical Directional Antennas in Multichannel Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Multi-channel wireless networks are increasingly deployed as infrastructure networks, e.g. in metro areas. Network nodes frequently employ directional antennas to improve spatial throughput. In such networks, between two nodes, it is of interest to compute a path with a channel assignment for the links such that the path and link bandwidths are the same. This is achieved when any two consecutive links are assigned different channels, termed as ''Channel-Discontinuity-Constraint'' (CDC). CDC-paths are also useful in TDMA systems, where, preferably, consecutive links are assigned different time-slots. In the first part of this paper, we develop a t-spanner for CDC-paths using spatial properties; a sub-network containing O(n/@q) links, for any @q0, such that CDC-paths increase in cost by at most a factor t= (1-2 sin(@q/2))^-^2. We propose a novel distributed algorithm to compute the spanner using an expected number of O(nlogn) fixed-size messages. In the second part, we present a distributed algorithm to find minimum-cost CDC-paths between two nodes using O(n^2) fixed-size messages, by developing an extension of Edmonds' algorithm for minimum-cost perfect matching. In a centralized implementation, our algorithm runs in O(n^2) time improving the previous best algorithm which requires O(n^3) running time. Moreover, this running time improves to O(n/@q) when used in conjunction with the spanner developed.