On reducing delay in mobile data collection based wireless sensor networks

Wireless Networks

Volumn 19, Issue 3, 2013, Pages 285-299

  Kumar, Arun K ^a   Sivalingam, Krishna M ^a   Kumar, Adithya ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Clustering; Mobile data collector; Wireless communication; Wireless sensor networks

Indexed keywords

CLUSTERING; DATA COLLECTION MECHANISM; EXTENSIVE SIMULATIONS; MOBILE DATA COLLECTIONS; MOBILE DATA COLLECTORS; MULTI-HOP DATA TRANSMISSIONS; NETWORK LIFETIME; WIRELESS COMMUNICATIONS;

DATA ACQUISITION; DATA COMMUNICATION SYSTEMS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

SENSOR NODES;

EID: 84876665398     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-012-0466-8     Document Type: Article

References (36)

1. Raghavendra, C. S.; Sivalingam, K. M.; & Znati, T. (2004). Wireless sensor networks. Berlin: Springer.
2. Ekici, E.; Gu, Y.; & Bozdag, D. (2006). Mobility-based communication in wireless sensor networks. IEEE Communications Magazine, 44(7), 56-62.
3. Wu, Q.; Rao, N.; Barhen, J.; Iyengar, S.; Vaishnavi, V.; Qi, H.; et al. (2004). On computing mobile agent routes for data fusion in distributed sensor networks. IEEE Transactions on Knowledge and Data Engineering, 16(6), 740-753.
4. Asok, A.; Sivalingam, K. M.; & Agrawal, P. (2009). Mobility in wireless sensor networks. In: D. Agrawal, B. Xie (Eds.), Encyclopedia on ad hoc and ubiquitous computing. Singapore: World Scientific Press.
5. Qi, H.; Iyengar, S.; & Chakrabarty, K. (2001). Multi-resolution data integration using mobile agents in distributed sensor networks. IEEE Transaction on Systems, Man, and Cybernetics, Part C: Applications and Review, 31(3), 383-391.
6. Bote, D.; Sivalingam, K. M.; & Agrawal, P. (2007). Data gathering in ultra wide band based wireless sensor networks using a mobile node. In International conference on broadband communications and networks (BROADNETS), Raleigh, NC.
7. Jain, S.; Shah, R.; Brunette, W.; Borriello, G.; & Roy, S. (2006). Exploiting mobility for energy efficient data collection in wireless sensor networks. IEEE Transaction on Systems, Man, and Cybernetics, Part C: Applications and Review, 31(3), 327-339.
8. Tong, L.; Zhao, Q.; & Adireddy, S. (2003). Sensor networks with mobile agents. In Proceedings of IEEE MILCOM, Boston, MA.
9. Shah, R.; Roy, S.; Jain, S.; & Brunette, W. (2003). Data MULEs: modeling a three-tier architecture for sparse sensor networks. in IEEE workshop on sensor network protocols and applications (SNPA) (pp. 30-41). Alaska: Anchorage.
10. Somasundara, A. A.; Ramamoorthy, A.; & Srivastava, M. B. (2004). Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines. In IEEE International Real-Time Systems Symposium (RTSS) (pp. 296-305). Portugal: Lisbon.
11. Jea, D.; Somasundara, A. A.; & Srivastava, M. B. (2005). Multiple controlled mobile elements (data mules) for data collection in sensor networks. In IEEE distributed computing in sensor systems (DCOSS) (pp. 244-257). CA: Marina Del Ray.
12. Shah, P.; Sivalingam, K. M.; & Agrawal, P. (2008). Efficient data gathering in distributed hybrid sensor networks using multiple mobile agents. In Proceedings of third international conference on communication system software and middleware (COMSWARE) Bangalore, India.
13. Ma, M.; & Yang, Y. (2007). SenCar: An energy-efficient data gathering mechanism for large-scale multihop sensor networks. IEEE Transaction on Parallel and Distributed Systems, 18(10).
14. Boukerche, A.; & Fei, X. (2008). Adaptive data gathering protocols with mobile collectors for vehicular ad-hoc and sensor networks. In IEEE international conference on wireless & mobile computing, networking & communication. http://doi.ieeecomputersociety.org/10.1109/WiMob.2008.124.
15. Han, J.; & Kamber, M. (2006). Data mining: Concepts and techniques. Amsterdam: Elsevier.
16. StatSoft. (2012). Cluster analysis, [Online]. From http://www.statsoft. com/textbook/stcluan.html.
17. MilanPolyTech. (2009). A tutorial on clustering algorithms, [Online]. From http://home.dei.polimi.it/matteucc/Clustering/tutorial-html/.
18. Heyer, L.; Kruglyak, S.; & Yooseph, S. (1999). Exploring expression data: Identification and analysis of coexpressed genes. Genome Research, 9, 1106-1115.
19. Applegate, D. L.; Bixby, R.; Chva̧tal, V.; & Cook, W. (2006). The traveling salesman problem: a computational study. Princeton: Princeton University Press.
20. Cook, W. (2005). Concorde TSP solver, [Online]. From http://www.tsp. gatech.edu/concorde/index.html.
21. IEEE. The IEEE 802.11 working group on wireless LAN standards, [Online]. From http://www.ieee802.org/11/.
22. The Wi-Fi alliance, [Online]. From http://wi-fi.org/ (2009).
23. Schiller, J. (2006). Mobile communications. Reading: Addison Wesley Publishers.
24. The IEEE 802.16 working group on broadband wireless access standards, [Online]. From http://grouper.ieee.org/groups/802/16/ (2009).
25. The WiMax forum, [Online]. From http://www.wimaxforum.org/ (2009).
26. Heinzelman, W. R.; Kulik, J.; & Balakrishnan, H. (1999). Adaptive protocols for information dissemination in wireless sensor networks. In ACM MOBICOM. USA: Seattle.
27. Bandyopadhyay, S.; & Coyle, E. J. (2003). An energy efficient hierarchical clustering algorithm for wireless sensor networks. In IEEE INFOCOM. USA: San Francisco.
28. Durresi, A.; Paruchuri, V.; & Barolli, L. (2006). Clustering protocol for sensor networks. In IEEE international conference on advanced information networking and applications (AINA). Austria: Vienna.
29. Lee, S.; Yoo, J.; & Chung, T. C. (2004). Distance-based energy efficient clustering for wireless sensor networks. In IEEE conference on local computer networks (LCN). USA: Tampa.
30. Elzinga J.; & Hearn, D. (1972). The minimum covering sphere problem. Management Science, 19(1), 96-104.
31. Elzinga J.; & Hearn, D. (1972). Geometrical solutions for some minimax location problems. Transportation Science, 6(4), 379-394.
32. Gartner, B. (1999). Fast and robust smallest enclosing balls. In European Symposium on Algorithms (ESA (pp. 325-338).
33. Gartner, B. (2012). Miniball 2.0: Smallest enclosing balls of points, [Online]. From http://www.inf.ethz.ch/personal/gaertner/miniball.html.
34. Kershner, R. (1939). The number of circles covering a set. American Journal of Mathematics, 61(3), 665-671.
35. OMNET++ network simulation framework. From http://www.omnetpp.org (2011).
36. MiXiM (mixed simulator) simulation framework. From http://mixim. sourceforge.net (2011).