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.

Author: Dirg Shaktihn
Country: Portugal
Language: English (Spanish)
Genre: Finance
Published (Last): 20 December 2008
Pages: 338
PDF File Size: 1.97 Mb
ePub File Size: 19.40 Mb
ISBN: 931-8-28674-354-6
Downloads: 46573
Price: Free* [*Free Regsitration Required]
Uploader: Shaktigal

This cgwr 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.

It is obvious that more nodes will lead to bigger average end-to-end delay. View at Google Scholar J. This phenomenon can be solved efficiently in hierarchical-based routing network. The node is fixed in coordinate originalbut moves along the vector.

Selection of cluster-head using PSO in CGSR protocol

For example, in Figure 6source node 1 has an original route to destination 10 i. The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both. After the above process, some clusters will have been formed. 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.

But to large scale networks, the frequent topology detection may invalidate the discovered routes, which would lead to high delay and network spending.

Routing Protocols for Ad Hoc Mobile Wireless Networks

When is bigger, node is more nuclear. If the source and destination are in the same cluster, the data packet can be transmitted directly or relayed by cluster head. Subscribe to Table of Contents Alerts.


And the role of cluster guest reduces the new clustering process taking place, proticol little routing overhead will be obtained. Hence the routing overhead will be decreased. Average end-to-end delay includes route finding, transmission lrotocol in MAC layer, and physical channel, which indicates protocoo connectivity and efficiency of the network.

Table of Contents Alerts. References Publications referenced by this paper. Abstract The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both.

In hierarchical routing protocols, superior clustering algorithm can not only reduce the routing overhead, but also increase the scalability of the net.

In our scheme, there are five possible states for nodes: In hierarchical-based routing [ 7 — 10 ], all nodes are divided into different clusters zones. Correspondingly, the coordinates of node are and.

The HCA algorithm used for the clustering initialization is described in Figure 2. It is due to the bigger speed leading to more frequent topology changes and hence more broken links or unreachable downstream nodes appear.

And the 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. If the source and destination are in the different clusters, the source must take the intracluster strategy.

A Clustering Routing Protocol for Mobile Ad Hoc Networks

The proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. And then, a CLEAR message is forwarded to source node 1, and hence rpotocol 1 will get a repaired route to destination 10 i.


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 another; therefore it will be elected as a gateway between these clusters.

The nodes linearly move in a single direction, where their direction is initially randomly chosen. But due to the mobility and constant topology changes of MANETs, designing routing protocols for those networks cgsg a challenging process, especially in the large-scale network.

Namely, when the destination is in the range of source, source and destination can communicate with each other directly or relayed lrotocol cluster head. Due to the frequent topology detection, an efficient and effective method of route maintenance in response to underlying network topology change is imperative because without routes validity the performance of a routing scheme in protoco dynamic, mobile environment is affected even adversely.

As a result of it, the cluster head holding time is decreased. ZRP Protofol Routing Protocol [ 11 ] is typical hybrid routing, which groups nodes into geographic zones. 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. Routing Search for additional papers on this topic. To receive news and publication updates for Mathematical Problems in Engineering, enter your email address in the box below.

Therefore, lrotocol packet acceptance ratio of HCA-R is the highest. Note that when node 3 receives the REP, it will send the message along the local shortest route i.