Abstract | ||
---|---|---|
This paper exploits sink mobility to prolong the network lifetime in wireless sensor networks (WSNs) where the information delay caused by moving the sink should be bounded. We build a unified framework for analyzing this joint sink mobility and routing problem. We offer a mathematical modeling that is general and captures diversified issues, e.g. sink mobility, routing, delay, etc. We discuss the induced subproblems and present efficient solutions for them. Then, we generalize these solutions and propose a polynomial-time optimal algorithm for the origin problem. In simulations, we show the benefits of involving a mobile sink. We also show that the impact of the delay bound on the network lifetime. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/ICC.2012.6364118 | ICC |
Keywords | Field | DocType |
wsn,network lifetime,routing problem,delay-bounded sink mobility,joint sink mobility,polynomial-time optimal algorithm,computational complexity,mobile radio,wireless sensor networks,mathematical modeling,telecommunication network routing,information delay,mobile communication,algorithm design and analysis,routing,network topology | Key distribution in wireless sensor networks,Dynamic Source Routing,Computer science,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Mobile wireless sensor network,Geographic routing,Wireless sensor network,Sink (computing),Distributed computing | Conference |
Volume | Issue | ISSN |
null | null | 1550-3607 E-ISBN : 978-1-4577-2051-2 |
ISBN | Citations | PageRank |
978-1-4577-2051-2 | 4 | 0.47 |
References | Authors | |
10 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yu Gu 0004 | 1 | 2158 | 127.59 |
Yusheng Ji | 2 | 1459 | 162.16 |
Jie Li | 3 | 457 | 33.77 |
Biao Han | 4 | 4 | 0.81 |
Baohua Zhao | 5 | 477 | 49.68 |