Connectivity Improvement for Inter-Domain Routing in MANETs

Size: px
Start display at page:

Download "Connectivity Improvement for Inter-Domain Routing in MANETs"

Transcription

1 The 2010 Military Communications Conference - Unclassified Program - Networking Protocols and Performance Track Connectivity Improvement for Inter-Domain Routing in MANETs You Lu *#, Biao Zhou &#, Ian Ku #, Mario Gerla # * Beijing University Posts and Telecommunications, Beijing , P.R. China & IAC Search & Media, Campbell, CA 95008, USA # Department Computer Science, University California, Los Angeles, CA 90095, USA superlvyou@gmail.com, {zhb, ianku, gerla}@cs.ucla.edu Abstract Inter-domain routing for MANETs (Mobile Ad Hoc Networks) draws increasing attention because military and vehicular applications. Most the proposed inter-domain routing protocols are using clustering to manage the connection between intra-domain nodes and inter-domain nodes. The distributed clustering algorithm elects within each domain gateways that connect to different domains. Also many inter-domain routing protocols assume that all nodes are equipped with GPS devices, which is common for nodes operating in military and vehicular environments. The geographical information can be used to assist the routing protocol. In this paper, we propose I-GIDR (improved geographical inter-domain routing protocol) which has several techniques to improve geo-based inter-domain routing protocol for MANETs. One key innovation is a new proposed gateway election algorithm that accounts for neighbor s number and distribution to select a gateway that can adapt to multiple domain scenarios. Another key innovation this paper is neighbor priority, a concept based on the geographical distribution and density neighbors. Using neighbor priority, we can optimize the geo-based routing protocol, and reduce control overhead. Simulation experiments show significant improvements in connectivity, Packet Delivery Ratio and Control Overhead. Index Terms gateway election, inter-domain routing, neighbor priority I. INTRODUCTION Nowadays, with the development military and vehicular applications, inter-domain routing for Mobile Ad Hoc Networks (MANETs) draws increasing attention [1]. Inter-domain routing in heterogeneous MANETs is not easy. The challenges include dynamic network topology, intermittent connectivity, membership management, and routing protocol heterogeneity. To meet the above challenges, researches have proposed several Inter-Domain Routing (IDR) Protocols for MANETs to achieve scalability and robustness to mobility using cluster techniques [2] [3] [4] [5]. The basic structure IDR consists clusters and gateways in each domain. The distributed clustering algorithm elects within each domain a set gateways that interconnect domains with different routing protocols. The cluster head acts as local DNS for own cluster and also (redundantly) for neighbor clusters. Gateways advertise to the network their connectivity, members, inter-domain routing table, and domain information (i.e. Autonomous System (AS) Id). The advertising protocol plays the role Border Gateway Protocol (BGP). Inter-domain routing protocol can then operate across incompatible domains, and make the final route selection based on the results from different underlying MANET routing protocols. In this paper, we propose I-GIDR (improved geographical inter-domain routing protocol) which has several techniques to improve geo-based inter-domain routing protocol for MANETs. Gateways must be selected carefully to insure the efficiency and accuracy communication between domains. They provide a bridge between domains and are crucial for inter-domain connections. We propose a new gateway election method by considering both the gateway s neighbor number and neighbor distribution to select gateways that achieve higher level connectivity. Similar to GIDR [2], our design assumes that all nodes are equipped with GPS devices, a common practice in military and vehicular application. The geographical information is used to assist the routing protocol to determine the next hop based on geo-routing mechanisms (i.e. greedy forwarding and direction forwarding). Based on the geographical information each node, we define the concept neighbor priority. The neighbor priority represents the reliability neighbor s connectivity. Using neighbor priority, we can 1) select as gateway the node that has the most reliable neighbors. 2) Estimate the neighbor s connectivity in order to select the next hop on the rout and improve the network reliability. 3) Calculate the ratio gateway s reliable neighbors to total neighbors. This ratio gives us a measure stability the topology. It allows us to optimize the frequency control messages and reduce control overhead. Our proposed I-GIDR protocol has the following key characteristics and innovations: 1) Balanced distribution assisted gateway election mechanism; 2) Neighbor priority assisted gateway election; 3) Neighbor priority assisted Geo-DFR routing improvement; 4) Neighbor priority assisted control overhead reduction. The rest the paper is organized as followed. Related work is briefly reviewed in section II. Then we describe the design our algorithm in details in section III. Extensive performance experiments are presented in section IV. We conclude the paper in section V. II. RELATED WORK We previously proposed a geo-based inter-domain routing protocol named GIDR [2]. The basic structure GIDR is clusters in each domain. GIDR exploits the clustering by group /10/$ IEEE 617

2 affinity. In each domain, the distributed clustering algorithm discovers the set travelingg companions and elects within each set a cluster head for each affinity group. In GIDR, packets to remote nodes are routed via gateway advertised routes, and packets to local destinations are routed using the local routing algorithm. Gateways are selected from the nodes that have the most neighbors. GIDR applies Geo-DFR as its main packet forwarding scheme among domains. A packet in GIDR is first greedy forwarded to the neighbor which yields the most progress towards the destinationn gateway. If greedy forwarding fails, the packet is directionally forwarded to the most promising node along the advertised direction. III. ALGORITHM DESIGN A. Basic Structure Inter-domain Routing An example scenario inter-domain are working above inter-domain routing protocols (i.e. GIDR), and incompatible intra-domain routing protocols (i.e. AODV, BELLMANFORD). routing is illustrated in Figure 1. Domains Figure 1. A typical scenario inter-domainn routing In order to communicate among incompatible domains, gateways must have multiple network interfaces. The number gateways in each domain could be more than one according to the requirement the MANETs. These gateways provide bridges among domains and are crucial for inter-domain connections. An example the situation multiple interfaces is illustrated as Figure 2. The central node is a gateway and has three interfaces to communicate with three different domains so that node A in domain1 can transmit data packets to node B in domain2 and node C in domain3. A Domain1 AODV b Domain3 RIP g GW Figure 2. Situation Multiple Interfaces and Channels C B Domain2 FSRL a B. Balanced Gateway Election Gateways, as bridges among domains, advertise their connectivity, members, inter-domainn routing table, and domain information to the network. Gateways must be carefully selectedd to insure the efficiency and accuracy communications between domains. Traditional gateway election methods only focus on the numberr neighbors. In GIDR, in order to represent the transmission efficiency among total nodes, gateway s neighbor ratio R is defined as the ratio the number neighbors to the total number nodess in the network, as shown in equation (1), where R is the neighbor ratio, n is the gateway s total number neighbors, and N is total number nodes in the network. Here, we consider the total number nodes in the network instead total number nodes in one domain because gateway nodes need to communicate with multiple domains. The node which has the maximum R iss chosen to be the gateway. In this paper, we consider the gateway election method in CSMA/ / scenarios. If the PHY/MAC protocol is CSMA, different domains share the channel. It is obvious that the connectivity dependss on not only the gateway s neighbor numberr but also its neighbor s distribution. In I-GIDR, we proposee a new gateway election method that considers both the neighbor number and neighbor distribution to achieve higher degree connectivity. In MANETs, the connectivity the networks is very dynamic. The primary problem is how to make the connectivity more reliable. The gateway nodes should have more neighbors than other normal nodes to connect more intra-domain nodes to make the transmissionn routing information and dataa packets more efficient. Meanwhile, its neighbor distribution in different domains should be balanced to make communication among domains more successful. Table 1 shows an example. Domain 1 has 10 members; domain 2 has 200 members; and domain 3 has 30 members. The numbers Node 1 s neighbors in each domain are 1, 2, and 3. The numbers Node 2 s neighbors in each domain are 0, 5, and 6. It is obvious that node 1 is a better gateway because its balanced neighbor distribution. Table 1 Neighbor Distribution Domain 1 Domain 2 Neighbors node 1 in each domain Neighbors node 2 in each domain Members domain in each In our method, we adopt the Jain s Balance Index mechanism to measure the balanced neighbor distribution among domains. [6] proposed Jain s Balance Index as equation (2). Jain s Balance Index is used to determine whether users or applications are receiving a fair share network resources. Jain s Balance Index: Domain 3 3 Jain ss equation rates the balance a set values. The result ranges from 1/n (worst case) to 1 (best case). This metric 6 30 (1) (2) 618

3 identifies underutilized channels and is not unduly sensitive to atypical network flow patterns. We define B as the value domain balance, as in (3). n is the total number domains. x i is the ratio the number neighbors to the number members in domain i. That is Equation (1) represents the transmission efficiency among total nodes. While equation (3) represents the balance distribution among domains. Considering both transmission efficiency and distribution balance, we elect gateways from nodes based on equation (4). If a domain needs to select more than one gateway, we will elect gateways in sequence from high to low according to (4). Gateways could be elected periodically to adapt the dynamic network topology. max 1, 0.6 (4) The parameter α is a coefficient to control the weight each factor. The result gateway election could be changed by modifying α.so the parameter α should be selected carefully depending on the specific scenario to optimize the efficiency the gateway selection method. Here, α = 0.6 is selected from our simulation results. Based on our simulation scenario as shown in IV, we set α as a series values and pick one them which has the best performance result. C. Neighbor Priority All nodes are assumed to be equipped with GPS. The control packet in our protocol includes geo-location neighbors, member list and other routing update message exchanged among gateways, which makes it possible to efficiently communicate with other gateways in different domains. Based on the geo-location information neighbors, we define a concept neighbor priority to check the neighbor s reliability. The gateway will calculate the geo-distance between each neighbor and itself based on geo-location. Also, the gateway will calculate its radio range based on its PHY and MAC parameters. We then define a percentage β its radio range as a threshold. The neighbors whose geo-distance is not more than β% the radio range have the neighbor priority set as 1. They are defined as reliable neighbors. And the neighbors whose geo-distance is more than β% the radio range have the neighbor priority set as 0. They are defined as unreliable neighbors. In other words, the closer neighbors will have higher priority than neighbors far away, as shown in Figure 3. Here, we define β = 80. The threshold β% is a criterion to determine the reliability neighbors. The results neighbor priority could be changed by modifying this threshold. The threshold β depends on the radio range, node relative velocity, channel interference, and system mobility model. Thus this threshold value should be selected carefully depending on the specific scenario to optimize the usage neighbor priority. (3) Figure 3. Neighbor s Reliability D. Improvement Gateway Connectivity As described in section III-B, we proposed a new gateway election method by considering both the neighbor number and neighbor distribution. We introduce neighbor priority to our method to improve the reliability neighbor s connectivity. The mobility nature nodes means that the network topology is highly dynamic. Since nodes update their geo-location information and neighbor list only periodically. Their neighbor list will not be the accurate list at all times. This causes gateways to be elected based on out-dated neighbor information. The randomness connectivity for nodes on the edge radio range will affect the neighbor list. In order to improve the connectivity gateways, they will only be elected based on the high neighbor priority which is equal to 1. We only calculate the number neighbors whose neighbor priority is equal to 1, using the equation (4). Based on this conservative calculation number neighbors, we can improve the gateway s reliability network connection. E. Improvement Geographical Routing In GIDR [2], we proposed a geo-based inter-domain routing protocol based on Geo-DFR (Greedy Forwarding + Direction Forwarding) as its core components to route among domains. The packet travels from the source node to the gateway in its own domain. Then the packet is forwarded from the gateway which is in the source node s domain to the gateway which is in the destination node s domain by using Geo-DFR. From the latter it is then delivered to the destination node via the local routing protocol. Geo-DFR is a geographical-assisted routing scheme. Each node knows its geo-coordinate from GPS, and the source node knows the destination node s geo-coordinate and stamps the coordinate in the packet. At each hop, the packet is forwarded to the neighbor who is closest to the destination node. Geo-routing uses some forwarding schemes such as Greedy Forwarding, Perimeter Forwarding and Direction Forwarding. Geo-DFR designs the direction forwarding to complement and even replace Perimeter forwarding in dead end recovery. Geo-DFR first forwards a packet to the neighbor which yields the most progress towards the destination, i.e., Greedy Forwarding. If Greedy Forwarding fails, Geo-DFR forwards 619

4 the packet directionally to the most promising node along the advertised direction. Based on the concept neighbor priority, in I-GIDR, we make Geo-DFR only consider its high priority neighbors when its routing table is updated. When a node received the inter-domain routing advertisement from its neighbor, if the routing path to a destination in the advertisement is new, it will always be inserted into the node s routing table. If the routing path to a destination in the advertisement already exists in the node s routing table and the path is better than the current routing path, the routing table entry is updated only if the advertised next hop is a reliable neighbor. In this way, the packet is only forwarded to the neighbor which is closest to the destination and whose neighbor priority is 1 when there is more than one path to the destination. That means the packet will only be forwarded to the neighbor who has a reliable connectivity, as shown in Figure 4. This will improve the network reliability and connectivity. Figure 4.Forwarding Packet to Reliable Neighbor F. Reduction Control Overhead Based on clustering techniques, gateways advertise control packets to the network. The control packet including geo-location neighbors, member list and other update information is sent by the gateways periodically to make it possible to efficiently communicate with multiple domains. In the previous method, the frequency update is pre-defined and fixed. Naturally, adjusting the frequency updates according to the situation dynamic network topology and neighbor connectivity will be better and contribute to optimize the control overhead. Based on neighbor priority, in I-GIDR, we define a neighbor reliability ratio F as (5). The gateway will calculate the ratio the neighbors whose neighbor priority is 1 to total neighbors. The ratio reliable neighbors to total neighbors represents the situation neighbor s reliability. We define that if this ratio F is more than 80%, which means the network topology is not much dynamic and the connectivity is stable, the frequency control message will be decreased by 20%. Otherwise, if this ratio is less than 80%, the frequency control message will be resume to the pre-define value. Also, the criterion, 80% and 20%, should be selected carefully depending on the specific scenario to optimize the frequency update message. In this way, we can reduce the control overhead during the routing period. (5) IV. PERFORMANCE EVALUATION We implemented I-GIDR under Qualnet network simulator 4.5 [7]. Network data traffic is generated by CBR sources. Packet size is 512 bytes and packet interval is 0.25s. The source-destination pairs are randomly selected. The dimension the network scenario is 1000m 1000m. Different seeds are used in the simulations. The mobility model is RPGM [8]. Each node in a domain has a common group motion component. In addition, each node has an individual intra-group motion component. In our simulation the group speed varies under different scenarios, while the intra-group speed is fixed in the range [0-5 m/s] and the pause time is 10 seconds. Total simulation time is 1000 seconds. PHY/MAC protocol is IEEE b, which use CSMA/CA with RTS/CTS, and radio range 375m. In order to compare with original GIDR, the commonly used metrics evaluating routing protocols for wireless ad hoc networks have been considered: 1) Packet Delivery Ratio: the ratio the number data packets received by the destination nodes over the number data packets transmitted to the destination node by the source nodes; and 2) Normalized Control Overhead: the ratio total number control packets to total number CBR data packets during the entire simulation time. A. Experiments with Different Node Mobility We compare our I-GIDR with original GIDR and evaluate performance under the scenarios with nodes in three domains running at different velocities and each domain electing three gateways. Each domain has 20 nodes. Total nodes are 60. The delivery ratio in the scenarios different velocities is illustrated in Figure 5. The curve with square represents the performance I-GIDR. The curve with triangle represents the performance original GIDR. In addition, we ran three sub-experiments to show the performance gain each our individual improvements, shown as curves No.1~3. The No.1 curve is the result when only using the balanced gateway election on top original GIDR. The No.2 curve is the result when only using the improved routing by neighbor priority. The No.3 curve is the result when only using improved gateway election by neighbor priority. We can observe that the effect balanced gateway election is the most obvious one the three improvements. And the old gateway election method improved by the neighbor priority only has a little improvement for the performance. But the accumulative effect improvements achieves a great increase in performance when compared to original GIDR. It also has been shown that the delivery ratio with both I-GIDR and original GIDR becomes lower when increasing the velocities nodes. When the nodes move faster, the radio links among nodes are frequently changed, which cause weaker node connectivity and thus reduces packet delivery ratio. If we adopt I-GIDR, the delivery ratio is much higher than original GIDR. And the trend advantage I-GIDR will be more obvious with increasing velocity. This is due to the connectivity unreliable neighbors becoming worse when nodes move faster. In I-GIDR, based on balanced gateway election and neighbor priority mechanism, we can 620

5 avoid the impact these unreliable neighbors and improve the connectivity dynamic network. communicator between domains. Insufficient gateways reduce the connectivity thee network and thus easier for packets to be dropped. So by increasing the number gateway, the deliveryy ratio becomes better. We can also see thatt the curve I-GIDRR is higher than original GIDR because balanced gatewayy election method and the routing mechanism assisted by neighbor priority. Figure 5. Packet Delivery Ratio vs. Node Velocity The normalized control overhead in the scenarios different velocities is illustrated in Figure 6. It shows that the normalized control overhead both I-GIDR and original GIDR becomes higher when increasing node velocity. This is because when node moves faster, it may lead to frequent change or break the radio links, which in turn produces more routing updates packets. We can also see that the normalized control overhead I-GIDR is much lower than original GIDR. This is due to our reducing update frequency method based on the ratio reliable neighbor. If the connectivity neighbors is more reliable, they will decrease the update frequency to reduce the control overhead. Figure 7. Packett Delivery Ratio vs. Gateway Percentage The normalized control overhead in the scenarios different percentages gateway is illustrated in Figure 8. It shows that the normalized control overhead both I-GIDR and original GIDR becomes higher when the percentage gateway increases, since more nodes act as gateways to broadcast inter-domain routing updates in this case. Gateway functions as the communicator between domains. So by increasing the numberr gateway, the normalized control overhead becomes higher. We can also see that the normalized control overhead I-GIDRR is lower than that original GIDR becausee reducing update frequency assisted by neighbor priority. Figure 6. Normalized Control Overhead vs. Node Velocity B. Experiments with Different Gateway Percentages We test the performance I-GIDR under scenarios that have different percentage gateways. The percentage gateway is the ratio number gateway over the total node number. There are still three domains and 20 nodes in each domain. Total nodes in network are 60. The delivery ratio in the scenarios different percentages gateway is illustrated in Figure 7. It has been shown that the delivery ratio becomes higher when the percentage gateway increases. More gateways result in higher delivery ratio. Every node needs to send its packets to gateways when transferring packets to nodes in other domain. Gateway functions as the Figure 8. Normalized Control Overhead vs. Gateway Percentage The comparison between delivery ratio and normalized control overhead (Figure 7, Figure 8) shows that with the rise the gateway percentage, the connectivity the domains will be much better, which causes more routing updates. Thus increase the packet delivery ratio and the control overhead. Meanwhile, our improvement connectivity method, balanced gateway electionn and neighborr priority assisted mechanism, can greatly improvee packet delivery ratio and reduce control overhead. 621

6 C. Experiments with Different Number Domains The scenarios Figure 9 and 10 have multiple domains, each which runs different routing protocol, such as AODV, BELLMANFORD, FSRL, LAR1, RIP, or OSPF, etc. In these scenarios, the total node number in the whole network is fixed as 60, and the percentage gateway is 10%. As shown in Figure 9, the packet delivery ratio drops when the number domain increases. When the packet transfers across more domains, the possibility packet loss increases since the packet needs to be routed by the communicator gateway and the number gateways in each domain is limited. As we can see in Figure 9, when we adopt the I-GIDR, the packet delivery ratio improves since the new mechanism can improve the connectivity which reduces packet loss. gatewayy percentage and different number domains, our balanced gateway election method, neighbor priority assisted geo-routing algorithm, and dynamical adjustment for update frequency can improve both the packet delivery ratio and reduce control overhead. V. CONCLUSIONS The proposed I-GIDR, modifications and extensions geo-based inter-domain routing protocol, have proven successful, in improving connectivity and reliability and reducing control overhead using neighbor priority. In I-GIDR, we proposed a new gateway election method by considering both the gateway s neighbor number and neighbor distribution to adapt to multiple domain scenarios. Based on the geographical information in each node, we use neighbor priority y to select the gateway with the most reliable neighbors. The neighbor priority was also used to estimatee neighbor s connectivity and more accurately select the next hop in geo-routing. Moreover, based on neighbor priority, we calculated the ratio f reliable neighbors to total neighbors and used this ratio to optimize the frequency control message advertisements. The experiments have shown significant improvements in connectivity, far exceeding traditional geo-based inter-domain routing protocols. Figure 9. Packet Delivery Ratio vs. Number Domain The relationship between the control overhead and the number domain is shown in Figure 10. When the number domain increases, the routing overhead drops. In the scenarios with more domains, the intra-domain routing control overhead is greatly reducedd because theree is smaller number members per domain. The update frequency in intra-domain is normally much more frequent compared to inter-domain. Thus the total control overhead is less in the scenarios more domains. As we can see in Figure 10, when we adopt the I-GIDR, the control overhead decrease since the new mechanismm can reduce the update frequency. REFERENCES [1] J. Crowcrt, et al, Inter-domain Networks, Hotmobile, Routing over Mobile Ad-hoc [2] Biaoo Zhou, etc., Geo-based Inter-Domain Routing Protocol for MANETs, in MILCOM [3] Y. Chen, A. Liestman, and J. Liu, Clustering algorithms for ad hoc wireless networks, inn Proc. Ad Hoc and Sensor Networks 04, [4] G. Pei, M. Gerla, X.. Hong. LANMAR: Landmark Routing for Large Scale Wireless Ad Hoc Networks with Group Mobility. Proceedings the 1st ACM international symposium on Mobile ad hoc networking & computing (MobiHocc 2000); Nov [5] Z.J. Haas and M.R. Pearlman. The Zone Routing Protocol (ZRP) for Ad Hocc Networks. Internet Draft, draft-ietf-manet-zone-zrp-02.txtand June 1999 [6] Hawe, W. A Quantitative Measure Fairness Jain, R., Chiu, D.M., and Discrimination for Resource Allocation in Shared Systems. DEC Research Report TR-301, [7] M. Takai, L. Bajaj, R. Ahuja, R. Bagrodia, M. Gerla. Glomosim: A Scalable Network Simulation Environment. Technical Report ; Univ. California at Los Angeles, Computer Science Department, [8] X. Hong, M. Gerla, G. Pei, and C.-C. Chiang. A Group Mobility Model for Ad Hoc Wireless Networks. Proceedings ACM/IEEE MSWiM'99; Seattle, WA, Aug Figure 10. Normalized Control Overhead vs. Number Domain In summary, with the variety node mobility, different 622

GEO-BASED INTER-DOMAIN ROUTING (GIDR) PROTOCOL FOR MANETS

GEO-BASED INTER-DOMAIN ROUTING (GIDR) PROTOCOL FOR MANETS GEO-BASED INTER-DOMAIN ROUTING (GIDR) PROTOCOL FOR MANETS Biao Zhou *, Abhishek Tiwari +, Konglin Zhu *, You Lu $, Mario Gerla *, Anurag Ganguli +, Bao-hong Shen +, David Krzysiak # Corresponding Address:

More information

MPR-Aware Performance Improvement for Inter-Domain Routing in MANETs

MPR-Aware Performance Improvement for Inter-Domain Routing in MANETs MPR-Aware Performance Improvement for Inter-Domain Routing in MANETs You Lu #&, Yenan Lin #$, Biao Zhou *, Mario Gerla # # Department of Computer Science, University of California, Los Angeles, CA 90095,

More information

Keywords-MANETs, Multicast mode, Clustering, Inter-domain routing.

Keywords-MANETs, Multicast mode, Clustering, Inter-domain routing. Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey of Multicast

More information

Node-Disjoint Multipath Routing with Group Mobility in MANETs

Node-Disjoint Multipath Routing with Group Mobility in MANETs Node-Disjoint Multipath Routing with Group Mobility in MANETs Yun Ge 1,2, Guojun Wang 1,, and Jie Wu 3 1 School of Information Science and Engineering Central South University Changsha 410083, China 2

More information

Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks

Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks Fatiha Djemili Tolba University of Haute Alsace GRTC Colmar, France fatiha.tolba@uha.fr Damien Magoni University

More information

Direction Forward Routing for Highly Mobile Ad Hoc Networks

Direction Forward Routing for Highly Mobile Ad Hoc Networks Ad Hoc & Sensor Wireless Networks, Vol. X, pp. 01 18 Reprints available directly from the publisher Photocopying permitted by license only c 2006 Old City Publishing, Inc. Published by license under the

More information

Reliable Routing In VANET Using Cross Layer Approach

Reliable Routing In VANET Using Cross Layer Approach Reliable Routing In VANET Using Cross Layer Approach 1 Mr. Bhagirath Patel, 2 Ms. Khushbu Shah 1 Department of Computer engineering, 1 LJ Institute of Technology, Ahmedabad, India 1 er.bhagirath@gmail.com,

More information

Comparison of proposed path selection protocols for IEEE s WLAN mesh networks

Comparison of proposed path selection protocols for IEEE s WLAN mesh networks Comparison of proposed path selection protocols for IEEE 802.11s WLAN mesh networks Sana Ghannay, Sonia Mettali Gammar and Farouk Kamoun CRISTAL lab, National School of Computer Sciences, ENSI, 2010, Manouba

More information

UCLA UCLA Previously Published Works

UCLA UCLA Previously Published Works UCLA UCLA Previously Published Works Title Geo-LANMAR: A scalable routing protocol for ad hoc networks with group motion Permalink https://escholarship.org/uc/item/91m27970 Journal Wireless Communications

More information

Histogram-Based Density Discovery in Establishing Road Connectivity

Histogram-Based Density Discovery in Establishing Road Connectivity Histogram-Based Density Discovery in Establishing Road Connectivity Kevin C. Lee, Jiajie Zhu, Jih-Chung Fan, Mario Gerla Department of Computer Science University of California, Los Angeles Los Angeles,

More information

Ad-hoc Storage Overlay System

Ad-hoc Storage Overlay System Ad-hoc Storage Overlay System (ASOS) David Barbour dmbarbour@gmail.com EECS 800: Survivable Networking Professor James P. G. Sterbenz Presentation based upon paper: Guang Yang, Ling-Jyh Chen, Tony Sun,

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

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on

More information

Distributed Clusterhead Architecture for Mobile Ad Hoc Networks

Distributed Clusterhead Architecture for Mobile Ad Hoc Networks Journal of Computer Science 2 (7): 583-588, 2006 ISSN 1549-3636 2006 Science Publications Distributed Clusterhead Architecture for Mobile Ad Hoc Networks 1 Emad Qaddoura, 2 Wesam AlMobaideen and 3 Ahmad

More information

2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service)

2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service) 2. LITERATURE REVIEW I have surveyed many of the papers for the current work carried out by most of the researchers. The abstract, methodology, parameters focused for performance evaluation of Ad-hoc routing

More information

Multicast-Enabled Landmark (M-LANMAR) : Implementation and scalability

Multicast-Enabled Landmark (M-LANMAR) : Implementation and scalability Multicast-Enabled Landmark (M-LANMAR) : Implementation and scalability YunJung Yi, Mario Gerla, JS Park, Yeng Lee, SW Lee Computer Science Dept University of California, Los Angeles The AINS Scenario FLIR

More information

Implementation and Validation of Multicast-Enabled Landmark Ad-hoc Routing (M-LANMAR) Protocol

Implementation and Validation of Multicast-Enabled Landmark Ad-hoc Routing (M-LANMAR) Protocol Implementation and Validation of Multicast-Enabled Landmark Ad-hoc Routing (M-LANMAR) Protocol Yunjung Yi, Joon-Sang Park, Sungwook Lee, Yeng-Zhong Lee, and Mario Gerla Computer Science Department University

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

AN ADAPTIVE GATEWAY DISCOVERY IN HYBRID MANETS

AN ADAPTIVE GATEWAY DISCOVERY IN HYBRID MANETS AN ADAPTIVE GATEWAY DISCOVERY IN HYBRID MANETS F. D. Trujillo, A. Triviño, E. Casilari and A. Díaz-Estrella Department of Electronic Technology University of Malaga A. J. Yuste Department of Telecommunication

More information

Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator

Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator Dr. S. K. Singh Professor, Department of EC, India Dr. R. Gupta Asst. Prof. Department of EC, India Abstract: The

More information

Control Traffic Analysis of On-Demand Routing Protocol. in Mobile Ad-hoc Networks

Control Traffic Analysis of On-Demand Routing Protocol. in Mobile Ad-hoc Networks Second International Conference on Networking and Distributed Computing Control Traffic Analysis of On-Demand Routing Protocol in Mobile Ad-hoc Networks Zhilin Zhang School of Computer Science & Technology

More information

Kapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types

Kapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types Kapitel 5: Mobile Ad Hoc Networks Mobilkommunikation 2 WS 08/09 Wireless Communication Wireless communication networks types Infrastructure-based networks Infrastructureless networks Ad hoc networks Prof.

More information

Keywords: AODV, MANET, WRP

Keywords: AODV, MANET, WRP Performance Analysis of AODV and WRP in MANET Sachchida Nand Singh*, Surendra Verma**, Ravindra Kumar Gupta*** *(Pursuing M.Tech in Software Engineering, SSSIST Sehore(M.P), India, Email: sesachchida@gmail.com)

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

Routing Protocols in MANETs

Routing Protocols in MANETs Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an

More information

Implementation and Validation of Multicast-Enabled Landmark Ad-hoc Routing (M-LANMAR) Protocol

Implementation and Validation of Multicast-Enabled Landmark Ad-hoc Routing (M-LANMAR) Protocol Implementation and Validation of Multicast-Enabled Landmark Ad-hoc Routing (M-LANMAR) Protocol Yunjung Yi, Joon-Sang Park, Sungwook Lee, Yeng-Zhong Lee, and Mario Gerla Computer Science Department University

More information

A New Efficient and Energy-aware Clustering Algorithm for the OLSR Protocol

A New Efficient and Energy-aware Clustering Algorithm for the OLSR Protocol IJCSNS International Journal of Computer Science and Network Security, VOL.15 No.7, July 2015 85 A New Efficient and Energy-aware Clustering Algorithm for the OLSR Protocol Ahmed Loutfi and Mohammed Elkoutbi

More information

On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering

On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering Mario Gerla, Taek Jin Kwon and Guangyu Pei Computer Science Department University of California, Los Angeles Los Angeles, CA,

More information

CLUSTER BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

CLUSTER BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS CLUSTER BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS M.SASIKUMAR 1 Assistant Professor, Dept. of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, Tamilnadu,

More information

A New Packet Forwarding Algorithm in Geographical Location Based Mobile Ad Hoc Routing Protocol

A New Packet Forwarding Algorithm in Geographical Location Based Mobile Ad Hoc Routing Protocol roceedings of the 5th WSEAS International Conference on Applied Computer Science, Hangzhou, China, April 16-18, 2006 (pp165-170) 1,2 A New acket Forwarding Algorithm in Geographical Location Based Mobile

More information

Analysis of GPS and Zone Based Vehicular Routing on Urban City Roads

Analysis of GPS and Zone Based Vehicular Routing on Urban City Roads Analysis of GPS and Zone Based Vehicular Routing on Urban City Roads Aye Zarchi Minn 1, May Zin Oo 2, Mazliza Othman 3 1,2 Department of Information Technology, Mandalay Technological University, Myanmar

More information

Performance Comparison of Routing Protocols for wrecked ship scenario under Random Waypoint Mobility Model for MANET

Performance Comparison of Routing Protocols for wrecked ship scenario under Random Waypoint Mobility Model for MANET Advances in Wireless and Mobile Communications. ISSN 0973-6972 Volume 10, Number 5 (2017), pp. 1051-1058 Research India Publications http://www.ripublication.com Performance Comparison of Routing Protocols

More information

International Journal of Engineering Research & Technology (IJERT) ISSN: Vol. 1 Issue 3, May

International Journal of Engineering Research & Technology (IJERT) ISSN: Vol. 1 Issue 3, May Cluster Based on Demand Routing Protocol for Mobile Ad Hoc Network Neha Gupta Er. Manish Shrivastava Angad Singh Deptt. of IT Head of Deptt. of IT Assot. Professor Deptt. of IT LNCT BHOPAL INDIA Abstract

More information

Joint Design of Routing and Medium Access Control for Hybrid Mobile Ad Hoc Networks

Joint Design of Routing and Medium Access Control for Hybrid Mobile Ad Hoc Networks Mobile Netw Appl (27) 12:57 68 DOI 1.17/s1136-6-6-9 Joint Design of Routing and Medium Access Control for Hybrid Mobile Ad Hoc Networks Xiaojiang (James) Du & Dapeng Wu Published online: 1 December 26

More information

Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks

Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks Xin Zhang, George F. Riley Department of ECE Georgia Institute of Technology Atlanta, GA 3332-25 xinzhang, riley@ece.gatech.edu

More information

Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks

Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks Mina Malekzadeh Golestan University Zohre Fereidooni Golestan University M.H. Shahrokh Abadi

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

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

Hybrid gateway advertisement scheme for connecting mobile ad hoc networks to the Internet

Hybrid gateway advertisement scheme for connecting mobile ad hoc networks to the Internet * gateway advertisement scheme for connecting mobile ad hoc networks to the Internet Jeongkeun Lee (), Dongkyun Kim (2), J.J.Garcia-Luna-Aceves (3), Yanghee Choi (), Jihyuk Choi (4), Sangwoo Nam (4) ()

More information

CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS

CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS 89 CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS 5.1 INTRODUCTION Efficient routing in MANET is a tough task due to their highly dynamic network topology, bandwidth controlled links and

More information

Performance of New Broadcast Forwarding Criteria in MANET

Performance of New Broadcast Forwarding Criteria in MANET 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

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

Lecture 6: Vehicular Computing and Networking. Cristian Borcea Department of Computer Science NJIT

Lecture 6: Vehicular Computing and Networking. Cristian Borcea Department of Computer Science NJIT Lecture 6: Vehicular Computing and Networking Cristian Borcea Department of Computer Science NJIT GPS & navigation system On-Board Diagnostic (OBD) systems DVD player Satellite communication 2 Internet

More information

Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks

Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks Journal of Computer Science 7 (12): 1813-1818, 2011 ISSN 1549-3636 2011 Science Publications Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks 1 M.Rajesh Babu and 2 S.Selvan 1 Department

More information

The General Analysis of Proactive Protocols DSDV, FSR and WRP

The General Analysis of Proactive Protocols DSDV, FSR and WRP Volume 116 No. 10 2017, 375-380 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu The General Analysis of Proactive Protocols DSDV, FSR and WRP 1 Dr.

More information

A Performance Comparison of Multicast Routing Protocols In Ad hoc Networks

A Performance Comparison of Multicast Routing Protocols In Ad hoc Networks A Performance Comparison of Multicast Routing Protocols In Ad hoc Networks Hasnaa MOUSTAFA and Houda LABIOD ENST - INFRES Department - 46 Rue Barrault 75634 Paris cedex 3 Paris - France Tel: +33 ().45.8.74.36

More information

LOCATION-AIDED ROUTING PROTOCOL IN HYBRID WIRED-WIRELESS NETWORKS. WU MINTAO (B.Eng.(Hons.), NTU)

LOCATION-AIDED ROUTING PROTOCOL IN HYBRID WIRED-WIRELESS NETWORKS. WU MINTAO (B.Eng.(Hons.), NTU) LOCATION-AIDED ROUTING PROTOCOL IN HYBRID WIRED-WIRELESS NETWORKS WU MINTAO (B.Eng.(Hons.), NTU) A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF ENGINEERING DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING

More information

Proposal of autonomous transmission timing control scheme for collision avoidance in ad hoc multicasting

Proposal of autonomous transmission timing control scheme for collision avoidance in ad hoc multicasting Proposal of autonomous transmission timing control scheme for collision avoidance in ad hoc multicasting Katsuhiro Naito, Yasunori Fukuda, Kazuo Mori, and Hideo Kobayashi Department of Electrical and Electronic

More information

Geo-LANMAR: A Scalable Routing Protocol for Large Wireless Ad Hoc Networks with Group Motion

Geo-LANMAR: A Scalable Routing Protocol for Large Wireless Ad Hoc Networks with Group Motion Geo-LANMAR: A Scalable Routing Protocol for Large Wireless Ad Hoc Networks with Group Motion Biao Zhou 1, Floriano De Rango 2, Yengzhong Lee 1, Mario Gerla 1, Salvatore Marano 2 1 Department of Computer

More information

Efficient Routing Algorithm for MANET using Grid FSR

Efficient Routing Algorithm for MANET using Grid FSR 2011 International Conference on Advancements in Information Technology With workshop of ICBMG 2011 IPCSIT vol.20 (2011) (2011) IACSIT Press, Singapore Efficient Routing Algorithm for MANET using Grid

More information

Geographic Routing Without Location Information. AP, Sylvia, Ion, Scott and Christos

Geographic Routing Without Location Information. AP, Sylvia, Ion, Scott and Christos Geographic Routing Without Location Information AP, Sylvia, Ion, Scott and Christos Routing in Wireless Networks Distance vector DSDV On-demand DSR, TORA, AODV Discovers and caches routes on demand Geographic

More information

A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks

A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks P.Madhan Mohan #, J.James Johnson #, K.Murugan $ and V.Ramachandran % # Under Graduate Student $ Senior

More information

Routing in Sensor Networks

Routing in Sensor Networks Routing in Sensor Networks Routing in Sensor Networks Large scale sensor networks will be deployed, and require richer inter-node communication In-network storage (DCS, GHT, DIM, DIFS) In-network processing

More information

Figure 1. Clustering in MANET.

Figure 1. Clustering in MANET. Volume 6, Issue 12, December 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance

More information

Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks

Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks Falko Dressler, Abdalkarim Awad and Mario Gerla Dept. of Computer Science, University of Erlangen, Germany {abdalkarim.awad,dressler}@informatik.uni-erlangen.de

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

CAPACITY COMPATIBLE TWO-LEVEL LINK STATE ROUTING FOR MOBILE AD HOC NETWORKS

CAPACITY COMPATIBLE TWO-LEVEL LINK STATE ROUTING FOR MOBILE AD HOC NETWORKS CAPACITY COMPATIBLE TWO-LEVEL LINK STATE ROUTING FOR MOBILE AD HOC NETWORKS John Sucec and Ivan Marsic Rutgers University ABSTRACT The throughput of mobile ad hoc networks (MANETs has been analyzed previously.

More information

Comparative Performance Analysis of AODV,DSR,DYMO,OLSR and ZRP Routing Protocols in MANET using Random Waypoint Mobility Model

Comparative Performance Analysis of AODV,DSR,DYMO,OLSR and ZRP Routing Protocols in MANET using Random Waypoint Mobility Model Comparative Performance Analysis of AODV,DSR,DYMO,OLSR and ZRP Routing Protocols in MANET using Random Waypoint Mobility Model ISSN: 2349-6363 Jogendra Kumar Department of computer science and engineering

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

Analysis and Comparison of DSDV and NACRP Protocol in Wireless Sensor Network

Analysis and Comparison of DSDV and NACRP Protocol in Wireless Sensor Network Analysis and Comparison of and Protocol in Wireless Sensor Network C.K.Brindha PG Scholar, Department of ECE, Rajalakshmi Engineering College, Chennai, Tamilnadu, India, brindhack@gmail.com. ABSTRACT Wireless

More information

NEW! Updates from previous draft Based on group mailing list discussions Added definition of optimal scalability with examples (captures idea of suffi

NEW! Updates from previous draft Based on group mailing list discussions Added definition of optimal scalability with examples (captures idea of suffi IRTF ANS WG Meeting, November 12, 2003 Notes on Scalability of Wireless Ad hoc Networks Onur Arpacioglu, Tara Small and Zygmunt J. Haas , which extends

More information

VANS: Visual Ad hoc Network Simulator

VANS: Visual Ad hoc Network Simulator VANS: Visual Ad hoc Network Simulator Masako Shinohara, Hideki Hayashi, Takahiro Hara, Akimitsu Kanzaki and Shojiro Nishio Graduate School of Information Science and Tech., Osaka University {sinohara.masako,

More information

Energy Aware and Anonymous Location Based Efficient Routing Protocol

Energy Aware and Anonymous Location Based Efficient Routing Protocol Energy Aware and Anonymous Location Based Efficient Routing Protocol N.Nivethitha 1, G.Balaji 2 1 PG student, 2 Asst.Professor Department of Electronics and Communication Engineering Angel College of Engineering

More information

Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks

Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent Wong and Victor Leung Department of Electrical and Computer Engineering The University of British Columbia 56

More information

Study on Indoor and Outdoor environment for Mobile Ad Hoc Network: Random Way point Mobility Model and Manhattan Mobility Model

Study on Indoor and Outdoor environment for Mobile Ad Hoc Network: Random Way point Mobility Model and Manhattan Mobility Model Study on and Outdoor for Mobile Ad Hoc Network: Random Way point Mobility Model and Manhattan Mobility Model Ibrahim khider,prof.wangfurong.prof.yinweihua,sacko Ibrahim khider, Communication Software and

More information

Computation of Multiple Node Disjoint Paths

Computation of Multiple Node Disjoint Paths Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes

More information

ADAPTIVE BANDWIDTH MANAGEMENT AND QOS PROVISIONING IN LARGE SCALE AD HOC NETWORKS

ADAPTIVE BANDWIDTH MANAGEMENT AND QOS PROVISIONING IN LARGE SCALE AD HOC NETWORKS ADAPTIVE BANDWIDTH MANAGEMENT AND QOS PROVISIONING IN LARGE SCALE AD HOC NETWORKS Kaixin Xu, Ken Tang, Rajive Bagrodia Scalable Network Technologies, Inc. {xkx, ktang, rlb}@scalable-networks.com and Mario

More information

Routing Protocols in Mobile Ad-Hoc Network

Routing Protocols in Mobile Ad-Hoc Network International Journal of Computer Science & Management Studies, Vol. 12, Issue 02, April 2012 Protocols in Mobile Ad-Hoc Network Sachin Minocha M. Tech Student, Vaish College of Engineering, Rohtak, Haryana

More information

Ad Hoc Wireless Routing CS 218- Fall 2003

Ad Hoc Wireless Routing CS 218- Fall 2003 Ad Hoc Wireless Routing CS 218- Fall 2003 Wireless multihop routing challenges Review of conventional routing schemes Proactive wireless routing Hierarchical routing Reactive (on demand) wireless routing

More information

Evaluating the Performance of Mobile Agent-Based Message Communication among Mobile Hosts in Large Ad Hoc Wireless Network

Evaluating the Performance of Mobile Agent-Based Message Communication among Mobile Hosts in Large Ad Hoc Wireless Network Evaluating the Performance of Mobile Agent-Based Communication among Mobile Hosts in Large Ad Hoc Wireless Network S. Bandyopadhyay Krishna Paul PricewaterhouseCoopers Limited Techna Digital Systems Sector

More information

Adaptive Cell-Relay Routing Protocol for Mobile ad hoc Networks

Adaptive Cell-Relay Routing Protocol for Mobile ad hoc Networks Adaptive Cell-Relay Routing Protocol for Mobile ad hoc Networks Xiaojiang Du Department of Computer Science North Dakota State University Fargo, ND 58105 Xiaojiang.Du@ndsu.edu Abstract - Most existing

More information

AMRIS: A Multicast Protocol for Ad hoc Wireless Networks

AMRIS: A Multicast Protocol for Ad hoc Wireless Networks of AMRIS: A Multicast Protocol for Ad hoc Wireless Networks C.W. Wu, Y.C. Tay National University of Singapore wuchunwei@alum.comp.nus.edu.sg,tay@acm.org Abstract This paper introduces AMRIS, a new multicast

More information

Improving the Data Scheduling Efficiency of the IEEE (d) Mesh Network

Improving the Data Scheduling Efficiency of the IEEE (d) Mesh Network Improving the Data Scheduling Efficiency of the IEEE 802.16(d) Mesh Network Shie-Yuan Wang Email: shieyuan@csie.nctu.edu.tw Chih-Che Lin Email: jclin@csie.nctu.edu.tw Ku-Han Fang Email: khfang@csie.nctu.edu.tw

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

Dynamic Group Support in LANMAR Routing Ad Hoc Networks

Dynamic Group Support in LANMAR Routing Ad Hoc Networks Dynamic Group Support in Routing Ad Hoc Networks Xiaoyan Hong, Nam Nguyen, Shaorong Liu and Ying Teng Computer Science Department, University of California at Los Angeles 45 Hilgard Avenue Los Angeles,

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

1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol 1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol Vahid Zangeneh i and Shahriar Mohammadi ii * ABSTRACT In recent years, routing has been the most focused area in ad hoc networks

More information

Why dynamic route? (1)

Why dynamic route? (1) Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update

More information

AODV-PA: AODV with Path Accumulation

AODV-PA: AODV with Path Accumulation -PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications

More information

A Survey - Energy Efficient Routing Protocols in MANET

A Survey - Energy Efficient Routing Protocols in MANET , pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram

More information

Mobility-based d-hop Clustering Algorithm for Mobile Ad Hoc Networks

Mobility-based d-hop Clustering Algorithm for Mobile Ad Hoc Networks Mobility-based d-hop Clustering Algorithm for Mobile Ad Hoc Networks Inn Inn ER 1,2 1 Department of Computer Science, School of Computing National University of Singapore Singapore 117543 erinninn@comp.nus.edu.sg

More information

Landmark Routing for Large Ad Hoc Wireless Networks

Landmark Routing for Large Ad Hoc Wireless Networks Landmark Routing for Large Ad Hoc Wireless Networks Mario Gerla, Xiaoyan Hong and Guangyu Pei Computer Science Department University of California Los Angeles, CA 90095 Abstract-In this paper, we present

More information

Team Oriented Multicast: a Scalable Routing Protocol for Large Mobile Networks

Team Oriented Multicast: a Scalable Routing Protocol for Large Mobile Networks Team Oriented Multicast: a Scalable Routing Protocol for Large Mobile Networks Yunjung Yi, Mario Gerla, and Joon-Sang Park University of California at Los Angeles California, USA {yjyi, gerla, jspark}@cs.ucla.edu

More information

A Hybrid Multi Meshed Tree Routing Protocol for Wireless Ad hoc Networks

A Hybrid Multi Meshed Tree Routing Protocol for Wireless Ad hoc Networks A Hybrid Multi Meshed Tree Routing Protocol for Wireless Ad hoc Networks Scott Pudlewski, Nirmala Shenoy, Yamin Al-Mousa, Yin Pan, John Fischer Rochester Institute of Technology, Rochester, NY Abstract

More information

IMPROVING PERFORMANCE OF PARALLEL SIMULATION KERNEL FOR WIRELESS NETWORK SIMULATIONS

IMPROVING PERFORMANCE OF PARALLEL SIMULATION KERNEL FOR WIRELESS NETWORK SIMULATIONS IMPROVING PERFORMANCE OF PARALLEL SIMULATION KERNEL FOR WIRELESS NETWORK SIMULATIONS M. Thoppian, S. Venkatesan, H. Vu, R. Prakash, N. Mittal Department of Computer Science, The University of Texas at

More information

CHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING

CHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING 99 CHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING 5.1 INTRODUCTION Dynamic network topology and limited system resources characterize mobile ad hoc networking. Many routing protocols

More information

CSMA based Medium Access Control for Wireless Sensor Network

CSMA based Medium Access Control for Wireless Sensor Network CSMA based Medium Access Control for Wireless Sensor Network H. Hoang, Halmstad University Abstract Wireless sensor networks bring many challenges on implementation of Medium Access Control protocols because

More information

Experimental Evaluation of Gateway Based Interdomain Routing Scheme for DTN

Experimental Evaluation of Gateway Based Interdomain Routing Scheme for DTN Lehigh University Lehigh Preserve Theses and Dissertations 2011 Experimental Evaluation of Gateway Based Interdomain Routing Scheme for DTN Dongli Li Lehigh University Follow this and additional works

More information

Limiting Control Overheads Based on Link Stability for Improved Performance in Mobile Ad Hoc Networks

Limiting Control Overheads Based on Link Stability for Improved Performance in Mobile Ad Hoc Networks Limiting Control Overheads Based on Link Stability for Improved Performance in Mobile Ad Hoc Networks Hwee Xian Tan 1,2 and Winston K.G. Seah 2,1 1 Department of Computer Science, School of Computing,

More information

WSN Routing Protocols

WSN Routing Protocols WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before

More information

THE EXTENDED CLUSTERING AD HOC ROUTING PROTOCOL (ECRP)

THE EXTENDED CLUSTERING AD HOC ROUTING PROTOCOL (ECRP) THE EXTENDED CLUSTERING AD HOC ROUTING PROTOCOL (P) 1 Buthayna Al-Sharaa 1 Department of Electrical Engineering, Al Balqa Applied University, Jordan buthayna74@hotmail.com Abstract Ad hoc networks are

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

QoS-Enabled Video Streaming in Wireless Sensor Networks

QoS-Enabled Video Streaming in Wireless Sensor Networks QoS-Enabled Video Streaming in Wireless Sensor Networks S. Guo and T.D.C. Little Department of Electrical and Computer Engineering Boston University, Boston, MA 02215 {guosong, tdcl}@bu.edu MCL Technical

More information

Ad hoc and Sensor Networks Topology control

Ad hoc and Sensor Networks Topology control Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling

More information

Experimental Evaluation of LANMAR, a Scalable Ad-Hoc Routing Protocol

Experimental Evaluation of LANMAR, a Scalable Ad-Hoc Routing Protocol Experimental Evaluation of LANMAR, a Scalable Ad-Hoc Routing Protocol Yeng-Zhong Lee*, Jason Chen*, Xiaoyan Hong, Kaixin Xu*, Teresa Breyer*, and Mario Gerla* Computer Science Department University of

More information

Open Shortest Path First (OSPF)

Open Shortest Path First (OSPF) CHAPTER 42 Open Shortest Path First (OSPF) Background Open Shortest Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the interior gateway protocol (IGP) working

More information

Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s

Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations

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

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

Estimation of Network Partition Problem in Mobile Ad hoc Network

Estimation of Network Partition Problem in Mobile Ad hoc Network Estimation of Network Partition Problem in Mobile Ad hoc Network Varaprasad Golla B.M.S.College of Engineering Bangalore, India varaprasad555555@yahoo.co.in ABSTRACT: A node cannot communicate with others

More information