Please use this identifier to cite or link to this item:
|Title:||Joint sink mobility and routing to maximize the lifetime of wireless sensor networks : the case of constrained mobility||Authors:||Luo, Jun.
|Keywords:||DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks||Issue Date:||2009||Source:||Luo, J., & Hubaux, J. P. (2009). Joint sink mobility and routing to maximize the lifetime of wireless sensor networks : the case of constrained mobility. IEEE/ACM Transactions on Networking. 2009: 1-14.||Series/Report no.:||IEEE/ACM transactions on networking||Abstract:||The longevity of wireless sensor networks (WSNs) is a major issue that impacts the application of such networks. While communication protocols are striving to save energy by acting on sensor nodes, recent results show that network lifetime can be prolonged by further involving sink mobility. As most proposals give their evidence of lifetime improvement through either (small-scale) field tests or numerical simulations on rather arbitrary cases, a theoretical understanding of the reason for this improvement and the tractability of the joint optimization problem is still missing. In this paper, we build a framework for investigating the joint sink mobility and routing problem by constraining the sink to a finite number of locations. We formally prove the NP-hardness of the problem. We also investigate the induced subproblems. In particular, we develop an efficient primal-dual algorithm to solve the subproblem involving a single sink, then we generalize this algorithm to approximate the original problem involving multiple sinks. Finally, we apply the algorithm to a set of typical topological graphs; the results demonstrate the benefit of involving sink mobility, and they also suggest the desirable moving traces of a sink.||URI:||https://hdl.handle.net/10356/84315
|ISSN:||1063-6692||DOI:||10.1109/TNET.2009.2033472||Rights:||© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCSE Journal Articles|
checked on Jul 16, 2020
WEB OF SCIENCETM
checked on Oct 22, 2020
Page view(s) 501,602
checked on Oct 28, 2020
checked on Oct 28, 2020
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.