mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
Centralized Routing for Prolonged Network Lifetime in Wireless Sensor Networks
Mälardalen University, Department of Computer Science and Electronics.
2008 (English)Licentiate thesis, comprehensive summary (Other scientific)
Abstract [en]

In this thesis centralized routing methods for wireless sensor networks have been studied. The aim has been to prolong network lifetime by reducing the energy consumed by sensor-node communication.

Wireless sensor networks are rapidly becoming common in application areas where information from many sensors is to be collected and acted upon. The use of wireless sensor networks adds flexibility to the network, and the cost of cabling can be avoided.

Wireless sensor networks may consist of several hundreds of small devices, equipped with sensors (e.g. acoustic, seismic or image) that form a wireless network. Each sensor node collects information from its surroundings and sends it to a base station, either from sensor node to sensor node, or directly to the base station.

We have made simulations that show that asymmetric communication with multihop extends the lifetime of large wireless sensor networks. We have also investigated the usefulness of enforcing a minimum separation distance between cluster heads in a cluster based wireless sensor network. The results show that our sensor network performs up to 150% better when introducing a minimum separation distance between cluster heads. The simulations also show that the minimum separation distance resulting in the lowest energy consumption in our network varies with the number of clusters. We have also made an initial study of maximum lifetime routing in sparse wireless sensor networks to be able to see how different heuristic routing algorithms influence the energy consumption of individual sensor nodes, and thus the lifetime of a sparse sensor network. We have also compared the maximum lifetime of the heuristic algorithms to the maximum lifetime of an optimal routing solution. These simulations showed that for some types of applications the choice of heuristic algorithm is more important to prolong network lifetime, than for other types of applications.

Place, publisher, year, edition, pages
Akademin för innovation, design och teknik , 2008.
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 79
Keyword [en]
Wireless sensor networks, routing, energy efficiency, asymmetric communicaiton, communication, power consumption, computer networks
Keyword [sv]
trådlösa sensornät, trådlös, kommunikation, energikonsumtion
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:mdh:diva-486ISBN: 978-91-85485-69-7 (print)OAI: oai:DiVA.org:mdh-486DiVA: diva2:121022
Presentation
2008-01-18, Kappa, U, Högskoleplan 1, Västerås, 14:15
Opponent
Supervisors
Available from: 2007-12-19 Created: 2007-12-19 Last updated: 2016-01-19
List of papers
1. Asymmetric Multihop Communication in Large Sensor Networks
Open this publication in new window or tab >>Asymmetric Multihop Communication in Large Sensor Networks
2006 (English)In: 2006 1st International Symposium on Wireless Pervasive ComputingVolume 2006, 2006, 1-7 p.Conference paper, Published paper (Refereed)
Abstract [en]

With the growing interest in wireless sensor networks, energy efficient communication infrastructures for such networks are becoming increasingly important. In this paper, we compare and simulate asymmetric and symmetric communication in sensor networks. We do this by extending LEACH, a well-known TDMA cluster-based sensor network architecture, to use asymmetric communication. The extension makes it possible to scale up the network size beyond what is feasible with LEACH and its variants LEACH-C and LEACH-F.

National Category
Computer Engineering
Identifiers
urn:nbn:se:mdh:diva-4003 (URN)10.1109/ISWPC.2006.1613561 (DOI)000237179000004 ()2-s2.0-33750394324 (Scopus ID)0780394100 (ISBN)
Conference
2006 1st International Symposium on Wireless Pervasive Computing; Phuket; Thailand; 16 January 2006 through 18 January 2006
Available from: 2006-05-29 Created: 2006-05-29 Last updated: 2016-01-19Bibliographically approved
2. Energy-Efficient Cluster Formation for Large Sensor Networks using a Minimum Separation Distance
Open this publication in new window or tab >>Energy-Efficient Cluster Formation for Large Sensor Networks using a Minimum Separation Distance
2006 (English)In: In proceedings of the Fifth Annual Mediterranean Ad Hoc Networking Workshop, 2006Conference paper, Published paper (Refereed)
National Category
Computer Engineering
Identifiers
urn:nbn:se:mdh:diva-4153 (URN)
Conference
Fifth Annual Mediterranean Ad Hoc Networking Workshop, Lipari, Sicily (Italy) - June 14-17, 2006
Available from: 2007-12-19 Created: 2007-12-19 Last updated: 2015-06-29Bibliographically approved
3. A Study of Maximum Lifetime Routing in Sparse Sensor Networks
Open this publication in new window or tab >>A Study of Maximum Lifetime Routing in Sparse Sensor Networks
2008 (English)In: CISIS 2008: THE SECOND INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS, PROCEEDINGS, 2008, 449-454 p.Conference paper, Published paper (Refereed)
Abstract [en]

A major issue in wireless sensor networks is to prolong network lifetime by efficient energy management. In this paper we present an initial study ofmaximum lifetime routing in sparse sensor networks. We have studied simulations of how different heuristic routing algorithms influence the energy consumption of individual sensor nodes, and thus the functional lifetime of a sparse sensor network. The functional lifetime of the sensornetwork can be either until the first node has run out of energy or until a certain threshold of nodes has demised. We have also compared themaximum lifetime of the heuristic algorithms to the maximum lifetime of an optimal routing solution. Our simulations with non-aggregated data indicates that using one of the presented heuristic routing algorithms are not enough to find a near optimal routing. Our study is made in the AROS framework.

National Category
Engineering and Technology
Identifiers
urn:nbn:se:mdh:diva-4154 (URN)10.1109/CISIS.2008.53 (DOI)000259299500063 ()2-s2.0-53149130948 (Scopus ID)978-0-7695-3109-0 (ISBN)
Conference
2nd International Conference on Complex, Intelligent and Software Intensive Systems Location: Polytechn Univ Catalonia, Catalonia, SPAIN Date: MAR 04-07, 2008
Available from: 2007-12-19 Created: 2007-12-19 Last updated: 2013-12-03Bibliographically approved

Open Access in DiVA

fulltext(314 kB)1867 downloads
File information
File name FULLTEXT01.pdfFile size 314 kBChecksum MD5
27278d8dbf667460c6ab91a0a658b95654ae77972fc43019c90bd42835aa65ce30427b4e
Type fulltextMimetype application/pdf

By organisation
Department of Computer Science and Electronics
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1867 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

Total: 576 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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