Localization for Intermittently Connected Ad Hoc Networks

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

[1]  Andy Hopper,et al.  The active badge location system , 1992, TOIS.

[2]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[3]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[4]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[5]  Henning Schulzrinne,et al.  Seven degrees of separation in mobile ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[6]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[7]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  MartonosiMargaret,et al.  Energy-efficient computing for wildlife tracking , 2002 .

[9]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[10]  Roy D. Yates,et al.  Exploiting data diversity and multiuser diversity in noncooperative mobile infostation networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[12]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[13]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[15]  Wei Wang,et al.  Using mobile relays to prolong the lifetime of wireless sensor networks , 2005, MobiCom '05.

[16]  Henning Schulzrinne,et al.  WSN01-3: Improving Search Efficiency Using Bloom Filters in Partially Connected Ad Hoc Networks: A Location-Centric Analysis , 2006, IEEE Globecom 2006.

[17]  Henning Schulzrinne,et al.  Performance Evaluation of Time-Based and Hop-Based TTL Schemes in Partially Connected Ad Hoc Networks , 2006, 2006 IEEE International Conference on Communications.

[18]  Hongyi Wu,et al.  DFT-MSN: The Delay/Fault-Tolerant Mobile Sensor Network for Pervasive Information Gathering , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  H. Schulzrinne,et al.  IMPROVING SEARCH EFFICIENCY USING BLOOM FILTER IN PARTIALLY CONNECTED AD HOC NETWORKS , 2006 .