• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1188-1197
• /
• 2010

A most important thing in a connected dominating set(CDS)-based routing in a wireless ad-hoc network is to select a minimum number of dominating nodes and then build a backbone network which is made of them. Node failure in a CDS is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. It is necessary to minimize the frequency of reconstruction of a CDS to reduce message overhead due to message flooding. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. With the proposed algorithm, the resulting number of dominating nodes after partial reconstruction of CDS is not changed and also its execution time is faster than well-known algorithm of construction of CDS by 20~40%. In the case of high mobility situation, the proposed algorithm gives better results for the performance metrics, packet receive ratio and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.41-49
• /
• 2009

A crucial issue in deploying wireless sensor networks is to perform a sensing task in an area of interest in an energy-efficient manner since sensor nodes have limited energy Power. The most practical solution to solve this problem is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy In this paper, we present a simple wake-up scheduling protocol, which can maintain sensing coverage required by applications and yet increase network lifetime by turning off some redundant nodes. In order to do this, we use the concept of a weighted average distance. A node decides whether it is active or inactive based on the weighted average distance. The proposed protocol allows sensor nodes to sleep dynamically while satisfying the required sensing coverage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.10
• /
• pp.801-807
• /
• 2013

WSN consists of hundreds to thousands of sensor nodes. In order to solve the problem of energy consumption imbalance cluster head is reelected in every round, while node authentication scheme is utilized for secure communication. However, re-clustering increases the overhead of sensor nodes and during the node authentication phase the frequent AREQ/AREP message exchange also increases the overhead. Therefore, a secure and energy efficient protocol, by which overhead of sensor nodes is reduced and long time communication is achieved, is required for wireless sensor network. In this paper, an energy efficient and reliable IDE-LEACH protocol for WSN is proposed. The proposed protocol is prolongs networks lifetime about average 20% compared to the LEACH-based protocols and all attending nodes in communication form BS authentication consisted of trusted nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.839-842
• /
• 2011

Lately Various researches on energy harvesting techniques for wireless sensor networks have been performed to overcome the power limitation of sensor nodes. In wireless sensor networks with harvesting techniques, sensor nodes exploit environmental energy, such as solar or wind energy, as the power sources of the nodes. Existing energy constrained environment routing protocols may not be suitable for energy harvesting based wireless sensor networks because they do not consider the accumulated energy from harvesting devices. In addition, the paths which aren't dispersed shorten the network lifetime. Therefore, in this paper, the algorithm that the path between each node is dispersed is proposed. In case of using the algorithm to be proposed through the simulator it showed that path of the node is variously reflected.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1519-1523
• /
• 2007

In this paper, we propose the fast and secure binding update protocol as handoff or handover in the micro and pico environment based on mobile IPv6. The nodes or routers on participating in this protocol generate their addresses from cryptographically generated addresses (CGAs) method unlike previous address generation method. The mobile node (MN) includes in home network or home link has limited power and computational abilities. So the home agent (HA) of the MN executes key agreement protocol with the correspondent node (CN) on behalf of the MN. The CN then creates a ticket on including session key, lifetime of ticket. and so on. It then transmits it to the MN via the HA of the MN. The ticket is used to communicate directly between the MN and its CN. In performance analysis, we analyze security of proposed binding update protocol under various attack scenarios and efficiency by comparing proposed protocol with prior binding update protocols. Finally we make a conclusion of this paper and present future works.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1071-1075
• /
• 2010

Because a sensor node in wireless sensor networks(WSNs) has limited resources, such as battery capacity and memory, data aggregation techniques have been studied to manage the limited resources efficiently. Because sensor network uses wireless communication, a data can be disclosed by attacker. Thus, the study on data protection schemes for data aggregation is essential in WSNs. But the existing data aggregation methods require both a large number of computation and communication, in case of network construction and data aggregation processing. To solve the problem, we propose a data protection scheme based on Hilbert-curve for data aggregation. Our scheme can minimizes communications among neighboring sensor nodes by using tree-based routing. Moreover, it can protect the data from attacker by doing encryption through a Hilbert-curve technique based on a private seed, Finally, we show that our scheme outperforms the existing methods in terms of message transmission and average sensor node lifetime.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.11
• /
• pp.2187-2192
• /
• 2016

A data-centric routing protocol considering a data aggregation technique at relay nodes is required to increase the lifetime of wireless sensor networks. An energy-efficient data-centric routing algorithm is proposed by considering a tradeoff between acquisition time and energy consumption in the wireless sensor network. First, the proposed routing scheme decides the sink node among all sensor nodes in order to minimize the maximum distance between them. Then, the proposed routing extends its tree structure in a way to minimize the link cost between the connected nodes for reducing energy consumption while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed data-centric routing algorithm has short information acquisition time and low energy consumption; thus, it achieves high energy efficiency in the wireless sensor network compared to conventional routing algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.5
• /
• pp.3421-3425
• /
• 2015

In sensor networks, sensor nodes are usually distributed to manage the networks in continuous unique area, however as by the network property nodes can be located in several areas. The data gathering of distributed nodes to several areas can be different with current continuous area. Hence, the distributed networks can be differently managed to the current continuous networks. In this paper, we describe the data gathering of sensor nodes in distributed sensor areas. It is possible that sensor nodes cannot instantly connect the mobile sink, and the node operation should be considered. The real time data sending to the instant connection scheme of mobile sink can be implemented, but the property of mobile sink should be considered for the sink connection of distributed areas. In this paper, we analyze the proposed scheme by the simulation results. The simulation results show that the overall lifetime to the periodic data gathering method is longer than the threshold method.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.733-742
• /
• 2002

It has been known that the host mobility feature has very significant impact on the QoS (Quality of Service), which is usually required to a real-time multimedia application. The existing QoS support mechanisms to provide the real-time services to fixed network environment, like as RSVP, are inadequate to accommodate the mobile hosts which can frequently change their point of attachments to the fixed network. So, MRSVP (Mobile RSVP) protocol has been proposed to reduce the impacts of host mobility on QoS guarantees, in which a mobile host needs to make advance resource reservations at multiple locations it may possibly visit during the lifetime of the connection. This paper proposes a dynamic dual anchor node (DDAN) architecture which integrates the MRSVP and RSVP tunnel, in addition to the Mobile IP Regional Registration protocol. By limiting the resource reserved in local area, it preserves the lower level of resource reservation, but provides approximately the same degree of QoS support as the existing MRSVP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3494-3510
• /
• 2019

Wireless sensor networks encounter energy saving as a major issue as the sensor nodes having no rechargeable batteries and also the resources are limited. Clustering of sensors play a pivotal role in energy saving of the deployed sensor nodes. However, in the cluster based wireless sensor network, the cluster heads tend to consume more energy for additional functions such as reception of data, aggregation and transmission of the received data to the base station. So, careful selection of cluster head and formation of cluster plays vital role in energy conservation and enhancement of lifetime of the wireless sensor networks. This study proposes a new mutation chemical reaction optimization (MCRO) which is an algorithm based energy efficient clustering protocol termed as MCRO-ECP, for wireless sensor networks. The proposed protocol is extensively developed with effective methods such as potential energy function and molecular structure encoding for cluster head selection and cluster formation. While developing potential functions for energy conservation, the following parameters are taken into account: neighbor node distance, base station distance, ratio of energy, intra-cluster distance, and CH node degree to make the MCRO-ECP protocol to be potential energy conserver. The proposed protocol is studied extensively and tested elaborately on NS2.35 Simulator under various senarios like varying the number of sensor nodes and CHs. A comparative study between the simulation results derived from the proposed MCRO-ECP protocol and the results of the already existing protocol, shows that MCRO-ECP protocol produces significantly better results in energy conservation, increase network life time, packets received by the BS and the convergence rate.