Dynamic Tree-Based Energy-Efficient Routing Algorithm in Sensor Networks Hyung-Soon Park Department of Software Engineering, Graduate School of Kumoh National Institute of Technology Abstract Sensor Networks contain hundreds or thousands of sensor nodes. Basically, each sensor node comprises sensing...
Dynamic Tree-Based Energy-Efficient Routing Algorithm in Sensor Networks Hyung-Soon Park Department of Software Engineering, Graduate School of Kumoh National Institute of Technology Abstract Sensor Networks contain hundreds or thousands of sensor nodes. Basically, each sensor node comprises sensing, processing, transmission, mobilizer, position finding system, and power units (some of these components are optional like mobilizer). Each of these sensor nodes has the capability to collect and route data either to other sensors or back to an external base station(s). The development of sensor networks was originally motivated by military applications. But, lately the focus of that has moved in many civilian application areas, including environment and healthcare applications, home automation, traffic control , and other industrial fields. However, there are still many crucial problems with the deployment of such large sensor networks: limited storage, limited network bandwidth, poor inter-node communication, limited computational ability, and limited power of the sensor nodes. We focus on the latter problem, i.e., reducing power consumption in sensor networks. In this paper, we propose an energy-efficient dynamic routing tree algorithm(EDRT) in the sensor networks. The idea of the EDRT is to maximize in-network processing opportunities using the parent nodes and friend nodes. In-network processing reduces the number of message transmissions by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message, resulting in reduction of communication cost. Our experimental results prove that our proposed method can reduce message transmissions more than query specific routing tree(QSRT) and flooding-based routing tree(FRT).
Dynamic Tree-Based Energy-Efficient Routing Algorithm in Sensor Networks Hyung-Soon Park Department of Software Engineering, Graduate School of Kumoh National Institute of Technology Abstract Sensor Networks contain hundreds or thousands of sensor nodes. Basically, each sensor node comprises sensing, processing, transmission, mobilizer, position finding system, and power units (some of these components are optional like mobilizer). Each of these sensor nodes has the capability to collect and route data either to other sensors or back to an external base station(s). The development of sensor networks was originally motivated by military applications. But, lately the focus of that has moved in many civilian application areas, including environment and healthcare applications, home automation, traffic control , and other industrial fields. However, there are still many crucial problems with the deployment of such large sensor networks: limited storage, limited network bandwidth, poor inter-node communication, limited computational ability, and limited power of the sensor nodes. We focus on the latter problem, i.e., reducing power consumption in sensor networks. In this paper, we propose an energy-efficient dynamic routing tree algorithm(EDRT) in the sensor networks. The idea of the EDRT is to maximize in-network processing opportunities using the parent nodes and friend nodes. In-network processing reduces the number of message transmissions by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message, resulting in reduction of communication cost. Our experimental results prove that our proposed method can reduce message transmissions more than query specific routing tree(QSRT) and flooding-based routing tree(FRT).
※ AI-Helper는 부적절한 답변을 할 수 있습니다.