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
A Study of Maximum Lifetime Routing in Sparse Sensor Networks
Mälardalen University, Department of Computer Science and Electronics.
2008 (English)In: CISIS 2008: THE SECOND INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS, PROCEEDINGS, 2008, p. 449-454Conference 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.

Place, publisher, year, edition, pages
2008. p. 449-454
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-4154DOI: 10.1109/CISIS.2008.53ISI: 000259299500063Scopus ID: 2-s2.0-53149130948ISBN: 978-0-7695-3109-0 (print)OAI: oai:DiVA.org:mdh-4154DiVA, id: diva2:121021
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
In thesis
1. Centralized Routing for Prolonged Network Lifetime in Wireless Sensor Networks
Open this publication in new window or tab >>Centralized Routing for Prolonged Network Lifetime in Wireless Sensor Networks
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
Keywords
Wireless sensor networks, routing, energy efficiency, asymmetric communicaiton, communication, power consumption, computer networks, trådlösa sensornät, trådlös, kommunikation, energikonsumtion
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-486 (URN)978-91-85485-69-7 (ISBN)
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: 2018-01-13

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Björkman, Mats

Search in DiVA

By author/editor
Björkman, Mats
By organisation
Department of Computer Science and Electronics
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 84 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