• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.407-416
• /
• 2005

This paper suggests a new geocasting protocol which is used to transfer the geographic packets to the specific region in MANET. Geocasting protocol is basically different from the conventional multicasting protocol that needs group addition and maintenance. A geocasting protocol using the mobile node's position information is the new area of multicasting protocols. The existing geocasting protocols have the following problems; it may be impossible to transfer data to some mobile hosts even if there are alternate routes and they have low adaptability and efficiency when the number of mobile hosts increases. The proposed CBG (Cluster-Based Geocasting) uses the proactive routing strategy and clustering technique with mobile host's location information. The CBG achieves high successful data transmission ratio and low data delivery cost to mobile hosts at specific region.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.127-132
• /
• 2008

Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.97-103
• /
• 2020

Wireless sensor networks collect and analyze sensing data in a variety of environments without human intervention. The sensor network changes its lifetime depending on routing protocols initially installed. In addition, it is difficult to modify the routing path during operating the network because sensors must consume a lot of energy resource. It is important to measure the network performance through simulation before building the sensor network into the real field. This paper proposes a WSN model for a low-energy adaptive clustering hierarchy protocol using DEVS kernel models. The proposed model is implemented with the sub models (i.e. broadcast model and controlled model) of the kernel model. Experimental results indicate that the broadcast model based WSN model showed lower CPU resource usage and higher message delivery than the broadcast model.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.147-154
• /
• 2007

Network topology in ad hoc networks keeps changing because of node mobility and no limitation in number of nodes. Therefore, the scalability of routing protocol is of great importance, However, table driven protocols such as DSDV have been known to be suitable for relatively small number of nodes and low node mobility, Various protocols like FSR, OLSR, and PCDV have been proposed to resolve scalability problem but vet remain to be proven for their comparative superiority for scalability, In this paper, we compare and amine them by employing various network deployment scenarios as follows: network dimension increase's while keeping node density constant node density increases while keeping network dimension fixed, and the number of sessions increase with the network dimension and the number of nodes fixed. the DSDV protocol showed a low scalability despite that it imposes a low overhead because its convergence speed against topology change is slow, The FSR's performance decreased according to the increase of overhead corresponding to increasing number of nodes, The OLSR with the shortest convergence time among them shows a good scalability, but turned out to be less scalable than the PCDV that uses a clustering because of its relatively high overhead.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.2
• /
• pp.379-384
• /
• 2022

In a wireless sensor network, a large number of sensor nodes are deployed in an environment where direct access is difficult. It is difficult to supply power, such as replacing the battery or recharging it. It is very important to use the energy with the sensor node. Therefore, an important consideration to increase the lifetime of the network is to minimize the energy consumption of each sensor node. If the energy of the wireless sensor node is exhausted and discharged, it cannot function as a sensor node. Therefore, it is a method proposed in various protocols to minimize the energy consumption of nodes and maintain the network for a long time. We consider the center point and residual energy of the cluster, and the plot point and K-means (WSN suggests optimal clustering). We want to evaluate the performance of the KOCED protocol. We compare protocols to which the K-means algorithm, one of the latest machine learning methods, is applied, and present performance evaluation factors.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.141-150
• /
• 2005

Wireless Sensor Networks have been rapidly developed due to the advances of sensor technology and are expected to be applied to various applications in many fields. In Wireless Sensor Networks, schemes for managing the network energy-efficiently are most important. For this purpose, there have been a variety of researches to suggest routing protocols. However, existing researches have ideal assumption that all sensor nodes have sensing data to transmit. In this paper, we designed and implemented a sensing-aware cluster selection algorithm based on LEACH-C for the sensor network in which part of sensors have sensing data. We also simulated proposed algorithm on several network situation and analyzed which situation is suitable for the algorithm. By the simulation result, selecting cluster head among the sensing nodes is most energy-efficient and the result shows application of sensing-awareness in cluster head selection when not all sensors have sensing data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1098-1104
• /
• 2010

Recently, a variety of research of multi-hop routing protocol have been done to balance the sensor node energy consumption of WSN(wireless sensor network) and to improve the node efficiency for extending the life of the entire network. Especially in multi-hop protocol, a variety of models have been concerned to improve energy efficiency and apply in the reality. In multi-hop protocol, we assumption that energy consumption can be adjusted based on the distance between the sensor nodes. However, according to the physical property of the actual WSN, it's hard to establish this assumption. In this dissertation, we propose low-power sub-cluster protocol to improve the energy efficiency based on the spread of distance. Compared with the previous protocols, this proposed protocol can be effectively used in the wireless sensing networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.225-232
• /
• 2013

In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.801-808
• /
• 2010

LEACH, one of hierarchical based routing protocols, was proposed for energy efficiency which is the most important requirement of Wireless Sensor Network(WSN). LEACH protocol is composed of a cluster of certain large number of clusters, which have a cluster head and member nodes. Member nodes send sensing data to their cluster heads, and the cluster heads aggregate the sensing data and transmit it to BS. The challenges of LEACH protocol are that cluster heads are not evenly distributed, and energy consumption to transmit aggregated data from Cluster heads directly to BS is excessive. This study, to improve LEACH protocol, suggests LECEEP that transmit data to contiguity cluster head that is the nearest and not far away BS forming chain between cluster head, and then the nearest cluster head from BS transmit aggregated data finally to BS. According to simulation, LECEEP consumes less energy and retains more number of survival node than LEACH protocol.