Skip Navigation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2005 E88-A(11):3063-3071; doi:10.1093/ietfec/e88-a.11.3063
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by TOBE, Y.
Right arrow Articles by SEZAKI, K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2005 The Institute of Electronics, Information and Communication Engineers

Special Section on Wide Band Systems -- Papers

Autonomous Configuration in Wireless Sensor Networks

Yoshito TOBE1, Niwat THEPVILOJANAPONG2 and Kaoru SEZAKI3

1 The author is with the Department of Information Systems and Multimedia Design, Tokyo Denki University, Tokyo, 101-8457 Japan. E-mail: yoshito{at}unl.im.dendai.ac.jp, 2 The author is with the Department of Information and Communication Engineering, the University of Tokyo, Tokyo, 113-8656 Japan. E-mail: wat{at}mcl.iis.u-tokyo.ac.jp, 3 The author is with the Center for Spatial Information Science (CSIS), the University of Tokyo, Tokyo, 153–8505 Japan. E-mail: sezaki{at}iis.u-tokyo.ac.jp

Because of the large scale of wireless sensor networks, the configuration needs to be done autonomously. In this paper, we present Scalable Data Collection (SDC) protocol, a tree-based protocol for collecting data over multi-hop, wireless sensor networks. The design of the protocol aims to satisfy the requirements of sensor networks that every sensor transmits sensed data to a sink node periodically or spontaneously. The sink nodes construct the tree by broadcasting a solicit packet to discover the child nodes. The sensor receiving this packet decides on an appropriate parent to which it will attach, it then broadcasts the same packet to discover its child nodes. Through this process, the tree is created autonomously without any flooding of the routing packets. SDC avoids periodic updating of routing information but the tree need to be reconstructed upon node failures or adding of new nodes. The states required on each sensor are constant and independent of network size, therefore SDC scales better than the existing protocols. Moreover, each sensor can make forwarding decisions regardless of the knowledge on geographical information. We evaluated the performance of SDC by using the ns-2 simulator and comparing with Directed Diffusion, DSR, AODV, and OLSR. The simulation results demonstrate that SDC achieves much higher delivery ratio, shorter delay, as well as high scalability in various scenarios.

Key Words: wireless sensor networks, configuration, autonomous, data collection, simulation

Manuscript received July 16, 2005. Final manuscript received July 16, 2005.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.