By Topic

Localization for Intermittently Connected Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wing Ho Yuen ; Dept. of Comput. Sci., Columbia Univ., New York, NY ; Schulzrinne, Henning

We consider localization for intermittently connected networks. Traditional localization approaches rely on network infrastructure such as access points (AP) as reference nodes or anchors, and do not work well when infrastructure is sparse. We propose a new class of localization scheme, where mobile nodes act as anchors for each other. Each node maintains an anchor table, storing its encounter history with APs and mobile nodes. When two nodes meet, they share their encounter history with each other, and jointly estimate the current location to form a new anchor. This dramatically increases the number of anchors for a mobile node, and reduces the localization error when position estimation is triggered by a user application. Both anchor formation and position estimation are formulated as a maximum likelihood (ML) estimation problem, by exploiting constraints of node location based on encounter history and mobility profile of nodes. Numerical examples are provided to illustrate properties of the ML estimator. We performed simulations and showed that localization error is independent of the anchor table size under a random walk mobility model. Thus, it suffices to store the most recent anchor, which simplifies implementation and is conducive to privacy. More importantly, localization error decreases as node density increases, and approaches the transmission range of mobile nodes when node density is sufficiently high

Published in:

Pervasive Computing and Communications Workshops, 2007. PerCom Workshops '07. Fifth Annual IEEE International Conference on

Date of Conference:

19-23 March 2007