Min-Sook Jin

Energy-Efficient Data Dissemination Protocol for Detouring Routing Holes in Wireless Sensor Networks

Void areas (holes) as an inevitable phenomenon exist in geographic routing of wireless sensor networks, because the unpredictable and harsh nature application environment or uneven energy consumption. Most of the existing schemes for the issue tend to construct a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the perimeter of the hole; thus it may enlarge the hole. At the same time, traffic would concentrate on the peripheral node of the hole; thus the nodes on the perimeter of the hole tend to be depleted quickly. In previous work, we have proposed a hole geometric model to reduce the energy consumption and packet collisions of the nodes on the hole boundary. This scheme, however, still has the static detour path problem. Therefore, we extend the previous work by constructing a dynamic detour path hole geometric model for wireless sensor networks in this paper. The location of hole detour anchor is dynamically shifted according to Gaussian function, just generating dynamic hole detour paths.

Sink Location Service for Geographic Routing in Wireless Sensor Networks

Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of the sinks. How can source nodes get sinks locations with low overhead is a difficult issue in wireless sensor networks. In this paper, we propose a Sink Location Service for geographic routing in wireless Sensor Networks. In this scheme, a source node and a sink node send sink location announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the sink location. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper. Simulation results show that our protocol is significantly superior to other protocols in terms of energy consumption and control overhead.

Novel strategy for data dissemination to mobile sink groups in wireless sensor networks

In wireless sensor networks, studies in terms of data dissemination to individual mobile sinks traditionally rely on a strategy that consists of a virtual infrastructure to service current location of the sinks and per-sink foot-print chaining to support local mobility after location update. To adapt the strategy for supporting mobile sink groups, it might be simply considered to use a representative per a sink group in order to representatively update location and representatively make a foot-print chain. However, it may lead to considerable problems with respect to efficiency and robustness for data dissemination: inefficient data collection problem, intra-group location update problem, and relay path loss problem. In this letter, we propose a novel strategy for data dissemination decoupled with any member sink of a mobile sink group. In order to independently deal with a mobile sink group, the strategy is composed of three mechanisms: representative location update, distributed data collection, and per-group foot-print chaining.

A Predictable Mobility-Based Data Dissemination Protocol for Wireless Sensor Networks

Many dissemination protocols on the mobility support in wireless sensor networks have been designed based on the assumption that the movement trace of sinks is random. However, the mobility of the sinks in many applications, for example, the movement traces of a soldier on operation in a battle field or a firelight on rescue operation in the disaster area, can be determined in advance since they move in accordance with the decided operation or the drill regulation to perform their task. In this paper, we propose a Predictable Mobility-based Data Dissemination protocol (PMDD) that enables data to directly route from source nodes to moving sinks by taking into consideration predictable movement behavior of the sinks. We also compare the performance of the PMDD with those of other dissemination protocols with random movement behavior of the sinks, and show the superiority of the PMDD based on network lifetime, data delivery ratio, and delay latency.

Sink Location Service via Inner Rectangular in Wireless Sensor Networks

Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure location information instead of global topology information to route data packets. Geographic routing requires the source nodes to be aware of the location of the sink nodes. How source nodes efficiently obtain the sink location information has been merely studied yet. In this paper, we propose a Sink Location Service via Inner Rectangular in Wireless Sensor Networks. A source node and a sink node send location queries and location announcement messages to specified direction respectively by geographic routing; thus, a sink location query path and a sink location announcement path is generated. The node located on a crossing point of these two paths informs the source node about the sink location information. Then the source node sends data to the sink node by geographic routing. The proposed scheme constructs a virtual restricted linear flooding zone inside the network to guarantee the existence of the crossing point. Simulation results show that proposed scheme is reliable and efficient than the existing protocols.

A Data Dissemination Model Base on Content-Based Publish/Subscribe Paradigm in Large-Scale Wireless Sensor Networks

In large scale internet network, the research in area of event detection and report publish/subscribe communications paradigm is being progressed. Data-centric is the basic characteristic of data transmission mode of the publish/subscribe communications paradigm. Such characteristic coincides with the wireless sensor network. The publish/subscribe communications paradigm performs task in manner of space, time and synchronous decoupling. The publish/subscribe communications paradigm with such property is tend to be applied to the wireless sensor network. However, existing algorithms do not satisfy the three decoupling modes in wireless sensor network. Therefore, this paper applies the publish/subscribe communications paradigm to the wireless sensor network and proposes a model to solve the energy consumption problem. The proposed communication model satisfies the three decoupling modes by using Embedded Grid Structure (EGS) in the wireless sensor network. Simulation results show that proposed model is energy-efficient compared with other protocols.

Localized mechanism for continuous objects tracking and monitoring in wireless sensor networks

This paper addresses issues for tracking and monitoring continuous objects, such as poison gas, biochemical, and chemical liquid in wireless sensor networks. These continuous objects are quite different from the individual objects, such as people, animals, and vehicles in that they are continuously distributed across a region and usually occupy a large area. Accordingly, they are detected and sensed by many sensor nodes, and their sensing data are redundant and highly correlated. Hence, there needs any efficient scheme on collecting and aggregating locally their sensing data and generating the data report. The continuous objects also tend to diffuse, changes in shape, increases the size, even splits into multiple smaller continuous objects, or join together one continuous object. Accordingly, there also need any efficient scheme to manage efficiently the dynamic change of shape of the continuous objects. Therefore, we introduce Dynamic Rectangle Zone-based Collaboration Mechanism for detecting, tracking, and monitoring the continuous objects taking into account the dynamic change of their shape. The proposed mechanism constructs a dynamic rectangle zone included the area occupied by one continuous object. One center node in the zone collects and aggregates the sensing data from sensor nodes which detect the continuous object. The dynamic rectangle zone change newly according to dynamic change of the continuous object and the center node is also altered by another node to minimize the energy consumption for collecting the sensing data. Through simulation results, we also evaluate how environmental factors and control parameters affect the performance of the proposed mechanism.

A Communication Architecture for Supporting Mobile User in Wireless Sensor Networks

Typical sensor networks consist of users, sinks, and a number of sensor nodes. The traditional architecture usually assumes that there is a legacy network between users and sinks. However, practical users like firefighters and soldiers move around sensor fields and they might not have any direct communication through legacy networks. In other words, sensor networks are the only communication channel between users and sinks in practical sensor fields. Now there are no researches with respect to architecture to support the user mobility. Thus it is necessary to deliberate a new architecture for such the issue. In this paper, we present a novel communication architecture where a user operates around an infrastructureless sensor field. We, then, propose a new networking model, named dynamic sink model, to support user mobility on the novel architecture. In the model a sink is temporarily selected among generic sensor nodes by a user when the user wants to get information from a sensor network. The chosen sink gathers data from sensor nodes for interested tasks and propagates collected information to the user via the sensor network. We evaluate and explore performance of the dynamic sink model on the novel architecture with regard to average delay, delivery ratio, and network lifetime compared with the common static sink model on typical communication architecture.

A Energy efficient data-dissemination protocol with multiple virtual grid in wireless sensor network

Sensor networks are composed of a great number of sensor nodes. Since all sensor nodes are energy-restricted and hardly to recharge. So in order to prolong network life, it is very important to minimize energy consumption. However, the energy consumption may significantly increase if mobile sources or sinks exist in sensor networks. The reason is that the routing information for mobile sources and sinks needs to be update frequently for efferent data delivery. The routing algorithm supporting mobile sinks should consider not only continuous data delivery but also the energy consumption of sensor nodes. However, most of existing research e.g. [2, 3] focuses on even energy consumption while rarely considers the mobility of sinks and sources. In this paper, we propose an efficient routing protocol with multiple virtual grid to reduce energy consumption and improve packets delivery efficiency. Simulation results show that our algorithm can guarantee high data delivery ratio and low average delivery delay, while consumes lower energy then existing routing protocols in sensor networks.

Communication Scheme for Loosely Coupled Mobile User Groups in Wireless Sensor Fields

We propose a communication mechanism to support mobility of loosely coupled mobile users in sensor applications with multiple sources. First, we examine problems for mobility support of the loosely coupled users in wireless sensor networks with multiple source nodes, and then study the dynamic sink communication model to support a mobile user with sink-oriented tree based data gathering from multiple sources and data-centric unicasting. Finally, we present an energy-efficient solution to support the loosely coupled mobile users through single datagathering tree establishment with a distributed manner and the gathering tree based data-centric multicasting.