Browse > Article

An Efficient Multiple Tree-Based Routing Scheme in Faulty Wireless Sensor Networks  

Park, Jun-Ho (충북대학교 정보통신공학)
Seong, Dong-Ook (충북대학교 정보통신공학)
Yeo, Myung-Ho (충북대학교 정보통신공학)
Kim, Hak-Sin (충북대학교 정보통신공학)
Yoo, Jae-Soo (충북대학교 정보통신공학)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.16, no.1, 2010 , pp. 75-79 More about this Journal
Abstract
Wireless sensor networks (WSN) are widely used in many applications. WSN acquires the data of surrounding environments with sensors attached to each node. It is important to design sensor networks that can communicate energy-efficiently as well as to get sensor readings with high accuracy. In this paper, we propose a novel routing scheme that assures high accuracy and significantly reduces data transmission costs in WSN with faults. First, we organize a number of network topologies randomly for routing sensor readings to the base station. Because every sensor node is connected each other with a single path, redundant transmissions are not incurred. It can reduce unnecessary transmissions and guarantee final sensor readings with high accuracy. To show the superiority of our scheme, we compare it with an existing multi-path routing scheme. In the result, our scheme has similar accuracy as the existing scheme and reduces unnecessary data transmissions by about 70% over the existing technique.
Keywords
Sensor network; Routing Tree; Routing Algorithm; Multiple Tree; Network Fault;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Kamra, A., Misra, V., and Rubenstein, D., "Count-Torrent: ubiquitous access to query aggregates in dynamic and mobile sensor network," Proc. of the 5th International Conference on Embedded Networked Sensor Systems, pp.43-57, 2007.
2 Nath, S., Gibbons, P. B., Seshan, S., and Anderson, Z., "Synopsis Diffusion for Robust Aggregation in Sensor Networks," Proc. of ACM Conference on Embedded Networked Sensor Systems, pp.250-262, 2004.
3 Culler, D., Estrin, D., and Srivastava, M., "Guest Editors' Introduction: Overview of Sensor Networks," IEEE Computer, vol.37, issue 8, pp.41-49, 2004.
4 Madden, S., Franklin, M. J., Hellerstein, J. M., and Hong, W., "TAG: a Tiny AGgregation service for ad-hoc sensor networks," Proc. of the 5th Symposium on Operating Systems Design and Implementation, pp.131-146, 2002.
5 Flajolet, P. and Martin, G. N., "Probabilistic Counting Algorithms for Database Applications," Journal of Computer and System Sciences, vol.31, issue 2, pp.182-209, 1985.   DOI   ScienceOn
6 Considine, J., Li, F., Kollios, G. and Byers, J., "Approximate Aggregation Techniques for Sensor Databases," Proc. of the 20th International Conference on Data Engineering, pp.449-461, 2004.
7 Manjhi, A., Nath, S. and Gibbons, P. B., "Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams," Proc. of the 2005 ACM SIGMOD International Conference on Management of Data, pp.287-298, 2005.