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

In this paper, delay-constrained data transmission is considered over error-prone networks. Network coding is deployed for efficient information exchange, and an approximate decoding approach is deployed to overcome potential all-or-nothing problems. Our focus is on determining the cluster size and its impact on approximate decoding performance. Decoding performance is quantified, and we show that performance is determined only by the number of packets. Moreover, the fundamental tradeoff between approximate decoding performance and data transfer rate improvement is analyzed; as the cluster size increases, the data transfer rate improves and decoding performance is degraded. This tradeoff can lead to an optimal cluster size of network coding-based networks that achieves the target decoding performance of applications. A set of experiment results confirms the analysis.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.30-35
• /
• 2015

The most important factor within the wireless sensor network is to have effective network usage and increase the lifetime of the individual nodes in order to operate the wireless network more efficiently. Therefore, many routing protocols have been developed. The LEACH protocol presented by Wendi Hein Zelman, especially well known as a simple and efficient clustering based routing protocol. However, because LEACH protocol in an irregular network is the total data throughput efficiency dropped, the stability of the cluster is declined. Therefore, to increase the stability of the cluster head, in this paper, it proposes a stochastic cluster head selection method for improving the LEACH protocol. To this end, it proposes a SH-LEACH (Stochastic Cluster Head Selection Method-LEACH) that it is combined to the HEED and LEACH protocol and the proposed algorithm is verified through the simulation.

• Journal of information and communication convergence engineering
• /
• v.17 no.3
• /
• pp.185-190
• /
• 2019

The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.427-432
• /
• 2010

It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely effects on the life duration of the network. Therefore, a recent research is going forward a research activity with regard to life time extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from a Sink, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.810-819
• /
• 2010

This paper proposes an algorithm to improve total network lifetime for Wireless Sensor Network (WSN) application such as environmental condition monitoring systems based on LEACH protocol. Firstly, the algorithm had equal number of nodes allocated to each cluster at cluster set-up phase where it abided by LEACH protocol. Secondly, at cluster set-up phase, each node was determined the order to be cluster header of the cluster which it had joined. After then, the role of a cluster head delivers to the next node according to determined order when the cluster head has received certain number of packets. With above method energy consumption of each node made equal and overall network lifetime was increased. Simulation results shows that overall network lifetime of proposed algorithm was increased two times than that of LEACH and total energy consumption was one forth of that of LEACH protocol.

• Journal of Korea Multimedia Society
• /
• v.16 no.1
• /
• pp.56-66
• /
• 2013

In MANET, the frequent movement of nodes causes the dynamic network topology changes. Therefore, it is required that the routing protocol should be very stable to effectively respond the changes of the network changes. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one paired cluster to make longer radius. Then the headers of the paired cluster manage and operate corresponding member nodes. In the current CBRP, when the cluster header leaves out the cluster, the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster plays the role instead of the left cluster header. This method reduces the routing delay. Concurrently, PCBRP reduces the delay when they route nodes in the paired cluster internally.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.87-91
• /
• 2019

WSN is a wirelessly configured network of sensor nodes with limited power such as batteries. If the sensor node's battery is exhausted, the node is no longer available. Therefore, if the network is to be used for a long time, energy consumption should be minimized. There are many Wireless Sensor Network Protocols to improve energy efficiency, including Cluster-based and chain-based Protocols. Cluster-based Protocols elect Cluster Heads and divide sensor field into Clusters. The Cluster Head collects the data in the Cluster and transmits it to the Base Station. In the case of nodes elected as Cluster Heads, there is a problem of energy consumption. The chain-based Protocol links sensor nodes in a chain and finally transmits all data to the Base Station. In this paper, we intend to increase the network lifetime by using a chain to reduce the energy consumption of the Cluster Head in the Cluster-based Protocol, LEACH Protocol.

• Asian Journal of Innovation and Policy
• /
• v.9 no.2
• /
• pp.164-186
• /
• 2020

It is generally known that a Science and Technology Park - as a representative example of an Innovation Cluster - produces network synergy among industry, university, research institutes, and other innovation actors in a specific area, so that it has a competitive edge over other regions in technological innovation. However, as the novel Coronavirus (COVID-19) pandemic unfolds, it has become necessary to reduce face-to-face contacts and this could lead to lesser network synergy being produced in an Innovation Cluster. With this background, this research was designed and conducted to evaluate how COVID-19 has changed the activities in Innovation Clusters and explore future development scenarios. In order to find out the changes occurring in an Innovation Cluster, a survey was conducted among the people in Science and Technology Parks. The survey result shows that people are experiencing difficulties in technological innovation and support activities, and face-to-face contacts have been reduced in the Innovation Cluster. A scenario planning sought to explore the future development of the Innovation Cluster. It suggests that the transformation into a Digital Innovation Cluster, which is less affected by physical distance, but can still maintain the effectiveness of the networks, can be the key strategy for the future Innovation Cluster.

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

This paper is about to improve the network life's reduction due to the deviation of sensor node and frequently change of network, the main problem of sensor network. The existing Scalable Topology Organization(STO)-based ZigBee Tree Topology Control Algorithm did not consider ways to consume power so the network lifetime is too short. Accordingly, per each round, electing a new parent node and consisting of the new network topology technique, The Cluster Header Selection, extending the network's overall lifetime. The OMNet++ Simulator yielded results from the existing STO Algorithm and the proposed Cluster Header Selection Technique in the same experimental environment, which resulted in an increase in overall network life by about 40% and an improvement of about 10% in performance in the remaining portion of the battery.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.1001-1008
• /
• 2015

Mobile Ad hoc Network(MANET) consists of a node that has mobility. In MANET, the node has routing, the node builds a network of their own, no dependent infrastructure. Topology are exchanged due to node mobility in MANET. For reducing the change of topology, hierarchical network algorithm has been investigated. In hierarchical network, cluster member node communicates through cluster head node. When the load-balancing of cluster head node is exceed, assigned cluster member node can't communicate with base station. To solve this problem, we proposed Load Tolerance algorithm. The proposed algorithm, when cluster member node can't send a message by cluster head node that exceed load-balancing, then the cluster member node sends a message by selected load tolerance node. Through a simulation, the proposed algorithm improves packet delivery ratio in cluster routing.