Mobile Element Scheduling with Dynamic Deadlines

作者：Arun Agrahara Somasundara, Aditya Ramamoorthy, Mani B. Srivastava · 发表于：IEEE Transactions on Mobile Computing · 年份：2007 · DOI：10.1109/tmc.2007.57 · 被引用次数：265 · 研究领域：Energy Efficient Wireless Sensor Networks、Mobile Ad Hoc Networks、Opportunistic and Delay-Tolerant Networks

Wireless networks have historically considered support for mobile elements's an extra overhead. However, recent research has provided the means by which a network can take advantage of mobile elements. Particularly in the case of wireless sensor networks, mobile elements can be deliberately built into the system to improve the lifetime of the network and act as mechanical carriers of data. The mobile element, whose mobility is controlled, visits the nodes to collect their data before their buffers are full. In general, the spatio-temporal dynamics of the sensed phenomenon may require sensor nodes to collect samples at different rates, in which case, some nodes need to be visited more frequently than others. This work formulates the problem of scheduling the mobile element in the network so that there is no data loss due to buffer overflow. The problem is shown to be NP-complete and an integer-linear-programming formulation is given. Finally, some computationally practical algorithms for a single mobile and for the case of multiple mobiles are presented and their performances compared