• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.103-108
• /
• 2015

Maintaining efficient energy consumption and elongating network lifetime are the key issues in wireless sensor networks. Existing routing protocols usually select the cluster heads based on the proximity to the sensor nodes. In this case the cluster heads can be placed farther to the base station, than the distance between the sensor nodes and the base station, which yields inefficient energy consumption. In this work we propose a novel algorithm that select the nodes in a cluster and the cluster heads based on the locations of related nodes. We verify that the proposed algorithm gives better performance in terms of network life time than existing solutions.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.791-801
• /
• 2011

Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.11
• /
• pp.1241-1248
• /
• 2014

An efficient battery usage of sensor nodes is main goal in a sensor network, which is the substructure of Internet of Things. Maximizing the battery usage of sensor nodes makes the lifetime of sensor network increase as well as the reliability of the network improved. The previous solutions to solve these problems are mainly focused on the cluster head selection based on the remaining energy. In this paper, we consider both the head selection and the replacement interval which is determined by a threshold that is based on the remaining energy, density of alive nodes, and location. Our simulation results show that the proposed scheme has outstanding contribution in terms of maximizing the life time of the network and balancing energy consumption of all nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.111-118
• /
• 2010

The proposed algorithm to be explained in this paper is the localization technique using directional antenna. Here, it is assumed that anchor node has the ability to transfer the azimuth of each sector using GPS modules, sector antenna, and the digital compass. In the conventional sensor network, the majority of localization algorithms were capable of estimating the position information of the sensor node by knowing at least 3 position values of anchor nodes. However, this paper has proposed localization algorithm that estimates the position of nodes to continuously move with sensor nodes and traveling nodes. The proposed localization mechanisms have been simulated in the Matlab. The simulation results show that our scheme performed better than other mechanisms (e.g. MCL, DV-distance).

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.541-548
• /
• 2006

Sensor network is a network for realizing the ubiquitous computing circumstances, which aggregates data by means of observation or detection deployed at the inaccessible places with the capacities of sensing and communication. To realize this circumstance, data which sensor nodes gathered from sensor networks are delivered to users, in which it is required to encrypt the data for the guarantee of secure communications. Therefore, it is needed to design key management scheme for encoding appropriate to the sensor nodes which feature continual data transfer, limited capacity of computation and storage and battery usage. We propose a key management scheme which is appropriate to sensor networks organizing hierarchical architecture. Because sensor nodes send data to their parent node, we can reduce routing energy. We assume that sensor nodes have different security levels by their levels in hierarchy. Our key management scheme provides different key establishment protocols according to the security levels of the sensor nodes. We reduce the number of sensor nodes which share the same key for encryption so that we reduce the damage by key exposure. Also, we propose key update protocols which take different terms for each level to update established keys efficiently for secure data encoding.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.39-47
• /
• 2015

In this paper, we propose a new time synchronization algorithm using CoAP(constrained-application protocol) in sensor network environment, which handles a technique that synchronizes an explicit timestamp between sensor nodes not including an additional module for time-setting and sensor node gateway linked to internet time server. CoAP is a standard protocol for sensor data communication among sensor nodes and sensor node gateway to be built much less memory and power supply in constrained network surroundings including serious network jitter, packet losses, etc. We have supplied an exact time synchronization implementation among small and cheap IP-based sensor nodes or non-IP based sensor nodes and sensor node gateway in sensor network using CoAP message header's option extension. On behalf of conventional network time synchronization method, as our approach uses an exclusive protocol 'CoAP' in sensor network, it is not to become an additional burden for synchronization service to sensor nodes or sensor node gateway. This method has an average error about 2ms comparing to NTP service and offers a low-cost and robust network time synchronization algorithm.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.225-228
• /
• 2005

A context-aware services platform supporting mobile agents consists of sensor nodes and a sensor coordinator. Sensor nodes collect environmental information and transmit the collected information to the sensor coordinator through wireless sensor networks. The sensor coordinator passes the information to the context-aware service module, and the mobile agent. The context-aware service module or the mobile agent performs services suitable for a user's situation based on the environmental information and a service actuation message is delivered to an actuation node through the sensor coordinator. In this paper, we present a context-aware services platform structure employed in our project, and describe context-aware services platform interfaces with a context-aware service module and mobile agents.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2008.03a
• /
• pp.1324-1331
• /
• 2008

Recently, landslides have frequently occurred on natural slopes during periods of intense rainfall. With a rapidly increasing population on or near steep terrain in Korea, landslides have become one of the most significant natural hazards. Thus, it is necessary to protect people from landslides and to minimize the damage of houses, roads and other facilities. To accomplish this goal, many landslide prediction methods have been developed in the world. In this study, a simple landslide prediction system that enables people to escape the endangered area is introduced. The system is focused to debris flows which happen frequently during periods of intense rainfall. The system is based on the wireless sensor network (WSN) that is composed of sensor nodes, gateway, and server system. Sensor nodes and gateway are deployed with Microstrain G-Link system. Five wireless sensor nodes and gateway are installed at the man-made slope to detect landslide. It is found that the acceleration data of each sensor node can be obtained via wireless sensor networks. Additionally, thresholds to determine whether the slope will be stable or not are proposed using finite element analysis. It is expected that the landslide prediction system by wireless senor network can provide early warnings when landslides such as debris flow occurs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1249-1272
• /
• 2016

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.482-486
• /
• 2008

When we design a sensor nodes, a energy-consumption of sensor nodes centers on design concerns to prolong lifetime of sensor network. In recent year, many researches have attempted to study this issue. One of that is TTDD(Two-Tier Data Dissemination approach) proposed to support a sensor network which includes several mobile sensor nodes. But it gives rise to a problem which increasing control packet for the formation and maintenance a grid structure. Therefore, we proposed a Energy-Efficient Routing Protocol used a permanent grid structure for reducing control packets in a sensor network.