• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3218-3226
• /
• 2009

A number of on-demand routing protocols for sensor networks have been proposed yet. However, the majority of proposed on-demand routing protocols for sensor networks are not suitable for a relatively poor wireless environment and sensor applications requiring reliable data transmission due to using a hop-count metric for their protocols. In this paper, we proposed a minimum LQI(Link Quality Indicator) based on-demand sensor network routing protocol that is suitable for a relatively poor wireless environment and implemented the proposed routing protocol on a TinyOS. We also compared the implemented protocol with typical hop count based routing protocol by carrying out performance experiments on a multi-hop testbed. The results from these experiments showed that the successful transmission rate of the proposed routing protocol is higher than that of typical hop count based routing protocol over a poor wireless link.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.534-543
• /
• 2006

As the topology frequently varies, more cluster reconstructing is needed and also management overheads increase in the wireless ad hoc/sensor networks. In this paper, we propose a multi-hop clustering algorithm for wireless sensor network topology management using dynamic pre-clusterhead scheme to solve cluster reconstruction and load balancing problems. The proposed scheme uses weight map that is composed with power level and mobility, to choose pre-clusterhead and construct multi-hop cluster. A clusterhead has a weight map and threshold to hand over functions of clusterhead to pre-clusterhead. As a result of simulation, our algorithm can reduce overheads and provide more load balancing well. Moreover, our scheme can maintain the proper number of clusters and cluster members regardless of topology changes.

• The KIPS Transactions:PartC
• /
• v.18C no.3
• /
• pp.167-178
• /
• 2011

As the growth of ubiquitous services, various types of ad hoc networks have emerged. In particular, wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are widely known ad hoc networks, but there are also other kinds of wireless ad hoc networks in which the characteristics of the aforementioned two network types are mixed together. This paper proposes a variant of the Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol modified to be suitable in such a combined network environment. That is, the proposed routing protocol provides node detection and route discovery/maintenance in a network with a large number of mobile sensor nodes, while preserving node mobility, network connectivity, and energy efficiency. The proposed routing protocol is implemented with a multi-hop multi-path algorithm, a topology reconfiguration technique using node movement estimation and vibration sensors, and an efficient path selection and data transmission technique for a great many moving nodes. In the experiments, the performance of the proposed protocol is demonstrated by comparing it to the conventional LEACH protocol.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.556-560
• /
• 2010

In the wireless sensor networks using a multi-hop, quality variation of links occurs irregularly due to the hardware restriction and environmental factor. If an appropriate route, which is affected by the quality variation, is not selected. Traditionally, a beacon is periodically broadcasted and the link quality is estimated. However, the periodically beacon based scheme cannot efficiently estimate the quality of the link changing irregularly. In this paper, a scheme to estimate the link quality adaptively according to network state is proposed. When the link quality changes, the scheme adapts to a change agilely and packet losses are reduced. When there is no change of the link quality, the link quality is estimated in the long period and the energy consumption is reduced. Through performance evaluations, we prove that our adaptive link estimation scheme improves the energy efficiency and packet reception ratio than the periodic estimation scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.1
• /
• pp.64-72
• /
• 2009

Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, but the re-search of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a technique for context gathering by mobile devices with the sink functionality added through fixed sinks under a previously built, cluster based multi hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing protocol, which was proposed for mobile sinks, it was conformed that performance increases in energy with the number of mobile sinks, and with the number of movements by mobile devices.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.48-57
• /
• 2008

Wireless sensor networks are composed of a lot of sensor nodes and they are used to monitor environments. Since many studies on wireless sensor networks have considered a stationary sink node, they cannot provide fully ubiquitous applications based on a mobile sink node. In those applications, routing paths for a mobile sink node should be updated while a sink node moves in order to deliver sensor data without data loss. In this paper, we propose a method to continuously update routing paths for a mobile sink node which can be extended on hierarchical multi-hop routing protocols in wireless sensor networks. The efficiency of the proposed scheme has been validated through comparing existing method using a location based routing protocol by extensive computer simulation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.1
• /
• pp.11-14
• /
• 2015

WSN (Wireless Sensor Network) based on low-power is one of the core technologies in the ubiquitous society. In this paper, we present a border surveillance and control system in WSN environment. The system consists of static sensor node, mobile sensor node, static gateway, mobile gateway, server and mobile application. Mobile applications are divided into user mode and manager mode. So users monitor border surveillance through mobile phone and get information of border network environment without time and space constraints. In manager mode, for the flexible operation of nodes, manager can update to the software remotely and adjust the position of the mobile node. And also we implement a suitable multi-hop routing protocol for scalable low-power sensor nodes and confirm that the system operates well in WSN environment.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.47-59
• /
• 2009

Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we propose a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC). The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to the application-dependent and time-varying delay requirements. The TPC requests sensors to construct two types of links: direct and relay links. The direct links are used for control and forwarding time critical sensed data. On the other hand, the relay links are used only for data forwarding based on the user delay constraints, thus allowing the sensors to opportunistically use the most energy-saving links and forming a multi-hop path. Simulation results demonstrate that cluster-based delay-adaptive data gathering strategy (CD-DGS) saves a significant amount of energy for dense sensor networks by adapting to the user delay constraints.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.2
• /
• pp.114-119
• /
• 2010

Network technology has been developed rapidly for digital service in these days. ZigBee, one of the IEEE 802.15.4 protocols, supporting local communication has become the core technology in the wireless network area. In this paper we designed an integrated fire monitoring system using a mobile robot and the ZigBee sensor nodes which are deployed to monitor fires. When a fire breaks out, the image information of the scene of a fire is transmitted by an autonomous mobile robot and we also monitor the current position of the robot. Furthermore, the data around the place where the fire breaks out and the positions of the sensor nodes can be transmitted to a server via the multi-hop communication in the real time.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.33-39
• /
• 2010

In this paper, a data dissemination protocol that transmits data collected for Wireless Sensor Networks (WSNs) is newly proposed, and the proposed proactive protocol takes into account energy consumption minimized and delay time disseminated. The well-known SPMS (Shortest Path Mined SPIN) forms the shortest path-based routing table obtained by Bellman Ford Algorithm (BFA) and disseminates data using a multi-hop path in order to minimize energy consumption. The mentioned properties of SPMS cause memory burden to create and maintain the routing tables. In addition, whenever BFA is executed, it is necessary to suffer from the energy consumption and traffic occurred. In order to overcome this problem, a proactive dissemination protocol using Residual Energy and Signal Strength, called RESS, is proposed in this paper. Simulation results show that RESS outperforms SPMS up to 84% in terms of the number of traffic messages and the transmitted delay time of RESS is similar to that of SPMS using the shortest path.