- Open Access
- Total Downloads : 16
- Authors : M.Kavipriya
- Paper ID : IJERTCONV2IS05072
- Volume & Issue : NCICCT – 2014 (Volume 2 – Issue 05)
- Published (First Online): 30-07-2018
- ISSN (Online) : 2278-0181
- Publisher Name : IJERT
- License: This work is licensed under a Creative Commons Attribution 4.0 International License
A Mobility based Routing method for Efficient Rebroadcasting in Mobile Ad Hoc Networks
PG Scholar, Department of CSE Paavai Engineering College Pachal, Namakkal. email@example.com
Abstract MOBILE ad hoc networks (MANETs) are defined as the collection or a group of nodes where they can move independently. The nodes organize or group themselves. They dont have any fixed infrastructure. The challenge of the mobile ad hoc network is their routing protocols are dynamic which increases performance and decreases the routing overhead. The objective of Transition based Percolation Model for improved Probabilistic Rebroadcasting in MANET is to increase network routing performance. It determines phase transition of a probabilistic broadcast stream. The Phase transition is a sudden change of state, where small changes of a given parameter induces great shift in network. The global behavior transition occurs at a specific critical threshold. The Phase transition probability rebroadcast is arrived to improve routing performance on high mobility node. It observes phase transition in probabilistic rebroadcast algorithm within all or known subsets of MANET topologies. The Phase transition in percolation models is observed as a change of state between finite number of clusters and one infinite cluster. Percolation theory evolves the existence and value for which phase transition occurs, cluster numbers, sizes and structures. Simulations were conducted on different ad hoc nodes to measure the performance in terms of Packet delivery ratio, MAC Collision rate, and Average end to end delay.
KeywordsMobile Ad hoc Networks (MANET); probabilistic rebroadcast; routing overhead.
A Mobile Ad hoc Network (MANET) has a large number of mobile hosts, which are connected to each other through the wireless communication. Before reaching the destination, the packet must go to number of hops typically. Hence, the mobile host in each and every network have a restriction and behave when needed as a router to ensure the delivery of the packet.
Mobile ad hoc networks (MANETs) consists of a freely moving nodes collection. They can dynamically arrange and organize themselves without any type of infrastructure. It will be based on the arbitrary topology if the group. The fundamental challenge in the mobile ad hoc networks is their dynamic routing protocol design that increases performance and reduces the overhead. The number of routing protocols such as Dynamic Source Routing, Ad hoc on Demand Distance Vector Routing have been used for the mobile networks. The demand routing protocols that are mentioned above increases the scalability of the mobile ad hoc networks by decreasing the routing overhead when a new route request is established. Still, due to presence of mobility of nodes in the mobile networks, there exists a link breakages often and as well as the discovery of route that stimulates the overhead of routing and decreases the ratio of the packet delivery.
The conventional protocols for the on-demand routing discover route using the flooding algorithm. The Route Request (RREQ) is broadcasted from the packet to the networks, and excessive redundant retransmissions is induced by broadcasting the RREQ packet and the broadcast storm problem is caused, which leads to a number of packet collisions, where the network is very denser. Therefore, optimizing this broadcasting mechanism is very dispensable. For optimizing this broadcast problem, many methods have been proposed in mobile ad hoc networks. The broadcasting protocols are categorized into four classes: probability-based methods, simple flooding, neighbor knowledge methods and area based methods. For the broadcasting protocols of above four type, an increase in the number of nodes are showed where the static network will degrade the performance of the area-based and probability-based methods. The uncovered neighbors (UCN) scheme considers the rebroadcast probability contains information about the connectivity
metric and local node density. The Rebroadcast probability is of two parts additional coverage ratio and connectivity factor.
Additional coverage ratio of the number of nodes covered by a single broadcast to total number of neighbors. Connectivity reflects relationship of network connectivity and number of neighbors of a given node to maximize coverage in the network to reduces the rebroadcast, redundancy and broadcast latency.
For stable route broadcast scheduling, the random nodes are simultaneously integrated for transmission Schedules. The Minimum broadcast schedule leads to maximum data transmissions in the network. It achieves less collision and bandwidth of channels are properly utilized. Hence it increase rebroadcast efficiency, throughput, and route stability.
As the results of advances in wireless communication technology, portable computers with wireless interfaces can communicate among themselves, It is argued that future wireless network will be converged to be more easily reconfigurable situations such as Mobile Ad hoc network (MANET). MANET is a type of some special wireless mobile network where they can communicate using the mobile host without any infrastructure established. be deployed For applications such as disaster relief ,battlefield, and rescue, etc they can be deployed.
T.K. Araghi, M. zamani, M. Mnaf,  in their paper described that a collection of wireless mobile hosts is an ad hoc network that forms a temporary group without any infrastructure established on a central network administration. It is necessary for some environment where the mobile host depends for aid of some other hosts during a packet forwarding to the destination with the limited range in the wireless transmission of the mobile host.
The routing protocol presented in this paper used dynamic source routing for ad hoc networks. he routing change will be quickly adapted by the protocol where frequent movement of node is there. Based on packet level simulation from the mobile hosts which operated in ad hoc network, performs well with many of the conditions which as movement rates and the density of the hosts.
A.A. Jeng, Rong-Hong Jan  in their paper described that broadcasting in the mobile networks provides a control that is important for the establishment of the route with many number of multicast and unicast protocols. A building block of the network is considered for the network layer of other
protocols, a standardized MANET community is needed for delivering the packet efficiently to the nodes in the network.
As a number of broadcasting schemes which are proposed are considered and an analysis based on comparative is done previously. He in this paper an analysis is provided with the existing schemes of broadcasting and the category is simulated. Thus a comparison is supplied for each nodes present in the network..
By pinpointing the simulations for each category, there are some failures for the network which are related to the dynamic topology and the congestion of bandwidth. The protocol extensions in addition uses some responses to the network conditions are proposed, and it is implemented and analyzed for comparative study.
S.A.V. Ali, W.R. Jayaseelan, S. Hariharan, in their paper, a large scale wireless network is considered with a low density of nodes per unit area with less critical interferences and contrary with connectivity. The latter property is studied in this paper for a hybrid network and a pure ad hoc networks where the base stations fixed can be reached easily. The power constraits assumed here uses maximal distance for modeling with the nodes that are not connected directly. As the sparse network is introduced with the base stations which significantly helps in improving the connectivity, only when the density of the node is larger.
The results are explained by using the percolation theory that uses the analytical expressions for the node connectivity. Also a low spatial density of nodes is shown because of the unavoidable bottlenecks. The results obtained from the actual population of data with findings. If all the networks are connected each other with base station so that they can communicate each other although the distance separates each of the nodes in the networks
. D. Kasamatsu, Y. Kawamura, M. Oki, N. Shinomiya,  in their paper described that the High stream MANET broadcast topology each node operates with limited transmission range. Its able to directly communicate only with nodes within its transmission range (neighbors).
The Node does not know the entire topology indulges in a broadcast-based query-reply mechanism to discover routes to distant nodes. The nodes outside its neighborhood is to send data packets to the other nodes.
The architecture of mobility based rebroadcasting for efficient routing in mobile ad hoc network.
The phases involved in the proposed scheme are:
High stream MANET broadcast topology
Controlled phase transition
Percolation based rebroadcast
A). High streamMANET broadcast topology
The Broadcast of a communication paradigm message originating from one node reaches every other node in the network. The Broadcast is realized through active involvement of all nodes in terms of forwarding message in each others neighborhood. If all the links in a MANET are used for broadcasting messages, it results in too much of redundancy.
The node would receive a copy of the same message from each of its neighbors energy consumption, collision of messages, referred as high stream broadcast. The Broadcast optimization mechanism choose only subset of nodes in network to broadcast a message (in its neighborhood) so that message reaches every node in the network. The Broadcast optimization mechanisms select the set of nodes that forward a message to their neighbors
Controlled Phase Transition
L.C. Llewellyn, K.M. Hopkinson, S.R. Graham,  in their paper said that the Controlled phase transition is a phenomenon where MANET undergoes sudden change of state. The Small changes of a given parameter in the system induces great shift in global behavior in the group of nodes which are present in the clusters. This behavior therefore brings a change in the transition of the nodes in network.
The Abrupt transition occurs at a specific value called critical point or critical threshold. The below critical point system is said to be in a subcritical phase. The global behavior is non-existent in above critical point system and is in supercritical phase and has global property.
The Cost-efficient phase transition in probabilistic flooding algorithm is carried out within all or known subsets of MANET topologies. The implication within such cases is that there exists certain probability threshold at which flooded message reach all nodes within multi-hop broadcast reach. The Broadcasting with probability greater than critical point did not provide any significant results.
Percolation Based Rebroadcast
In general, the cluster is a collection or a group of nodes. Here the Cluster is a set of connected entities with edges for bond percolation sites for site percolation. The Cluster that reaches from one side of lattice to other is said to be an infinite cluster. In percolation based rebroadcast there is no loss of fluid. It Arrives a model useful for extracting best-case results for specific MANET topology reduced to percolation case with known theoretical results. The Nodes communication range is R.
Shakkeera  said that the Phase transition in percolation models is observed as change of state between finite number of clusters and one infinite cluster.The Nodes are randomly placed on an mÃ—n area according to probability distribution such as Poisson functions. Link connecting nodes i and j is added to graph if Euclidean distance between nodes is less than R.
The Probabilistic flooding implies a node. To choose not to broadcast a message to all its neighbors within range with probability 1 p resulting in fluid not flowing in any of links attached to node using percolation. In random graph models edges are added or removed independently.
Here the Mobility Based Probabilistic Rebroadcasting for Efficient Routing Performance in the mobile ad hoc network is evaluated by the following metrics.
Packet Delivery Ratio
MAC Collision rate
Average end to end delay
TABLE 1. PACKET DELIVERY RATIO
Number of Node
Packet delivery Ratio in
Packet Deli Ratio Proposed
Table I demonstrates the Packet delivery ratio. X axis represents the number of nodes whereas Y axis denotes the Packet Delivery Ratio using both the proposed Transition base percolation model (TPM).
No of Nodes
Figure 1. Packet Delivery Ratio.
When the number of nodes increased, Packet delivery ratio rate gets increases accordingly. The rate of Packet delivery ratio is illustrated using the existing NCPR and proposed TPM Techniques.
It shows better performance of proposed TPM Technique in terms of No of nodes density than existing and proposed TPM. Transition percolation model 15 to 25% less Packet delivery ratio rate variation when compared with the packet delivery ratio of the existing system.
TABLE II. MAC COLLISION RATE
Number of Node
MAC Collision rate in
MAC Collision rate in
Table II demonstrates the MAC Collision rate.
Here X axis represents the number of nodes whereas Y axis denotes MAC Collision rate the using both the NCPR and our proposed TPM.
10 20 30 40 50
No of Nodes
Figure 2. MAC Collision Rate
When the number of nodes increased, MAC Collision rate also gets decreases accordingly. The MAC Collision is illustrated using the existing NCPR and our proposed TPM.
Figure 2 shows a better performance for the model described in terms o nodes than existing NCPR and our proposed TPM. Transition percolation model achieves 20 to 35% less MAC Collision rate variation when compared with existing system.
The analytical results obtained with the proposed model are in a close agreement with simulation results which are obtained from the discrete-event of simulations.
TABLE III. AVERAGE END TO END DELAY
Number of Node
Average end to end delay in Existing
Average end to end delay in Proposed
Table III demonstrates the Average End to End Delay.
protocols (for example, the scheme based on cluster) can be combined usefully with the gossiping to get some performance improvements further. It is proceeded by selecting some random nodes to which gossip is carried out.
Xiaoqin Chen, Jones, M. Haley, D. Jayalath,  in their paper discussed that the mobile ad hoc network is a group of mobile nodes that are co-operative without any requirement of an infrastructure or an access point. An ad hoc on demand distance vector routing is presented in this paper for operating the mobile ad hoc networks which is based on the novel algorithm. A router which specially operates the mobile host and the routes as needed are obtained..
For self starting of the network dynamically a new routing algorithm should be needed for the users. The AODV algorithm provides some free routes for the ad hoc networks when the links are broken or even repaired.. The advertisement for global periodic routing
Average end to end delay (ms)
No of Nodes
is not necessary for this protocol. The number of nodes is less as the available bandwidth is low for this protocol. This mechanism has an advantage with distance vector routing and can be easily maintained. The results can be verified from the operation of the simulation and methodology of the routing algorithm provided.
Hui Xu, Xianren Wu, H.R. Sadjadpour,  presented a framework based on the mathematical evaluation of the proactive performance and the routing
Figure 3. Average End to End Delay
The X axis represents number of nodes whereas Y axis denotes the Average End to End Delay using both the NCPR and our proposed TPM Technique. When the number of nodes increases, the Average End to End Delay gets increased. Transition percolation achieves 30% to 50% more Average End to End delay when compared with existing schemes.
Tsung-Chuan Huang, Sheng-Chieh Chen, Lung Tang,  described the approach based on the gossiping where forwarding of message to each node with a probability to decrease the overhead with routing protocols. Some execution fraction is carried where message in nodes depends on probability of gossiping and the network topology. For the networks, the probability of gossiping will be between 0.6 to 0.8 to ensure that each node receives a message at all execution. For the networks that are larger the gossip protocol will be up to 33 % with fewer flooding and increased performance. Various optimizations can be combined with gossiping to get more benefits. The optimizations that are applied for flooding by the other
reactive protocols in the mobile ad hoc networks. This framework is unified and provides a parametric view of the given protocol which gives a deeper sight of the operations and the effects rare revealed further. The acting effect of the network parameter is combined. It comes from a combinational model and a parametric model for analyzing the routing logic with the performance of the MAC. Each of the wireless node is seen independently with a queue priority based on customer queue. The broadcast packets and the unicast are the two types. The captured model is essential in the behavior and the network size is limited by the scalability that provides a very good performance with the proactive routing protocols under different types of network configurations and different mobility conditions.
L.C. Llewellyn, K.M. Hopkinson, K.M, S.R. Graham,  said that a mobile ad hoc network (MANET) is a number of nodes with communicating hosts which forms an arbitrary network by a topology with a number of wireless media communications. The communications in MANET is represented by by a technology in the communication which are necessary
to solve the requirements of the network communications in the group.
With a number of challenges in the distributed system the routing based problem with a number of customer preferences that are predefined which ensures the service provided. This is the main aim of the research. But when featuring the nodes that are present in the network, this becomes very critical. A new fault tolerant algorithm is used for calculating the recovery time of the failure time. This also ensures the quality of service which decreases the bandwidth usage that decreases the failure of the nodes.
R.J. La, Eunyoung Seo,  studied about the overhead of the routing and collected the information about the mobile networks for setting the route based on the geography. A number of new framework is provided initially with the increase in routing overhead to chare the information of the actual location. By decreasing the available number of bits, he node location can be easily and identified and the message is sent to the destination.
This result can be used for simulating the the overhead that is, (n1.5log (n)), where n stands for the number of nodes, under the both type of routing that is assumed previously. Here the mobility of the nodes is free in nature and each can manage themselves to maintain the range for the connectivity. Hence we can prove the less amount of the overhead expected based on (n log (n)).
In this paper we performed a tradeoff analysis gain in reliability, timeliness, and security for ad hoc utilizing Transition percolation based model to answer user queries. Finally, we applied our analysis results to the design of a TPM Techniques to identify and apply the best design parameter settings in Ns2. we implemented the proposed scheme, and conducted comprehensive performance analysis and evaluation, which showed its efficiency over existing schemes.
The author wish to thank the Computer Science Department of Paavai Engineering College for their support to carry out this project successfully.
T.K. Araghi, M. zamani, M. Mnaf, Performance Analysis in Reactive Routing Protocolsin Wireless Mobile Ad Hoc Networks Using DSR, AODV and AOMDV, International conference on Informatics and Creative Multimedia (ICICM), 2013 pp. 81-84
A.A. Jeng, Rong-Hong Jan, Adaptive Topology Control for Mobile Ad Hoc Networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 22 , Issue: 12, 2011 , pp. 1953-1960
S.A.V. Ali, W.R. Jayaseelan, S. Hariharan, Enhanced route discovery in Mobile Adhoc Networks, International Conference on Computing Communication & Networking Technologies (ICCCNT), 2012 pp. 1-5.
D. Kasamatsu, Y. Kawamura, M. Oki, N. Shinomiya, Broadcasting Method Based on Topology Control for Fault- Tolerant MANET, International Conference on Distributed Computing Systems Workshops (ICDCSW), 2011 pp. 105- 110.
L.C. Llewellyn, K.M. Hopkinson, S.R. Graham, "Distributed Fault-Tolerant Quality of Wireless Networks, IEEE Transactions on Mobile Computing, Vol. 10 , Issue: 2, 2011 pp. 175-190.
Shakkeera, Optimal path selection tchnique for flooding in link state routing protocol using forwarding mechanismsin MANET, International Conference on Communication and Computational Intelligence (INCOCCI), 2010 pp. 318-323
Tsung-Chuan Huang, Sheng-Chieh Chen, Lung Tang, Energy Aware Gossip Routing for Mobile Ad Hoc Networks, International Conference on High Performance Computing and Communications (HPCC), 2011 pp. 955-959
Xiaoqin Chen, Jones, M. Haley, D. Jayalath, Channel- Aware Routing in MANETs with Route Handoff, IEEE Transactions on Mobile Computing, Vol. 10 , Issue: 1, 2011 pp. 108-121
Hui Xu, Xianren Wu, H.R. Sadjadpour, J.J. Garcia-Luna- Aceves, A unified analysis of routing protocols in MANETs, IEEE Transactions on Communications, Volume: 58 , Issue: 3, 2010 pp. 911 – 922
L.C. Llewellyn, K.M. Hopkinson, K.M, S.R. Graham, Distributed Fault-Tolerant Quality of Wireless Networks, IEEE Transactions on Mobile Computing, Vol. 10 , Issue: 2, 2011 pp. 175-190
R.J. La, Eunyoung Seo, Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing, IEEE Transactions on Mobile Computing, Vol. 10 , Issue: 3, 2011 pp. 434 448