uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Swarm-Intelligent Localization
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2009 (English)Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In wireless sensor networks we often want to know where individual sensor nodesare physically positioned in order to make sense of the data that they report. Theprocess of obtaining such position information for the nodes is known as localization.Simple solutions to the problem of localization are to either place the nodes manuallyat specified places, or to use some special localization hardware such as GPSreceivers. However, these solutions can be impractical or too costly, especially forlarge networks. Instead we can use some algorithm to try to compute the nodes'positions based on available data. We present a new distributed algorithm, which wecall Swarm-Intelligent Localization (SIL), for computing these positions. Our algorithmassumes that a fraction of the nodes, the so-called anchors, have an a prioriknowledge of their positions, and that noisy range measurements can be madebetween neighbouring nodes in the network. The average computational complexityper node running SIL is constant in the network size, and linear in the connectivity ofthe network. We evaluate the algorithm through simulations of different networktopologies with varying parameters, such as network size, range measurement errors,fraction of anchors and connectivity. The results of the simulations indicate that inmost cases SIL can successfully locate the majority of sensor nodes with reasonableaccuracy, even in the face of difficulties such as large distance measurement errors.

Place, publisher, year, edition, pages
2009.
Series
IT ; 09 037
Identifiers
URN: urn:nbn:se:uu:diva-108042OAI: oai:DiVA.org:uu-108042DiVA, id: diva2:233958
Presentation
(English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2009-09-03 Created: 2009-09-03 Last updated: 2009-11-18Bibliographically approved

Open Access in DiVA

fulltext(1402 kB)1613 downloads
File information
File name FULLTEXT01.pdfFile size 1402 kBChecksum SHA-512
8165082f4d87c5c763ddb09297d18f71d354a90f6bdabddb8f937ab9430d5057fad89f683ce03359e402b21a961c41726b3293ad2ba1093b7b9341e8fdf48464
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 1613 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 835 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf