Browsing by Author "Chuang, Shun-Yu"

Now showing 1 - 4 of 4

Minimum-delay energy-efficient source to multisink routing in wireless sensor networks
(2007-01-01)
Chuang, Shun-Yu
;
Chen, Chien
;
Jiang, Chang-Jie
;
資訊工程學系
;
Department of Computer Science
This paper proposes a simple and scalable approach to multisink routing scheme in wireless sensor networks. Wireless sensor network is a rapidly growing discipline, with new technologies emerging and new applications wider development. In addition to providing light and temperature measurements, wireless sensor nodes have applications such as security surveillance, environmental monitoring, and wildlife watching. One potential problem in a sensor network is how to transmit packets efficiently from Single-Source to Multi-Sinks, Le., to gather data from a single sensor node and to deliver it to multiple clients who are interested in the data The difficulty of such a scenario is finding the minimum-cost multiple transmission paths. Many routing algorithms have been proposed to solve this problem. Most current algorithms address the reduction of power consumption, and potentially introduce a large delay. This paper proposes a novel multi-path routing algorithm, called Hop-Count based routing (HCR) algorithm, which considers energy cost and transmission delay simultaneously. A hop count vector (HCV) is introduced to support routing decision. Moreover, an additional pruning vector (PV) can further enhance energy efficiency.
Minimum-delay energy-efficient source to multisink routing in wireless sensor networks
(2007-12-01)
Chuang, Shun-Yu
;
Chen, Chien
;
Jiang, Chang-Jie
;
資訊工程學系
;
Department of Computer Science
This paper proposes a simple and scalable approach to multisink routing scheme in wireless sensor networks. Wireless sensor network is a rapidly growing discipline, with new technologies emerging and new applications under development. In addition to providing light and temperature measurements, wireless sensor nodes have applications such as security surveillance, environmental monitoring, and wildlife watching. One potential problem in a sensor network is how to transmit packets efficiently from single-source to multi-sinks, i.e., to gather data from a single sensor node and deliver it to multiple clients who are interested in the data. The difficulty of such a scenario is finding the minimum-cost multiple transmission paths. Many routing algorithms have been proposed to solve this problem. Most current algorithms address the reduction of power consumption, and potentially introduce a large delay. This paper proposes a novel multi-path routing algorithm, called hop count based routing (HCR) algorithm, which considers energy cost and transmission delay simultaneously. A hop count vector (HCV) is introduced to support routing decision. Moreover, an additional pruning vector (PV) can further enhance routing performance. The proposed algorithm also provides a maintenance mechanism to handle the consequence of faulty nodes. A failure of a node leads to an inaccurate HCV. Therefore, an efficient correction algorithm is necessary. An Aid-TREE (A-TREE) is applied to facilitate restricted flooding. This correction mechanism is more efficient than full-scale flooding for correcting the limited inaccurate HCVs. Finally, the impact of failed nodes is studied, and an algorithm, called Lazy-Grouping, is proposed to enhance the robustness of HCR. (C) 2007 Elsevier B.V. All rights reserved.
SmartBone: An energy-efficient smart backbone construction in wireless sensor networks
(2007-01-01)
Chuang, Shun-Yu
;
Chen, Chien
;
資訊工程學系
;
Department of Computer Science
Wireless sensor network is a rapidly growing discipline with new technologies emerging, and new applications under development. The nodes in a wireless network generally communicate with each other along the same wireless channel. Unfortunately, sharing among wireless channels decreases network performance due to radio interference, and also raises energy consumption due to packet retransmission when interference occurs. Many topology control algorithms have been proposed to solve these problems. One widely used strategy is the backbone method. Backbone algorithms aim to reduce the backbone size.. However, poor performance may be explored if only few backbone nodes are selected. Therefore, several heuristic algorithms such as SBC have been proposed. However, these algorithms cannot efficiently eliminate redundant nodes, and dramatically decrease performance, especially in relatively sparse networks. This study proposes a novel heuristic-based backbone algorithm called SmartBone to choose proper backbone nodes from a network. SmartBone includes two major mechanisms. Flow-Bottleneck preprocessing is adopted to find critical nodes, which act as backbone nodes to improve connectivity. Dynamic Density Cutback is adopted to reduce the number of redundant nodes depending on local area node density of network. SmartBone simultaneously considers the balance of network performance and energy savings. Significantly, the proposed algorithm has a 50% smaller backbone size than SBC, and improves the energy saving ratio from 25% using SBC to 40% using SmartBone. Moreover, SmartBone improves the packet delivery ratio from 40% to 90% when the density of sensor networks becomes relatively sparser.
SmartBone: An energy-efficient smart backbone construction in wireless sensor networks
(2007-07-01)
Chuang, Shun-Yu
;
Chen, Chien
;
資訊工程學系
;
Department of Computer Science
Wireless sensor network is a rapidly growing discipline with new technologies emerging, and new applications under development. The nodes in a wireless network generally communicate with each other along the same wireless channel. Unfortunately, sharing among wireless channels decreases network performance due to radio interference, and also raises energy consumption due to packet retransmission when interference occurs. Many topology control algorithms have been proposed to solve these problems. One widely used strategy is the backbone method. Backbone algorithms aim to reduce the backbone size. However, poor performance may be explored if only few backbone nodes are selected. Therefore, several heuristic algorithms such as SBC have been proposed. However, these algorithms cannot efficiently eliminate redundant nodes, and dramatically decrease performance, especially in relatively sparse networks. This study proposes a novel heuristic-based backbone algorithm called SmartBone to choose proper backbone nodes from a network. SmartBone includes two major mechanisms. Flow-Bottleneck preprocessing is adopted to find critical nodes, which act as backbone nodes to improve connectivity. Dynamic Density Cutback is adopted to reduce the number of redundant nodes depending on local area node density of network. SmartBone simultaneously considers the balance of network performance and energy savings. Significantly, the proposed algorithm has a 50% smaller backbone size than SBC, and improves the energy saving ratio from 25% using SBC to 40% using SmartBone. Moreover, SmartBone improves the packet delivery ratio from 40% to 90% when the density of sensor networks becomes relatively sparser.