A novel scheme for WSAN sink mobility based on clustering and set packing techniques

IEEE Transactions on Automatic Control

Volumn 56, Issue 10, 2011, Pages 2381-2389

  Nakayama, Hidehisa ^a   Fadlullah, Zubair Md ^b   Ansari, Nirwan ^c   Kato, Nei ^b  

^a TOHOKU INSTITUTE OF TECHNOLOGY   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

^c NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Clustering; mobile sink; set packing techniques; wireless sensor and actuator network (WSAN)

Indexed keywords

AUTOMATION CONTROL SYSTEM; CLUSTERING; DATA GATHERING; ENVIRONMENTAL INFORMATION; MOBILE SINKS; NUMBER OF METHODS; PACKET DATA; PHYSICAL SYSTEMS; RESEARCH EFFORTS; SET PACKING; SINK MOBILITY; WIRELESS SENSOR AND ACTUATOR NETWORK (WSAN); WIRELESS SENSOR AND ACTUATOR NETWORKS;

ACTUATORS; COMPUTER SIMULATION; DIGITAL DEVICES; MEMS; SENSORS; TRAVELING SALESMAN PROBLEM;

WIRELESS SENSOR NETWORKS;

EID: 80053644052     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2011.2163872     Document Type: Article

References (32)

1. M. Weiser, The Computer for the 21st Century [Online]. Available: http://www.ubiq.com/hypertext/weiser/SciAmDraft3.html
2. V. Hsu, J. Kahn, and K. Pister, "Wireless communications for smart dust," UC Berkely Electronics Research Laboratory Memorandum M98/2 1998, pp. 168-171.
3. J. Kahn, R. Katz, and K. Pister, "Next century challenges: Mobile networking for smart dust," in Proc. 5th Annu. ACM/IEEE Int. Conf. Mobile Comp. Netw. (Mobicom'99), 1999, pp. 271-278.
4. Crossbow MOTE-MEMSIC Website [Online]. Available: http://www.memsic.com/
5. Sun SPOT-Sun SPOT World Website [Online]. Available: http://www. sunspotworld.com/
6. Zigbee Alliance [Online]. Available: http://www.zigbee.org/
7. TinyOS Home Page [Online]. Available: http://www.tinyos.net/
8. H. Nakayama, N. Ansari, A. Jamalipour, and N. Kato, "Fault-resilient sensing in wireless sensor networking," Comp. Commun., vol. 30, no. 11-12, pp. 2375-2384, Sep. 2007.
9. G. A. Shah, O. B. Akan, and B. Baykal, "Real-time coordination and routing in wireless sensor and actor networks," in Proc. 6th Int. Conf. Next Generation Teletraffic Wired/Wireless Adv. Netw. (NEW2N), 2006, pp. 365-383.
10. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy- efficient communication protocol for wireless microsensor networks," in Proc. 33rd Hawaii Int. Conf. System Sci. (HICSS'00), 2000, vol. 8, p. 8020.
11. S. Lindsey, C. Raghavendra, and K. Sivalingam, "Data gathering algorithms in sensor networks using energy metrics," IEEE Trans. Parallel Distrib. Syst., vol. 1, no. 4, pp. 660-670, Oct. 2002.
12. X. Fan and Y. Song, "Improvement on leach protocol of wireless sensor network," in Proc. Int. Conf. Sensor Technol. Appl. (SENSORCOMM' 07), 2007, pp. 260-264.
13. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "An application-specific protocol architecture for wireless microsensor networks," IEEE Trans. Wireless Commun., vol. 1, no. 4, pp. 660-670, Oct. 2002.
14. R. Shah, S. Roy, S. Jain, and W. Brunette, "Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks," Ad Hoc Netw., vol. 1, no. 2/3, pp. 215-233, Sep. 2003.
15. F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, "A two-tier data dissemination model for large-scale wireless sensor netoworks," in Proc. 8th Int. Conf. Mobile Comp. Netw., Sep. 2002, pp. 148-159.
16. D. Johnson and D. Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing. Norwell, MA: Kluwer Academic Publishers, 1996, vol. 153-181.
17. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations. New York: Plenum Press, 1972, vol. 85-103.
18. Y. Sasaki, H. Nakayama, N. Ansari, Y. Nemoto, and N. Kato, "A new data gathering scheme based on set cover algorithm for mobile sinks in wsns," in Proc. IEEE Global Telecommun. Conf. (GLOBECOM'08), 2008, pp. 725-729.
19. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. Freeman and Company, 1979.
20. A. Levin, "Approximating the unweighted k-set cover problem: Greedy meets local search," in Proc. 4th Int. Workshop Approx. Online Algorithms (WAOA'06), 2006, pp. 290-310.
21. C. M. Bishop, Pattern Recognition and Machine Learning. New York: Springer, 2006.
22. D. Johnson and L. McGeoch, The Traveling Salesman Problem: A Case Study in Local Optimization. New York: Wiley, 1997.
23. N. Ansari and E. Hou, Computational Intelligence for Optimization. New York: Springer, 1997.
24. G. A. Croes, "A method for solving traveling-salesman problems," Oper. Res., vol. 6, no. 6, pp. 791-812, 1958.
25. I. Or, "Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking," Ph.D. dissertation, Industrial Engineering and Management Science, Northwestern University, Evanton, IL, 1976.
26. S. Lin, "Computer solutions of the traveling salesman problem," Bell. Syst. Tech. J., vol. 44, pp. 2245-2269, 1965.
27. QualNet-Scalable Network Technologies Website [Online]. Available: http://www.scalable-networks.com/
28. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, "Directed diffusion for wireless sensor networking," IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 2-16, Feb. 2003.
29. B. Krishnamachari and J. Heidemann, "Application-specific modeling of information routing in sensor networks," in Proc. IEEE Int. Conf. Performance, Comp. Commun. (IPCCC'04), Apr. 2004, pp. 717-722.
30. R. Jain, D. Chiu, and W. Hawe, "A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems," DEC, Tech. Rep. DEC-TR-301, Sep. 1984.
31. S. He, J. Chen, Y. Sun, D. Yau, and N. Yip, "On optimal information capture by energy-constrained mobile sensors," IEEE Trans. Vehicular Technol., vol. 59, no. 5, pp. 2472-2484, Sep. 2010.
32. X. Cao, J. Chen, C. Gao, and Y. Sun, "An optimal control method for applications using wireless sensor/actuator networks," Comp. Elect. Eng., vol. 35, pp. 748-756, 2009.