• Title/Summary/Keyword: Cluster-based Routing Scheme

Search Result 74, Processing Time 0.023 seconds

Adaptive k-means clustering for Flying Ad-hoc Networks

  • Raza, Ali;Khan, Muhammad Fahad;Maqsood, Muazzam;Haider, Bilal;Aadil, Farhan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2670-2685
    • /
    • 2020
  • Flying ad-hoc networks (FANETs) is a vibrant research area nowadays. This type of network ranges from various military and civilian applications. FANET is formed by micro and macro UAVs. Among many other problems, there are two main issues in FANET. Limited energy and high mobility of FANET nodes effect the flight time and routing directly. Clustering is a remedy to handle these types of problems. In this paper, an efficient clustering technique is proposed to handle routing and energy problems. Transmission range of FANET nodes is dynamically tuned accordingly as per their operational requirement. By optimizing the transmission range packet loss ratio (PLR) is minimized and link quality is improved which leads towards reduced energy consumption. To elect optimal cluster heads (CHs) based on their fitness we use k-means. Selection of optimal CHs reduce the routing overhead and improves energy consumption. Our proposed scheme outclasses the existing state-of-the-art techniques, ACO based CACONET and PSO based CLPSO, in terms of energy consumption and cluster building time.

Energy Efficient Routing in Wireless Sensor Networks

  • Cho, Seongsoo;Shrestha, Bhanu;Shrestha, Surendra;Lee, Jong-Yong;Hong, Suck-Joo
    • International journal of advanced smart convergence
    • /
    • v.3 no.2
    • /
    • pp.1-5
    • /
    • 2014
  • Sensor nodes depend on batteries for energy source in Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) is a representative cluster-based routing protocol designed to ensure energy use efficiency whereas the virtual cluster exchange routing (VCR) information only with its closest node to build a network. In this paper, a protocol scheme was proposed wherein member nodes are designed to compare the currently sensed data with the previously sensed one and to switch to sleep mode when a match is achieved. The design is to help improve the transmission energy efficiency too.

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.

Identity-Based Key Management Scheme for Smart Grid over Lattice

  • Wangke, Yu;Shuhua, Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.1
    • /
    • pp.74-96
    • /
    • 2023
  • At present, the smart grid has become one of the indispensable infrastructures in people's lives. As a commonly used communication method, wireless communication is gradually, being widely used in smart grid systems due to its convenient deployment and wide range of serious challenges to security. For the insecurity of the schemes based on large integer factorization and discrete logarithm problem in the quantum environment, an identity-based key management scheme for smart grid over lattice is proposed. To assure the communication security, through constructing intra-cluster and inter-cluster multi-hop routing secure mechanism. The time parameter and identity information are introduced in the relying phase. Through using the symmetric cryptography algorithm to encrypt improve communication efficiency. Through output the authentication information with probability, the protocol makes the private key of the certification body no relation with the distribution of authentication information. Theoretic studies and figures show that the efficiency of keys can be authenticated, so the number of attacks, including masquerade, reply and message manipulation attacks can be resisted. The new scheme can not only increase the security, but also decrease the communication energy consumption.

An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 에너지 효율적인 2-level 트리 기반의 클러스터 라우팅 프로토콜)

  • Lee, Young Joon;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.5
    • /
    • pp.155-162
    • /
    • 2014
  • We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

An Energy Aware Network Construction and Routing Method for Wireless Sensor Network (무선센서네트워크를 위한 에너지 인지형 네트워크 구성 및 라우팅 기법)

  • Hosen, A.S.M. Sanwar;Lee, Hyeak-Ro;Cho, Gi-Hawn
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.9
    • /
    • pp.225-234
    • /
    • 2012
  • In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing.

An Efficient Cluster header Election Scheme Using Remain Energy in Ad hoc network (Ad hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤드 선출 기법)

  • Park, Hye-Ran;Kim, Wu-Woan;Jang, Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.224-227
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP), a cluster header in each cluster is selected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP selects a cluster header without considering the remaining energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be selected frequently. In this paper, we propose the advanced protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining energies of all of nodes are compared with one another, and the node with the highest energy is selected as the cluster header.

  • PDF

An Energy Efficient Cluster-Based Local Multi-hop Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 클러스터 기반 지역 멀티홉 라우팅 프로토콜)

  • Kim, Kyung-Tae;Youn, Hee-Yong
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.495-504
    • /
    • 2009
  • Wireless sensor networks (WSN) consisting of a largenumber of sensors aims to gather data in a variety of environments and is beingused and applied in many different fields. The sensor nodes composing a sensornetwork operate on battery of limited power and as a result, high energyefficiency and long network lifetime are major goals of research in the WSN. Inthis paper we propose a novel cluster-based local multi-hop routing protocolthat enhances the overall energy efficiency and guarantees reliability in thesystem. The proposed protocol minimizes energy consumption for datatransmission among sensor nodes by forming a multi-hop in the cluster.Moreover, through local cluster head rotation scheme, it efficiently manageswaste of energy caused by frequent formation of clusters which was an issue inthe existing methods. Simulation results show that our scheme enhances energyefficiency and ensure longer network time in the sensor network as comparedwith existing schemes such as LEACH, LEACH-C and PEACH.

Maximizing Information Transmission for Energy Harvesting Sensor Networks by an Uneven Clustering Protocol and Energy Management

  • Ge, Yujia;Nan, Yurong;Chen, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1419-1436
    • /
    • 2020
  • For an energy harvesting sensor network, when the network lifetime is not the only primary goal, maximizing the network performance under environmental energy harvesting becomes a more critical issue. However, clustering protocols that aim at providing maximum information throughput have not been thoroughly explored in Energy Harvesting Wireless Sensor Networks (EH-WSNs). In this paper, clustering protocols are studied for maximizing the data transmission in the whole network. Based on a long short-term memory (LSTM) energy predictor and node energy consumption and supplement models, an uneven clustering protocol is proposed where the cluster head selection and cluster size control are thoroughly designed for this purpose. Simulations and results verify that the proposed scheme can outperform some classic schemes by having more data packets received by the cluster heads (CHs) and the base station (BS) under these energy constraints. The outcomes of this paper also provide some insights for choosing clustering routing protocols in EH-WSNs, by exploiting the factors such as uneven clustering size, number of clusters, multiple CHs, multihop routing strategy, and energy supplementing period.

A Method for Constructing Multi-Hop Routing Tree among Cluster Heads in Wireless Sensor Networks (무선 센서 네트워크에서 클러스터 헤드의 멀티 홉 라우팅 트리 구성)

  • Choi, Hyekyeong;Kang, Sang Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.11
    • /
    • pp.763-770
    • /
    • 2014
  • In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.