• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.23-32
• /
• 2007

We propose a group-based security scheme for hierarchical wireless sensor networks. We model the network for secure routing with 3-tier sensor network comprised of three types of nodes: Base Station, Group Dominator and ordinary Sensor Nodes. Group-based deployment is performed using Gaussian (normal) distribution and show that more than 85% network connectivity can be achieved with the proposed model. The small groups with pre-shared secrets form the secure groups where group dominators form the backbone of the entire network. The scheme is devised for dealing with sensory data aggregated by groups of collocated sensors; i.e., local sensed data are collected by the dominating nodes and sent an aggregated packet to the base station via other group dominators. The scheme is shown to be light-weight, and it offers a stronger defense against node capture attacks. Analysis and simulation results are presented to defend our proposal. Analysis shows that robustness can significantly be improved by increasing the deployment density using both the dominating and/or ordinary sensor nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.98-106
• /
• 2013

The duty-cycle synchronization among mobile sensor nodes with energy-harvesting is very important. The nodes should keep their duty-cycle same to others as much as possible because they have to cooperate each other and to consume energy efficiently. The distribution of node position in network affects not only node connectivity but also the active time of synchronized nodes, and it relates to network life-time finally. In this paper, we introduce a network topology change algorithm (TCA) for energy-harvesting mobile sensor networks based on self-synchronized duty-cycling. The algorithm tries to change a network topology into a balanced topology where the mobile sensor nodes are unified according to the density of the number of nodes. For TCA, both fluid flow algorithm and flock dispersion algorithm are proposed and they are evaluated through the simulation in agent based modeling language. TCA is applied to the energy-harvesting mobile sensor networks to improve the synchronization of duty-cycle and to reduce the variation of energy consumption among nodes.

• Journal of Internet of Things and Convergence
• /
• v.6 no.3
• /
• pp.39-44
• /
• 2020

In this paper, we propose a SDN-based fog computing service mobility support scheme. Fog computing architecture has been attracted because it enables task offloading services to IoT(Internet of Things) devices which has limited computing and power resources. However, since static as well as mobile IoT devices are candidate service targets for the fog computing service, the efficient task offloading scheme considering the mobility should be required. Especially for the IoT services which need low-latency response, the new connection and task offloading delay with the new fog computing node after handover can occur QoS(Quality of Service) degradation. Therefore, this paper proposes an efficient service mobility support scheme which considers both task migration and flow rule pre-installations. Task migration allows for the service connectivity when the fog computing node needs to be changed. In addition, the flow rule pre-installations into the forwarding nodes along the path after handover enables to reduce the connection delay and service interruption time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.5
• /
• pp.578-587
• /
• 2003

The DSTM (Dual Stack Transition Mechanism), one of tunneling mechanism, is considered as the best solution in IPv4/IPv6 transition recently. The DSTM provides a method to assure IPv4/v6 connectivity based on 4over6 (IPv4-over-IPv6) tunneling and temporal allocation of a global IPv4 address to a host requiring such communication. A TEP (Tunnel End Point) operates as a border router between IPv6 domain and IPv4 Internet, which performs encapsulation and decapsulation of 4over6 tunneling packets to assure hi-directional forwarding between both networks. In this paper, we analyze basic standards of the IPv6 protocol. And, we design and implement a DSTM TEP daemon block. The TEP daemon analyzes a fevers tunneling packet that is forwarded by the DSTM node, establishes the TEP's 4over6 interface, and supplies communication between a DSTM and a IPv4-only node. Finally, we construct a DSTM testbed and measure performance of the DSTM TEP. Our observation results show that performance of TEP supports the DSTM service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.647-658
• /
• 2010

Many localization schemes estimate the locations of radio nodes based on the physical locations of anchors and the connectivity from the anchors. Since they only consider the knowledge of the anchors without else other nodes, they are likely to have enormous error in location estimate unless the range information from the anchors is accurate or there are sufficiently many anchors. In this paper, we propose a novel localization algorithm with the location knowledge of anchors and even one-hop neighbors to localize unknown nodes in the uniform distance from all the one-hop neighbors without the range information. The node in the uniform distance to its all neighbors reduces the location error relative to the neighbors. It further alleviates the location error between its actual and estimated locations. We evaluate our algorithm through extensive simulations under a variety of node densities and anchor placement methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1044-1047
• /
• 2013

Wireless Mesh Network (WMN) provides effective Internet Service accesses to users by utilizing multi-rate and multi-channel. In multi-rate networks, the Rate Anomaly (RA) problem occurs, the problem that low-rate link degrades the performance of high-rate link. In this paper we propose Rate Gap Minimum Channel Assignment (RGM-CA) protocol that select the minimal rate gap parent node and assign the channel in order to mitigates the rate anomaly problem. RDM-CA protocol is efficient because it consider rate anomaly, channel diversity and node connectivity.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.100-103
• /
• 2019

Due to the fourth industrial revolution called 'fusion and connection', interest in 'high connectivity society' and 'highland society' is increasing, and related objects are not limited to automation and connected cars. The Internet of Things is the main concern of the 4th Industrial Revolution and it is expected to play an important role in establishing the basis of the next generation mobile communication service. Several domestic and foreign companies have been studying various types of LPWANs for the construction of the Internet based on things, and there is Semtech's LoRaWAN technology as representative. LoRaWAN is a long-distance, low-power network designed to manage a large number of devices and sensors, with communications from hundreds to thousands to thousands of devices and sensors. In this paper, we analyze the optimum node capacity of gateway for maximum performance while reducing resource waste in using LoRaWAN.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.119-125
• /
• 2010

In ad-hoc networks, dynamically reconfigurable and temporary wireless networks, all mobile devices cooperatively maintain network connectivity with no assistance of base stations while they have limited amounts of energy that is used in different rates depending on the power level. Since every node has to perform the functions of a router, if some nodes die early due to lack of energy, it will not be possible for other nodes to communicate with each other and network lifetime will be shortened. Consequently, it is very important to develop a technique to efficiently consume the limited amounts of energy resources so that the network lifetime is maximized. In this paper, geographical localized routing is proposed to help making smarter routing decision using only local information and reduce the routing overhead. The proposed localized routing algorithm selects energy-aware neighbors considering the transmission energy and error rate over the wireless link, and the residual energy of the node, which enables nodes to achieve balanced energy-consumption and the network lifetime to prolong.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.5
• /
• pp.1-13
• /
• 2007

In this research, we found out that bridging nodes have great effect on the robustness of protein-protein interaction networks. Until now, many researchers have focused on node's degree as node's essentiality. Hub nodes in the scale-free network are very essential in the network robustness. Some researchers have tried to relate node's essentiality with node's betweenness centrality. These approaches with betweenness centrality are reasonable but there is a positive relation between node's degree and betweenness centrality value. So, there are no differences between two approaches. We first define a bridging node as the node with low connectivity and high betweenness value, we then verify that such a bridging node is a primary factor in the network robustness. For a biological network database from Internet, we demonstrate that the removal of bridging nodes defragment an entire network severally and the importance of the bridging nodes in the network robustness.