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):||27 July 2014|
|PDF File Size:||15.98 Mb|
|ePub File Size:||15.70 Mb|
|Price:||Free* [*Free Regsitration Required]|
According to the topology of networks, routing protocols can be classified into flat-based routing and hierarchical-based routing [ 56 ]. Otherwise, source and destination must exchange data through cluster head.
Mathematical Problems in Engineering
Hence, this mechanism is not suitable for large dynamic networks. So node 1 can send data packet to node 5 relayed by the cluster head i. Packet acceptance ratio is the ratio of the received data packet number at source to the sent data packet number at destination. Although this method can decrease the possibility of reclustering, but it cannot ensure the elected cluster head is logically centric and more profitable to play the cluster head role and hence to increase cgs whole network performance.
View at Google Scholar M.
And this mechanism is very helpful to reduce the route reestablishing expenses and end-to-end delay. So, node leaves from the transmission range of node need to track the segment. The CGSR lies under table driven or proactive protocol based on routing information update mechanism. In our scheme, there are five possible states for nodes: And the role of cluster guest reduces the new clustering process taking place, so little routing overhead will be obtained.
But to large scale networks, the frequent topology detection may invalidate the discovered routes, which would lead to high delay and network spending. To receive news and publication updates for Mathematical Problems in Engineering, enter your email address in the box below. For example, in Figure 4source node 1 and destination 5 are in the same cluster. Hence the routing overhead will be decreased.
From Figure 11it can be seen that the HCA-R outperforms others as it estimates the link duration more accurately, and hence more stable clusters will be established. Thus, the relative velocity between nodes and is. This indicates that the HCA performs more stability when the density of nodes increases. The analysis of Figure 1 b is similar to Figure 1 aso where the definition of and is the same as 1,and.
In hierarchical routing protocols, network overhead mainly comes from clustering process protocil information exchanges between clusters. For example, in Figure 5source node 1 wants to send data to destination 9. In hierarchical routing protocols, superior clustering algorithm can not only reduce the routing overhead, but also increase the scalability of the net.
Normalized routing overhead is the ratio of the total number of control message transmissions the forwarding of a control message at each hop is counted as one control transmission to the total number of data packets received, which indicates the efficiency of the routing protocol.
It must send a REQ to its attached cluster head 3 firstly and then node 3 sends the message to node 7 through gateway nodes 5 and 6.
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.
Thus, an efficient clustering algorithm must maintain a more protockl and less overlapping structure. It is obvious that more nodes will lead to bigger average end-to-end delay.
Subscribe to Table of Contents Alerts. If not, node 1 must send data packet to node 5 relayed by the cluster head i. View at Google Scholar J. Once the initial clustering phrase takes place, cluster heads and cluster members must exchange message to maintain the relationship periodically.
To evaluate the clustering algorithm and clustering routing protocol, we implemented them in the simulator NS2. Routing Prtocol for additional papers on this topic. View at Scopus J.
Routing Protocols for Ad Hoc Mobile Wireless Networks
Each node is assigned a weight indicating whether the node is suitable to act as a cluster head. Showing of 8 references. For simplicity, we assume that node is fixed and node is moving, but actually they are all moving at all times.