• Title/Summary/Keyword: Network cluster

Search Result 1,436, Processing Time 0.022 seconds

Secure Cluster Selection in Autonomous Vehicular Networks

  • Mohammed, Alkhathami
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.11-16
    • /
    • 2023
  • Vehicular networks are part of the next generation wireless and smart Intelligent Transportation Systems (ITS). In the future, autonomous vehicles will be an integral part of ITS and will provide safe and reliable traveling features to the users. The reliability and security of data transmission in vehicular networks has been a challenging task. To manage data transmission in vehicular networks, road networks are divided into clusters and a cluster head is selected to handle the data. The selection of cluster heads is a challenge as vehicles are mobile and their connectivity is dynamically changing. In this paper, a novel secure cluster head selection algorithm is proposed for secure and reliable data sharing. The idea is to use the secrecy rate of each vehicle in the cluster and adaptively select the most secure vehicle as the cluster head. Simulation results show that the proposed scheme improves the reliability and security of the transmission significantly.

An Energy Saying Method using Cluster Cohesion in Sensor Networks (센서 네트워크에서 클러스터 응집도를 이용한 에너지 절약 방안)

  • Kim, Jin-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.3
    • /
    • pp.569-575
    • /
    • 2007
  • The main issue of this study is to find ways to lengthen the lifetime of network mainly by reducing energy consumption. This paper proposes how to reduce the amount of data transmitted in each sensor and cluster head in order to lengthen the lifetime of sensor network. The most important factor of reducing the sensor's energy dissipation is to reduce the amount of messages transmitted. This study proposes cluster cohesion for the purposes. The method is to use the cluster cohesion and manage the number of clusters adaptively and reduce the amount of message transmitted in network topology. This method should be much more efficient and effective as it reduces the network traffic significantly and increases the network's lifetime.

  • PDF

A Method for Minimizing the Number of Clusters in Ad-Hoc Networks (Ad-Hoc 네트워크에서 클러스터 수를 최소화하기 위한 방안)

  • Bang Sang-Won
    • Journal of Internet Computing and Services
    • /
    • v.5 no.6
    • /
    • pp.21-30
    • /
    • 2004
  • In Ad-Hoc network, the cluster structure enables effective use of multiple channels, reduces the number of control messages, and increase the scalability of network, Also, it is employed for reducing the number of broadcast messages in an Ad-Hoc network. With the consideration of these advantages, it is desirable that a cluster structure keeps a few clusters in the network, Generally, the cluster formation scheme based on connectivity yields fewer clusters than the other schemes. However, the connectivity based scheme may yield even more clusters than the other schemes according to the network topology. In this paper, a cluster formation scheme dividing the cluster formation into two phases is proposed. In the first phase, the lowest connectivity host in neighborhood initiates the cluster formation. Then, an adjustment procedure for affiliating a lot of the lowest connectivity hosts is employed. In the second phase, the hosts which were not affiliated to the first phase clusters are grouped into one or more clusters through criterions of connectivity and host ID. As a result, the proposed scheme yields a fewer clusters compared with existing other schemes in fully distributed method. The simulation results proves that our scheme is better than LIDCP(3) and HCCP(3).

  • PDF

A Token Based Clustering Algorithm Considering Uniform Density Cluster in Wireless Sensor Networks (무선 센서 네트워크에서 균등한 클러스터 밀도를 고려한 토큰 기반의 클러스터링 알고리즘)

  • Lee, Hyun-Seok;Heo, Jeong-Seok
    • The KIPS Transactions:PartC
    • /
    • v.17C no.3
    • /
    • pp.291-298
    • /
    • 2010
  • In wireless sensor networks, energy is the most important consideration because the lifetime of the sensor node is limited by battery. The clustering is the one of methods used to manage network energy consumption efficiently and LEACH(Low-Energy Adaptive Clustering Hierarchy) is one of the most famous clustering algorithms. LEACH utilizes randomized rotation of cluster-head to evenly distribute the energy load among the sensor nodes in the network. The random selection method of cluster-head does not guarantee the number of cluster-heads produced in each round to be equal to expected optimal value. And, the cluster head in a high-density cluster has an overload condition. In this paper, we proposed both a token based cluster-head selection algorithm for guarantee the number of cluster-heads and a cluster selection algorithm for uniform-density cluster. Through simulation, it is shown that the proposed algorithm improve the network lifetime about 9.3% better than LEACH.

A study on the Methodology for Vitalization of the Mini-cluster Network in Industrial Parks (산업단지 미니클러스터 네트워크 활성화 방법론)

  • Mun, Mun-Chol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.4
    • /
    • pp.1675-1683
    • /
    • 2011
  • The cluster project in Korea has restructured to develop the cluster into a core engine for the pan-regional development policy and connect industrial parks across the country. Korean government has made great efforts to attract research institutes, support organizations and universities in industrial parks and enhance growth potential through a close cooperation network. Especially A mini-cluster is an integrated group joined by companies, universities and research institutes and support organizations. It has been developing business opportunities through industry-academia-research cooperation and providing assistance through network activities. Mini clusters have implemented a variety of network activities. This paper proposed three strategies to accomplish self-sustainable growth of mini-clusters. First of all, mini-cluster needs to provide useful contents that can attract the participation of members. Then it is necessary to promote mini-cluster initiative. Finally, mini-clusters need to make up a cooperative culture.

Regional Extension of the Neural Network Model for Storm Surge Prediction Using Cluster Analysis (군집분석을 이용한 국지해일모델 지역확장)

  • Lee, Da-Un;Seo, Jang-Won;Youn, Yong-Hoon
    • Atmosphere
    • /
    • v.16 no.4
    • /
    • pp.259-267
    • /
    • 2006
  • In the present study, the neural network (NN) model with cluster analysis method was developed to predict storm surge in the whole Korean coastal regions with special focuses on the regional extension. The model used in this study is NN model for each cluster (CL-NN) with the cluster analysis. In order to find the optimal clustering of the stations, agglomerative method among hierarchical clustering methods was used. Various stations were clustered each other according to the centroid-linkage criterion and the cluster analysis should stop when the distances between merged groups exceed any criterion. Finally the CL-NN can be constructed for predicting storm surge in the cluster regions. To validate model results, predicted sea level value from CL-NN model was compared with that of conventional harmonic analysis (HA) and of the NN model in each region. The forecast values from NN and CL-NN models show more accuracy with observed data than that of HA. Especially the statistics analysis such as RMSE and correlation coefficient shows little differences between CL-NN and NN model results. These results show that cluster analysis and CL-NN model can be applied in the regional storm surge prediction and developed forecast system.

Secure and Energy Efficient Protocol based on Cluster for Wireless Sensor Networks (무선 센서 네트워크에서 안전하고 에너지 효율적인 클러스터 기반 프로토콜)

  • Kim, Jin-Su;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.2
    • /
    • pp.14-24
    • /
    • 2010
  • Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. In this study, we use data on direction, distance, density and residual energy in order to maximize the energy efficiency of cluster-based routing methods. Through this study, we expect to minimize the frequency of isolated nodes when selecting a new cluster head autonomously using information on the direction of the upper cluster head, and to reduce energy consumption by switching sensor nodes, which are included in both of the new cluster and the previous cluster and thus do not need to update information, into the sleep mode and updating information only for newly included sensor nodes at the setup phase using distance data. Furthermore, we enhance overall network efficiency by implementing secure and energy-efficient communication through key management robust against internal and external attacks in cluster-based routing techniques. This study suggests the modified cluster head selection scheme which uses the conserved energy in the steady-state phase by reducing unnecessary communications of unchanged nodes between selected cluster head and previous cluster head in the setup phase, and thus prolongs the network lifetime and provides secure and equal opportunity for being cluster head.

An EIBS Algorithm for Wireless Sensor Network with Life Time Prolongation (수명 연장 기능의 무선 센서 네트워크용 EIBS 알고리즘)

  • Bae, Shi-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.65-73
    • /
    • 2014
  • Since Time synchronization is also critical in Wireless Sensor Networks (WSN) like other networks, a time synchronization protocol for WSN called IBS(Indirect-Broadcast Synchronization) has been already proposed in 2012. As IBS operates in cluster tree topology, network lifetime may be mainly shortened by cluster head node[s], which usually consumes more power than cluster member (i.e. non-cluster head) nodes. In this paper, I propose enhanced version of IBS (called EIBS) which saves overall energy and prolongs network lifetime by re-constructing partial cluster tree locally. Compared with other tree construction approaches, this tree reconstruction algorithm is not only simpler, but also more efficient in the light of overall power consumption and network lifetime.

Cluster Group Multicast by Weighted Clustering Algorithm in Mobile Ad-hoc Networks (이동 에드-혹 네트워크에서 조합 가중치 클러스터링 알고리즘에 의한 클러스터 그룹 멀티캐스트)

  • 박양재;이정현
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.37-45
    • /
    • 2004
  • In this paper we propose Clustered Group Multicast by Clustering Algorithm in Wireless Mobile Ad-hoc Network. The proposed scheme applies to Weighted Cluster Algorithm Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network muting protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by seeped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

An Energy Efficient Clustering Algorithm in Mobile Adhoc Network Using Ticket Id Based Clustering Manager

  • Venkatasubramanian, S.;Suhasini, A.;Vennila, C.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.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.