A Distributed Method for Bottleneck Node Detection in Wireless Sensor Network
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to the special property and difference from the traditional wireless network, the lifetime of the whole network is the most important aspect. The bottleneck nodes widely exist in WSNs and lead to decrease the lifetime of the whole network. In order to find out the bottleneck nodes, the traditional centralized bottleneck detection method MINCUT has been proposed as a solution for WSNs. However they are impractical for the networks that have a huge number of nodes. This paper first proposes a distributed algorithm called DBND (Distributed Bottleneck Node detection) that can reduce the time for location information collection, lower the algorithm complexity and find out the bottleneck nodes quickly. We also give two simple suggestions of how to solve the bottleneck problem. The simulation results and analysis show that our algorithm achieves much better performance and our solutions can relax the bottleneck problem, resulting in the prolonging of the network lifetime.
Abstract
Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to the special property and difference from the traditional wireless network, the lifetime of the whole network is the most important aspect. The bottleneck nodes widely exist in WSNs and lead to decrease the lifetime of the whole network. In order to find out the bottleneck nodes, the traditional centralized bottleneck detection method MINCUT has been proposed as a solution for WSNs. However they are impractical for the networks that have a huge number of nodes. This paper first proposes a distributed algorithm called DBND (Distributed Bottleneck Node detection) that can reduce the time for location information collection, lower the algorithm complexity and find out the bottleneck nodes quickly. We also give two simple suggestions of how to solve the bottleneck problem. The simulation results and analysis show that our algorithm achieves much better performance and our solutions can relax the bottleneck problem, resulting in the prolonging of the network lifetime.
참고문헌 (13)
- I. Akyildiz, "A Survey on Sensor Networks", IEEE Communications Magazine, 40(8), pp.102~114 (2002)
- Y. Yoo, "Mobile Sensor Relocation to Prolong the Lifetime of Wireless Sensor Networks", Proc. IEEE VTC‐Spring 2008, pp.193~197 (2008)
- X. Ji, "Sensor Positioning in Wireless Ad‐hoc Sensor Networks Using Multidimensional Scaling", Proc. IEEE INFOCOM, pp.2652~2661 (2004)
- F. Y. S. Lin, "A Near‐Optimal Sensor Placement Algorithm to Achieve Complete Coverage", Discrimination in Sensor Networks, 2005, pp.9(1), 43~45
- Mechthild Stoer, "A Simple Min‐Cut Algorithm", Journal of the ACM, 44(4), pp.585~591 (1997)
- Lizhi Xu, "Computer Mathematics of Modern Mathematics Handbook", pp.539~, Huazhong University of Science and Technology Press
- Ningning Hu, "A Measurement Study of Internet Bottlenecks", Proc. IEEE INFOCOM 2005, pp.1689~1700 (2005)
- S. Floyd, "Random early detection gateways for congestion avoidance", IEEE, 1993, pp.1(4), 397~413
- Heinzelman W, "Application‐Specific protocol architectures for wireless networks", 박사, pp.2000
- Handy MJ, "Low energy adaptive clustering hierarchy with deterministic cluster‐head selection", Proc. of the 4th IEEE Conf, on Mobile and Wireless Communications Networks (2002), IEEE Communications Society
- Haosong Gou, "A Partition‐Based Centralized LEACH Algorithm for Wireless Sensor Network Using solar Energy", Proceedings of the International conference on Convergence & Hybrid Information Technology 2009 (ICHIT 2009). (2009)
- Al‐Karaki JN, "Data aggregation in wireless sensor networks―Exact and approximate algorithms", Proc. of the IEEE Workshop on High Performance Switching and Routing, pp.241~245 (2004), IEEE Communications Society
- Younis O, "Heed: A hybrid, energy‐efficient, distributed clustering approach for ad‐hoc sensor networks", IEEE Trans. onMobile Computing,, 3(4), pp.660~669 (2004)