Energy Efficient Correlated Data Aggregation for Wireless Sensor Networks

References

• Akyildiz , I.F. , Su , W. , Sankarasubramaniam , Y. and Cayirci , E. 2002 . Wireless sensor networks: A survey . Computer Networks Journal , 38 ( 4 ) March : 393 – 422 .
   Web of Science ®Google Scholar
• Park , Seung-Jong , Vedantham , R. , Sivakumar , R. and Akyildiz , I.F. May 2004 . “ A scalable approach for reliable downstream data delivery in wireless sensor networks ” . In ACM MOBIHOC May , 78 – 89 . Tokyo, , Japan
   Google Scholar
• Intanagonwiwat , Chalermek , Govindan , Ramesh and Estrin , Deborah . Aug 2000 . “ Directed diffusion: a scalable and robust communication paradigm for sensor networks ” . In MOBICOM Aug , 56 – 67 . Boston, , USA
   Google Scholar
• Karp , B. and Kung , H.T. Aug 2000 . “ Greedy perimeter stateless routing for wireless networks ” . In MOBICOM Aug , 243 – 254 . Boston, , USA
   Google Scholar
• Akan , O. B. and Akyildiz , I. F. 2005 . Event-to-sink reliable transport in wireless sensor networks . IEEE/ACM Transactions on Networking , 13 ( 5 ) October : 1003 – 1017 .
   Web of Science ®Google Scholar
• Zelikovsky , Alexander . 1996 . “ Better approximation bounds for the network and Euclidean Steiner Tree problems ” . In Tech. Rep. CS-96-06, University of Virginia, Charlottesville VA, USA
   Google Scholar
• Cristescu , R. , Beferull-Lozano , B. and Vetterli , M. Mar 2004 . “ On network correlated data gathering ” . In INFOCOM Mar , Hong Kong
   Google Scholar
• Karp , R. M. 1972 . Reducability Among Combinatorial Problems, Complexity of Computer Computations , Edited by: Miller , R. E. and Thatcher , J. W. New York : Plenum Press .
   Google Scholar
• Karger , David R. and Minkoff , Maria . 2000 . Building Steiner Trees with incomplete global knowledge . Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science ,
   Google Scholar
• Takahashi , H. and Matsuyama , A. 1980 . An approximate solution for the steiner problem in graphs . Math. Japonica 24 , 24 ( 1 ) Jan : 573 – 577 .
   Google Scholar
• Gilbert , E. N. and Pollak , H. O. 1968 . Steiner Minimal Trees . SIAM J. Applied Math , 16 : 1 – 20 .
   Web of Science ®Google Scholar
• Wang , Ning-Yang B. and Chang , Reui-Chuan . 1989 . An upper bound for the average length of the Euclidean Minimum Spanning Tree . J. Computer Math , 30 : 1 – 12 .
   Google Scholar
• W. Yuan, S. V. Krishnamurthy, and S. K. Tripathi, “Synchronization of Multiple Levels of Data Fusion in Wireless Sensor Networks,” 2003.
   Google Scholar
• Luo , Haiyun , Ye , Fan , Cheng , Jerry , Lu , Songwu and Zhang , Lixia . 2002 . TTDD - A Two-Tier Data Dissemination for Large-scale Sensor Networks . MOBICOM ,
   Google Scholar
• Ratnasamy , S. , Karp , B. , Yin , L. , Yu , F. , Estrin , D. , Govindan , R. and Shenker , S. 2002 . GHT - A geographic hash-table for datacentric storage . In First ACM International Workshop on Wireless Sensor Networks and their Applications ,
   Google Scholar
• Cristescu , R. and Vetterli , M. 2003 . Power efficient gathering of correlated data: Optimization,NP-completeness and heuristics . The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing , June
   Google Scholar
• Goel , A. and Estrin , D. 2003 . Simultaneous optimization for concave cost: Single sink aggregation or single source buy-at-bulk . ACM-SIAM Symposium on Discrete Algorithm ,
   Google Scholar
• Karp , R. M. 1972 . Reducibility among combinatorial problems . Complexity of Computer Computations , May : 85 – 103 .
   Google Scholar
• Hwang , F. K , Richards , D.S. and Winter , P. 1992 . The Steiner Tree Problem North-Holland
   Google Scholar
• Alon , N. and Spencer , J.H. 1992 . The Probabilistic Method , J. Wiley and Sons .
   Google Scholar
• Karp , B. and Kung , H. T. Aug 2000 . “ Gpsr: Greedy perimeter state routing for wireless networks ” . In MOBICOM Aug , 243 – 254 . Boston, USA
   Google Scholar