Rebroadcast Routing Technique for Reducing Overhead based on Neighbor Coverage in Mobile Ad Hoc Netw

IJSRD - International Journal for Scientific Research & Development| Vol. 3, Issue 09, 2015 | ISSN (online): 2321-0613

Rebroadcast Routing Technique for Reducing Overhead based on Neighbor Coverage in Mobile Ad Hoc Networks (MANET) S.Ezhilin Freeda1 T.C.Ezhil Selvan2 M.Marimuthu3 Dr.P.Malathi4 1,2,3 Assistant Professor 4Principal 1 Sri Ramakrishna Engineering College, Coimbatore 2,3 Sri Ramakrishna Institute of Technology, Coimbatore 4 Bharathiyar Institute of Engineering for Women, Salem.

Abstract— Mobile Adhoc Network (MANET) is a selfcontributed dynamic network comprising of mobile nodes.

MANET faces number of challenges in routing, security and packet transmission. rebroadcast routing techniques for dropping overhead based on neighbor coverage in Mobile Ad-hoc Networks [1]. In MANET, a wireless node can be the source, the target, or a middle node of data transmission.

Once a wireless node shows the role of middle node, it functions as a router that can accept and onward data packets to its neighbor nearer to the target node. A probabilistic rebroadcast protocol is based on neighbor coverage to decrease the routing overhead in MANETs. This neighbor coverage understanding includes further coverage ratio and connectivity feature. We projected a new scheme to dynamically analyze the rebroadcast delay, which is used to adjust the forwarding order and more efficiently exploit the neighbor coverage knowledge.

Key words: Mobile Ad-hoc Networks –Rebroadcast Routing – Neighbor Coverage –Simulation Results I. INTRODUCTION Mobile Ad-hoc NETworks (MANETs) include a cluster of wireless portable nodes which dynamically exchange data among themselves without the support on a static base station or a wired backbone network. MANETs have possible use in a wide variety of disparate situations. Such states include moving communications to throwaway sensors which are released from high elevations and detached on the ground for hazardous materials detection.

Citizen requests include simple situations such as people at a forum in a communication where their workstations comprise a temporary MANET to more complex scenarios such as highly mobile automobiles on the road which form an ad hoc network in order to provide vehicular traffic controlling [4]. MANET nodes are typically well-known by their restricted power, handling and memory resources as well as high amount of movement.

A. Routing Routing is to select best routes in a network. In the earlier, the term routing was also used to sending network traffic among networks [5][6][7]. However this latter function is much better described as simply forwarding. Routing is achieved for several types of networks, including the telephone network (circuit switching), electronic data networks (such as the Internet), and transportation networks. This paper is concerned primarily with routing in data networks using packet switching technology[3].

B. MANET Routing Protocols Routing protocols in MANETs are categorized into three in respect of their functionality

1) Reactive protocols 2) Proactive protocols 3) Hybrid protocols

Fig. 1: MANETs Routing Protocols II. EXISTING SYSTEM Broadcasting is an effective mechanism for route discovery, but the routing overhead associated with the broadcasting can be fairly huge, particularly in high dynamic links [2].

The problems in existing systems are,  The existing broadcasting protocol tested analytically and experimentally and showed that the rebroadcast is very expensive and eats too much network resource.  The broadcasting suffers large routing overhead and bases many complications such as redundant retransmissions, disputations and impacts.

III. PROPOSED SYSTEM The main contributions of this paper are as follows: We suggest a new system to estimate the rebroadcast delay. The rebroadcast delay is to decide the forwarding order. The node which has more mutual neighbors with the prior node has the lesser delay. If this node rebroadcasts a packet, then more mutual neighbors will know this detail. Consequently, this rebroadcast delay allows the evidence that the nodes have transmitted the packet spread to other neighbors, which is the vital to achievement for the proposed system.

1) We also recommend a new scheme to calculate the rebroadcast probability. The scheme considers the evidence about the uncovered neighbors (UCN), connectivity metric and local node thickness to estimate the rebroadcast probability.

2) The rebroadcast probability is composed of two parts:  Extra coverage ratio, which is the ratio of the number of nodes that must be enclosed by a single broadcast to the total number of neighbors;

All rights reserved by www.ijsrd.com

467

Rebroadcast Routing Technique for Reducing Overhead based on Neighbor Coverage in Mobile Ad Hoc Networks (MANET) (IJSRD/Vol. 3/Issue 09/2015/113)



(3)

Connectivity issue, which replicates the association of network connectivity and the quantity of neighbors of a specified node.

A. Benefits of Offered System It reduces the routing overhead in MANETs. This neighbor coverage information includes extra coverage ratio and connectivity factor.

It’s a new scheme to dynamically calculate the rebroadcast delay, which is used to regulate the progressing order and more efficiently adventure the neighbor coverage information.

Simulation results show that the offered protocol produces less rebroadcast traffic compared to flooding techniques and other enhanced scheme in surveys.

IV. NEIGHBOR COVERAGE-BASED PROBABILISTIC REBROADCAST PROTOCOL

In this module, use the upstream coverage ratio of an RREQ packet received from the previous node to estimate the rebroadcast delay and use the extra coverage ratio of the RREQ packet and the connectivity factor to estimate the rebroadcast probability in protocol, which needs that each node wants its one-hop neighborhood information.

Fig. 2: NCPR flow diagram A. Uncovered Neighbors Set When node receives an RREQ packet from its earlier node S, it can use the neighbor list in the RREQ packet to estimate how many its neighbors have not been enclosed by the RREQ packet from s. If node has more neighbors uncovered by the RREQ packet from s, which means that, node ni rebroadcasts the RREQ packet, the RREQ packet can spread more additional neighbor nodes. To quantify this, define the Uncovered Neighbors set = –[ ∩ ]-{ } (1) B. Rebroadcast Delay The rebroadcast delay is to regulate the forwarding order.

The node which has more public neighbors with the previous node has the lesser delay. If this node rebroadcasts a packet, then more public neighbors will know this detail.

So, this rebroadcast delay permits the evidence that the nodes have transmitted the packet spread to further neighbors.

(2)

- Delay Ratio - Neighbor Nodes ) - Rebroadcast Delay C. Rebroadcast Probability The scheme considers the evidence about the uncovered neighbors (UCN), connectivity metric and local node depth to calculate the rebroadcast probability. The rebroadcast probability is collected of two portions: extra coverage ratio, which is the ratio of the number of nodes that must be covered by a single broadcast to the total number of neighbors and connectivity factor, which reflects the suggestion of network connectivity and the number of neighbors of a given node.

Extra Coverage Ratio (4) Connectivity Factor (5) Rebroadcast Probability (6) D. Simulation Parameters Simulation Parameter Value Simulalator NS-2 (V 2.35) Topology Size 1000m X 1000m Number of Nodes 50,100,150,.....,300 Transmission Range 240m Bandwidth 4Mbps Interface Queue Length 50 Traffic Type CBR Number of CBR Connections 10,12,14,......,20 Packet Size 512 byte’s Packet Rate 6 packets/sec Pause Time 0-1s Min Speed 0.01 m/s Max Speed 5 m/s Table 1: Simulation Parameters E. Performance Metrics    

MAC Collision Rate Normalized Routing Overhead Packet Delivery Ratio Average End to End Delay

F. Parameters on the Performance of Routing Protocols   

Performance with Varied Quantity of Nodes.

Performance with Varied Quantity of CBR Connections.

Performance with Varied Random Packet Loss Ratio.

V. SIMULATION RESULTS

We modify the source code of AODV in NS-2 (v2.35) to implement our proposed protocol. The projected NCPR protocol needs HELLO packets to get the neighbor information, and needs to bring the neighbor list in the RREQ packet. Therefore, in our application, some techniques are used to reduce the overhead of Hello packets and neighbor list in the RREQ packet, which are described as follows[8][9][10]:

All rights reserved by www.ijsrd.com

468

Rebroadcast Routing Technique for Reducing Overhead based on Neighbor Coverage in Mobile Ad Hoc Networks (MANET) (IJSRD/Vol. 3/Issue 09/2015/113)

1) In order to reduce the overhead of HELLO packets, we doesn’t use periodical HELLO tool. Since a node sending any broadcasting packets can inform its neighbors of its existence, the broadcasting packets such as RREQ and RERR can show a role of HELLO packets. We use the following tool to decrease the overhead of Hello packets.

2) When the time passed from the last broadcasting packet (RREQ and RERR) is greater than the worth of HELLO Break, the node needs to send a HELLO packet. The worth of HELLO Interval is equal to that of the original AODV. 3) In order to decrease the overhead of neighbor list in the RREQ packet, each node needs to monitor the variation of its neighbor stall and maintain a cache of the neighbor angle in the received RREQ packet. We change the RREQ header of AODV protocol and included static field num cum neighbors which represents the size of neighbor list in the RREQ packet and following the num cum neighbors is the dynamic neighbor list. In the interval of two close followed sending or forwarding of RREQ packets, the neighbor stall of any node ni has the following three cases:  If the neighbor table of node ni adds minimum one new neighbor nj, then node ni sets the num-neighbors to a confident integer, which is the number of listed neighbors, and then occupy its complete neighbor list after the num-neighbors field in the RREQ packet. It is for that node nj may not have cached the neighbor information of node ni, and, thus, node nj needs the complete neighbor list of ni.  If the neighbor table of node ni deletes some neighbors, then node ni sets the num-neighbors to a negative integer, which is the opposite number of the number of removed neighbors, and then only needs to fullfill the deleted neighbors after the num--neighbors in the RREQ packet of the algorithm.  If the neighbor table, the node ni does not vary, node ni does not require to list its neighbors, and set the num-neighbors to 0.

Fig. 4: Rebroadcast Source to Destination

Fig 5: Data Transfer (Hello Message)

Fig 6: MAC Collision Rate

Fig 7: Average end-to-end delay Fig 3: Covered Neighbors

All rights reserved by www.ijsrd.com

469

Rebroadcast Routing Technique for Reducing Overhead based on Neighbor Coverage in Mobile Ad Hoc Networks (MANET) (IJSRD/Vol. 3/Issue 09/2015/113)

Fig 8: Packet Delivery Ratio

Fig. 9: Normalized Routing Overhead VI. CONCLUSION A probabilistic rebroadcast protocol is established on neighbor coverage to decrease the routing overhead in MANETs. This neighbor coverage knowledge contains additional exposure ratio and connectivity feature. We offered a new system to dynamically calculate the rebroadcast delay, which is used to decide the promoting demand and more effectively exploit the neighbor coverage knowledge. A simulation result shows that the proposed protocol generates less rebroadcast traffic than the flooding and some other optimized scheme in works. Because of fewer redundant rebroadcast, the proposed protocol mitigates the network collision and disputation, so as to improve the packet delivery ratio and degrade the average end-to-end delay. The simulation results also show that the offered protocol has worthy performance when the network is in high density or the traffic is in heavy load.

IEEE International Conference on Network Protocols (ICNP’02), Paris, France, November 2002, pp. 78-90.

[8] Y. Hu, A. Perrig, D. Johnson. “Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks”. Proceedings of The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), March 2003.

[9] Yi-an Huang and Wenke Lee. “Attack analysis and Detection for Ad-hoc Routing protocols”. Proceedings of the 7th International Symposium on Recent Advances in Intrusion Detection (RAID'04), French Riviera, France. September 2004.

[10] Hongmei Deng, Wei Li, and Dharma P. Agrawal.

“Routing Security in Wireless Ad Hoc Network,”. IEEE Communications Magazine, vol. 40, no. 10, October 2002.

REFERENCES [1] T.C.Ezhil Selvan, P.Malathi, S.Ezhilin Freeda, “Reliable Congestion Control and Link-aware routing protocol (RCLRP) for Mobile Adhoc Networks ”.

International Journal of Electronics and Communication Engineering (SSRG-IJECE) Pages 9-17, 2015.

[2] A.Gantes and j. stucky, "A platform on a Mobile Ad hoc Network challenging collaborative gaming,"international symposium on collaborative technologies and systems, 2008 [3] R.Sheikh, M. S. Chande, and D. K. Mishra, "Security issues in MANET:A review," presented at the Seventh International Conference On Wireless And Optical Communications Networks (WOCN),2010.

[4] Mishra Amitabh, Nadkarni Ketan M., and Ilyas Mohammad. “Chapter 30: Security in wireless ad-hoc networks, the handbook of Ad hoc wireless network”. , CRC PRESS Publisher, 2003.

[5] C.Siva Ram Murthy and B. S. Manoj. “Ad hoc wireless networks: Architecture and Protocols”. Prentice Hall Publishers, May 2004, ISBN 013147023.

[6] William Stallings. “Network Security essentials: Application and Standards”, Pearson Education, Inc 2003, ISBN 0130351288.

[7] Kimaya Sanzgiri, Bridget Dahill, Brian N. Levine, and Elizabeth M. Belding-Royer. “A Secure Routing Protocol for Ad Hoc Networks”. Proceedings of 10th

All rights reserved by www.ijsrd.com

470