- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Localization algorithms for wireless sensor networks
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Localization algorithms for wireless sensor networks Vivekanandan, Vijayanth
Abstract
Many applications in wireless sensor networks require sensor nodes to obtain their absolute or relative geographical positions. Due to the size, cost and energy restrictions imposed by sensor nodes, only a few nodes can be equipped with the Global Positioning System (GPS) capability and act as anchors for the rest of the network. The algorithms based on classical Multidimensional Scaling (MDS) [1][2] only require three or four anchor nodes and can provide higher accuracy than some other schemes. In the first part of this thesis, we propose and analyze the use of ordinal MDS for localization in wireless sensor networks. Ordinal MDS differs from classical MDS by that it only requires a monotonicity constraint between the shortest path distance and the Euclidean distance for each pair of nodes. Simulation studies are conducted under square and C-shaped topologies with different connectivity levels and number of anchors. Results show that ordinal MDS provides a lower position estimation error than classical MDS in both hop-based and range-based scenarios. In the second part of this thesis, we propose a concentric anchor-beacons (CAB) localization algorithm for wireless sensor networks. CAB is a range-free approach and uses a small number of anchor nodes. Each anchor emits several beacons at different power levels. From the information received by each beacon heard, nodes determine which annular ring they are located within each anchor. Each node uses the approximated center of intersection of the rings as its position estimate. Simulation results show that the estimation error reduces by half when anchors transmit beacons at two different power levels periodically instead of at a single level. CAB also gives a lower estimation error than other range-free localization schemes (e.g., Centroid, APIT) when the anchorto- node range ratio is less than four.
Item Metadata
Title |
Localization algorithms for wireless sensor networks
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2006
|
Description |
Many applications in wireless sensor networks require sensor nodes to obtain their absolute
or relative geographical positions. Due to the size, cost and energy restrictions
imposed by sensor nodes, only a few nodes can be equipped with the Global Positioning
System (GPS) capability and act as anchors for the rest of the network. The algorithms
based on classical Multidimensional Scaling (MDS) [1][2] only require three or four anchor
nodes and can provide higher accuracy than some other schemes.
In the first part of this thesis, we propose and analyze the use of ordinal MDS for
localization in wireless sensor networks. Ordinal MDS differs from classical MDS by
that it only requires a monotonicity constraint between the shortest path distance and
the Euclidean distance for each pair of nodes. Simulation studies are conducted under
square and C-shaped topologies with different connectivity levels and number of anchors.
Results show that ordinal MDS provides a lower position estimation error than classical
MDS in both hop-based and range-based scenarios.
In the second part of this thesis, we propose a concentric anchor-beacons (CAB)
localization algorithm for wireless sensor networks. CAB is a range-free approach and
uses a small number of anchor nodes. Each anchor emits several beacons at different power levels. From the information received by each beacon heard, nodes determine
which annular ring they are located within each anchor. Each node uses the approximated
center of intersection of the rings as its position estimate. Simulation results show that
the estimation error reduces by half when anchors transmit beacons at two different
power levels periodically instead of at a single level. CAB also gives a lower estimation
error than other range-free localization schemes (e.g., Centroid, APIT) when the anchorto-
node range ratio is less than four.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2010-01-06
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0064953
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2006-05
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.