• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.27-37
• /
• 2004

The existing ad hoc network protocols suffer the scalability problem due to the inherent characteristics of node mobility. Cluster-based routing protocols divide the member nodes into a set of clusters and perform a hierarchical routing between these clusters. This hierarchical feature help to improve the scalability of ad hoc network routing. However, previous k-hop cluster-based routing protocols face another problems, that is, control overhead of the cluster headers. This paper proposes a novel k-hop cluster-based routing scheme with delegation functions for mobile ad hoc networks. The scheme employs is based on tree topology to manage cluster members in effectively. The cluster headers do not manage the routing table for whole members, while the header keeps the routing table for its neighbor members and the member list for one hop over nodes within k-hop cluster. Then the in-between leveled nodes manage the nested nodes which is structured in the lower level. Therefore, the proposed mechanism can reduce some control overhead of the cluster leaders.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.799-818
• /
• 2010

In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic and P2P network partition in mobile ad hoc network (MANET). We propose an approach to construct an efficient unstructured P2P overlay over MANET using underlying cluster-based routing (CBRP). One of the peers in the P2P network is used as a root-peer to connect all peers. Each peer maintains connection with physically closer peers such that it can reach the root-peer. The peer constructs a minimum-spanning tree consisting of itself, its directly connected neighbor peers and 2-hop away neighbor peers to remove far away redundant links and to build an overlay closer to the physical network. Due to on-demand nature of inter-cluster routing of CBRP, the positioning algorithm for MANET is used to retrieve the file by a peer from the source peer via shorter path in the physical network. We can show by simulation that our approach performs better in comparison with the existing approach.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.51-58
• /
• 2017

This paper deals with the improvement of cluster head selection method in L-SEP for heterogeneous nodes among hierarchical routing protocols of wireless sensor network. Wireless sensor networks are classified into homogeneous and heterogeneous network. In heterogeneous network, SEP, L-SEP are mainly used because cluster head selection probability is different depending on node type. But, since protocol based on SEP has different cluster head selection probabilities depending on the node type, clusters that transmit data inefficiently can be formed. to improve this, it is necessary to select the cluster head that minimizes the transmission distance of member node and the cluster head. Therefore, we propose a protocol that improve the cluster head selection method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.31-34
• /
• 2012

In MANET, frequent movement of nodes causes the dynamic network topology changes. Therefore the routing protocol, which is very stable to effectively respond the changes of the network changes, is required. 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 pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. When they route nodes in the paired cluster internally, PCBRP reduces the delay by requesting a route. Therefore PCBRP shows improved total delay of the network and improved performance of packet transmitting rate.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.103-109
• /
• 2013

Mobile ad hoc networks (MANETs) are infrastructure-less and stand-alone wireless networks with dynamic topologies. To support user's safety in MANETs, fundamental and various security services should be supported. Especially in mobile commercial market, one of the major concerns regarding security is user privacy. Recently, researches about security system to protect user privacy in cluster-based MANETs have been introduced. This paper propose a cluster reconfiguration protocol under anonymous cluster-based MANETs to enhance the network stability. The improved anonymous cluster-based MANETs can recover the network structure against abnormal states of clutserheads.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.3
• /
• pp.207-215
• /
• 2013

This paper is channel assignment and scheduling techniques for efficient wireless AMI network. In AMI system, the multi-channel cluster network to be proposed defines the communication channel between NC (Network Coordinator) and CDA (Clustered Data Aggregator) as the network channel. CDA and OMD(Out Meter display) and communication channel between SMD(Smart Meter Device) are defined as the group channel. AMI network of the multi-channel cluster based in which the network channel and group channel is mixed increases the administration efficiency through the physical/logical consumer channel clustering. The reliability of inspection data through the channel use distinguished between the adjacent cluster is enhanced. In addition, the fast aggregation of data is possible and the size of a metering network is increased through the channel allocation of the multichannel cluster based.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.124-130
• /
• 2023

In this paper, we intend to improve the network lifetime by improving the energy efficiency of sensor nodes in a wireless sensor network by utilizing machine learning using K-means clustering algorithm. A wireless sensor network is a wireless network composed of physical devices including batteries as physical sensors. Due to the characteristics of sensor nodes, all resources must be efficiently used to minimize energy consumption to maximize network lifetime. A cluster based approach is used to manage groups of relatively large numbers of nodes. In the proposed protocol, by improving the existing LEACH algorithm, we propose a clustering algorithm that selects a cluster head using a cluster based approach and a location based approach. The performance results to be improved were measured using Matlab simulation. Through the experimental results, K-means clustering was applied to the energy efficiency part. By utilizing K-means, it is confirmed that energy efficiency is improved and the lifetime of the entire network is extended.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.53-63
• /
• 2022

In the paper, we propose a TSCH-based scheduling scheme for IEEE 802.15.4e, which is able to perform the scheduling of its own network by avoiding collision from interference network cluster (INC). Firstly, we model a bipartite graph structure for presenting the slot-frame (channel-slot assignment) of TSCH. Then, based on the bipartite graph edge weight, we utilize the Hungarian assignment algorithm to implement a scheduling scheme. We have employed two features (maximization and minimization) of the Hungarian-based assignment algorithm, which can perform the assignment in terms of minimizing the throughput of INC and maximizing the throughput of own network. Further, in this work, we called the scheme "dual-stage Hungarian-based assignment algorithm". Furthermore, we also propose deep learning (DL) based deep neural network (DNN)scheme, where the data were generated by the dual-stage Hungarian-based assignment algorithm. The performance of the DNN scheme is evaluated by simulations. The simulation results prove that the proposed DNN scheme providessimilar performance to the dual-stage Hungarian-based assignment algorithm while providing a low execution time.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.465-468
• /
• 2005

This paper presents a new trust evaluation scheme in an ad hoc network. To overcome the limited information about unfamiliar nodes and to reduce the required memory space, we propose a cluster-based trust evaluation scheme, in which neighboring nodes form a cluster and select one node as a cluster head. The head issues a trust value certificate that can be referred to by its non-neighbor nodes. In this way, an evaluation of an unfamiliar node's trust can be done very efficiently and precisely. In this paper, we present a trust evaluation metric using this scheme and some operations for forming and managing a cluster. An analysis of the proposed scheme over some security problems is also presented.

• 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.