NDLI: Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks

Please wait, while we are loading the content...

ACM Transactions on Sensor Networks (TOSN) : Volume 13

ACM Transactions on Sensor Networks (TOSN) : Volume 12

ACM Transactions on Sensor Networks (TOSN) : Volume 11

ACM Transactions on Sensor Networks (TOSN) : Volume 10

ACM Transactions on Sensor Networks (TOSN) : Volume 9

ACM Transactions on Sensor Networks (TOSN) : Volume 8

Issue 4, September 2012

PIP: A multichannel, TDMA-based MAC for efficient and scalable bulk transfer in sensor networks

WILDSENSING: Design and deployment of a sustainable sensor network for wildlife monitoring

A-MAC: A versatile and efficient receiver-initiated link layer for low-power wireless

AutoWitness: Locating and tracking stolen property while tolerating GPS and radio outages

Achieving long-term operation with a capacitor-driven energy storage and sharing network

In-situ soil moisture sensing: Optimal sensor placement and field estimation

Radio link quality estimation in wireless sensor networks: A survey

Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks

A novel framework for energy-efficient data gathering with random coverage in wireless sensor networks

Issue 3, July 2012

Issue 2, March 2012

Issue 1, August 2011

ACM Transactions on Sensor Networks (TOSN) : Volume 7

ACM Transactions on Sensor Networks (TOSN) : Volume 6

ACM Transactions on Sensor Networks (TOSN) : Volume 5

ACM Transactions on Sensor Networks (TOSN) : Volume 4

ACM Transactions on Sensor Networks (TOSN) : Volume 3

ACM Transactions on Sensor Networks (TOSN) : Volume 2

ACM Transactions on Sensor Networks (TOSN) : Volume 1

Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks

Content Provider	ACM Digital Library
Author	Nath, Swaprava Kumar, Anurag Ekambaram, Venkatesan N. Kumar, P. Vijay
Copyright Year	2012
Abstract	Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being $\textit{self-localization}.$ Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as $\textit{anchors}$ with known locations. First, we obtain high probability bounds on the Euclidean distances of $\textit{all}$ nodes that are $\textit{h}$ hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance $\textit{h}.$ This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.
Starting Page	1
Ending Page	38
Page Count	38
File Format	PDF
ISSN	15504859
e-ISSN	15504867
DOI	10.1145/2240116.2240124
Volume Number	8
Issue Number	4
Journal	ACM Transactions on Sensor Networks (TOSN)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-09-25
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Random geometric graph Belief propagation Localization
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Theory And Algorithms For Hop-Count-Based Localization With Random Geometric Graph Models Of Dense Sensor Networks

Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks (2012)

Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks (2012)

Analysis of Hop-Count-Based Source-to-Destination Distance Estimation in Wireless Sensor Networks With Applications in Localization

Nonparametric belief propagation for self-localization of sensor networks

Range-free wireless sensor networks localization based on hop-count quantization

Hop-count based localization algorithm for wireless sensor networks

Connectivity-based localization of large-scale sensor networks with complex shape

A hop-count based positioning algorithm for wireless ad-hoc networks

Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks

Similar Documents

Theory And Algorithms For Hop-Count-Based Localization With Random Geometric Graph Models Of Dense Sensor Networks

Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks (2012)

Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks (2012)

Analysis of Hop-Count-Based Source-to-Destination Distance Estimation in Wireless Sensor Networks With Applications in Localization

Nonparametric belief propagation for self-localization of sensor networks

Range-free wireless sensor networks localization based on hop-count quantization

Hop-count based localization algorithm for wireless sensor networks

Connectivity-based localization of large-scale sensor networks with complex shape

A hop-count based positioning algorithm for wireless ad-hoc networks

Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks