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.
|Genre:||Health and Food|
|Published (Last):||21 October 2017|
|PDF File Size:||10.69 Mb|
|ePub File Size:||16.81 Mb|
|Price:||Free* [*Free Regsitration Required]|
In Figure 1 athere are two equations: It is obvious that more nodes will lead to bigger average end-to-end delay. Empirical study of Particle Swarm Optimization. References Publications referenced by this paper.
Traffic sources are CBR constant bit ratewith the rate of 10 packets per second and bytes per packet. If the source and destination are in the same cluster, the data packet can be transmitted directly or relayed by cluster head.
Mathematical Problems in Engineering
And progocol cluster members of the attached cluster broadcast cluster member node ID, cluster IDs messages back to the cluster head periodically, where the node ID is the identifier of the broadcasting node, and cluster ID is the list of clusters of which the node is a member. Mathematical Problems in Engineering.
In a MANET of nodes, the degree of node, which is a good indicator of node density, can be easily denoted as where is the distance between potocol and. Thus, this method does well to large population and high mobility networks. Head – Component of Device Cluster Headache.
But when a cluster member receives more than one ATJ message, this denotes that the node lies in separate clusters but within transmission range of one protocok therefore it will be elected as a gateway between these clusters. 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.
Selection of cluster-head using PSO in CGSR protocol – Semantic Scholar
Table of Contents Alerts. Normalized routing overhead is the ratio of the total number of control message transmissions the forwarding of a control message proyocol each hop is counted as one control transmission to the total number of data packets received, which indicates the efficiency of the routing protocol.
This indicates the reliability of the network. We assume that the velocity and direction of nodes and are not changing during. If not, node 1 must send data packet to node 5 relayed by the cluster head i. This indicates that the HCA performs more stability when the density of nodes increases. Packet acceptance ratio is the ratio of the received data packet number at source to the sent vgsr packet number at destination.
HSR Hierarchical State Routing [ 14 ] and CGSR the Center for Global Security Research [ 15 ] are all using table-driven strategy to establish routing of both intra- and interzone, which is good to decrease routing updating delay, but increase the cost of routing overhead unwillingly. So, more data packets will be discarded. Hence the routing overhead will be decreased.
Routing Protocols for Ad Hoc Mobile Wireless Networks
The CGSR lies under table driven or proactive protocol based on routing cysr update mechanism. Once started, each node in the network broadcasts a HELLO message to have knowledge of its member nodes, which can be used to calculate its cost metric.
In this way, it can reduce the probability of cluster overlapping. From Figure 9it can be seen that, with the speed increasing, the average cluster head holding time of all the schemes is decreased. In flat-based routing, all nodes play an equal role and can establish a route by local operation and information feedback among themselves easily.
Selection of cluster-head using PSO in CGSR protocol
The above three routings have a similar shortcoming; namely, routing maintenance will consume a large portion of bandwidth and even may paralyze the network, when the traffic prtoocol too large. Thus, they should request joining other clusters or establish a new cluster.
In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks. Showing of 2 extracted citations. In order to utilize the network resources efficiently, HCA-R absorbs the quintessence of ZRP to use proactive 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 delay but increase the cost of routing overhead unwillingly.
When a node, including new coming or dissociated from other clusters, wants to join a cluster, it should send RTJ to a cluster head, and the cluster head will send a ATJ message back only if the requesting node is allowed to join. Thus, node 1 gets the shortest route to node 9 i.