Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks

References

• Imielinski , T. and Goel , S. 2000 . DataSpace: querying and monitoring deeply networked collections in physical space . IEEE Personal Communications , 7 : 4 – 9 .
   Google Scholar
• Bulusu , N. , Heidemann , J. and Estrin , D. April 2000 . GPS-less low cost outdoor localization for very small devices , April , Computer Science Department, University of Sourthern California, Tech. Report 00–729 .
   Google Scholar
• Kalpakis , K. , Dasgupta , K. and Namjoshi , P. 2003 . Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks . Proceedings of the International Journal of Computer and Telecommunications Networking , 42 : 697 – 716 .
   Web of Science ®Google Scholar
• Du , H.-W. , Hu , X.-D. and Jia , X.-H. 2006 . Energy efficient routing and scheduling for real-time data aggregation in WSNs . Computer Communications , 29 : 3527 – 3535 .
   Google Scholar
• Annamalai , V. , Gupta , S. K. S. and Schwiebert , L. . On tree-based convergecasting in wireless sensor networks . Proceedings of the IEEE Wireless Communication and Networking Conference . pp. 1942 – 1947 .
   Google Scholar
• Kesselman , A. and Kowalski , D. . Fast distributed algorithm for convergecast in ad hoc geometric radio networks . Proceedings of the 2nd Annual Conference on Wireless On-demand Network Systems and Services . pp. 119 – 124 .
   Google Scholar
• Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness Freeman, San Francisco
   Google Scholar
• Ravi, R , R. 1994 . Rapid rumor ramification: approximating the minimum broadcast time . Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science , : 202 – 213 .
   Google Scholar
• Bar-Noy , A. , Guha , S. , Naor , J. and Schieber , B. 2000 . Message multicasting in heterogeneous networks . SIAM Journal on Computing , 30 : 347 – 358 .
   Google Scholar
• Gandhi , R. , Parthasarathy , S. and Mishŕa , A. 2003 . Minimizing broadcasting latency and redundancy in ad hoc networks . Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing , : 222 – 231 .
   Google Scholar
• Biedl , T. and Kant , G. 1998 . A better heuristic for orthogoanl graph drawings . Computational Geomety , 9 : 159 – 180 .
   Web of Science ®Google Scholar
• Lichtenstein , D. 1982 . Planar formulae and their uses . SIAM Journal on Computing , 11 : 329 – 343 .
   Web of Science ®Google Scholar
• Di Battista , G. , Liotta , G. and Vargiu , F. 1993 . “ Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs ” . In Proceedings of Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science , Vol. 709 , 151 – 162 . New York : Springer .
   Google Scholar
• Hunt , H. B. III , Marathe , M. V. , Radhakrishnan , V. , Ravi , S. S. , Rosenkrantz , D. J. and Stearns , R. E. 1998 . NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs . Journal of Algorithms , 26 : 238 – 274 .
   Google Scholar
• Krumke , S. O. , Marathe , M. V. and Ravi , S. S. 2001 . Models and approximation for channel assignment in radio networks . Wireless Networks , 7 : 575 – 584 .
   Google Scholar
• Varshnery , M. and Bagrodia , R. 2004 . Detailed models for sensor network simulations and their impact on network performance . Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems , : 70 – 77 .
   Google Scholar
• Khuller , S. , Raghavachari , B. and Young , N. 1995 . Balancing minum spanning trees and shortest path trees . Algorithmica , 14 : 305 – 321 .
   Google Scholar