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.
|Country:||Trinidad & Tobago|
|Published (Last):||20 July 2015|
|PDF File Size:||10.14 Mb|
|ePub File Size:||14.19 Mb|
|Price:||Free* [*Free Regsitration Required]|
And this mechanism is very helpful to reduce the route reestablishing expenses and end-to-end delay. Hence, MANETs bear great application potential in these scenarios, including battlefield communications, emergency operation, disaster relief, survival search, and sensor dust.
This is because the more the nodes participate in the network communication, the more the bandwidth will be consumed, and hence more congestion will take place, cgrs the average end-to-end delay will increase substantially. 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.
Mathematical Problems in Engineering
In hierarchical-based routing [ 7 — 10 ], all nodes are divided into different clusters zones. Skip to search form Skip to main content. Routing protocols of MANETs presented currently can be classified into four categories according to the mechanism of updating [ 34 ].
Simulation results show that the proposed clustering algorithm and hierarchical routing protocol provide superior performance with several advantages over existing clustering algorithm and routing protocol, respectively.
Once a cluster head leaves its own cluster or is damaged, the node belonging to this cluster would return to the NULL state. So node lrotocol can send data packet to node 5 relayed by the cluster head i. Pfotocol physical layer uses the free space model and takes the actual aeronautical communication parameters into account, such as transmitter power and receiver sensitivity. The analysis of Figure 1 b is similar to Figure 1 aso where the definition of and is the same as 1,and.
Each cluster elects a cluster head according to specific rules. Figure 1 depicts the approaching and receding scenario of nodes and. The MPBC Mobility Prediction-Based Clustering in [ 22 ] elects the node, which has a low variance of the relative mobility values with respect to its neighbors, taking the cluster head responsibility. Knowledge organization Particle swarm optimization Node – plant part.
Thus, node 1 gets the shortest route to node 9 i. A cluster member would dissociate from the attached cluster, if it does not hear periodic broadcast from its cluster head. Figure 13 demonstrates the packet acceptance ratio with respect to maximum moving speed. In a word, hierarchical-based routing not only plays down the network spending by decreasing the number of nodes which participate in routing maintenance, but also increases the network stability by dividing the network into easily controlled subnets.
Hence, this mechanism is not suitable for large dynamic networks. The CGSR lies under table driven or proactive protocol based on routing information update mechanism. Head – Component of Device Cluster Headache. 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.
Through the law of cosines, there exists where. 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. In this way, it can reduce the probability of cluster overlapping.
Note that only when the node receives more than two consecutive RTJ messages from another certain node, should they establish a new cluster. Hence the routing overhead will be decreased. After the above process, some clusters will have been formed.
From This Paper Figures, tables, and topics from this paper. Thus, the relative velocity between nodes and is. For example, in Figure 5source node 1 wants to send data chsr destination 9. Therefore, the packet acceptance ratio of HCA-R is the highest.
Otherwise, it denotes that the two clusters just incidentally pass by each other in a short period and it is not worthy of merging. Traffic sources are CBR constant bit ratewith the rate of 10 packets per second and bytes per packet. Each cluster is composed of a cluster head, several cluster gateway nodes, several cluster guest nodes, and other cluster members.
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 is too large. Citations Publications citing this paper. Thus, the relative node degree of node can be calculated as. Note that the cluster head in the discovered path will transfer the REP along the local shortest route. According to the topology of networks, routing protocols can be classified into flat-based routing and hierarchical-based routing [ 56 ].
As a result of it, the cluster head holding time is decreased. Meanwhile, a CLEAR message will be forwarded to the source node which originates the packets to notify the change.
Selection of cluster-head using PSO in CGSR protocol – Semantic Scholar
Introduction A mobile ad hoc network Rpotocol [ 12 ] is a wireless communication network, at which nodes use peer-to-peer packets transmission and multihop routes to communication. Showing of 2 extracted citations.
Here, we set the initial value of and to andrespectively, and adjusted them adaptively according to real-life network. This indicates that the HCA performs more stability when the density of nodes increases. Namely, cluster head 3 takes the intercluster strategy to build link with cluster head 7 through gateway nodes 11 and 6. 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.
All the nodes in such a cluster are within the range of the cluster head, but not necessarily within range of each other. Thus, they should request joining other clusters or establish a new cluster.
Indexed in Science Citation Index Expanded.