A Survey on Cluster Head Selection in CGSR Protocol for Wireless Sensor Network. Article (PDF Available) · January with Reads. This paper surveys the routing protocols forAd Hoc mobile wireless Clusterhead Gateway Switch Routing (CGSR) [Chiang97]uses as basis. The CGSR lies under table driven or proactive protocol based on routing to deal with this problem we have used PSO for choosing cluster-head in CGSR.
|Published (Last):||28 March 2010|
|PDF File Size:||8.31 Mb|
|ePub File Size:||12.8 Mb|
|Price:||Free* [*Free Regsitration Required]|
In Figure 1 athere are two equations: In this paper, we usually consider one-hop clusters, besides the only scenario; namely, when the cluster guest appears, in this case, the guest node is two hops away from the cluster head.
Chsr proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. Note that the cluster head in the discovered path will transfer the REP along the local shortest route.
ccgsr This is an open access article distributed under the Creative Commons Attribution Licensewhich permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Therefore, we make a reasonable compromise based on the actual needs and operation environment to select cluster heads, which can improve overall performance of MANETs.
Indexed in Science Citation Index Protpcol. In order to utilize the network resources efficiently, HCA-R absorbs the quintessence of ZRP to use prtocol strategy between nodes within individual clusters and reactive strategy between clusters, not like CBRP to use on-demand strategy between nodes of both intracluster and intercluster communication to purely decrease the routing overhead and HSR, CGSR to use table-driven strategy to communicate in both intra- and interzone to decrease average end-to-end prohocol but increase the cost of routing overhead unwillingly.
Packet acceptance ratio is the ratio of the received data packet number at source to the sent data packet number at destination. Otherwise, source and destination must exchange data through cluster head. If so, the cluster head which has bigger metric will be reelected as the new cluster head, but the similar one must give up its cluster head role to be a common member of the new cluster.
Namely, at first, the source sends a REQ request message to its attached cluster head and then the cluster head will broadcast this REQ to its adjacent cluster head through gateway nodes, and the process will continue until the REQ arrives at the cluster which belongs to the destination node. From Figure 12it can be seen that the HCA-R protocol outperforms others as it uses proactive protocol between nodes within individual clusters and reactive protocol between prottocol and hence restricts the flooding area effectively.
Routing Protocols for Ad Hoc Mobile Wireless Networks
Hence, this mechanism is protocpl suitable for large dynamic networks. So node 1 can send data packet to node 5 relayed by the cluster head i. Data exchanging between clusters was relayed by gateway node, disregarding the details cgdr how the relayed data would be transmitted to the destination. Finally, node 9 sends a REP along the discovered path to node 1.
For example, in Figure 6source node 1 has an original route to destination 10 i.
Selection of cluster-head using PSO in CGSR protocol
The CGSR lies under table driven or proactive protocol based on routing information update mechanism. As a result of it, the cluster head holding time is decreased. Thus, they should request joining other clusters or establish a new cluster.
However, its location management is closely tied with the network hierarchical topology, cgssr makes the location updating and location finding quite complex. And as an essential technique of hierarchical routing protocol, clustering of nodes provides an efficient method of establishing a hierarchical structure in mobile ad hoc networks.
Upon receiving, it will compare the cost metric with itself, and the bigger one will be elected as a cluster head. According to the topology of networks, routing protocols can be classified into flat-based routing and hierarchical-based routing [ 56 ].
Thus, it will take little time to communicate with each other. For simplicity, we assume that node is fixed and node is moving, but actually they are all moving at all times.
Selection of cluster-head using PSO in CGSR protocol – Semantic Scholar
Based on the analysis of existing clustering routing protocols and clustering algorithms, a clustering algorithm based on the cost metric and a corresponding hierarchical routing protocol were proposed. In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks.
Routing protocols of MANETs presented currently can be classified into four categories according to the mechanism of updating [ 34 ]. It can operate without fixed based station or any wireless backbone infrastructure.
So, node leaves from the transmission range of node need to track the segment. When the link between gateway nodes 5 and 6 is broken, gateway node 5 will send a BROKEN message to its attached cluster head 3 to launch the local repairing process.
Routing Protocols for Ad Hoc Mobile Wireless Networks
In a MANET of nodes, the degree of node, which is a good indicator of node density, can cgst easily denoted as where is the distance between nodes and. Introduction A mobile ad hoc network MANET [ 12 ] is a wireless communication network, at which nodes use peer-to-peer packets transmission and multihop routes to communication. When a cluster enters the transmission range of another cluster and the variance of cost metric of the two cluster heads is small, which denotes that the two clusters are worth merging.
Knowledge organization Particle swarm optimization Node – plant part.