A beacon-less location discovery scheme for wireless sensor networks

Lei Fang, Wenliang Du, Peng Ning

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the information provided by these beacon nodes. In this paper, we show that efficient location discovery can be achieved in sensor networks without using beacons. We propose a beacon-less location discovery scheme. based on the following observations: in practice, it is quite common that sensors are deployed in groups, i.e., sensors are put into n groups, and sensors in the same group are deployed together at the same deployment point (the deployment point is different from the sensors' final resident location). Sensors from the same group can land in different locations, and those locations usually follow a probability distribution that can be known a priori. With this prior deployment knowledge, we show that sensors can discover their locations by observing the group memberships of its neighbors. We model the location discovery problem as a statistical estimation problem, and we use the Maximum Likelihood Estimation method to estimate the location. We have conducted experiments to evaluate our scheme.

Original languageEnglish (US)
Title of host publicationAdvances in Information Security
Pages33-55
Number of pages23
Volume30
StatePublished - 2007

Publication series

NameAdvances in Information Security
Volume30
ISSN (Print)15682633

Fingerprint

Wireless sensor networks
Sensors
Global positioning system
Maximum likelihood estimation
Sensor nodes
Probability distributions
Sensor networks

Keywords

  • System Design

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Fang, L., Du, W., & Ning, P. (2007). A beacon-less location discovery scheme for wireless sensor networks. In Advances in Information Security (Vol. 30, pp. 33-55). (Advances in Information Security; Vol. 30).

A beacon-less location discovery scheme for wireless sensor networks. / Fang, Lei; Du, Wenliang; Ning, Peng.

Advances in Information Security. Vol. 30 2007. p. 33-55 (Advances in Information Security; Vol. 30).

Research output: Chapter in Book/Report/Conference proceedingChapter

Fang, L, Du, W & Ning, P 2007, A beacon-less location discovery scheme for wireless sensor networks. in Advances in Information Security. vol. 30, Advances in Information Security, vol. 30, pp. 33-55.
Fang L, Du W, Ning P. A beacon-less location discovery scheme for wireless sensor networks. In Advances in Information Security. Vol. 30. 2007. p. 33-55. (Advances in Information Security).
Fang, Lei ; Du, Wenliang ; Ning, Peng. / A beacon-less location discovery scheme for wireless sensor networks. Advances in Information Security. Vol. 30 2007. pp. 33-55 (Advances in Information Security).
@inbook{0a75d28e123e43d6b482003fd3fe7c77,
title = "A beacon-less location discovery scheme for wireless sensor networks",
abstract = "In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the information provided by these beacon nodes. In this paper, we show that efficient location discovery can be achieved in sensor networks without using beacons. We propose a beacon-less location discovery scheme. based on the following observations: in practice, it is quite common that sensors are deployed in groups, i.e., sensors are put into n groups, and sensors in the same group are deployed together at the same deployment point (the deployment point is different from the sensors' final resident location). Sensors from the same group can land in different locations, and those locations usually follow a probability distribution that can be known a priori. With this prior deployment knowledge, we show that sensors can discover their locations by observing the group memberships of its neighbors. We model the location discovery problem as a statistical estimation problem, and we use the Maximum Likelihood Estimation method to estimate the location. We have conducted experiments to evaluate our scheme.",
keywords = "System Design",
author = "Lei Fang and Wenliang Du and Peng Ning",
year = "2007",
language = "English (US)",
isbn = "9780387327211",
volume = "30",
series = "Advances in Information Security",
pages = "33--55",
booktitle = "Advances in Information Security",

}

TY - CHAP

T1 - A beacon-less location discovery scheme for wireless sensor networks

AU - Fang, Lei

AU - Du, Wenliang

AU - Ning, Peng

PY - 2007

Y1 - 2007

N2 - In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the information provided by these beacon nodes. In this paper, we show that efficient location discovery can be achieved in sensor networks without using beacons. We propose a beacon-less location discovery scheme. based on the following observations: in practice, it is quite common that sensors are deployed in groups, i.e., sensors are put into n groups, and sensors in the same group are deployed together at the same deployment point (the deployment point is different from the sensors' final resident location). Sensors from the same group can land in different locations, and those locations usually follow a probability distribution that can be known a priori. With this prior deployment knowledge, we show that sensors can discover their locations by observing the group memberships of its neighbors. We model the location discovery problem as a statistical estimation problem, and we use the Maximum Likelihood Estimation method to estimate the location. We have conducted experiments to evaluate our scheme.

AB - In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the information provided by these beacon nodes. In this paper, we show that efficient location discovery can be achieved in sensor networks without using beacons. We propose a beacon-less location discovery scheme. based on the following observations: in practice, it is quite common that sensors are deployed in groups, i.e., sensors are put into n groups, and sensors in the same group are deployed together at the same deployment point (the deployment point is different from the sensors' final resident location). Sensors from the same group can land in different locations, and those locations usually follow a probability distribution that can be known a priori. With this prior deployment knowledge, we show that sensors can discover their locations by observing the group memberships of its neighbors. We model the location discovery problem as a statistical estimation problem, and we use the Maximum Likelihood Estimation method to estimate the location. We have conducted experiments to evaluate our scheme.

KW - System Design

UR - http://www.scopus.com/inward/record.url?scp=84882669183&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84882669183&partnerID=8YFLogxK

M3 - Chapter

SN - 9780387327211

VL - 30

T3 - Advances in Information Security

SP - 33

EP - 55

BT - Advances in Information Security

ER -