Performance of New Broadcast Forwarding Criteria in MANET

Size: px
Start display at page:

Download "Performance of New Broadcast Forwarding Criteria in MANET"

Transcription

1 Performance of New Broadcast Forwarding Criteria in MANET Lijuan Zhu 1, Bu-Sung Lee 1, Boon-Chong Seet 2, Kai-Juan Wong 3, Genping Liu 1, Shell-Ying Huang 1, and Keok-Kee Lee 1 1 Centre for Multimedia and Network Technology, School of Computer Engineering 2 Network Technology Research Centre Research TechnoPlaza, 4th Storey, Nanyang Technological University, Nanyang Avenue, Singapore , 3 Institute for Computing Systems Architecture Informatics University of Edinburgh JCMB, Mayfield Road U.K, Edinburgh, EH9 3JZ Abstract. In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce in MANET environment. The problem is to find the ideal forward node set so as to minimize the bandwidth consumed, which is a NP-Complete problem. In this paper we will investigate three dominant node approximation algorithms: dominant pruning, total dominant pruning and partial dominant pruning algorithm. An extension to the original algorithms, modified termination criteria, is proposed. Simulation results show that the new termination criteria ensure the same coverage using a reduced number of forward nodes. 1 Introduction A mobile ad hoc network (MANET) is a self-constructing network that consists of mobile hosts roaming around and communicating with each other freely. Due to the radio transmission range limit, packets transmitted from the source may need intermediate hosts to help relaying before they can reach the destination. Such network finds applicability in military environment, wherein a platoon of soldiers may establish an ad hoc network in the region of their deployment. It has been used as well in non-military environment, e.g. Inter-vehicular communication. There are several types of message communication services in ad hoc network. When one packet needs to be sent from one node to all other nodes in the network, a broadcast service is needed. The straightforward approach for broadcast is flooding, in which each node retransmits the received packet once. Many MANET routing protocols such as Ad Hoc On Demand Distance Vector (AODV) [1], Dynamic Source Routing (DSR) [2], Location Aided Routing (LAR) [3] and Zone Routing protocol (ZRP) [4] use flooding or its derivation to establish routes. This traditional flooding causes excessive redundant retransmissions, contention and congestion, which is referred as broadcast storm problem.

2 2 Some related works have been done to reduce redundant broadcast. Multipoint Relaying [6] restricts the number of neighbor nodes, which can reduce the retransmission by efficiently selecting a small set of neighbor nodes, which can cover the same region as the whole. This is a distributed mechanism; each node independently selects its own multipoint relaying set without the information of others selection. In [7] Jie Wu and Wei Lou used a greedy algorithm to select the forward node set at each node, and then broadcast in clustered networks based on forward node set. H. Lim and C. Kim proposed a dominant pruning algorithm [8], and later, in [9] Wei Lou and Jie Wu proposed other two algorithms: total dominant pruning algorithm and partial dominant pruning algorithm, which reduced some of the redundancy in the dominant pruning algorithm. They also discussed two termination criteria: marked and relayed. In this paper, we modify the termination criteria, and proposed a hybrid termination criterion that shows marked improvement in the reduction of number of forwarding nodes. The rest of this paper is organized as follows: section 2 introduces some graph definitions and forward node selection algorithms. Section 3 proposes the modification of the marked/relayed mechanism and the hybrid termination criteria, and examples are given at section 4. Section 5 shows the simulation results. Finally section 6 concludes the paper. 2 Problem Definition An ad hoc network can be represented by a graph, G = (V, E), where V is the set of nodes in the network, and E is the set of edges between every two nodes. An edge exists between two nodes only when they are within the transmission range of each other, and then each one is called one-hop neighbor by the other node. For a node v, we use N(v) to represent its one-hop neighbor set (including v), and N(N(v)) to represent its two-hop neighbor set (the union of the N(v) s one-hop neighbor). The hosts can get the one-hop or two-hop neighborhood information by periodically exchanging their Hello messages. The ideal way for broadcast is to select the minimum connected dominating set (MCDS) [5] nodes to do the rebroadcast. Finding MCDS is a NP-Complete problem, and extensive work has been done in the theoretical community on finding a good approximation of MCDS. The author in [5] proposed an approximation algorithm (AMCDS), which assumes that it has full network connectivity information. AMCDS Process: 1. Color all the nodes in V white. 2. Select the node with the maximum node degree, and put it into the set C. color this node black and all its neighbors white. 3. Select the grey node with the maximum white node degree, and put it into the set C. Color this selected grey node black and all its white neighbors grey. 4. If there are still some nodes white, go to 3; else go to 5.

3 3 5. The set C is an approximation for the MCDS. However, in the real MANET environment the nodes will only have limited information, eg. 1-hop or 2-hop neighbor information. Distributed algorithms [8][9] that make use of 1-hop and/or 2-hop information, has been proposed to find the forwarding node set in the MANET environment. These algorithms have two major tasks: selection of forwarding nodes and termination of broadcast. 2.1 Forward node selection algorithms Three distributed algorithms for forward node selection were investigated. In the discussion that follows, the following parameters are defined: N(v) is defined as the 1-hop neighbors of node v. N(N(v)) is defined as the 2-hop neighbors of node v. B(u, v) = N(v) N(u). This is the set of nodes in the neighborhood of node v that are not the 1-hop neighbors of node u. U x (u, v): the set of forwarding nodes that would relay the packet based on the algorithm X. F (u, v): the forwarding node set, initialized to zero members. Z: initialized to zero members (empty set). The general algorithm for forward node selection when node v receives a broadcast packet from node u is as follows: 1. For every node w i B(u, v), S i = N(w i ) U(u, v) 2. Find w j with the maximum size of its corresponding set S i. 3. Add w j to F (u, v), Z = Z S j, and for all the S i, S i = S i S j. 4. If no new node is added to Z, exit; otherwise return to step 2. Dominant Pruning (DP) Algorithm When node v receives a broadcast packet from node u, it will do the following steps to select the minimum forwarding nodes based on the process described above. For DP [7] the set of nodes that should be considered for forwarding the packet are as follows: U DP (u, v) = N(N(v)) N(v) N(u). (1) Thus, they are the nodes that are 2-hops away from node v, which are not member of the nodes that are 1-hop away from node v and node u. U DP (u, v) is shown as shaded areas in Figure 1. The two nodes u and v are marked as black dots. Total Dominant Pruning (TDP) Algorithm In TDP [8] the forwarding nodes set is given by: U T DP (u, v) = N(N(v)) N(N(u)). (2)

4 4 Fig. 1. Elimination of neighbor in DP TDP makes full use of the 2-hop neighbor information in the selection of the forwarding nodes. Figure 2 shows the coverage of the neighbor nodes for TDP. The shaded region represents U T DP (u, v), the neighbor nodes area that would act as the broadcast forwarding nodes. The area is less than that of DP, thus less number of forwarding nodes. However, it suffers from the need for node u to piggyback its 2-hop neighbor set along with the broadcast packet. Fig. 2. Elimination of neighbor in TDP Partial Dominant Pruning (PDP) Algorithm In PDP [8], they remove the nodes that are 1-hop neighbors of node u and node v as well as the 2-hop neighbors of the nodes that are 1-hop neighbors of both node u and v. Let P = N(N(v)N(u)). (3) then U P DP (u, v) = N(N(v)) N(v) N(u) P. (4) The shaded areas in Figure 3 represent the area where the forwarding nodes can reside as defined by equation 4, i.e. U T DP (u, v). The area covered is slightly larger than TDP. The advantage of PDP over TDP is that it does not need to

5 5 Fig. 3. Elimination of neighbor in PDP piggyback the 2-hop neighbor set information of the sender with the broadcast packet. Thus, reducing the overhead. 2.2 Termination criteria When a broadcast packet is sent, every intermediate node will use the DP/PDP/TDP algorithm to select the forward nodes, and every selected forward node will use termination criteria to determine whether to broadcast the packet. Wei Lou and Jie Wu [9] proposed two termination criteria: Marked: When node v receives a broadcast packet it will not rebroadcast if all its one-hop neighbors status are marked. Relayed: When node v receives a broadcast packet it will not rebroadcast if it has previously relayed the packet. 3 Modified Marked/Relayed 3.1 Modified Marked We modify the marked termination criterion described above, and propose a hybrid one based on the two termination criteria, which is as follows: When node v is performing its forward node selection process, it will drop its marked neighbors out of consideration. Node v will stop rebroadcast only if all its one-hop neighbors status are marked. Theorem 1. If node v is marked, then its one-hop neighbor N(v) has been marked before or will be marked later. Proof. Node v is marked, assume that it receives the packet from its neighbor u, there are then two conditions: (1) u will select v as the forward node, if v really broadcasts the packet using the termination criteria, then its one-hop neighbor N(v) will receive that packet and be marked later, otherwise its N(v) has been marked before. The theorem is thus correct; (2) u will not select v as the forward node, then u will select other forward nodes to mark N(N(u)), N(v) N(N(u)), so N(v) will be marked later thus the theorem is correct.

6 6 Theorem 2. All the nodes in the network will receive the packet through the termination criteria, when initializing one source node as the forward node. Proof. When one source node is a forward node and is marked, then from theorem 1, the one-hop neighbor of source will be marked later. By iteratively putting theorem1 into application, all the nodes will be marked later. 3.2 Modified Relayed In the modified relay, node v will not rebroadcast the packet if it checks its status as having received the packet previously, irrespective of whether it was selected as a forward node or not. Theorem 3. If a node v receives the packet from node u and is not selected by u as its forward node, then there is no need for another node w to select v as its forward node. Proof. If node u does not select v as its forward node, then it will select other nodes to cover N(N(u)) including N(v), so N(v) will later be set as relayed, so does not need w to select v as the forward node to cover N(v) N(N(w)). 4 Example Fig. 4. Example MANET topology with source node 0 Figure 4 shows the connectivity map of the MANET environment used in our example to illustrate the difference between the forwarding algorithms and termination criteria. Table 4 depicts the differences between modified and original

7 Table 1. Forward nodes list for Figure 4 with different algorithm and termination criteria Original Marked Modified Marked Original Relayed Modified relayed DP 0,1,2,3,4,7,8,10,12 0,1,2,3,7,8,10,12 0,1,2,3,4,7,8, 9,10,12,13 0,1,2,3,7,8,10,12,13 PDP 0,1,2,3,4,7,8,10 0,1,2,3,7,8,10 0,1,2,3,4,7,8,9,10,13 0,1,2,3,7,8,10,13 TDP 0,1,2,3,4,7,8,10 0,1,2,3,7,8,10 0,1,2,3,4,7,8,10 0,1,2,3,7,8,10 7 in the DP algorithm. Using the original marked termination algorithm, node 2 will select node 4 as its forward node, and for the termination criteria, node 4 will do the rebroadcast, since node 6 is unmarked. When the new modified marked termination algorithm is used, node 2 will not choose node 4 as its forward node. This is because after node 1 has selected node 3 as its forward node, node 4 will be marked, then node 2 will drop node 4 out of consideration as a forward node. In the relay termination algorithm, node 13 will select node 9 as its forward node. Since node 9 has not relayed the packet before, it will act as the forward node. In the case of modified relay, node 13 will select node 9 as its forward node. When node 9 receives the packet, based on the new but termination criteria, node 9 will not rebroadcast the packet since its status is relayed. In this example, we have illustrated how the different dominant nodes selection algorithms have benefited from using the modified termination mechanism. The number of forward nodes is reduced in this example. 5 Simulation results Simulations are done using the unit disk graph [10]. The set-up for the simulation is as follows: Graph area = 100x100 Transmission range = 40 Number of nodes = 20 to 100 A total of 400 sample graphs are generated and for each graph 20 nodes are selected as the broadcast source. The results on number of forward nodes are then averaged across all the experiment and plotted. The experiments were carried out for the three dominant node selection algorithms: DP, TDP, and PDP. Figure 5, Figure 6 and Figure 7 show the average number of forward nodes with different termination criteria and different dominant node algorithm. In all the figures, AMCDS is the lower bound for the performance as it s a centralized system, while the others use a distributed algorithm. All the algorithms perform poorly when they use the relay termination criteria. This is to be expected as it only makes use of its own information, i.e. whether it had previously forwarded the packet. The other termination criteria makes use of its 1-hop neighbors information.

8 8 number of forward node mark modified mark relay modified relay AMCDS DP node number Fig. 5. Average number of forward nodes for DP algorithm number of forward node mark modified mark relay modified relay AMCDS TDP node number Fig. 6. Average number of forward nodes for TDP algorithm

9 9 number of forward node mark modified mark relay modified relay AMCDS PDP node number Fig. 7. Average number of forward nodes for PDP algorithm The modified termination criteria reduces the number of forwarding nodes. The performance of the algorithm using different termination criteria increases as the number of nodes increase. Example for node number of 100, the percentage reduction in the number of forward nodes based on modified marked compared with original marked termination criteria is 16.8% for DP, 14.6% for PDP, and 11.7% for TDP. The percentage of the reduced forward nodes based on modified relay compared with the original relay is 78.3% for DP, 60.0% for PDP and 51.5% for TDP. 6 Conclusions In this paper, we have summarized some previously promising algorithms to select the forward nodes, and related termination criteria to determine whether node should broadcast or not. Since the number of forward nodes depends largely on the termination criteria, we have modified one termination criteria and proposed a hybrid one. From the simulation results, we can see that the new termination mechanisms show marked improvement when incorporated with existing forwarding node selection algorithms, especially when the number of nodes in the network increases. References 1. C. Perkins, E. Royer, and S. Das, Ad hoc on demand distance vector (AODV) routing, Internet Draft: draft-ietf-manet-aodv-09.txt, Nov

10 10 2. D. Johnson and D. Maltz, Dynamic source routing in ad hoc wireless networks. In T. Imelinsky and H. Korth, editors, Mobile Computing, Kluwer Academic publishers, pp , Y.Ko and N.H. Vaidya, location-aided routing (LAR) in mobile ad hoc networks, In proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), pp.66-75, Zygmunt J. Haas, Marc R. Pearlm, and prince Samar, The Zone Routing Protocol (ZRP) for ad hoc networks, IETF MANET Internet Draft, July B. Das, R. Sivakumar, and V. Bharghavan, Routing in Ad hoc Networks Using a Virtual Backbone, Proc. Int l Conf. Computer Comm. And Networks 97, pp. 1-20, Sept A. Qayyum, L. Viennot, and A. Laouiti, Multipoint Relaying for Flooding Broadcast Message in Moble Wireless Networks, Proc. 35th Annual Hawaii International Conference on System Science J. Wu and W. Lou, Forward-Node-Set-Based Broadcast in Clustered Mobile Ad hoc Networks, Technical Report CSE-02-15, June H. Lim and C. Kim, Flooding in Wireless Ad hoc Networks, computer Comm. J.,vol. 24, no. 3-4, pp , W. Lou and J. Wu, On Reducing Broadcast Redundancy in Ad hoc Wireless Ad hoc Networks, IEEE Transactions on Mobile Computing, vol. 1, no. 2 APRIL- JUNE B.N. Clark, C.J.Colbourn, and D.S.Johnson, Unit Disk Graphs, Discrete Math., vol. 86, pp , S. Ni, Y. Tseng, Y. Chen, and J. Sheu, The Broadcast Storm Problem in a mobile Ad hoc Networks, Proc.MOBICOM 99, pp , Aug

On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks

On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks Wei Lou and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL Abstract Unlike in a wired network,

More information

A Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile Ad Hoc Networks

A Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile Ad Hoc Networks A Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile Ad Hoc Networks Wei Lou and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 3343

More information

An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks

An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks Xiuzhen Cheng, Min Ding Department of Computer Science The George Washington University Washington, DC 20052, USA {cheng,minding}@gwu.edu

More information

Enhanced Partial Dominant Pruning (EPDP) Based Broadcasting in Ad hoc Wireless Networks

Enhanced Partial Dominant Pruning (EPDP) Based Broadcasting in Ad hoc Wireless Networks Enhanced Partial Dominant Pruning (E) Based Broadcasting in Ad hoc Wireless Networks Ashikur Rahman, Md. Endadul Hoque, Farzana Rahman, Sabuj Kumar Kundu Department of Computer Science Engineering (CSE)

More information

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Journal homepage: www.mjret.in ISSN:2348-6953 A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Ms. Amruta Kodole 1, Prof. P. M. Agarkar 2 Computer Engineering Dr. D. Y. Patil School Of Engineering

More information

Improved Performance of Mobile Adhoc Network through Efficient Broadcasting Technique

Improved Performance of Mobile Adhoc Network through Efficient Broadcasting Technique Improved Performance of Mobile Adhoc Network through Efficient Broadcasting Technique Vijay J Parmar Department of Computer Engineering,Sarvajanic College of Engineering and Technology Surat, Gujrat (India),E-mail

More information

Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS

Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS , pp.479-486 http://dx.doi.org/1.14257/astl.217.147.67 Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS G Parimala 1, B Suvarna 2, N Rajeswari 3 and Venkatesulu Dondeti 4 VFSTR University,

More information

Reliable and Efficient Broadcasting in Asymmetric Mobile Ad Hoc Networks Using Minimized Forward Node List Algorithm

Reliable and Efficient Broadcasting in Asymmetric Mobile Ad Hoc Networks Using Minimized Forward Node List Algorithm Journal of Computer Science 7 (1): 46-51, 2011 ISSN 1549-3636 2011 Science Publications Reliable and Efficient Broadcasting in Asymmetric Mobile Ad Hoc Networks Using Minimized Forward Node List Algorithm

More information

Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks

Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks Yingshu Li Department of Computer Science Georgia State University Atlanta, GA 30303 yli@cs.gsu.edu Donghyun Kim Feng

More information

Competent Broadcasting in MANET

Competent Broadcasting in MANET Competent Broadcasting in MANET 1 Ms. K. Vijayalakshmi, 2 Mrs.S.Jeyanthi 1 M.E., Lecturer, CSE Dept., PSNA College of Engg. And Tech., Dindigul, Tamilnadu,India. 2 M.E., Lecturer, CSE Dept., PSNA College

More information

Research Paper GNANAMANOHARAN ET AL., INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING TECHNOLOGY E-ISSN

Research Paper GNANAMANOHARAN ET AL., INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING TECHNOLOGY E-ISSN Research Paper PERFORMANCE ANALYSIS OF PROBABILISTIC BROADCAST ON DEMAND ROUTE DISCOVERY PROTOCOL FOR MOBILE AD HOC NETWORKS BASED ON NODE MOBILITY E.Gnanamanoharan 1, R.Bensraj 2 Address for Correspondence

More information

Localized Broadcasting in Mobile Ad Hoc Networks Using Neighbor Designation

Localized Broadcasting in Mobile Ad Hoc Networks Using Neighbor Designation 1 Localized Broadcasting in Mobile Ad Hoc Networks Using Neighbor Designation Wei Lou and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Email:{wlou,

More information

Route maintenance and Scalability improvement of DSR, based on Relay node identification after locating Link-failure over MANET

Route maintenance and Scalability improvement of DSR, based on Relay node identification after locating Link-failure over MANET IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 3, Ver. III (May-Jun. 2014), PP 21-27 Route maintenance and Scalability improvement of DSR, based on

More information

GATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS. Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani

GATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS. Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani GATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani Centre for Telecommunication and Information Engineering Monash University,

More information

BUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications

BUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications BUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications Kai-Juan Wong, Bu-Sung Lee, Boon-Chong Seet, Genping Liu, Lijuan Zhu School of Computer

More information

Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions

Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College

More information

Architecture of EHARP Routing Protocols in Ad Hoc Wireless Networks

Architecture of EHARP Routing Protocols in Ad Hoc Wireless Networks 2009 International Conference on Intelligent Networking and Collaborative Systems Architecture of EHARP Routing Protocols in Ad Hoc Wireless Networks Saud Al otaibi Software Technology Research Laboratory

More information

Impact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness in MANET

Impact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness in MANET Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 12, December 2014,

More information

Reducing Routing Overhead In Manet Using Ncpr Protocol

Reducing Routing Overhead In Manet Using Ncpr Protocol Reducing Routing Overhead In Manet Using Ncpr Protocol Ms.Manjula.R 1, Mr.Santhosh.R 2 PG Scholar, Karpagam University, Coimbatore 1 Assistant Professor/CSE, Karpagam University, Coimbatore 2 ABSTRACT:

More information

QoS Routing for Heterogeneous Mobile Ad Hoc Networks

QoS Routing for Heterogeneous Mobile Ad Hoc Networks QoS Routing for Heterogeneous Mobile Ad Hoc Networks Mohammed Abdul Waheed 1, Dr. K Karibasappa 2 1 Research Scholar, Singhania University, Pacheri Bari Dist. Jhunjhunu, Rajasthan, India. Mohdabdul.waheed@mission10x.com,

More information

AN IMPROVED APPROACH IN FLOODING WITH PACKET REACHABILITY IN FSR (FISHEYE STATE ROUTING) PROTOCOL USING MANET

AN IMPROVED APPROACH IN FLOODING WITH PACKET REACHABILITY IN FSR (FISHEYE STATE ROUTING) PROTOCOL USING MANET AN IMPROVED APPROACH IN FLOODING WITH PACKET REACHABILITY IN FSR (FISHEYE STATE ROUTING) PROTOCOL USING MANET 1 S. NITHYA REKHA, 2 Dr.C.CHANDRASEKAR, 1 Ph.D. Full-Time Research Scholar, Department of Computer

More information

A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks

A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 12, Issue 6 (Jul. - Aug. 2013), PP 01-09 A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile

More information

Vol. 2, Issue I, Jan ISSN

Vol. 2, Issue I, Jan ISSN Probabilistic Rebroadcast Protocol based on Neighbor Coverage to Reduce Routing Overhead in MANETs Shakeela Attikeri 1, Preeti Patil 2 1 Department of Computer Science and Engineering, Visvesvaraya University

More information

Energy Efficient Broadcasting Using Network Coding Aware Protocol in Wireless Ad hoc Network

Energy Efficient Broadcasting Using Network Coding Aware Protocol in Wireless Ad hoc Network Energy Efficient Broadcasting Using Network Coding Aware Protocol in Wireless Ad hoc Network 1 Shuai Wang 2 Athanasios Vasilakos 1 Hongbo Jiang 1 Xiaoqiang Ma 1 Wenyu Liu 1 Kai Peng 1 Bo Liu 1 Yan Dong

More information

Implementation and simulation of OLSR protocol with QoS in Ad Hoc Networks

Implementation and simulation of OLSR protocol with QoS in Ad Hoc Networks Implementation and simulation of OLSR protocol with QoS in Ad Hoc Networks Mounir FRIKHA, Manel MAAMER Higher School of Communication of Tunis (SUP COM), Network Department, m.frikha@supcom.rnu.tn ABSTRACT

More information

Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks

Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks Wireless Sensor Network, 2017, 9, 73-86 http://www.scirp.org/journal/wsn ISSN Online: 1945-3086 ISSN Print: 1945-3078 Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks Raqeebir Rab 1,

More information

Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks. Technical Report

Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks. Technical Report Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks Technical Report Department of Computer Science and Engineering University of Minnesota 4-192 EECS

More information

Reducing Routing Overhead For Multimedia Traffic in Manet Using Rebroadcast Probability

Reducing Routing Overhead For Multimedia Traffic in Manet Using Rebroadcast Probability Reducing Routing Overhead For Multimedia Traffic in Manet Using Rebroadcast Probability Sivakumar.P, Sivaranjani.R, Srilakshmi.G, Subashini.R Abstract: Mobile ad hoc networks (MANET) have been proposed

More information

Modified Ultra Smart Counter Based Broadcast Using Neighborhood Information in MANETS

Modified Ultra Smart Counter Based Broadcast Using Neighborhood Information in MANETS Modified Ultra Smart Counter Based Broadcast Using Neighborhood Information in MANETS Ms. Nutan Julka 1, Prof. Dr. J.W Bakal 2 1 Dept. of Computer Science, Pillais Institute of Information Technology,

More information

A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks

A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks Yamin Li and Shietung Peng Department of Computer Science Hosei University Tokyo 18-858 Japan {yamin, speng}@k.hosei.ac.jp

More information

BEAM: Broadcast Engagement ACK Mechanism to Support Reliable Broadcast Transmission in IEEE Wireless Ad Hoc Networks

BEAM: Broadcast Engagement ACK Mechanism to Support Reliable Broadcast Transmission in IEEE Wireless Ad Hoc Networks : Broadcast Engagement ACK Mechanism to Support Reliable Broadcast Transmission in IEEE 2.11 Wireless Ad Hoc Networks Jenhui Chen and Muwen Huang Department of Computer Science and Information Engineering,

More information

Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks

Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,

More information

The Impact of Clustering on the Average Path Length in Wireless Sensor Networks

The Impact of Clustering on the Average Path Length in Wireless Sensor Networks The Impact of Clustering on the Average Path Length in Wireless Sensor Networks Azrina Abd Aziz Y. Ahmet Şekercioğlu Department of Electrical and Computer Systems Engineering, Monash University, Australia

More information

Middle in Forwarding Movement (MFM): An efficient greedy forwarding approach in location aided routing for MANET

Middle in Forwarding Movement (MFM): An efficient greedy forwarding approach in location aided routing for MANET Middle in Forwarding Movement (MFM): An efficient greedy forwarding approach in location aided routing for MANET 1 Prashant Dixit* Department of CSE FET, Manavrachna international institute of research

More information

Rheinisch-Westfälische Technische Hochschule Aachen Lehrstuhl für Informatik IV Prof. Dr. rer. nat. Otto Spaniol

Rheinisch-Westfälische Technische Hochschule Aachen Lehrstuhl für Informatik IV Prof. Dr. rer. nat. Otto Spaniol Rheinisch-Westfälische Technische Hochschule Aachen Lehrstuhl für Informatik IV Prof. Dr. rer. nat. Otto Spaniol COMPARISON of BROADCASTING TECHNIQUES for MOBILE AD HOC NETWORKS Seminar: Data Communication

More information

Efficient Broadcast Algorithms To Reduce number of transmission Based on Probability Scheme

Efficient Broadcast Algorithms To Reduce number of transmission Based on Probability Scheme Efficient Broadcast s To Reduce number of transmission Based on Probability Scheme S.Tharani, R.Santhosh Abstract Two main approaches to broadcast packets in wireless ad hoc networks are static and dynamic.

More information

Impact of Hello Interval on Performance of AODV Protocol

Impact of Hello Interval on Performance of AODV Protocol Impact of Hello Interval on Performance of AODV Nisha Bhanushali Priyanka Thakkar Prasanna Shete ABSTRACT The multi-hop ad hoc networks are self organizing networks with dynamic topology. The reactive

More information

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols Performance Comparison of Ad Hoc Routing Protocols over IEEE 82.11 DCF and TDMA MAC Layer Protocols Govind. P. Gupta Computer Science Department R.K.G.I.T, Ghaziabad (India) er_gpgupta@yahoo.com A. K.

More information

A Review and Comparison of Efficient Flooding Schemes for On-demand Routing Protocols on Mobile Ad hoc Networks (MANETs)

A Review and Comparison of Efficient Flooding Schemes for On-demand Routing Protocols on Mobile Ad hoc Networks (MANETs) Australian Journal of Basic and Applied Sciences, 4(8): 3695-3707, 2010 ISSN 1991-8178 2010, INSInet Publication A Review and Comparison of Efficient Flooding Schemes for On-demand Routing Protocols on

More information

Performance Evaluation in MANET by Using NCPR Scheme with Cluster Technique

Performance Evaluation in MANET by Using NCPR Scheme with Cluster Technique International Journal of Emerging Engineering Research and Technology Volume 3, Issue 7, July 2015, PP 22-31 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Performance Evaluation in MANET by Using NCPR

More information

A Comparative Analysis between Forwarding and Network Coding Techniques for Multihop Wireless Networks

A Comparative Analysis between Forwarding and Network Coding Techniques for Multihop Wireless Networks A Comparative Analysis between Forwarding and Network Coding Techniques for Multihop Wireless Networks Suranjit Paul spaul2@connect.carleton.ca Broadband Network Lab, Carleton University Acknowledgements

More information

Performance Evaluation of Various Routing Protocols in MANET

Performance Evaluation of Various Routing Protocols in MANET 208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri

More information

AWERProcedia Information Technology & Computer Science

AWERProcedia Information Technology & Computer Science AWERProcedia Information Technology & Computer Science Vol 03 (2013) 1424-1429 3 rd World Conference on Information Technology (WCIT-2012) Comparison of routing protocols in mobile ad-hoc wireless networks

More information

Routing Protocols in MANET: Comparative Study

Routing Protocols in MANET: Comparative Study Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119

More information

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET 2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar

More information

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology 2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Performance Comparison of MANETs Routing Protocols for Dense and Sparse

More information

Performance Evaluation of Routing Protocols for MAC Layer Models

Performance Evaluation of Routing Protocols for MAC Layer Models IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 10, Issue 4 (Mar. - Apr. 2013), PP 71-77 Performance Evaluation of Routing Protocols for MAC Layer Models Somya

More information

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network ShriRam College of Engineering & Management 1 A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network M.Ramaiya Rohit Gupta Rachit Jain Head,Dept. Computer Science Dept. Computer

More information

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks Peng-Jun Wan Khaled M. Alzoubi Ophir Frieder Abstract Connected dominating set (CDS) has been proposed as virtual backbone

More information

Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols

Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Sharma Shelja, Kumar Suresh and Rathy R. K. Department of CSE, FET, MRIU, Faridabad, India Email: sharma.shelja@gmail.com, enthusk@yahoo.com,

More information

Effective Routing Based on Overhead Reduction

Effective Routing Based on Overhead Reduction Effective Routing Based on Overhead Reduction 1 Bambrik Ilyas, 2 Didi Fedoua 1, 2 Dept of computer Engineering University of Tlemcen Algeria ABSTRACT Over the years, many reactive routing protocols for

More information

Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks

Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks 1 Ravindra.E, 2 Pooja Agraharkar Asst Prof, Dept. of Electronics & Communication Engg, Mtech Student, Dept. of Electronics & Communication

More information

Optimized Location Aided Routing Protocol using Greedy Forwarding Approach in MANET

Optimized Location Aided Routing Protocol using Greedy Forwarding Approach in MANET Volume-4, Issue-4, August-2014, ISSN No.: 2250-0758 International Journal of Engineering and Management Research Available at: www.ijemr.net Page Number: 110-116 Optimized Location Aided Routing Protocol

More information

Performance Evolution of Proactive and Reactive Routing Protocols in Mobile Ad Hoc Networks

Performance Evolution of Proactive and Reactive Routing Protocols in Mobile Ad Hoc Networks Performance Evolution of Proactive and Reactive Routing Protocols in Mobile Ad Hoc Networks E.Gnanamanoharan 1 and R. Bensraj 2 Department of Electrical Engineering 1, 2 Annamalai University 1, 2 Email:

More information

Crucial Video Scattering with QoS above Wireless Network by Selective Repeat Algorithm

Crucial Video Scattering with QoS above Wireless Network by Selective Repeat Algorithm Vol. 5, Issue 1, March 2018, pp. 227-231 Crucial Video Scattering with QoS above Wireless Network by Selective Repeat Algorithm E. Madhusudhana Reddy 1, M. Dinesh 2 Professor Dept. of CSE 1, DRK College

More information

Cooperative Caching in Wireless P2P Networks. Aseel Nadhum Kadhum The Islamic University College

Cooperative Caching in Wireless P2P Networks. Aseel Nadhum Kadhum The Islamic University College Cooperative Caching in Wireless P2P Networks Aseel Nadhum Kadhum The Islamic University College (138).. Cooperative Caching in Wireless P2P Networks Cooperative Caching in Wireless P2P Networks... (139)

More information

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks 2014 IJSRSET Volume i Issue i Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Science Zone-based Proactive Source Routing Protocol for Ad-hoc Networks Dr.Sangheethaa.S 1, Dr. Arun Korath

More information

Impact of Routing Overhead in A Real-Time MANET Environment

Impact of Routing Overhead in A Real-Time MANET Environment Impact of Routing Overhead in A Real-Time MANET Environment P. Chandra Sekhar M.R. Pavan Kumar B.Praveen Kumar Ch. Koteswararao chandu.0431@gmail.com sivapavan.mr@gmail.com Praveen.chou39@gmail.com chkoti518@gmail.com

More information

A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE

A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE Journal of Engineering Science and Technology Vol. 4, No. 2 (2009) 132-141 School of Engineering, Taylor s University College A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE 802.11 AND IEEE

More information

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario K.Gautham 1, Nagajothi A 2 Student, Computer Science and Engineering,

More information

A NEW DENSITY BASED PROBABILISTIC COUNTER SCHEME FOR SOLVING BROADCAST STORM IN MOBILE AD HOC NETWORKS

A NEW DENSITY BASED PROBABILISTIC COUNTER SCHEME FOR SOLVING BROADCAST STORM IN MOBILE AD HOC NETWORKS A EW DESITY BASED PROBABILISTIC COUTER SCHEME FOR SOLVIG BROADCAST STORM I MOBILE AD HOC ETWORKS A. SETHIL KUMAR, 2 K.S. RAMASWAMI Associate Professor, RVS College of Engineering and Technology, Coimbatore,

More information

A New Energy Efficient and Scalable Multicasting Algorithm for Hierarchical Networks

A New Energy Efficient and Scalable Multicasting Algorithm for Hierarchical Networks International Journal of Engineering Research and Development ISSN: 2278-067X, Volume 1, Issue 5 (June 2012), PP.12-17 www.ijerd.com A New Energy Efficient and Scalable Multicasting Algorithm for Hierarchical

More information

International Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 5, Sep -Oct 2015

International Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 5, Sep -Oct 2015 RESEARCH ARTICLE OPEN ACCESS Throughput-Aware Probabilistic Rebroadcasting Method to Reduce Routing Overhead in Mobile Ad Hoc Network Mr. H. T. Gurme [1], Mr. B. R. Solunke [2] PG Scholar, Assistant Professor

More information

Reducing Routing Overhead in Mobile Ad Hoc Networks Using Cluster Scheme

Reducing Routing Overhead in Mobile Ad Hoc Networks Using Cluster Scheme e-issn 2455 1392 Volume 2 Issue 2, February 2016 pp. 1-7 Scientific Journal Impact Factor : 3.468 http://www.ijcter.com Reducing Routing Overhead in Mobile Ad Hoc Networks Using Cluster Scheme Paranjape

More information

Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1

Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1 Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1 Shiv Mehra and Chansu Yu Department of Electrical and Computer Engineering Cleveland State University E-mail: {s.mehra,c.yu91}@csuohio.edu

More information

Traffic Based Analysis of Efficient & Dynamic Probabilistic Broadcasting Algorithm in MANETs Routing Protocols

Traffic Based Analysis of Efficient & Dynamic Probabilistic Broadcasting Algorithm in MANETs Routing Protocols Traffic Based Analysis of Efficient & Dynamic Probabilistic Broadcasting Algorithm in MANETs Routing Protocols Deepak Dembla * and Yogesh Chaba ** * Associate Professor, Deptt. of CSE, AIET, Jaipur INDIA

More information

Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP

Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP Thomas Kunz and Ed Cheng Carleton University tkunz@sce.carleton.ca Abstract. Multicasting can efficiently support a variety of applications that

More information

A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks

A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi Huang Dept. of Computer Science and Engineering Arizona State University Tempe,

More information

A Novel Interference Aware Optimized Link State Routing Protocol for Power Heterogeneous MANETs

A Novel Interference Aware Optimized Link State Routing Protocol for Power Heterogeneous MANETs A Novel Interference Aware Optimized Link State Routing Protocol for Power Heterogeneous MANETs Vijaya Lekshmi. S.V, E.P.Prakash PG Scholar, Assistant Professor Department of CSE SNS College of Engineering

More information

A NOVEL APPROACH OF AODV FOR STABILITY AND ENERGY EFFICIENT ROUTING FOR MANET USING IPV6

A NOVEL APPROACH OF AODV FOR STABILITY AND ENERGY EFFICIENT ROUTING FOR MANET USING IPV6 A NOVEL APPROACH OF AODV FOR STABILITY AND ENERGY EFFICIENT ROUTING FOR MANET USING IPV6 Shival Chadda Department of Computer Science Lovely Professional University Phagwara, Punjab, India Email: Shival.chadda@gmail.com

More information

Literature Review on Characteristic Analysis of Efficient and Reliable Broadcast in Vehicular Networks

Literature Review on Characteristic Analysis of Efficient and Reliable Broadcast in Vehicular Networks International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 6, Number 3 (2013), pp. 205-210 International Research Publication House http://www.irphouse.com Literature Review

More information

Enhanced Dominant Pruning Applied to The Route Discovery Process of On-demand Routing Protocols

Enhanced Dominant Pruning Applied to The Route Discovery Process of On-demand Routing Protocols Enhanced Dominant Pruning Applied to The Route Discovery Process of On-demand Routing Protocols Marco Aurélio Spohn Computer Science Department University of California at Santa Cruz Santa Cruz, CA 95064

More information

Routing in Anhinga. Aakash Chauhan October 20th, Chair: Hans-Peter Bischof Reader: Alan Kaminsky Observer: Sidney Marshall

Routing in Anhinga. Aakash Chauhan October 20th, Chair: Hans-Peter Bischof Reader: Alan Kaminsky Observer: Sidney Marshall Routing in Anhinga Aakash Chauhan October 20th, 2006 Chair: Hans-Peter Bischof Reader: Alan Kaminsky Observer: Sidney Marshall Agenda Introduction & Background Dynamic Source Routing Project Architecture

More information

Impact of Pause Time on the Performance of DSR, LAR1 and FSR Routing Protocols in Wireless Ad hoc Network

Impact of Pause Time on the Performance of DSR, LAR1 and FSR Routing Protocols in Wireless Ad hoc Network Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 2, February 2015,

More information

An Efficient Zone-Based Multicast Routing Protocol for Ad Hoc Network

An Efficient Zone-Based Multicast Routing Protocol for Ad Hoc Network An Efficient Zone-Based Multicast Routing Protocol for Ad Hoc Network Tain-Sao Chang 1 Jyh-Horng Wen 2* and Tzu-Ting Wu 3 1 Department of Electrical Engineering National Chung Cheng University No. 168

More information

A Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks

A Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks A Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks Radhu.R.Nair #1 T. K Parani *2 # Student, M.E Communication Systems engineering, Anna University DSCE Coimbatore, India *Assistant professor,

More information

Multicast over Vehicle Ad Hoc Networks

Multicast over Vehicle Ad Hoc Networks 1 Multicast over Vehicle Ad Hoc Networks Alberto Gordillo Muñoz Abstract Vehicular networks may improve the safety and efficiency of road travel but there are many challenges that still need to be overcome.

More information

A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Abstract Introduction

A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Abstract Introduction A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Weibo Chen 1, Kun Yang 1 and Xueqi Cheng 2 1. University of Essex, School of Computer

More information

Neighbour Knowledge Based Overhead Reduction in MANET

Neighbour Knowledge Based Overhead Reduction in MANET PP 38-43 Neighbour Knowledge Based Overhead Reduction in MANET A.S.Mohan Kumar 1, K.Saravana Kumar 2 1 ( M.E/CSE V.S.B Engineering College Karur, Tamilnadu). 2 (AP/CSE V.S.B Engineering College Karur,

More information

An improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET Zifen YANG 1, a, Guoqiang LI 1, b Li LIU 1, c

An improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET Zifen YANG 1, a, Guoqiang LI 1, b Li LIU 1, c International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015) An improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET Zifen YANG 1,

More information

Ubiquitous computing has added a new feature,

Ubiquitous computing has added a new feature, COVER FEATURE Integrating Mobile IP with Ad Hoc Networks Extending traditional IEEE 802.11-based access points to incorporate the flexibility of mobile ad hoc networks would help make the dream of ubiquitous

More information

Mobility Based Proactive and Reactive Routing Algorithm in Mobile Ad hoc Networks (MANETs)

Mobility Based Proactive and Reactive Routing Algorithm in Mobile Ad hoc Networks (MANETs) Mobility Based Proactive and Reactive Routing Algorithm in Mobile Ad hoc Networks (MANETs) Ajay Vikram Singh 1, Prof. M. Afshar Alam 2 and Prof. Bani Singh 3 1 Research Scholar, Department of Computer

More information

[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY NOVEL REVIEW OF MANET ROUTING PROTOCOLS Nippun Kamboj*, Dr. Munishwar Rai Department of Computer Applications Maharishi Markandeshwar

More information

Aanchal Walia #1, Pushparaj Pal *2

Aanchal Walia #1, Pushparaj Pal *2 An Implemented approach of VANET using Location Information based Technique for safe city and vehicle Aanchal Walia #1, Pushparaj Pal *2 #1. M.Tech Scholor,ECE,Krukshetra University, *2. A.P.ECE Department,

More information

Overhead Analysis of Reactive Shortest Single and Multi-path Routing Mechanism with Load Balance in MANET

Overhead Analysis of Reactive Shortest Single and Multi-path Routing Mechanism with Load Balance in MANET www.ijcsi.org https://doi.org/10.20943/01201605.102107 102 Overhead Analysis of Reactive Shortest Single and Multi-path Routing Mechanism with Load Balance in MANET K.MARIYAPPAN 1, Dr.M.KARNAN 2 1 Assistant

More information

An Enhanced Zone Routing Protocol to evaluate performance over MANET

An Enhanced Zone Routing Protocol to evaluate performance over MANET Disha Jamwal et al. International Journal of Recent Research Aspects ISSN: 2349-7688, Vol. 2, Issue 4, December 2015, pp.79-83 An Enhanced Zone Routing Protocol to evaluate performance over MANET Diksha

More information

Mobile-Gateway Routing for Vehicular Networks 1

Mobile-Gateway Routing for Vehicular Networks 1 Mobile-Gateway Routing for Vehicular Networks 1 Hsin-Ya Pan, Rong-Hong Jan 2, Andy An-Kai Jeng, and Chien Chen Department of Computer Science National Chiao Tung University Hsinchu, 30010, Taiwan {hypan,

More information

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Kalyan Kalepu, Shiv Mehra and Chansu Yu, Department of Electrical and Computer Engineering Cleveland State University 2121

More information

Stochastic Flooding Broadcast Protocols in Mobile Wireless Networks

Stochastic Flooding Broadcast Protocols in Mobile Wireless Networks Stochastic Flooding Broadcast Protocols in Mobile Wireless Networks Julien Cartigny David Simplot Jean Carle Abstract In wireless communication environment, the information broadcast based on the flooding

More information

A Review of On-Demand Routing Protocols for Mobile Ad-Hoc Networks

A Review of On-Demand Routing Protocols for Mobile Ad-Hoc Networks A Review of On-Demand Routing Protocols for Mobile Ad-Hoc Networks *Vivek Sharma, *Sujit Jhare, **Divakar Singh *School of Computer Science, BUIT, Bhopal **HOD, School of Computer Science, BUIT, Bhopal

More information

A Study of Bellman-Ford, DSR and WRP Routing Protocols with Respect to Performance Parameters for Different Number of Nodes

A Study of Bellman-Ford, DSR and WRP Routing Protocols with Respect to Performance Parameters for Different Number of Nodes A Study of Bellman-Ford, DSR and WRP Routing Protocols with Respect to Performance Parameters for Different Number of Nodes Ruchi Khandelwal 1 & Akhilesh Kosta 2 Department of Computer Science and Engineering

More information

STUDY ON MOBILE ADHOC NETWORK ROUTING PROTOCOLS

STUDY ON MOBILE ADHOC NETWORK ROUTING PROTOCOLS International Journal of Information Technology and Knowledge Management January-June 2012, Volume 5, No. 1, pp. 155-158 STUDY ON MOBILE ADHOC NETWORK ROUTING PROTOCOLS Monika ABSTRACT: In Many wireless

More information

A Review of Pro-Active and Re-Active Routing protocols for Mobile Ad-hoc Network

A Review of Pro-Active and Re-Active Routing protocols for Mobile Ad-hoc Network A Review of Pro-Active and Re-Active Routing protocols for Mobile Ad-hoc Network T. Sivaraman, Department of Computer Science, Thiruvalluvar University Arts & Science College, Thiruvennainallur. Tamilnadu,

More information

Peer to Peer Cooperation for Caching in Wireless Networks

Peer to Peer Cooperation for Caching in Wireless Networks Peer to Peer Cooperation for Caching in Wireless Networks A.Aruna Jyothi# 1 M.Tech(SE) CSE Department VNRVJIET, Hyderabad-72,India. arunajyothiurs@gmail.com N.Sravani * 2 Asst.prof, CSE Department VNRVJIET,

More information

Multi-Metric Energy Efficient Routing in Mobile Ad-Hoc Networks

Multi-Metric Energy Efficient Routing in Mobile Ad-Hoc Networks 214 IEEE Military Communications Conference Multi-Metric Energy Efficient Routing in Mobile Ad-Hoc Networks Evripidis Paraskevas, Kyriakos Manousakis, Subir Das and John S. Baras Institute for Systems

More information

Comparative study and Performance Analysis of FSR, ZRP and AODV Routing Protocols for MANET

Comparative study and Performance Analysis of FSR, ZRP and AODV Routing Protocols for MANET 2nd International Conference and workshop on Emerging Trends in Technology (ICWET) 211 Comparative study and Performance Analysis of FSR, and Protocols for MANET Parma Nand Research Scholar Wireless Computing

More information

Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes

Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes Sudheer Kumar 1, Akhilesh Yadav 2 Department of Computer Science and Engineering Kanpur Institute of Technology, Kanpur sudheerkr21@gmail.co

More information

REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS

REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS G. Poornima 1, Mr. M. Rajasenathipathi 2, 1 Research Scholar, Department of Computer Science, NGM College, Pollachi 2 Assistant Professor, Department

More information

HRP: A Hybrid Routing Protocol for Wireless Mesh Network

HRP: A Hybrid Routing Protocol for Wireless Mesh Network HRP: A Hybrid Routing Protocol for Wireless Mesh Network Muhammad Shoaib Siddiqui, Choong Seon Hong O Department of Computer Engineering, Kyung Hee University shoaib@networking.khu.ac.kr, cshong@khu.ac.kr,

More information

Packet Routing using Optimal Flooding Protocol in Cluster based MANET

Packet Routing using Optimal Flooding Protocol in Cluster based MANET IJSTE - International Journal of Science Technology & Engineering Volume 2 Issue 09 March 2016 ISSN (online): 2349-784X Packet Routing using Optimal Flooding Protocol in Cluster based MANET S.Bavani V.Aiswariya

More information