Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
Computers and Operations Research
Maximizing the lifetime of Daley-tolerant wireless sensor networks using fuzzy system
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I
Coordination in wireless sensor-actuator networks: A survey
Journal of Parallel and Distributed Computing
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Optimized relay node placement for connecting disjoint wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximizing lifetime vector in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Energy-aware sensor node relocation in mobile sensor networks
Ad Hoc Networks
| Hi-index | 0.00 |
This paper proposes a framework to maximize the lifetime of the wireless sensor networks (WSNs) by using a mobile sink when the underlying applications tolerate delayed information delivery to the sink. Within a prescribed delay tolerance level, each node does not need to send the data immediately as it becomes available. Instead, the node can store the data temporarily and transmit it when the mobile sink is at the most favorable location for achieving the longest WSN lifetime. To find the best solution within the proposed framework, we formulate optimization problems that maximize the lifetime of the WSN subject to the delay bound constraints, node energy constraints, and flow conservation constraints. We conduct extensive computational experiments on the optimization problems and find that the lifetime can be increased significantly as compared to not only the stationary sink model but also more traditional mobile sink models. We also show that the delay tolerance level does not affect the maximum lifetime of the WSN.