• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.757-766
• /
• 2006

Mobile Ad-hoc Network(MANET) is an autonomous network consisted of mobile hosts. A considerable number of studies have been conducted on the MANET with studies of ubiquitous computing. Several studies have been made on the clustering schemes which manage network hierarchically to Improve flat architecture of MANET. But the conventional schemes have the lack of multi-hop clustering and load balancing. This paper proposes a clustering scheme to support multi-hop clustering and to consider load balancing between cluster heads. We define the split of clusters and states of cluster, and propose join, merge, divide, and election of cluster head schemes for load balancing of between cluster heads

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.13-20
• /
• 2005

An ad hoc wireless networks forms temporary network without the aid of fixed networks or centralized administration with a collection of wireless mobile hosts. In this case, it is necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. This paper presents an efficient cluster-based routing protocol scheme for ad hoc networks. The cluster is used for path setup and data delivery. Our cluster-based routing algorithm is designed for the improvement of the load balance. Our simulation results show the improved performance for low mobility networks comparing with the previous works.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.848-850
• /
• 2014

Mobile Ad hoc Networks(MANET) is consist of node that has mobility, MANET build cluster formation for using energy efficient. In existing LEACH algorithm elect cluster head node in coverage area by distribution function. However, when the cluster head node, that elected by distribution function, is divided coverage area unevenly, the network can't consumption energy efficiency. To solve this problem, we proposed CSWC(Coverage Scheduling Weight-value Control) algorithm. When the coverage area is divided nonchalance, proposed algorithm increased number of hops, that determines coverage area, for balance coverage area. As the result proposed algorithm is set balance coverage area, the network consumption energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.689-698
• /
• 2008

The performance of a TCP protocol on MANETs has been studied in a numerous researches. One of the significant reasons of TCP performance degradation on MANETs is inability to distinguish between packet losses due to congestion from those caused by nodes mobility and as consequence broken routes. This paper presents the Cluster-Label-based Routing (CLR) protocol that is an attempt to compensate source of TCP problems on MANETs - multi-hop mobile environment. By utilizing Cluster-Label-based mechanism for Backbone, the CLR is able to concentrate on detection and compensation of movement of a destination node. The proposed protocol provides better goodput and delay performance than standardized protocols especially in cases of large network size and/or high mobility rate.

• 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 Digital Convergence
• /
• v.14 no.9
• /
• pp.309-315
• /
• 2016

The node mobility in the wireless mobile network environment increases the energy consumption. This paper proposes a CNMA (cluster-based node management algorithm) to reduce the energy consumption caused by node mobility, and to prolong the life cycle for cluster member nodes. The proposed CNMA traces the mobility for nodes between cluster header and member, and it analyses the energy capacity as monitoring periodically their relationship. So, it makes a division and merges by analysing the state transition for nodes. This paper is to reduce the energy consumption due to the node mobility. The simulation results show that the proposed CNMA can efficiently control the energy consumption caused by mobility, and it can improve the energy cycle.

• Convergence Security Journal
• /
• v.13 no.1
• /
• pp.19-24
• /
• 2013

MANET has a highly dynamic topology because it consists of only mobile nodes. Various attacks using these characteristics exist. Among them, damage of the attacks based flooding such as DoS or DDos is large and traceback of the attack node is not easy. It is because route information by moving of intermediate nodes which pass the data changes frequently. In this paper, we propose table-based traceback technique to perform efficient traceback although route information by moving of nodes changes frequently. Cluster head manages route management table in order to form cluster status table and network topology snapshot for storing the location information of mobile nodes when cluster member nodes change. Also, bloom filter is used to reduce the amount of storing route information. The performance of the proposed technique is confirmed through experiment.

• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.249-258
• /
• 2009

As wireless internet markets become larger than before, many mobile applications are also being developed actively. In this circumstances mobile devices such as cell phones, PDAs are playing an important role to satisfy the user's need of ubiquitous computing. Due to the hardware limitations, however, the mobile devices like PDA can not run large-scale softwares by itself. The main goal of this paper is to make large-scale applications runnable on PDA. To accomplish this, we used the PDA-JPVM cluster computing engine which has been already developed by us. We found out by running the applications and the performance evaluation that large-scale Java softwares can easily run on the hardware-limited PDA. And the performance evaluation results are also presented.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.241-244
• /
• 2012

In mobile ad-hoc networks, it should be the most important issue to reduce the power consumption of communications, because the resource of a node is limited in these networks. In existing cluster-based routing protocols, cluster headers participate in almost all communication processes. Therefore the lifetime of the cluster header is shortened and it does not have the effective route. In the proposed cluster-based routing protocol, the cluster header transmits a control packet which gives the route information to member nodes. This makes that the cluster header decreases the number of participating in communications, and that node members do not have to communicate trough the cluster header. This results in extending the lifetime of the cluster header, and having the effective route, data transmission rate and improved stability of routes.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1015-1024
• /
• 2011

Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.