This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mobile Element Scheduling with Dynamic Deadlines
April 2007 (vol. 6 no. 4)
pp. 395-410
Wireless networks have historically considered support for mobile elements as 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.
Index Terms:
Controlled mobility, scheduling, wireless sensor networks.
Citation:
Arun A. Somasundara, Aditya Ramamoorthy, Mani B. Srivastava, "Mobile Element Scheduling with Dynamic Deadlines," IEEE Transactions on Mobile Computing, vol. 6, no. 4, pp. 395-410, April 2007, doi:10.1109/TMC.2007.57
Usage of this product signifies your acceptance of the Terms of Use.