Dynamic sink assignment for efficient energy consumption in wireless sensor networks

Handle URI:
http://hdl.handle.net/10754/564536
Title:
Dynamic sink assignment for efficient energy consumption in wireless sensor networks
Authors:
Oikonomou, Konstantinos N.; Aissa, Sonia
Abstract:
Efficient energy consumption is a challenging problem in wireless sensor networks (WSNs) and closely related to extending network lifetime. The usual way of tackling this issue for topologies with fixed link weight and fixed sink location, has been shown to be severely affected by the energy hole problem. In this paper, the energy consumption problem is initially studied for WSNs with fixed sink assignment and it is analytically shown that energy consumption is minimized when the sink is assigned to the node that is the solution of a suitably formulated 1-median problem. This motivates the introduction of a dynamic environment where link weights change based on the energy level and the aggregate traffic load of the adjacent nodes. Then, the sink is adaptively allowed to move among neighbor nodes, according to a scalable sink migration strategy. Simulation results support the analytical claims demonstrating energy consumption reduction and an additional network lifetime increment when migration is employed in the dynamic environment. © 2012 IEEE.
KAUST Department:
Physical Sciences and Engineering (PSE) Division
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2012 IEEE Wireless Communications and Networking Conference (WCNC)
Conference/Event name:
2012 IEEE Wireless Communications and Networking Conference, WCNC 2012
Issue Date:
Apr-2012
DOI:
10.1109/WCNC.2012.6214091
Type:
Conference Paper
ISSN:
15253511
ISBN:
9781467304375
Appears in Collections:
Conference Papers; Physical Sciences and Engineering (PSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorOikonomou, Konstantinos N.en
dc.contributor.authorAissa, Soniaen
dc.date.accessioned2015-08-04T07:03:28Zen
dc.date.available2015-08-04T07:03:28Zen
dc.date.issued2012-04en
dc.identifier.isbn9781467304375en
dc.identifier.issn15253511en
dc.identifier.doi10.1109/WCNC.2012.6214091en
dc.identifier.urihttp://hdl.handle.net/10754/564536en
dc.description.abstractEfficient energy consumption is a challenging problem in wireless sensor networks (WSNs) and closely related to extending network lifetime. The usual way of tackling this issue for topologies with fixed link weight and fixed sink location, has been shown to be severely affected by the energy hole problem. In this paper, the energy consumption problem is initially studied for WSNs with fixed sink assignment and it is analytically shown that energy consumption is minimized when the sink is assigned to the node that is the solution of a suitably formulated 1-median problem. This motivates the introduction of a dynamic environment where link weights change based on the energy level and the aggregate traffic load of the adjacent nodes. Then, the sink is adaptively allowed to move among neighbor nodes, according to a scalable sink migration strategy. Simulation results support the analytical claims demonstrating energy consumption reduction and an additional network lifetime increment when migration is employed in the dynamic environment. © 2012 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.titleDynamic sink assignment for efficient energy consumption in wireless sensor networksen
dc.typeConference Paperen
dc.contributor.departmentPhysical Sciences and Engineering (PSE) Divisionen
dc.identifier.journal2012 IEEE Wireless Communications and Networking Conference (WCNC)en
dc.conference.date1 April 2012 through 4 April 2012en
dc.conference.name2012 IEEE Wireless Communications and Networking Conference, WCNC 2012en
dc.conference.locationParisen
dc.contributor.institutionDepartment of Informatics, Ionian University, Corfu, Greeceen
dc.contributor.institutionINRS, University of Quebec, Montreal, QC, Canadaen
kaust.authorAissa, Soniaen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.