Computer Networks: The International Journal of Computer and Telecommunications Networking
An optimization based distributed algorithm for mobile data gathering in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Data dissemination strategies in mobile sink wireless sensor networks: a survey
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Minimum Cost Routing with a Lifetime Guarantee in Wireless Sensor Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey
ACM Transactions on Sensor Networks (TOSN)
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
Computers and Operations Research
Joint mobile energy replenishment and data gathering in wireless rechargeable sensor networks
Proceedings of the 23rd International Teletraffic Congress
Fine grained load balancing in multi-hop wireless networks
Journal of Parallel and Distributed Computing
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Energy efficient and QoS aware routing protocol for Clustered Wireless Sensor Network
Computers and Electrical Engineering
| Hi-index | 0.01 |
We consider a noise-limited wireless sensor network that consists of battery-operated nodes which can route information to a mobile sink in a multi-hop fashion. The problem of maximizing the network's lifetime, defined as the period of time during which the network can route a feasible flow to each sink location subject to power/energy constraints, is cast into a linear program, reduced into a simpler equivalent form and solved via dual decomposition. The unknowns are the sink sojourn times and the routing flow vector for each sink location. The presence of a mobile sink presents new challenges but the problem structure can still be exploited to find the optimal solution. A distributed algorithm based on the subgradient method and using the sink as leader is proposed and its performance is evaluated through simulation for random networks. The algorithm's requirements in memory are also provided.