Skip navigation
Skip navigation
Open Research will be down for maintenance between 8:00 and 8:15 am on Tuesday, December 1 2020.

Prolonging Network Lifetime via A Controlled Mobile Sink in Wireless Sensor Networks

Liang, Weifa; Luo, Jun; Xu, Xu (Grace)

Description

In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by petrol and/or electricity, the total travel distance of the mobile sink should be bounded. To minimize the data loss during the transition of the mobile sink from its current location to its next location, its moving distance must be restricted. Also, considering the overhead on a routing tree construction at each...[Show more]

dc.contributor.authorLiang, Weifa
dc.contributor.authorLuo, Jun
dc.contributor.authorXu, Xu (Grace)
dc.coverage.spatialMiami USA
dc.date.accessioned2015-12-10T22:32:04Z
dc.date.createdDecember 6-10 2010
dc.identifier.urihttp://hdl.handle.net/1885/55605
dc.description.abstractIn this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by petrol and/or electricity, the total travel distance of the mobile sink should be bounded. To minimize the data loss during the transition of the mobile sink from its current location to its next location, its moving distance must be restricted. Also, considering the overhead on a routing tree construction at each sojourn location of the mobile sink, it is required that the mobile sink sojourns for at least a certain amount of time at each of its sojourn locations. The distance constrained mobile sink problem in a WSN is to find an optimal sojourn tour for the mobile sink such that the sum of sojourn times in the tour is maximized, subject to the above mentioned constraints. In this paper we first formulate the problem as a mixed integer linear programming (MILP). Due to its NP-hardness, we then devise a novel heuristic for it. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm in terms of network lifetime. The experimental results demonstrate that the solution delivered by the proposed heuristic is nearly optimal which is comparable with the one by solving the MILP formulation but with much shorter running time.
dc.publisherIEEE Communications Society
dc.relation.ispartofseriesIEEE Global Communications Conference, Exhibition & Industry Forum (GLOBECOM 2010)
dc.sourceIEEE Global Communications Conference, Exhibition & Industry Forum (GLOBECOM 2010): Proceedings
dc.subjectKeywords: Data loss; Mechanical movements; MILP formulation; Mixed-integer linear programming; Mobile sinks; Network lifetime; NP-hardness; Routing trees; Running time; Sojourn time; Travel distance; Algorithms; Computer simulation; Integer programming; Linear prog
dc.titleProlonging Network Lifetime via A Controlled Mobile Sink in Wireless Sensor Networks
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2010
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.absfor100510 - Wireless Communications
local.identifier.ariespublicationU3594520xPUB334
local.type.statusPublished Version
local.contributor.affiliationLiang, Weifa, College of Engineering and Computer Science, ANU
local.contributor.affiliationLuo, Jun, National University of Defence Technology
local.contributor.affiliationXu, Xu (Grace), College of Engineering and Computer Science, ANU
local.description.embargo2037-12-31
local.identifier.doi10.1109/GLOCOM.2010.5683095
local.identifier.absseo890103 - Mobile Data Networks and Services
dc.date.updated2016-02-24T10:18:05Z
local.identifier.scopusID2-s2.0-79551637477
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Liang_Prolonging_Network_Lifetime_2010.pdf237.04 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator