A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Sparse communication networks and efficient routing in the plane (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the message from the source to the destination. In theory, models that have been used oversimplify the problem of route discovery in ad hoc networks. The achievement of this paper is threefold. First we use a more general model in which nodes can have different transmission and interference ranges and we present a new routing algorithm for wireless ad hoc networks that has several nice features. We then combine our algorithm with that of known greedy algorithms to arrive at an average case efficient routing algorithm in the situation that GPS information is available. Finally we show how to schedule unicast traffic between a set of source-destination pairs by providing a proper vertex coloring of the nodes in the wireless ad hoc network. Our coloring algorithm achieves a O(Δ)-coloring that is locally distinct within the 2-hop neighborhood of any node.