ACM Home Page
Please provide us with feedback. Feedback
Scalable and energy efficient data dissemination in wireless sensor networks
Full text PdfPdf (208 KB)
Source International Conference On Communications And Mobile Computing archive
Proceedings of the 2006 international conference on Wireless communications and mobile computing table of contents
Vancouver, British Columbia, Canada
SESSION: W2-E: sensors-- various issues table of contents
Pages: 1061 - 1066  
Year of Publication: 2006
ISBN:1-59593-306-9
Authors
Yang Sun  The University of Mississippi, University, MS
Guangbin Fan  Intel China Research Center, Beijing, China
Shigang Chen  The University of Florida, Gainesville, FL
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 71,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1143549.1143761
What is a DOI?

ABSTRACT

Data dissemination in wireless sensor networks is a key problem that acts as a bottleneck to its wide application in real world. In this paper, a novel data dissemination scheme ? logarithmic spiral data dissemination (LSDD) ? is proposed. In LSDD, data advertisements are disseminated following a parametric spiral-like path, which involves only a small fraction of nodes in a dense sensor network. By exploiting the nice feature of spiral, the scheme scales well for large sensor networks while saving much energy in the data dissemination process. By both numerical analysis and simulations, we show the distinct merits of LSDD as lower dissemination cost, better scalability, and better fault tolerance when compared to flooding-based schemes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
5
 
6
 
7
Z. J. Haas, J. Y. Halpern, and L. Li, "Gossip-based Ad Hoc Routing," in Proceedings of INFOCOM 2002, Ithaca, NY, June 2002, pp. 1707--1716.
8
 
9
 
10
Y. Yu, R. Govindan, and D. Estrin, "Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks," UCLA Computer Science Department, Tech. Rep. UCLA/CSD-TR-01-0023, May 2001. {Online}. Available: http://citeseer.ist.psu.edu/yu01geographical.html
11
 
12
R. C. Archibald, "The Logarithmic Spiral," Amer. Math. Monthly, no. 25, pp. 189--193, 1918.
 
13
E. W. Weisstein, "Logarithmic Spiral," From MathWorld-A Wolfram Web Resource. {Online}. Available: http://mathworld.wolfram.com/LogarithmicSpiral.html
14
 
15
Chipcon Inc., "CC1000 Datasheet v2.3," 2005. {Online}. Available: http://www.chipcon.com/files/CC1000 Data Sheet 2 3.pdf

Collaborative Colleagues:
Yang Sun: colleagues
Guangbin Fan: colleagues
Shigang Chen: colleagues