JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.

ORG

60

An Energy Efficient Multicast Routing Protocol Exploiting MGS Clustering Method in Mobile Ad-hoc Networks
Md.Mosaddek Khan and Md.Mamun-or-Rashid
Abstract The Routing Approaches in Mobile Ad-hoc Network have almost entered the saturated arena. But still there are available options of perfection in this meadow. In the routing approach it is difficult to find any proposal which can successfully mingle clustering, geographic information and multicasting technique. The task of improving the clustering techniques is one of the fields which is under rated as a research topic for further improvement of routing. Clustering based MANET routing protocols, which are popular in terms of efficiency, simplicity and usability mostly use circular based clustering techniques. And the election of cluster head is done through the use conventional approaches. This particular paper is mainly focused to launch a new-fangled routing protocol through which it is possible to use the surroundings defined above. It exploits multicast rather than using unicast and broadcast with some remarkable improvements. This approach also try to fix the existing typical problems reside in multicast approach. Another important aspect of this paper is to provide a cluster head selection algorithm which can effectively maintain the clusters and provides more stability. The clustering idea is useful for geographically related nodes effectively in different turf of routing. To maintain the clusters and their stability, it provides a new idea to select cluster head within the cluster, also the election of secondary cluster head for avoiding further election immediately after the unavailability of primary cluster head. Finally we provide an ef ficient way of multicast forwarding by utilizing the geometric angular direction. We have evaluated our proposed routing (MGS-Route) in network simulator (ns-2.34) and it outperforms the existing proposals. Index TermsModified Graham Scan (MGS), MGS-Route, Primary-CH, Secondary-CH, RC-State, Cluster Selector (CS).

1 INTRODUCTION
his is the time to launch an of use approach for Mobile Ad hoc routing protocol. This idea is utilizing the multicast approach for forwarding. For structuring and delegating the routing task cluster sloping attribute is used. Make use of geometric angular direction for selecting victims for multicast towards the destination. For the reason of cluster formation a cluster formation algorithm is provided. Cluster head selection algorithm for both primary and secondary cluster is also proposed for delegating the routing task & other useful functionalities in an efficient manner. Hopefully this approach provides a new dimension in the field of geographical approach of routing in Mobile ad hoc network. Multicasting is an efficient communication service for supporting multi-point applications (e.g., software distributions, audio/video conferencing) in the Internet. In MANET[], the role of multicast services is potentially even more important due the bandwidth and energy savings that can be achieved through multicast packets delivery. MANET multicast research started by adapting internet existing approaches to ad hoc networks. Two main approaches are used for multicast routing in fixed networks: group-shared tree and source-specific tree. In both

Md.Mosaddek Khan is with Dept. of Computer Science & Engineering, University of Dhaka Dr. Mamun-or-Rashid is with Dept. of Computer Science & Engineerin,

cases, multicast trees are constructed to interconnect all the members of the multicast group. Data is delivered along the tree paths to reach all group members. The source specific approach maintains, for each source, a tree towards all its receivers. In the group-share, a single tree is constructed for the whole group (e.g., regardless the sources location). Internet multicast routing protocols works well under static configurations; supporting multicast route under highly dynamic network configurations is a big challenge for ad hoc networking researchers. Location-aware routing protocols use, during the forwarding operations, the nodes position (i.e., geographical coordinates) provided by GPS [1] or other mechanisms. Specifically, anode selects the next hop for packets forwarding by using the physical position of its one-hop neighbors, and the physical position of the destination node. The packets are forwarded to a neighbor in the receiver direction; for this reason, these routing protocols are also referred to as position-based or geographic approaches. Generally, a location service is used to solve the queries about the current position of the networks node. The use of geo-location information avoids network wide searches, as both control and data packets are sent towards the known geographical coordinates of the destination node. These features make location-aware routing protocols quickly adaptive to route changes, and more scalable than unicast protocols. Any device with a microprocessor can in principle be an ad hoc network node[13]. Supporting a large number of

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

61

heterogeneous users is thus a requirement for future ad hoc networks. In a large network, flat routing schemes produce an excessive amount of information that can saturate the network. In addition, given the nodes heterogeneity, nodes may have highly variable amount of resources, and this naturally produces a hierarchy in their roles inside the network. Nodes with large computational and communication power, and powerful batteries are more suitable for supporting the ad hoc network functions (e.g., routing) [12] than small embedded systems. Cluster-based routing is interesting solution to2 address nodes heterogeneity, and to limit the amount of routing information that propagates inside the network. The basic idea behind clustering is to group the network nodes into a number of overlapping clusters. This enables the aggregation of the routing information, and consequently increases the routing algorithms scalability. Specifically, clustering makes possible a hierarchical routing in which paths are recorded between clusters (instead of between nodes); this increases the routes lifetime, thus decreasing the amount of routing control overhead. In this proposed scheme utilizes the essential characteristics of all the three mechanisms and uses them in the corresponding arena to provide an efficient routing scheme.

2 RELATED WORKS
Different clustering algorithms have been introduced to group mobile nodes and elect cluster heads in cluster based routing protocols. In HSR [2], hierarchical addressing is used and the network may have a recursive multilevel cluster structure. Moreover, a location management mechanism is used in HSR to map the logical address to the physical address. CGSR[2] is based on DSDV[2], a proactive routing protocol for mobile ad hoc networks, and every node keeps routing information for other nodes in both the cluster member table and the routing table. In CBRP [2], every node keeps information about its neighbors and a cluster head maintains information about its members and its neighboring cluster heads. CBRP exploits the source routing scheme and the addresses of cluster heads along a route are recorded in the data packets. CIDR [3]exploits the clustering by group affinity. In each domain, the distributed clustering algorithm discovers the set of traveling companions- these are the nodes that stick together as a group for some time or for some common tasks. It elects within each set a Cluster Head (CH) for each affinity group. Affinity [4] is defined in terms of some common characteristics, such as group motion or same tasks. The clusters (i.e., subnets) are defined a priori or evolve dynamically by the affinity of geography, motion, or task. The cluster head in the subnet acts as local DNS for own cluster and also (redundantly) for neighbor clusters. Note that the clustering algorithm re-

quires periodic communications between nodes in the underlying pool nodes that are candidates to become members in the cluster. If the cluster uses a proactive routing algorithm, the routing algorithm itself can be used for cluster creation and cluster-head election. In the case of on-demand routing like AODV[5] and DSR[5], a separate periodic algorithm such as Distance Vector must be implemented to support the cluster functions and to propagate the cluster head advertisements across the cluster. The DSDV[5] distance information is used to detect and form clusters with group affinity. Once the clusters are created and the cluster heads elected, the routing is a two level operation. In the proposed protocol, packets to remote nodes are routed via cluster-head advertised routes, and packets to local destinations are routed using the local routing algorithm. When a source node wants to transmit a packet, the destination node ID is first searched in the source nodes local routing table. The local routing protocol will be applied if the destination node is located in the same domain as the source node. The destination node ID wont be found in the local routing table of the source node if the destination is located in a remote subnet, i.e., a different domain. In this case, the source node transmits the packet to its cluster head using local routing protocol. The packet travels from the source nodes cluster head to the destination nodes cluster head, using the advertised inter-domain DSDV route. From the latter it is delivered to the destination node via local routing protocol or DSDV. The cluster selection mechanism proposed in ODSCMP [6] is based the minimal hop counts from source nodes to the destination nodes. When the nodes join to the network, each source node will flood Ctrl req packets to all nodes periodically to get the routing information and network topology. For example, when source node i received Ctrl req packets, it will record the hop counts from the source nodes and the destination nodes. Secondly, after a period of time TGI each node got the minimal total hop counts to all source and destination nodes, and will calculate out the parameters TotalHopCount ToSrc and TotalhopCountToDest, then it will insert these two parameters into the elds of Ctrl req and sent to the other source nodes. How to select cluster header from the source nodes in a certain area. Each source node will calculate its own TotalHopCount which is the sum of TotalHopCountToSrc and TotalhopCountToDest, and compare it with the corresponding elds in the Ctrl req from the other source nodes. If its TotalHopCount is the maximal value in the area, it will be the cluster header in the certain area, otherwise it will be a normal source and will send a join request to the cluster header source node. M-MAODV [7] makes use of Heading Directional Angle (HDA)of the nodes in the network to limit the routing overhead (PREQ) and to select the long lived route to the destination. Each node is exchanging its information with its neighbors in a periodic manner.

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

62

Fig. 1 Flow Chart of Nodes Activities the caption.

3 PRELIMINARIES
In the proposed approach all the nodes can be distinguished through their geographical position corresponding to the cluster available for them. The procedure for a node to make itself a member of a cluster and perform some functions is given below. A node finds itself in one of three conditions. It may be in Relax state, Robinson Crusoe State or Cluster Creator mode. If it find itself in a position where there exists a cluster available for this then its a relax node, the state of relax node is defined as a relax state. A relax node has some normal functions to do for make the cluster aware about itself and make the cluster converge. Relax node propagate information to become a member of the cluster. When a node is alone and nobody is there to make a cluster then it will become an Isolated Node. This situation can be defined as Robinson Crusoe State. If it fails to find any cluster to become its member or there is no suitable number of nodes available for creating a cluster then it works as Robinson to find somebody to communicate with in its range. The features of isolated node are described shortly later in this paper. Another situation can occur when there is enough nodes are available for establishment of a cluster. Then we use Modified Graham Scan [MGS] algorithm for creating a cluster. Here a crucial fact is that cluster head and cluster creator are different in their nature and activity. It is not possible for a cluster creator to works as cluster head in the proposed clustering approach. The flow chart in g 1 shows the overall procedure of a node which can acts as each previously defined state.

Let x be the maximum distance that is selected to define the boundary nodes of the clusters. Here every pair of nodes in the cluster boundary can have maximum x distance 2) The node with minimum Y-coordinate is determined as cluster creator for that cluster. The CC is denoted as q0. 3) Now q0 is looking to nd his next boundary member by searching anti clockwise. So next member will be the node with second least Y-coordinate value. For each selection of next boundary member this procedure will be executed. But for each selection need to maintain a checking for x. 4) push(q0,S),push(q1,S),push(q2,S) for i=3 to n [n is the maximum selected boundary members] while the angle formed by points Next to Top(S),Top(S),and Pi makes a non left turn do pop(S) push (Pi, S) return S. The term x is the main modification in Graham Scan Algorithm that is proposed. Note that x is not the transmission range. It is chosen carefully to determine the actual figure of the cluster with respect to geographical area where the nodes with in this particular cluster reside. Another part of modification is the highest selected boundary members. the selection absolute value of highest selected boundary member n demands more research. A simple example of cluster formation is shown in fig 2. Suppose (CM1,CM2...CMn) are the nodes within the cluster other than boundary members. Let R is the average transmission range of the cluster members. All pair max distance, x = 2.5* R. This decision of choosing x provides the tradeoff between cluster size with respect to area and costs of transmit the message outside the cluster area. This basic structure of MGS helps to obtain efficient communication in MANETs and to achieve the scalability in large networks. From very first research of cluster based approach of MANET routing protocol maximum cluster formation algorithm is based on circle. But MGS try to utilize convex polygon. The reason behind that is very obvious. The geographic area based formation of circle often produce dense or sparse cluster most of the time in real life. But by using MGS approach we guarantee that the number of cluster member always be in reasonable limit because of the use of n.

1)

4 CLUSTER FORMATION
The design of MGS tries overcoming the existing problems of clustering techniques those are used in different reactive, proactive, hybrid MANET routing protocols. In this particular clustering technique, well known Graham Scan algorithm [8]is used with some modification[10] to form a cluster. Modified Graham Scan Algorithm MGS (Q, S)

5 CLUSTER HEAD SELECTION

Here is the proposal for selecting the cluster head. First of all need to make it clear through a reminder that cluster creator and cluster head is not the same for this specific design. Some specification by which we can define a specific node as cluster head or some other for its future replacement is provided in this approach. That is when the present cluster head will move from current cluster or

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

63

Fig. 2 Cluster Formation through the use of MGS

Fig. 3 Election of Cluster Head

6,2-8 and 4-10 is used in same procedure to find the CS2. Role of a cluster is not fixed for each cluster based algorithm. Though every algorithm use some basic roles with some proposed roles. MGS use some of the roles of a CH those are previously defined. But mainly it focused on using the CH as its defied criteria. Additional roles or features of cluster heads are defined below. Cluster head contains some additional information about location and angle of its member nodes. For that it needs to maintain a table that contains the area it belongs, the location of the boundary members and normal nodes. It is also responsible for providing better service for isolated nodes [features of isolated nodes are discussed shortly].It should contain some features by using those it can maintain the moving nodes those are going out or in the cluster area. It is strongly recommended that a cluster head must maintain a table that contains some information about previous mobility of clusters boundary members. Communications between nodes in the underlying pool nodes that are candidates to become members in the cluster. Note that MGS oppose the idea to use CH as the only via to forward message from the cluster. In the proposed scheme each node can be a forwarder from the cluster. CH helps to maintain the cluster so that each member is aware about their own geographic position as well as their sibling members of that cluster. This information is most useful to obtain the geographic angular position of nodes to forward packet. CH plays important role to support the cluster related functions and to propagate the cluster head advertisements across the cluster.

step down by any reason then this secondary cluster head take control of this cluster and works as full-face cluster head & this procedure will continue until the end of this cluster. Here is one important statement that needs to be noted that the end of cluster is special situation which is declared clearly later in this article. In MGS we propose a CH election algorithm unlike the previous approaches of using hop count or neighbor discovery MGS utilize the facilities provided by Global Positioning System. As the geographical position of each cluster boundary nodes is previously known to cluster creator. The cluster creator is the initiator of the CH-election algorithm. Some mathematical contemplation as well as some zone oriented features are used. Calculate two points CS1 & CS2 within the cluster area and the closest node from the first point is declared as a cluster head and same decision criteria is used for selecting the secondary cluster head. But in the worst case when both the cluster head and secondary cluster head is goes down at a time then the CS1 and CS2 is used again for cluster head selection with same approach once again. Let n =12, where n is maximum number of boundary members described in MGS (Q,S) algorithm. Then odd nodes are 1,3,5,7,9,11 and even nodes are 0,2,4,6,8,10. Here odd and even nodes are used for determining CS1 & CS2 respectively. For this particular example we visualize lines 1-7,3-9 and 5-11 accordingly so the intersecting point is the CS1. If the three points do not intersect in a single point then centroid of the triangle is chosen as CS1 and 0-

6 PACKET FORWARDING SCHEME

One of the two basic functions of a router is packet forwarding. As it is popularly known that in Mobile Ad hoc Network each node can be used as an individual router. For determining the path for sending packet need to send a control packet. After establishing the required path with the destination, sender sends the actual data. The proposed approach provides an algorithm for forwarding standpoint. The pseudo code of MGS-Route is given below:

Fig. 4 Packet Forwarding Approach

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

64

MGS-Route (Source S, Destination D) Let p1, p2,p3...pN be the nodes with the corresponding transmission range r1, r2, r3... r N. Let transmission range of S and D is Rs, Ds. If (D is within Rs) Forward the packet to D else define an ellipse region with centroid G in the line SD G=Rs-b; [where b is the half of minor axes of that particular ellipse]. a= sin (theta) * 90; [Here a is the half of the major axes of that particular ellipse and (2* theta) is the predefined angle which define the leftmost and rightmost point of that ellipse]. b= (Rs-20)/2; From the available nodes within the ellipse region select the farthest node in a single angle towards the destination. This selected nodes are considered as victim nodes for multicasting. Intermediate-node (V []) Each V[i] sequentially try to define an ellipse for next step. If No victim is successful then for same sequence a+=5 b+=3 This procedure is repeated until reaching the destination. An example of our proposed packet forwarding approach is given below: Let b= 10m ;if theta=30/2 Now, sin 15=a/90 =>a=0.26*90 so a= 23.4m If it there is no victims available by fulfilling all possible requirements described in the above algorithm then the value of a and b will be 28.5 and 13 in the immediate next step. For this design concern where cluster structure [Modified Graham Scan Algorithm].and geographic position of nodes are previously known. It is assumed that through the use of Global Positioning System (GPS) and the information receiving periodically from cluster head each node is aware of its neighbors positional angle. In this scenario MGS-Route provides an efficient way of how to establish a path. Suppose a node p1 who is willing to send a message to a node say q1. Let the transmission range of p1 is 100 m. Now p1 choose the victim nodes to multicast its packet. The convention says that p1 virtually construct a ellipse area from where the victim will be chosen. P1 now chose the nodes in that region those are in highest distance in each angle of that 30 degree ellipse region. This procedure will continue up to finding the destination. Let the total broadcast region is total reg for the particular sender. MGS-Route reduce it in 1/4th region in the very first of its execution. Selection of ellipse region reduce it another 1/4th to 1/10th region in different environment. Finally its a great achievement to reduce it to 1/6th to 1/9th of total_reg.

7 ACHIEVEMENTS
One of the main advantages that is made available by using the Graham Scan Algorithm with some modification is stability of Clusters. In most of the clustering approach, clusters are so much vulnerable with the escalating mobility of their members. The proposed approach of cluster formation increases the existence of cluster although it stands with the mobile nodes. MGS provides some convex polygon as clusters. It creates The boundary nodes need to find them self in worst case scenario due to the mobility environment for break up the cluster. MGSRoute is one of the remarkable achievements in this entire work, which provides the efficient way of routing and forwarding by utilizing the Multicasting. MGS-Route dramatically reduces the number of victims for multicasting as well. Probabilistic measurements shows that our proposed approach dramatically decrease the victims with compare to the broadcast techniques and other existing multicast approaches as well. But still this selection mechanism provides the flexibility than unicast approach with alternative forwarders. So this may conclude with the fact that it successfully generates the tradeoff among them.

7 PARAMETERS
The simulation environment parameters which are used in Network Simulator [9][11] are listed in table I: TABLE 1 SIMULATION PARAMETER SETUP

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

65

8 RESULTS
8.1 Cluster Head Selection
Every members of a cluster is strongly bounded to their corresponding clusters. But there might be scenario where due to increasing mobility environment of nodes cluster head may have to move outside the cluster or it may not be available due to the physical disasters. To reduce the execution of selection algorithm MGS propose the secondary cluster as beside the primary cluster head with almost same algorithm. On the other hand no such method is available in other approaches. Fig 5 shows the simulation scenario for this important metrics.

Fig. 5 Execution of Custer Head Selection Algorithm.

8.2 Cluster Size (Members)

In fig 6 we observe the scenario where due to the network density the members within the cluster increase. This obviously affects the performance of cluster head as it has to maintain more information. MGS fixed the cluster boundary members. By using this fixed size we can control the maximum number of members within a cluster. On the other hand using of circular techniques of cluster formation always causes problems here as the number of nodes can never be guaranteed in preferable number so they are unable to control the number of members with in a cluster.

Fig. 6 Cluster Size through Considering the Density

8.3 Number of Cluster Reformation & Cluster Residence Time

MGS minimize the number of cluster reformation and increase the cluster residence time by strong bindings of nodes to cluster. If mobility of nodes is too high then it needs more reformation and selection otherwise it works really well. Fig 7 & 8 shows this for different average speeds of nodes for all approaches
Fig. 7 Execution of Cluster Formation Algorithm

8.4 Delivery Ratio

The delivery ratio should be closed to 1 for corresponding packet generation rate. Fig 9 shows the fact that as the packet generation rates increase due to the increasing congestion delivery ratio is decreased slightly. In comparison MGS provides better result than corresponding GIDR [4],ODSCMP[6] and M-MAODV [7] due to its capability of taking the advantages of multipath routing more effectively. M-MAODV uses Heading Direction Angle (HDA) for choosing neighbors which has some poor scenario in case of taking the facilities of multipath, GIDR uses Geo-DFR routing components for which it performs better than M-MAODV and ODSCMP, but still lack of efficiency exists in using of multipath routing in GIDR for which MGS performs better. In fig 10 where mobility of nodes is taking under consideration, this comparison is based on different speed of nodes. Here from the graph it is clear that if average speed is less then

Fig. 8 Stability Measurement of Cluster

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

66

delivery ratio is more optimal. As mobility affects the performance of delivery ratio. But In the proposed idea the affects are largely minimized through the use of strong cluster formation schemes. Within the cluster movements of nodes do not cause the problem but if nodes go out of the cluster then it may cause some problem.

8.5 End to End Average Delay

As source nodes increase their packet generation rates, the end-to-end packet delay increases in all protocols. This is also referred to as latency, and is the time needed to deliver the message. Data delay can be divided into queuing delay and propagation delay. If queuing delay is ignored, propagation delay can be replaced by hop count, because of proportionality. In comparison MGS provides less end to end average delay than other protocols. Fig 11 provides this result in static scenario. Reason behind this is very obvious as by using HDA, Source based approach or directly using the Geo-DFR approach, it may chooses a node as forwarder which is closer than the node with far apart but within its range. So hop count increases as with end to end delay. We chose most apart nodes in the right direction for which MGS works better. Same simulation as previous except the addition of mobility of nodes & of course simulation result provides by only using the proposed MGS method for various speed of nodes. As usual for same packet generation rate increasing the speed always causes increasing the end to end delay. But in our proposed scheme we try to provide some facilities that can improve the throughput for mo. As MGS tries to use the most of the transmission range which provides some improvement in case of mobility. Fig 12 shows the impact of this scenario.

Fig. 9 Simulation Result of Delivery Ratio

Fig. 10 Delivery Ratio for Mobility Environment

8.6 Hop Distance

All routing protocol need more hop distance than actual. Other proposals work well if the selected forwarder node lays in the very last area of source transmission range but in real life this scenario is rarely available. So to overcome this problem MGS offer facilities for sender nodes that they can choose forwarder in such a way that more distance node within the transmission range is always chosen. The benefit of using this scheme is clearly shown in fig 13.

Fig. 11 End-to-End Average Delay

8.7 No. of Forwarder Selected per Step

As a multicast protocol in every steps need to use several forwarder per step. But if too many nodes are chosen then it causes some problematic scenario. For solving this problem MGS provide a tradeoff between this two. With comparison to GIDR & ODSCMP it is clear that it works well for average density level of state but for higher density scenario it does networks well. On the other hand the forwarder selection strategy given by MGS works well for all the density levels. In fig 14 simulation results for this metrics is shown.

Fig. 12 End-to-End Average Delay for Mobility Environment

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

67

[3] Z. G. M. Zhou, B.and Cao, Cluster-based inter-domain

routing (CIDR) protocol for MANETs, IEEE/IFIP WONS, pp. 1926, 2009. M. Gerla, A. Tiwari, B. Zhou, K. Zhu, Y. Lu, A. Ganguli, B. Shen, and D. Krzysiak, Geo-Based Inter-Domain Routing (GIDR) Protocol for MANETS, pp. 17, 2009. I. Chlamtac, M. Conti, and J. Liu, Mobile Ad Hoc Networking: imperatives and challenges, Ad Hoc Networks, vol. 1, no. 1, pp. 1364, 2003. M. H. X. Siwei, Liu. Dejun, An on-demand source based clustering multicast routing protocol in Ad Hoc network, pp. 408412, 2009. P. Latha and R. Ramachandran, HDA: Heading Direction Angle based Multicast Routing for Mobile Adhoc, pp. 1067 1072, 2009. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. PHI, 2004-2005. [Online]. Available: http://www.isi.edu/nsnam/ns// Md.Mosaddek Khan and Md. Mamun-or-Rashid, A stable

[4]

[5]

[6]

Fig. 13 Hop Distance.

[7]

[8] [9] [10]

clustering method for efficient geographic routing in mobile ad-hoc networks," in 13th International Conference on Computer and Information Technology (ICCIT), 2010. IEEE, pp. 539-544. [11] [Online]. Available: http://www.nsnam.org/ [12] [Online]. Available: www.afar.net/wireless/ [13] [Online]. Available: www.ietf.org/html.charters/manetcharter.html
Md.Mosaddek Khan received B.Sc.(Hons.) in Computer Science & Engineering from University of Dhaka, Bangladesh.He is currently doing his M.S. in Computer Science & Engineering from University of Dhaka, Bangladesh Worked as a lecturer at Department of Computer Science & Engineering, Ahsanullah University of Science & Tehnology , Bangladesh. His research interests include Mobile Ad-hoc Networks, Wireless Mesh Networks, Sensor Networks and Theoritical Computer Science.

Fig. 14 Selection of Forwarder Nodes

9 CONCLUSION
We have entered the era of wireless networks. Wireless devices like Laptop, LANs and phones become commonplace in anywhere in the world. Through the use of infrastructure base wireless network we have almost found the destiny of this field, but still there exist lots of scenarios where we need to use infrastructure less network in situation like battle fields, areas affected by natural disaster etc. So here is the reason of birth of Mobile Ad hoc Network. MANET routing protocol is one of the most challenging area for researcher. In this paper we try to work on a specific field of routing in MANET. The experiments have shown that the MANET nodes have achieved the relatively stable platform through the use of proposed MGS-cluster formation algorithm. The feature Primary and Secondary cluster provides the more effective way to maintain the cluster. But obviously the main contribution of our job is the feature of packet forwarding (MGS-Route) which provides the better performance than other recent proposal in the same field.

Dr.Md.Mamun-or-Rashid received B.Sc.(Hons.) in Computer Science & Engineering from University of Dhaka. He received M.S. in Computer Science & Engineering from University of Dhaka, Bangladesh. He received PhD. degree in Computer Science & Engineering from Kyung Hee University in South Korea. He is currently worked as a A ssistant professor at Department of CSE,University of Dhaka, Bangladesh. His research interests include Wireless Ad-hoc Networks, Sensor Networks, Wireless Mesh Networks, Future Internet, Multiple Access Control, Congestion control.

REFERENCES
[1] B. Hofmann-Wellenhof, H. Lichtenegger, and J. Collins,
Global Positioning System. Theory and Practice. 1993.

[2] C. Liu and J. Kaiser, A survey of mobile ad hoc network

routing protocols, University of Magdeburg, vol. 13, no. 5, pp. 3382, 2005.