Discrete Mathematics - Topics on domination
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
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
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Coverage and connectivity in three-dimensional networks
Proceedings of the 12th annual international conference on Mobile computing and networking
POSANT: A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
Ad Hoc Networking
Position-based routing in ad hoc networks
IEEE Communications Magazine
On ad hoc routing with guaranteed delivery
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Delivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Slab routing: adapting two-dimensional geographic routing to three-dimensions
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Pressure routing for underwater sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Symbiotic routing in future data centers
Proceedings of the ACM SIGCOMM 2010 conference
Energy-efficient restricted greedy routing for three dimensional random wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Greedy face routing with face identification support in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node υ's routing decision only depends on knowledge of the labels of the source and destination nodes, of the subgraph induced by nodes within distance k of υ, and of the neighbour of υ from which the message was received. We model a three-dimensional ad hoc network by a unit ball graph, where nodes are points in R3, and nodes u and υ are joined by an edge if and only if the distance between u and v is at most one. The question of whether there is a simple local routing algorithm that guarantees delivery in unit ball graphs has been open for some time. In this paper, we answer this question in the negative: we show that for any fixed k, there can be no k-local routing algorithm that guarantees delivery on all unit ball graphs. This result is in contrast with the two-dimensional case, where 1-local routing algorithms that guarantee delivery are known. Specifically, we show that guaranteed delivery is possible if the nodes of the unit ball graph are contained in a slab of thickness 1/√2. However, there is no k-local routing algorithm that guarantees delivery for the class of unit ball graphs contained in thicker slabs, i.e., slabs of thickness 1/√2+Ɛ for some Ɛ 0. The algorithm for routing in thin slabs derives from a transformation of unit ball graphs contained in thin slabs into quasi unit disc graphs, which yields a 2-local routing algorithm. We also show several results that further elaborate on the relationship between these two classes of graphs.