๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Location safety protection in ad hoc networks

โœ Scribed by Toby Xu; Ying Cai


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
466 KB
Volume
7
Category
Article
ISSN
1570-8705

No coin nor oath required. For personal study only.

โœฆ Synopsis


Many routing protocols and applications developed for ad hoc networks rely on location information of participating nodes. The exposure of such information, however, presents significant safety threats to the networks. In this paper, we investigate the problem of preventing an adversary from locating (and thus destroying) nodes based on their location information they disclose in communications. Our idea is to reduce location resolution to achieve a desired level of safety protection. We define the safety level of a geographic region to be the ratio of its area and the number of nodes inside it. The higher safety level a region has, the less attractive for an adversary to search over it for the nodes. When a node has to disclose its location, it can compute a cloaking box that meets a desired level of safety requirement and report that as its current location information. To implement this simple idea, there are several challenges. First, each cloaking box must be as small as possible in order to minimize the impact of reduced location resolution on the efficiency of network operating and applications. Second, nodes must be able to compute their cloaking boxes without having to reveal their accurate position. Finally, given a sequence of cloaking boxes, they must not be correlated to refine an area whose safety level is less than the requirement. Our research addresses these challenges with cost-effective solutions in the context of both stationary and mobile ad hoc networks. We evaluate the performance of our techniques through both mathematical analysis and simulation. In addition, we present a new geographic routing protocol which can work with blurred location information and evaluate the impact of location resolution reduction on the performance of this technique.


๐Ÿ“œ SIMILAR VOLUMES


Advances in Ad Hoc Networks (I)
โœ Jun Zheng; Shiwen Mao; Scott F. Midkiff; Tommaso Melodia ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

Ad hoc networks, which include a variety of autonomous networks for specific purposes, promise to enable a broad range of civilian, commercial, and military applications. These networks were originally envisioned as collections of autonomous mobile or stationary nodes that dynamically auto-configure

Preemptive routing in ad hoc networks
โœ Tom Goff; Nael Abu-Ghazaleh; Dhananjay Phatak; Ridvan Kahvecioglu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 458 KB

Routing in ad hoc networks is a challenging problem because nodes are mobile and links are continuously being created and broken. Existing on-demand ad hoc routing algorithms initiate route discovery only after a path breaks, incurring a significant cost in detecting the disconnection and establishi

Flooding in wireless ad hoc networks
โœ H Lim; C Kim ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 265 KB

In an ad hoc network, each host assumes the role of a router and relays packets toward ยฎnal destinations. This paper studies efยฎcient routing mechanisms for packet ยฏooding in ad hoc wireless networks. Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network