Message Delivery Capacity in Delay-Constrained Mobile Sensor Networks: Bounds and Realization

• Published in: IEEE transactions on wireless communications Vol. 10; no. 5; pp. 1552 - 1559
• Main Authors: Keung, G Y, Bo Li, Qian Zhang
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.05.2011; Institute of Electrical and Electronics Engineers
• Subjects: Applied sciences; Approximation algorithms; Delay; delay-constrained network; Detection, estimation, filtering, equalization, prediction; Equipments and installations; Exact sciences and technology; information collection; Information, signal and communications theory; Mathematical model; message delivery capacity; Mobile communication; Mobile radiocommunication systems; Mobile sensor network; Radiocommunications; Relays; Sensors; Signal and communications theory; Signal, noise; Telecommunications; Telecommunications and information theory; Upper bound; Mobile radiocommunication; information collection; Relay; Wireless telecommunication; message delivery capacity; Buffer system; Temporal constraint; delay-constrained network; Distributed algorithm; Delay time; Mobile sensor network; Sensor array; Signal detection; Information exchange
• ISSN: 1536-1276
• DOI: 10.1109/TWC.2011.030911.100827

In this paper, we study the message delivery capacity problem in delay-constrained mobile sensor networks. The message delivery capacity specifies the maximum percentage of sensing messages that can be successfully delivered to sink nodes within a given time constraint. This captures the overall system capacity in terms of successful sensing message delivery. By taking full advantage of sensor mobility and rendezvous during senor node encounters, messages can be delivered to a sink node either directly or through relays by other sensor nodes. In this paper, for the first time, we present the delay-constrained message delivery capacity formulation in mobile sensor networks. The objective is to maximize the message delivery capacity subject to the delay and buffering constraints. We first identify a number of unique challenges involved in such systems including message relay and buffer replacement mechanisms, and we derive the capacity bound under perfect message relay and buffer replacement mechanisms. Due to an unrealistic assumption about the foreknowledge of sensor moving trajectories, we next proceed to propose a practical algorithm to approximate the maximal message delivery capacity based on current global network knowledge. Furthermore, a distributed algorithm is proposed to reduce the control overhead for information exchange. Finally, we evaluate the algorithms and examine their sensitivity with respect to delay constraints, buffer size and message relay, and replacement schemes.