A new data gathering scheme based on set cover algorithm for mobile sinks in WSNs

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2008, Pages 725-729

  Sasaki, Yutaro ^a   Nakayama, Hidehisa ^a   Ansari, Nirwan ^b   Nemoto, Yoshiaki ^a   Kato, Nei ^a  

^a TOHOKU UNIVERSITY   (Japan)

^b NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING METHODS; DATA GATHERING; ISOLATED NODES; MICROELECTROMECHANICAL SYSTEMS; MOBILE SINKS; MOBILITY SCHEMES; PACKAGING TECHNOLOGIES; SET COVER; SIMULATION RESULT; SMALL DEVICES;

SENSORS; SOLID STATE DEVICES; TELECOMMUNICATION EQUIPMENT; WIRELESS SENSOR NETWORKS;

SENSOR NODES;

EID: 67449102707     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2008.ECP.145     Document Type: Conference Paper

References (18)

1. J. Kahn, R. Katz, and K. Pister, "Next century challenges: mobile networking for smart dust," in Proc. of ACM/IEEE Int. Conf. on Mobile Comput. andNetw., Seattle, USA., Aug. 1999, pp. 271-278.
2. 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 Networks, vol. 1, no. 2-3, pp. 215-233, Sep. 2003.
3. H. Nakayama, N. Ansari, A. Jamalipour, and N. Kato, "Fault-resilient sensing in wireless sensor networks," Comput. Commun. archive, vol. 30, no. 11-12, pp. 2375-2384, Sep. 2007.
4. K. Fukunaga, Statistical Pattern Recognition, 2nd Ed., Academic Press, 1990.
5. 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.
6. S. Lindsey, C. Raghavendra, and K. Sivalingam, "Data gathering algorithms in sensor networks using energy metrics," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 9, pp. 924-935, Sep. 2002.
7. Y. Yao and J. Gehrke, "The Cougar Approach to In-Network Query Processing in Sensor Networks," ACM SIGMOD, vol. 31, no. 3, pp. 9-18, Sep. 2002.
8. S. Madden, etal., "TAG: a Tiny AGgregation Service for Ad Hoc Sensor Networks," in Proc. of OSDI, Boston, USA., Dec. 2002, pp. 131-146.
9. S. Nath, P. Gibbons, S. Seshany, and Z. Andersony, "Synopsis Diffusion for Robust Aggregation in Sensor Networks," in Proc. of ACM SenSys, Baltimore, USA., Nov. 2004, pp. 250-262.
10. D. Johnson and D. Malt, "Dynamic source routing in ad hoc wireless networks," Mobile Computing, 1996, pp. 153-181.
11. R. Karp, "Reducibility Among Combinatorial Problems," in Complexity ofComputer Computations, New York, USA., 1972, pp. 85-103.
12. D. Johnson, "Approximation algorithms for combinatorial problems," in Proc. ofACM symp. Theory ofcomput., Austin, USA., 1973, pp. 38-49.
13. D. Johnson and L. McGeoch, The Traveling Salesman Problem: A Case Study in Local Optimization, John Wiley & Sons, 1997.
14. N. Ansari and E. Hou, Computational Intelligence for Optimization, Springer, 1997.
15. M. Garey and D. Johnson, Computers and Intractability: A Guide to the theory ofNP-Completeness, W. Freeman and Company, 1979.
16. C. Intanagonwiwat, et al., "Directed diffusion for wireless sensor networking," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 2-16, Feb. 2003.
17. B. Krishnamachari and J. Heidemann, "Application-specific modelling of information routing in wireless sensor networks," in Proc. of IEEE Int. Conf. on Performance, Comput., and Commun., Phoenix, USA., Apr. 2004, pp. 717-722.
18. R. Jain, D. Chiu, and W. Hawe, "A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems," DEC Technical Report, DEC-TR-301, Sep. 1984.