Data harvesting with mobile elements in wireless sensor networks

Computer Networks

Volumn 50, Issue 17, 2006, Pages 3449-3465

  Gu, Yaoyao ^a   Bozdaǧ, Doruk ^a   Brewer, Robert W ^a   Ekici, Eylem ^a  

^a Ohio State University   (United States)

Author keywords

Data collection; Mobility; Path planning; Scheduling; Sensor networks; Sensor actor

Indexed keywords

ALGORITHMS; DATA ACQUISITION; MOTION PLANNING; SCHEDULING; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

DATA COLLECTION; PARTITIONING-BASED SCHEDULING (PBS) ALGORITHM; SENSOR NETWORKS; SENSOR-ACTOR;

COMPUTER NETWORKS;

EID: 33748714786     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2006.01.008     Document Type: Article

References (26)

1. A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, J. Anderson, Wireless sensor networks for habitat monitoring, in: Proceedings of ACM Wireless Sensor Networks and Applications Workshop (WSNA 2002), 2002.
2. P. Juang et al., Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet, in: International Conference on Architectural support for programming languages and operating systems, 2002.
3. Manatee website, http://distlab.dk/manatee/, 2002.
4. A. Beafour, M. Leopold, P. Bonnet, Smart tag based data dissemination, in: ACM Workshop on Wireless Sensor Networks and Applications, 2002.
5. M. Vahdat, D. Becker, Epidemic routing for partially connected ad hoc networks, Technical Report, Duke University, 2000.
6. Akyildiz I.F., and Kasimoglu I.H. Wireless sensor and actor networks: research challenges. Ad Hoc Networks Journal 2 October (2004) 351-367
7. J.-H. Chang, L. Tassiulas, Energy conserving routing in wireless ad hoc networks, in: Proceedings of the 19th IEEE INFOCOM, 2000.
8. A. Manjeshwar, D. Agrawal, Teen: a routing protocol for enhanced efficiency in wireless sensor networks, in: International Proceedings of 15th Parallel and Distributed Processing Symposium, 2001, pp. 2009-2015.
9. K. Kar, M. Kodialam, T. Lakshman, L. Tassiulas, Routing for network capacity maximization in energy-constrained ad hoc networks, in: Proceedings of the 22th IEEE INFOCOM, 2003.
10. A. Sankar, Z. Liu, Maximum lifetime routing in wireless ad hoc networks, in: Proceedings of the 23nd IEEE INFOCOM, 2004.
11. Li Q., and Rus D. Sending messages to mobile users in disconnected ad hoc wireless networks. MobiCom'00: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (2000), ACM Press 44-55
12. Grossglauser M., and Tse D.N.C. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking 10 4 (2002) 477-486
13. R. Shah, S. Roy, S. Jain, W. Brunette, Data mules: modeling a three-tier architecture for sparse sensor networks, in: IEEE Workshop on Sensor Network Protocols and Applications (SNPA), 2003.
14. W. Zhao, M.H. Ammar, Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks, in: Proceedings of the Ninth IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS'03), 2003.
15. Zhao W., Ammar M., and Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks. MobiHoc'04: Proceedings of the 5th ACM International Symposium on Mobile Ad hoc Networking and Computing (2004), ACM Press 187-198
16. Kansal A., Somasundara A.A., Jea D.D., Srivastava M.B., and Estrin D. Intelligent fluid infrastructure for embedded networks. MobiSYS'04: Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services (2004), ACM Press 111-124
17. A.A. Somasundara, A. Ramamoorthy, M.B. Srivastava, Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines, in: 25th IEEE International Real-Time Systems Symposium (RTSS'04), 2004, pp. 296-305.
18. Golden B.L., Levy L., and Vohra R. The orienteering problem. Naval Research Logistics 34 (1987) 307-318
19. Bar-Yehuda R., Even G., and Shahar S.M. On approximating a geometric prize-collecting traveling salesman problem with time windows. Journal of Algorithm 55 April (2005) 76-92
20. P. Toth, E.C. Vigo, The vehicle routing problem, Society for Industrial and Applied Mathematics (SIAM), 2001.
21. Bansal N., Blum A., Chawla S., and Meyerson A. Approximation algorithms for deadline-tsp and vehicle routing with time-windows. STOC'04: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing (2004), ACM Press 166-174
22. Solomon M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research 35 2 (1987) 254-265
23. Bentley J.L. Multidimensional binary search trees used for associative searching. Communications of the ACM 18 9 (1975) 509-517
24. Bentley J. Fast algorithms for geometric traveling salesman problem. ORSA Journal on Computing 4 (1992) 387-411
25. Cormen T.H., Leiserson C.E., Rivest R.L., et al. Introduction to Algorithms (2002), The MIT Press
26. Gutin G., and Punnen A.P. The Traveling Salesman Problem and Its Variations (2002), Kluwer Academic Publishers