Energy-constrained paths for optimization of energy consumption in wireless sensor networks

Hoang, DB; Kamyabpour, N

Energy-constrained paths for optimization of energy consumption in wireless sensor networks

Hoang, DB

Kamyabpour, N

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings of the International Conference on Networking and Distributed Computing, ICNDC, 2014, pp. 9 - 13
Issue Date:: 2014-10-09

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript versionAdobe PDF (670.03 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Hoang, DB https://orcid.org/0000-0003-1798-4926	en_US
dc.contributor.author	Kamyabpour, N	en_US
dc.date.issued	2014-10-09	en_US
dc.identifier.citation	Proceedings of the International Conference on Networking and Distributed Computing, ICNDC, 2014, pp. 9 - 13	en_US
dc.identifier.isbn	9781479930463	en_US
dc.identifier.issn	2165-4999	en_US
dc.identifier.uri	http://hdl.handle.net/10453/37230
dc.description.abstract	© 2014 IEEE. A sensor spends a large part of its energy in transmitting its data and relay its neighbours' data. The overall lifetime of a wireless sensor network depends strongly on how a sensor selects its relaying neighbours and the data path to the destination. One critical problem is that if a sensor has to support too many neighbours, its energy is exhausted rapidly and may bring down the whole network. This paper suggests algorithms for assigning weights to links between neighbours taking into account the number of neighbours who rely on them to relay traffic to the destination. In order to do so, the paper also proposes an algorithm for constructing node connectivity based on sensors position within the broadcast range of another sensor, and a shortest energy-constrained path from a sensor to the destination.	en_US
dc.relation.ispartof	Proceedings of the International Conference on Networking and Distributed Computing, ICNDC	en_US
dc.relation.isbasedon	10.1109/ICNDC.2013.17	en_US
dc.title	Energy-constrained paths for optimization of energy consumption in wireless sensor networks	en_US
dc.type	Conference Proceeding
utslib.for	080501 Distributed and Grid Systems	en_US
dc.location.activity	Los Angeles, CA
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US

Abstract:

© 2014 IEEE. A sensor spends a large part of its energy in transmitting its data and relay its neighbours' data. The overall lifetime of a wireless sensor network depends strongly on how a sensor selects its relaying neighbours and the data path to the destination. One critical problem is that if a sensor has to support too many neighbours, its energy is exhausted rapidly and may bring down the whole network. This paper suggests algorithms for assigning weights to links between neighbours taking into account the number of neighbours who rely on them to relay traffic to the destination. In order to do so, the paper also proposes an algorithm for constructing node connectivity based on sensors position within the broadcast range of another sensor, and a shortest energy-constrained path from a sensor to the destination.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/37230