Asymptotically optimal geometric mobile ad-hoc routing

Kühn, Fabian; Wattenhofer, Rogert; Zollinger, Aaron

doi:10.1145/570810.570814

Cited by 209 publications

(79 citation statements)

References 23 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The underlying assumption of this model is that the nodes are placed in the plane, all of them having the same transmission range-normalized to a radius of one unit of length. In the unit disk graph model a considerable number of theoretical results have been found with respect to aspects of wireless ad hoc and sensor networks as diverse as topology control [11,20,70,72,73], the construction of dominating sets [2,22,23,26,28,37,43,71], network initialization [40,55,56] and deployment [54], geographic routing [44,45,47], or positioning [60]. A more general model is provided by disk graphs.…”

Section: Related Workmentioning

confidence: 99%

“…An important issue of such precomputation is the reduction of interference effects, message complexity, or energy consumption. Sometimes, algorithms need network graphs with special properties; for example all face-routing based geographic routing algorithms [10,30,35,44,45,47] need a planar graph to operate correctly. For unit disk graphs, a number of different ideas in order to reduce the complexity of the network topology have been proposed.…”

Section: Related Workmentioning

confidence: 99%

“…A more detailed overview of geographic routing can be found in [69]. The first geographic routing algorithm whose cost is bounded by a function of the cost c of an optimal path is Adaptive Face Routing (AFR) as introduced in [45]. It was also shown that this is the worst-case optimal result any geographic routing algorithm can achieve.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Ad hoc networks beyond unit disk graphs

2007

Self Cite

View full text Add to dashboard Cite

In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks while at the same time being concise enough to promote strong theoretical results. The quasi unit disk graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1. We show that-in comparison to the cost known for unit disk graphs-the complexity results of geographic routing in this model contain the additional factor 1/d 2 . We prove that in quasi unit disk graphs flooding is an asymptotically message-optimal routing technique, we provide a geographic routing algorithm being most efficient in dense networks, and we show that classic geographic routing is possible with the same asymptotic performance guarantees as for unit disk graphs if d ! 1=ffiffi ffi 2 p .

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Ad hoc networks beyond unit disk graphs

2007

Self Cite

View full text Add to dashboard Cite

show abstract

“…To guarantee delivery, Face Routing [20] was proposed which walks along faces of planar graphs and proceeds along the line connecting the source and the destination. To reduce the cost of finding optimal route, Adaptive Face Routing (AFR) [21] basically enhancing Face Routing using an ellipse restricting the searchable area. For practical purposes, the GOAFR algorithm [22] was introduced that combines greedy and face routing.…”

Section: Related Work and Design Challengementioning

confidence: 99%

Enhancing robustness of vehicular networks using virtual frameworks

Chen

2014

Telecommun Syst

View full text Add to dashboard Cite

Vehicular ad-hoc network (VANET) is one of the most transforming technologies for Intelligent Transportation Systems today. In particular, wireless mesh network is widely used for VANETs due to its scalability, flexibility, and low maintenance cost. When a mesh node in such a network fails, one can simply replace it with a new mesh node, and the network automatically reconfigures itself. However, due to the environment or limited resources, it may not be feasible to replace a failed node immediately. We have witnessed over the last few years many disasters in the globe. One thing that all of those natural disasters have in common, besides the tremendous loss of life, is that they are immediately followed by an almost total loss of the ability to communicate with outside world. In the recent event of natural disaster in Japan, the communication network was still not fully recovery after weeks of the disaster. However, communication is the key to post-disaster survival. Therefore, it is important to have an alternate communication during time of disaster. In this paper, we introduce two techniques, virtual router approach and virtual link approach, for designing failure-resilient VANET's that can retain almost their original coverage and capacity until the failed mesh nodes can be repaired or replaced, i.e., we are able to retain 80 % of original capacity with only 50 % working mesh nodes. We give simulation results, validated by analytical analysis, to show that this desirable property can be achieved, using virtual routers and/or virtual links, with minimal overhead. These virtual frameworks also balance the workload among the mesh nodes even when the mesh clients are not uniformly distributed over the application terrain. This characteristic helps improve the overall end-to-end delay and communication throughput of the network.

show abstract

“…The unit disk graph model has been used to represent ad hoc networks with identical devices being deployed in order to derive insightful theoretical results in diverse research topics, such as security[9,14], network connectivity[3,15], routing[16,23,24], and topology control[48].…”

mentioning

confidence: 99%

A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks

2006

View full text Add to dashboard Cite

Wireless ad hoc networks are envisioned to be randomly deployed in versatile and potentially hostile environments. Hence, providing secure and uninterrupted communication between the un-tethered network nodes becomes a critical problem. In this paper, we investigate the wormhole attack in wireless ad hoc networks, an attack that can disrupt vital network functions such as routing. In the wormhole attack, the adversary establishes a low-latency unidirectional or bi-directional link, such as a wired or long-range wireless link, between two points in the network that are not within communication range of each other. The attacker then records one or more messages at one end of the link, tunnels them via the link to the other end, and replays them into the network in a timely manner. The wormhole attack is easily implemented and particularly challenging to detect, since it does not require breach of the authenticity and confidentiality of communication, or the compromise of any host. We present a graph theoretic framework for modeling wormhole links and derive the necessary and sufficient conditions for detecting and defending against wormhole attacks. Based on our framework, we show that any candidate solution preventing wormholes should construct a communication graph that is a subgraph of the geometric graph defined by the radio range of the network nodes. Making use of our framework, we propose a cryptographic mechanism based on local broadcast keys in order to prevent wormholes. Our solution does not need time synchronization or time measurement, requires only a small fraction of the nodes to know their location, and is decentralized. Hence, it is suitable for networks with the most stringent constraints such as sensor networks. Fi-R. Poovendran ( )· L. Lazos

show abstract

Asymptotically optimal geometric mobile ad-hoc routing

Cited by 209 publications

References 23 publications

Ad hoc networks beyond unit disk graphs

Ad hoc networks beyond unit disk graphs

Enhancing robustness of vehicular networks using virtual frameworks

A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks

Contact Info

Product

Resources

About