• International Journal of Internet, Broadcasting and Communication
• /
• 제7권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
• /
• 제17권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.

• 한국멀티미디어학회논문지
• /
• 제11권12호
• /
• pp.1706-1715
• /
• 2008

In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1237-1255
• /
• 2014

In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.

• 한국인터넷방송통신학회논문지
• /
• 제15권6호
• /
• pp.103-108
• /
• 2015

무선 센서 네트워크에서는 효율적으로 에너지를 사용해서 전체 네트워크의 수명을 연장하는 것이 중요한 이슈이다. 기존의 라우팅 프로토콜에서는 클러스터 헤드를 단순히 센서노드들과 가까운 노드로 선택했기 때문에, 경우에 따라서는 클러스터 헤드와 Base Station(BS) 위치가 센서노드와 BS사이의 위치보다 멀어서 거리에 따른 불필요한 에너지 소모가 생긴다. 따라서 본 논문에서는 클러스터의 구성과 클러스터 헤드를 노드들의 위치 정보에 따라서 선정하는 위치기반 클러스터링 알고리즘을 제안하였다. 시뮬레이션 결과 기존의 알고리즘보다 네트워크 시간이 연장되어 에너지를 효율적으로 사용함을 알 수 있다.

• 한국통신학회논문지
• /
• 제37A권9호
• /
• pp.772-779
• /
• 2012

현재 MANET에서는 DOS나 DDOS 공격이 증가하고 있지만, MANET은 제한된 대역폭, 계산 자원 및 배터리 전원을 가진 노드들로 구성된 네트워크이기 때문에 기존의 역추적 메커니즘을 적용할 수가 없다. 따라서 MANET에서 역추적 기법을 적용 시킬 시에는 각 노드가 가지는 자원을 효율적으로 사용해야한다. 그러나 기존의 애드혹 네트워크에 적용한 역추적 기법은 클러스터링 영역에서 각 노드를 대표하는 Cluster head가 역추적 정보를 관리하기 때문에 Cluster head의 과부하로 노드의 수명을 단축시키는 문제점을 가지게 된다. 게다가, 다중홉 클러스터링일 경우, 하나의 Cluster head가 더 많은 노드를 관리하기 때문에 문제는 더욱 심각해진다. 본 논문에서는 이러한 Cluster head의 오버헤드를 줄이기 위한, 역추적 정보를 관리하기 위하여 트리구조의 깊이를 이용한 TNA(Traceback against Network Attacks)를 제안한다.

• International Journal of Computer Science & Network Security
• /
• 제21권7호
• /
• pp.341-349
• /
• 2021

Many emerging mobile ad-hoc network application communications are group-oriented. Multicast supports group-oriented applications efficiently, particularly in a mobile environment that has a limited bandwidth and limited power. Energy effectiveness along with safety are 2 key problem in MANET design. Within this paper, MANET is presented with a stable, energy-efficient clustering technique. In this proposed work advanced clustering in the networks with ticket ID cluster manager (TID-CMGR) has formed in MANET. The proposed routing scheme makes secure networking the shortest route possible. In this article, we propose a Cluster manager approach based on TICKET-ID to address energy consumption issues and reduce CH workload. TID-CMGR includes two mechanism including ticket ID controller, ticketing pool, route planning and other components. The CA (cluster agent) shall control and supervise the functions of nodes and inform to TID-CMGR. The CH conducts and transfers packets to the network nodes. As the CH energy level is depleted, CA elects the corresponding node with elevated energy values, and all new and old operations are simultaneously stored by CA at this time. A simulation trial for 20 to 100 nodes was performed to show the proposed scheme performance. The suggested approach is used to do experimental work using the NS- simulator. TIDCMGR is compared with TID BRM and PSO to calculate the utility of the work proposed. The assessment shows that the proposed TICKET-ID scheme achieves 90 percent more than other current systems.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.552-557
• /
• 2004

Mobile Ad Hoc Network (MANET) is a network architecture, which has no backbone network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, previously developed routing algorithms in wired networks cannot be used. And many new algorithms have been undergone. This study proposes the secondary leader approach to the cluster based routing protocol(CBRP). In case, the primary leader becomes abnormal status so that the primary leader cannot participate the communications between network entities, the secondary leader immediately replaces the primary header without selecting process of the new primary leader. The performances of proposed algorithm ACBRP(Advanced Cluster. Based Routing Protocol;CBRP using secondary leader) are compared with CBRP and results are presented in order to show the effectiveness of the algorithm.

• International journal of advanced smart convergence
• /
• 제6권3호
• /
• pp.59-64
• /
• 2017

A wireless sensor network is a network in which nodes equipped with sensors capable of collecting data from the real world are configured wirelessly. Because the sensor nodes are configured wirelessly, they have limited power such as batteries. If the battery of the sensor node is exhausted, the node is no longer usable. If more than a certain number of nodes die, the network will not function. There are many wireless sensor network protocols to improve energy efficiency, among which LEACH Protocol is a typical example. The LEACH protocol is a cluster-based protocol that divides sensor space into clusters and transmits and receives data between nodes. Therefore, depending on how the cluster is structured, the shape of the energy cow may decrease or increase. We compare the network lifetimes of the existing LEACH protocols and the three types of protocols that have been improved using fuzzy methods for cluster selection.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 춘계학술대회
• /
• pp.447-449
• /
• 2021

에너지 소비를 최소화하여 네트워크를 오랫동안 유지하기 위해 다양한 무선 센서 네트워크 프로토콜이 제안되었다. K-평균 군집화 알고리즘을 사용하면 최종 군집이 설정될 때까지 중심점을 반복적으로 이동해야 하기 때문에 기존 계층형 알고리즘보다 군집화에 시간이 더 오래 걸린다. K-평균 클러스터링 기반 프로토콜의 경우 클러스터 헤드가 선택되었을 때 클러스터 중심점 근처의 노드 또는 노드의 잔류 에너지만 고려된다. 본 논문에서는 앞서 언급한 문제를 개선하면서 에너지 효율을 개선하기 위해 K-평균 클러스터링을 기반으로 하는 새로운 무선 센서 네트워크 프로토콜을 제안한다.