Example of TORA operations. From last time, this was the DAG that was built. A was the source and X was the destination.
|
|
- Elfrieda Kelly
- 6 years ago
- Views:
Transcription
1 Example of TORA operations A Link 2 D Link 6 Y Link 1 Link 3 C Link 4 Link 8 B Link 5 E Link 7 X From last time, this was the DAG that was built. A was the source and X was the destination.
2 Link 1 A B Link 3 Reacting to failures: Route Maintenance Link 2 C Link 4 Link 5 D E Link 6 Link 7 Y Link 8 X Let Link 4 fail. At this time notice that other than the destination all nodes still have an outbound link. Thus, none of the nodes generate an UPD message. The DAG is still OK! This is especially attractive when the network is dense most nodes have many outbound links.
3 Let Link 7 fail. Link 1 A B Link 3 Link 2 C Link 5 D E Link 6 Y Link 8 Link 7 (1,E,0,0,E) X Now, Node E does not have any outbound links! Thus, we resort to full link reversal at E. E generates a new reference level which is 1, sets the oid to E and transmits an UPD message. It also reverses the direction of all its inbound links.
4 Link 1 A B Link 3 Link 2 (1,E,0,-1,C) C Link 5 D E Link 6 Y Link 8 X At this, Node C no longer has outbound links. It resorts to partial link reversal reverses the direction of its links to A and B and transmits an UPD. It also sets its own offset to 1 to ensure that it is at a lower level compared to E.
5 Link 1 A B Link 3 Link 2 C Link 5 D E Link 6 Y Link 8 X Now the situation repeats at B. After B reverses its links and transmits an UPDATE. (1,E,0,-2,B)
6 Link 1 (1,E,1,-2,A) A Link 2 Link 3 C D Link 6 Y Link 8 The situation repeats at A. This is now a full reversal. A got updates from B and C. Link 1 B A Link 2 C Link 5 D E Link 6 Y Link 8 X Thus, A stays at the same level as C, but indicates the full reversal by flipping r i. This causes a partial reversal at B. Link 3 B (1,E,1,-3,B) Link 5 E X
7 A Link 2 (1,E,1,-4,C) D Link 6 Y Link 1 C Link 8 Link 3 B Link 5 E X Finally an update is generated at C. DAG is restored!
8 Link 1 A B Link 3 Link 2 C Link 5 D E Link 6 Y Link 8 X Now let Link 5 fail. This causes a network partition. E,D,Y and X are ok. C has no outbound links. Link 1 A B Link 3 Link 2 (2,C,0,0,C) C D E Link 6 Y Link 8 X It creates a new reference level which is 2, and sets the oid to C and sends a UPD. This causes B to have no outbound links.
9 Link 1 A Link 3 Link 2 C (2,C,1,-1,A) Link 1 A Link 2 Link 3 C B resorts to partial reversal. It reverses its link to A and broadcasts an update. B B Now A does not have outbound links. (2,C,0,-1,B) It resorts to a full reversal. At full reversal r i is flipped. This causes a partial reversal at B.
10 Link 1 A B Link 3 Link 2 (2,C,1,-2,B) C Important Point : Height is reduced with respect to node that created the reference level. B s UPD message after the partial reversal creates the same situation at C. This would cause C to realize that there is no path to X. It sets its height to NULL and sends an UPD to A and B. Now the nodes realize that there is no path to X.
11 Advantages: That of an on-demand routing protocol create a DAG only when necessary. Multiple paths created. Good in dense networks. Disadvantages Same as on-demand routing protocols. Not much used since DSR and AODV outperform TORA. Not scalable by any means.
12 References Chapter 8 of book. V.D.Park and Scott.M.Corson, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks, Proceedings of INFOCOM 1997.
13 Associativity Based Routing (ABR) Proposed by C-K.Toh currently at Georgia Tech. Introduces a new metric for routing which is called Degree of Association Stability. ABR is free from loops. What is association stability? How stable are nodes with respect to each other? Based on an estimate of this, a route is selected.
14 Each node would periodically generate and transmit a beacon to signify its existence. Neighboring nodes receive this beacon. They, maintain what is known as an associativity table. For each beacon received, the associativity of the receiving node with respect to the beaconing node is incremented. Thus, to reiterate there is an indication of how stable nodes are with respect to each other. Association Stability is defined by the connection stability in time and space of one node with respect to another.
15 Associativity entries (or ticks as they are called) are reset when the neighbors of a node, or the node itself moves out of proximity. Goal :? Longevity longer lived routes for stability. Lower Overhead (?) Three phases of ABR: Route Discovery Route Re-construction Route Deletion NOW HERE IS A NEW CONCEPT!!!!!!
16 ROUTE DISCOVERY Each node broadcasts a query message (BQ message just to sound different! ) in order to find a destination. In addition to the address, the associativity ticks with respect to their neighbors is appended. The receiving node, chooses the best one, i.e., retains only the entry corresponding to itself and its upstream node. Thus, at the destination, multiple routes are available. It chooses the one that is best in terms of associativity ticks. If there is a tie, choose shortest path.
17 Destination generates a REPLY message towards the source. Intermediate nodes that forward this message mark the corresponding routes as valid. Thus, only one route at a given time.
18 ROUTE MAINTENANCE Partial route recovery is allowed. Intermediate nodes will try and rediscover route from point of failure. When routes are no longer valid, they would be erased. This is similar to DSR except for associativity. In addition partial route discovery.
19 Advantages: Tries to find stable routes lower overhead in some scenarios. Partial recovery may be faster in some cases. Disadvantages Unclear if the overhead incurred in maintaining stability info. is higher than the actual gains. Depends on scenario. Partial recovery may lead to longer and less stable routes.
20 Chapter 9 on book. References Read about effects of beaconing on battery life. C-K. Toh, A Novel Distributed Routing Protocol to support Ad Hoc Mobile Computing, Proceedings of IEEE 15 th Annual International Phoenix Conference on Computers and Communication, March E.Royer and C-K.Toh, A Review of Current Routing Protocols for Ad-Hoc Mobile Networks, IEEE Personal Comm. Mag. April 1999.
21 Signal Stability based Adaptive Routing (SSA) Prof. Tripathi s work. Reference: R.Dube, C.D.Rais, K.Y.Wang and S.K.Tripathi, Signal Stability based Adaptive Routing for Ad Hoc Mobile Networks, IEEE Personal Communications Magazine, February 1997.
22 Principle of SSA Select routes based on the signal strength between nodes and on a node s location stability. Choose routes that have stronger connectivity. SSA has two component co-operative protocols: The Dynamic Routing Protocol The Static Routing Protocol.
23 The Dynamic Routing Protocol (DRP) The DRP is responsible for maintaining what is called the Signal Stability Table and also the Routing Table. SST record of signal strengths of neighboring nodes which is obtained by means of periodic beaconing. Quantized levels possible weak channel vs. strong channel. When a packet is received, DRP processes the packet, updates the tables and passes the received packet to the SRP.
24 The Static Routing Protocol (DRP) Forwards the packet up to the transport layer if it is the receiver. If not, it looks up the routing table and forwards the packet to the appropriate next-hop. If no entry is found, it initiates a route search.
25 The Route Search Route requests are propagated throughout the network however... Forwarded onto the next hop, only if they are received over strong channels and have not yet been previously processed. /* Notice that the second condition prevents looping */. The destination chooses the first arriving query message because it is most probable that the packet arrived on the strongest, shortest and/or least congested path. DRP reverses the route and sends a route-reply back to the sender.
26 The PREF field Notice so far that a route-search packet is forwarded only if it arrived on a strong link. However, it is possible that no route is found with strong links all the way. At this time, the source initiates another routesearch and uses what is called the PREF field to indicate that weak links are acceptable.
27 Route Maintenance Use a route error message to the source to indicate which channel has failed. Source then initiates a new route-search to find a new path to the destination.
28 Advantages: More stable routes since signal strength indicates stability. No overhead incurred in dissemination of tables. Disadvantages Of on-demand routing protocols. The time over which the signal strength is averaged out might be an issue.
29 Location Aided Routing (LAR) By Nitin Vaidya and Young-bae Ko. Reference: Location Aided Routing (LAR) in Mobile Ad Hoc Networks, Y.Ko and N.Vaidya, Proceedings of Mobicom Idea: Use Location Information for doing Routing does the name give a hint or what? The location info is obtained using GPS (Global Positioning System). Forward the packet towards the destination instead of forwarding it indiscreetly.
30 Global Positioning System (GPS) It is a system that allows a mobile user to know its physical location. There is however some error in the estimated position. Different systems have different errors few meters to about 100 meters.
31 The notion of expected zone If a source (S) knows that a destination (D) was at position L at time t 0, it has some notion of where the destination might be at a later time t 1. If the average speed of D is v, then S might expect that D is within a circular radius of v (t 1 -t 0 ) which is centered at L. However, note that this is only an estimate. If the actual speed was higher, the node might be outside this circle. This circular region is called the expected zone.
32 Why is the expected zone important? If we have an on-demand routing protocol, now we can disseminate a query within the expected zone! Note that if there is no information whatsoever with respect to the destination, query search would degenerate to pure flooding. On the other hand, if we further knew that D was moving north, then the expected zone may be further refined.
33 The Request Zone Source node defines what is known as a request zone. A node would forward the request only if it belongs to the request zone. Typically, the request zone would include the expected zone. Additionally nodes in other regions around the expected zone are to be included in the request zone. Why?
34 The Request Zone (Continued) Source node might not belong to the expected zone. Thus, other nodes which are not in the expected zone would need to forward request towards the expected zone. If with an initial request zone, the destination is not found (because no route exists entirely within the request zone), an expanded request zone may be defined. In an extreme case, the expanded request zone might be just doing flooding. There is a tradeoff between latency and message overhead.
35 Defining the Request Zone In the first scheme, the suggestion is that the request zone be the rectangle that includes the source and the expected zone of the destination. Expected Zone D v(t 1 -t 0 ) Source determines the co-ordinates of the rectangle and includes in query. A node upon receiving this, will forward the query only if it is within the rectangle. S Request Zone Entire Network
36 Expected Zone S D v(t 1 -t 0 ) Request Zone Entire Network The destination node, Node D would respond with its current location, and current time in its reply message. It could also include its current speed, or average speed over a recent time interval.
37 Size of the request zone Initially destination s location, D is unknown. The size of the request zone depends upon the average speed of movement of the destination v, and the time elapsed since the last known location of D was recorded. If v is large, larger expected zone, larger request zone. If communication with D is infrequent, it may result in a larger request zone. It may be possible to piggyback location info. on packets other than the query.
38 A Second Possible Scheme for determining the Request Zone. Source node knows location (X,Y) of dest at some time t0. It calculates its distance from (X,Y) = D s. It includes both, (X,Y) and D s in the query message. A node I, forwards it if for some parameter d, if its own distance from the destination D I <= Ds + d. If this message is further received by node J, node J would forward it only if its distance from the destination D J <= D I + d. Obviously the idea is that you try and get closer and closer to the destination. More details in the paper.
39 Finally, remember we said GPS could have some error. Thus, some leeway has to be provided to take this error into account while determining the expected zone and the request zone. That is my brief intro to ABR, SSA and LAR.
Arvind Krishnamurthy Fall 2003
Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
More informationA Survey of Routing Protocols for Ad Hoc Wireless Home Networks
International Journal of Electronics and Computer Science Engineering 52 Available Online at www.ijecse.org ISSN-2277-1956 A Survey of Routing Protocols for Ad Hoc Wireless Home Networks Meenakshi Chaturvedi
More informationEZR: Enhanced Zone Based Routing In Manet
EZR: Enhanced Zone Based Routing In Manet Bency Wilson 1, Geethu Bastian 2, Vinitha Ann Regi 3, Arun Soman 4 Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri
More informationPolitecnico di Milano Facoltà di Ingegneria dell Informazione. WI-7 Ad hoc networks. Wireless Internet Prof. Antonio Capone
Politecnico di Milano Facoltà di Ingegneria dell Informazione WI-7 Ad hoc networks Wireless Internet Prof. Antonio Capone Acknowlegments o This class notes are mostly based on the teaching material of:
More informationRouting 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 informationChapter 4 Routing in Mobile Ad Hoc Networks
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 Chapter 4 Routing in Mobile Ad Hoc Networks Al-Sakib Khan Pathan and Choong Seon
More informationWhite Paper. Mobile Ad hoc Networking (MANET) with AODV. Revision 1.0
White Paper Mobile Ad hoc Networking (MANET) with AODV Revision 1.0 This page is intentionally blank, or rather nearly blank. Table of Contents TABLE OF CONTENTS...3 TABLE OF FIGURES...4 WHAT IS MANET?...5
More informationAd Hoc Routing. Ad-hoc Routing. Problems Using DV or LS. DSR Concepts. DSR Components. Proposed Protocols
d oc Routing d-hoc Routing rvind Krishnamurthy all 2003 Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
More informationLECTURE 9. Ad hoc Networks and Routing
1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links
More informationAODV-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 informationECS-087: Mobile Computing
ECS-087: Mobile Computing Mobile Adhoc Networks and Routing in MANETS (most of the slides borrowed from Prof. Sridhar Iyer) Diwakar Yagyasen 1 Index Mobile Ad Hoc Networks (MANET) MAC in MANET MANET routing
More informationUnicast Routing in Mobile Ad-Hoc Networks
Unicast Routing in Mobile Ad-Hoc Networks Overview Introduction MaNet Protocols Proactive & Hybrid Protocols WRP/GSR/FSR/LAR ZRP Reactive Protocols DSR/DSDV/AODV Challenges in Ad-Hoc Networks References
More informationAnalyzing Reactive Routing Protocols in Mobile Ad Hoc Networks Dr. Kamaljit I. Lakhtaria
Int. J. Advanced Networking and Applications 1416 Analyzing Reactive Routing Protocols in Mobile Ad Hoc Networks Dr. Kamaljit I. Lakhtaria Email: kamaljit.ilakhtaria@gmail.com -------------------------------------------------------------------ABSTRACT--------------------------------------------------------------
More informationA Survey of Routing Protocols for Ad Hoc Networks Based on Update Mechanism
A Survey of Routing Protocols for Ad Hoc Networks Based on Update Mechanism Ruaa A. S. Alsabah, Ali A. J. Al-Sabbag, and H. Alzorghani Abstract An essential matter for ad hoc networks is routing protocol
More informationA COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET
ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer
More informationLecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday
Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing
More informationUCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.
Mobile Ad Hoc Networks: Routing TOPIC 8 UCS-805 MOBILE COMPUTING Jan-May,2011 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com Mobile Ad Hoc Networks (MANET) Introduction
More informationChapter 16. Wireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols. Wireless Network Models. Illustration of an ad hoc network
Chapter 16 Wireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols Associate Prof. Yuh-Shyan Chen Department of CSIE National Chung Cheng University Wireless Network Models With Infrastructure:
More informationWireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols
Chapter 16 Wireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols Associate Prof. Yuh-Shyan Chen Department of CSIE National Chung Cheng University 2002/11/ Yuh-Shyan Chen 1 Wireless Network
More informationSurvey on Location Based Routing Protocols in MANET
Survey on Location Based Routing Protocols in MANET Vivek Nikam, Prof. G.T. Chavan Sinhgad College of engineering, University of Pune Abstract- Due to the infrastructure less and dynamic nature of mobile
More informationKapitel 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 informationLocation Awareness in Ad Hoc Wireless Mobile Neworks
Location Awareness in Ad Hoc Wireless Mobile Neworks Lijuan Ai Wenyu Wang Yi Zhou 11/14/2001 Mobile Computing, Fall 2001 1 PART I INTRODUCTION TO MANET & LOCATION-AWARE COMPONENTS 11/14/2001 Mobile Computing,
More informationRouting in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14
Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path
More informationUnicast 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 informationROUTING PROTOCOLS FOR MANET WITHIN MULTICHANNEL
ROUTING PROTOCOLS FOR MANET WITHIN MULTICHANNEL MS. AMANDEEP KAUR Department of Computer Science and Technology, Asst Prof,in Guru Nanak National.College(Women),Nakodar,Punjab,India Abstract Mobile ad
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 6 CMPE 257 Winter'11 1 Announcements Project proposals. Student presentations. 10 students so
More informationPerformance 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 informationContent. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
More informationScalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size
Lovekesh Kumar / International Journal of Engineering Research and Applications (IJERA) ISSN: Scalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size Lovekesh Kumar* *(Department
More informationMobile Ad Hoc Networks: Routing, MAC and Transport Issues
Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Nitin H. Vaidya University of Illinois at Urbana-Champaign nhv@uiuc.edu http://www.crhc.uiuc.edu/~nhv 2004 Nitin Vaidya 1 Notes Names in brackets,
More informationA Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad-hoc Networks
A Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad-hoc Networks Won-Ik Kim Radio Performance Analysis Section Electronics & Telecommunications Research Institute 161 Kajong-dong,
More informationMiddle 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 informationAnalysis 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 informationCS5984 Mobile Computing
CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part II 1 Outline Routing Protocols for Ad hoc Networks DSDV: Highly Dynamic Destination-Sequenced Distance- Vector
More informationAn Improved Model for the Dynamic Routing. Effect Algorithm for Mobility Protocol. Karthik Ramakrishnan. A thesis
An Improved Model for the Dynamic Routing Effect Algorithm for Mobility Protocol by Karthik Ramakrishnan A thesis presented to the University of Waterloo in the fulfilment of the thesis requirement for
More informationPerformance Evaluation of AODV and DSR routing protocols in MANET
Performance Evaluation of AODV and DSR routing protocols in MANET Naresh Dobhal Diwakar Mourya ABSTRACT MANETs are wireless temporary adhoc networks that are being setup with no prior infrastructure and
More informationWireless Networking & Mobile Computing
Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Network Layer: Ad Hoc Routing Tamer Nadeem Dept. of Computer Science The OSI Communication Model Page 2 Spring 2012 CS 752/852 - Wireless
More informationAnalysis QoS Parameters for Mobile Ad-Hoc Network Routing Protocols: Under Group Mobility Model
2009 International Conference on Computer Engineering and Applications IPCSIT vol.2 (2011) (2011) IACSIT Press, Singapore Analysis QoS Parameters for Mobile Ad-Hoc Network Routing Protocols: Under Group
More informationRouting 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 informationKeywords: 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 informationPRO-ACTIVE ROUTE MAINTENANCE IN DSR. Liang Qin. Master of Science
PRO-ACTIVE ROUTE MAINTENANCE IN DSR by Liang Qin A thesis submitted to the Faculty of Graduate Studies in partial fulfillment of the requirement for the degree of Master of Science Ottawa-Carleton Institute
More informationA Study on Routing Protocols for Mobile Adhoc Networks
A Study on Routing Protocols for Mobile Adhoc Networks R.Logambal 1, Dr.K.Chitra 2 Research Scholar, Dept of Computer Science, Bharathiar University, Coimbatore, India 1 Asst. Professor, Govt Arts College,
More informationRouting 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 informationMobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1
Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Oxford University Press 2007. All rights reserved. 1 Ad-hoc networks deployment For routing, target detection,
More informationArchitecture 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 information6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET)
INTERNATIONAL International Journal of Computer JOURNAL Engineering OF COMPUTER and Technology ENGINEERING (IJCET), ISSN 0976- & TECHNOLOGY (IJCET) ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4,
More informationA 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 informationFairness Example: high priority for nearby stations Optimality Efficiency overhead
Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency
More information[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 informationLocation Prediction Based Routing Protocol for Mobile Ad hoc Networks
Location Prediction Based Routing Protocol for Mobile Ad hoc Networks Natarajan Meghanathan Department of Computer Science Jackson State University Jackson, MS 39217, USA Email: nmeghanathan@jsums.edu
More informationTable of Contents. 1. Introduction. 2. Geographic Routing. 2.1 Routing Mechanisms. 2.2 Destination Location. 2.3 Location Inaccuracy. 3.
Geographic Protocols in Sensor Networks Karim Seada, Ahmed Helmy Electrical Engineering Department, University of Southern California {seada, helmy}@usc.edu Table of Contents 1. Introduction 2. Geographic
More informationCS551 Ad-hoc Routing
CS551 Ad-hoc Routing Bill Cheng http://merlot.usc.edu/cs551-f12 1 Mobile Routing Alternatives Why not just assume a base station? good for many cases, but not some (military, disaster recovery, sensor
More informationII. CLASSIFICATION OF ROUTING PROTOCOLS MANET routing protocols are classified into three major categories: proactive, reactive and hybrid.
A COMPLETE STUDY ON POWER AWARE ROUTING PROTOCOL FOR MOBILE ADHOC NETWORK A. Kumaravel 1, Dr. M.Chandrasekaran 2 1 (Electronics and Communication Engineering, Paavai Engineering College,India) 2 (Electronics
More informationMobile & Wireless Networking. Lecture 10: Mobile Transport Layer & Ad Hoc Networks. [Schiller, Section 8.3 & Section 9] [Reader, Part 8]
192620010 Mobile & Wireless Networking Lecture 10: Mobile Transport Layer & Ad Hoc Networks [Schiller, Section 8.3 & Section 9] [Reader, Part 8] Geert Heijenk Outline of Lecture 10 Mobile transport layer
More informationPage 1 EEC173B/ECS152C. Link State Routing [Huitema95] Optimized Link State Routing (OLSR) MANET Unicast Routing. Proactive Protocols
173/S152 Proactive Protocols MNT Unicast Routing Proactive Protocols OLSR SV ybrid Protocols Most of the schemes discussed so far are reactive Proactive schemes based on distance vector and link state
More informationExperiment 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 informationPerformance 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 informationREVIEW 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 informationDynamic Route Switching Protocol in Mobile Ad Hoc Networks
Dynamic Route Switching Protocol in Mobile Ad Hoc Networks Abstract Due to limited bandwidth, how to decrease routing overhead is an important issue in mobile ad hoc networks. Several multipath routing
More informationA Proposed Routing Protocol for MANET
International Journal of Engineering & Technology IJET-IJENS Vol: 11 No: 02 101 A Proposed Routing Protocol for MANET Mamoun Hussein Mamoun Faculty of Computer and Information Sciences Mansoura University,
More informationImpact 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 informationLecture 16: Wireless Networks
&6( *UDGXDWH1HWZRUNLQJ :LQWHU Lecture 16: Wireless Networks Geoffrey M. Voelker :LUHOHVV1HWZRUNLQJ Many topics in wireless networking Transport optimizations, ad hoc routing, MAC algorithms, QoS, mobility,
More informationComparative Analysis of Throughput and Dropped rate for Location-Aided Routing Protocol
Comparative Analysis of Throughput and Dropped rate for Location-Aided Routing Protocol Neelima Parsendia, Amit Sinhal Dept. of I.T., Technocrats Institute of Technology, Bhopal Abstract A wireless LAN
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob
More informationMANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols.
MANET TECHNOLOGY Dharna 1, Varsha Saroha 2, R. B. Dubey 3 1,2,3 Department of Electronics and Communication Engineering, Hindu College of Engineering, Sonepat, Haryana,(India) ABSTRACT Wireless technology
More informationRouting protocols in WSN
Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationPacket 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 informationDynamic Source Routing in ad hoc wireless networks
Dynamic Source Routing in ad hoc wireless networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University In Mobile Computing, vol. 353, chapter 5, T. Imielinski and H.
More informationBehaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model
Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Deepak Agrawal, Brajesh Patel Department of CSE Shri Ram Institute of Technology Jabalpur,
More informationOptimized 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 informationUNICAST ROUTING TECHNIQUES FOR MOBILE AD-HOC NETWORKS
1 UNICAST ROUTING TECHNIQUES FOR MOBILE AD-HOC NETWORKS ROBERTO BERALDI, ROBERTO BALDONI Dipartimento di Informatica e Sistemistica Universita' di Roma "La Sapienza" Via Salaria 113, Roma, Italy {beraldi,
More informationDesign and Implementation of Fisheye Routing Protocol for Mobile Ad Hoc Networks
Design and Implementation of Fisheye Routing Protocol for Mobile Ad Hoc Networks by Allen C. Sun Submitted to the Department of Electrical and Computer Science in Partial Fulfillment of the Requirements
More informationSurvey of Routing Protocols for Mobile Ad-hoc Network
Survey of Routing Protocols for Mobile Ad-hoc Network Humayun Bakht Taitec College Manchester, United Kingdom ABSTRACT Routing is a challenging issue in mobile ad-hoc network. Concerning routing various
More informationSignal Stability based Adaptive Routing (SSA) for. Ad-Hoc Mobile Networks. Rohit Dube Cynthia D. Rais Kuang-Yeh Wang Satish K.
Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks Rohit Dube Cynthia D. Rais Kuang-Yeh Wang Satish K. Tripathi Institute for Advanced Computer Studies Mobile Computing and Multimedia
More informationRelative Performance Analysis of Reactive (on-demand-driven) Routing Protocols
Relative Performance Analysis of Reactive (on-demand-driven) Routing Protocols Mukesh Kumar Garg, Dr. Ela Kumar Abstract A Mobile Ad Hoc Network (MANET) is a group of wireless mobile computers (or nodes);
More informationA 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 informationComputation 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 informationMobile Ad Hoc Networks
Mobile Ad Hoc Networks Tutorial at CIT 2000 Bhubaneshwar, Dec 20 23 Sridhar Iyer IIT Bombay http://www.it.iitb.ernet.in.in/~sri sri@it.iitb.ernet.in Acknowledgements Many figures, slides and reference
More informationReferences. Forwarding. Introduction...
References Routing Protocols H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor
More informationChapter 11 Chapter 6
Routing Protocols References H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor
More informationA Comparative Study of Routing Protocols for Mobile Ad-Hoc Networks
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. 11, November 2014,
More informationEvaluating 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 informationRedes Inalámbricas Tema 4. Mobile Ad Hoc Networks
Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments
More informationSurvey of Stability Based Routing Protocols in Mobile Ad-hoc Networks
Survey of Stability Based Routing Protocols in Mobile Ad-hoc Networks Mandeep Kaur Gulati 1 and Krishan Kumar 2 1 Punjab Technical University, PTU, Kapurthala, Punjab, India 2 Department of Computer Science
More informationAn Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks
An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks Tejomayee Nath #1 & Suneeta Mohanty *2 # School of Computer Engineering, KIIT University Bhubaneswar,, India Abstract
More informationPerformance 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 informationMr. Pradip A. Chougule 1, Mr. Rajesh A. Sanadi 2, Mr. U. H.Kamble 3
IOSR Journal of Computer Engineering (IOSR-JCE) ISSN: 2278-0661, ISBN: 2278-8727, PP: 01-05 www.iosrjournals.org COMPARATIVE STUDY OF TABLE DRIVEN ROUTING PROTOCOLS IN AD HOC WIRELESS NETWORKS Mr. Pradip
More informationEnergy and Power Aware Stable Routing Strategy for Ad hoc Wireless Networks based on DSR
Energy and Power Aware Stable Routing Strategy for Ad hoc Wireless Networks based on Mr. Nirav Bhatt, Dr. Dhaval Kathiriya Reaserch Scholar, School of Computer Science, RK University, Rajkot Director IT,
More informationA Highly Effective and Efficient Route Discovery & Maintenance in DSR
A Highly Effective and Efficient Route Discovery & Maintenance in DSR Shiva Prakash 1, Rajeev Kumar 2, Brijesh Nayak 3, Manindar Kumar Yadav 4 Department of Computer Science and Engineering, Madan Mohan
More informationMobile Ad-Hoc Networks & Routing Algorithms
Mobile Ad-Hoc Networks & Routing Algorithms EMMANOUIL G. SPANAKIS, PhD. spanakis@csd.uoc.gr COLLABORATING RESEARCHER, COMPUTATIONAL BIOMEDICINE LABORATORY, FORTH-ICS VISITING LECTURER, COMPUTER SCIENCE
More informationA Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
A Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks Gunyoung Koh, Duyoung Oh 1 and Heekyoung Woo 2 1 School of Electrical Engineering and Computer Science Seoul National University,
More informationAnalytical Performance Comparison of Different Routing Protocols in Mobile Ad hoc Wireless Networks
76 Analytical Performance Comparison of Different Routing Protocols in Mobile Ad hoc Wireless Networks 1 Ravi Garg, 2 Amit Kumar, 3 Manvendra Partap Singh 1 Assistant Professor, Ganga Institute of Technology
More informationPerformance Analysis and Enhancement of Routing Protocol in Manet
Vol.2, Issue.2, Mar-Apr 2012 pp-323-328 ISSN: 2249-6645 Performance Analysis and Enhancement of Routing Protocol in Manet Jaya Jacob*, V.Seethalakshmi** *II MECS, Sri Shakthi Institute of Engineering and
More informationCS 229 Final Report: Location Based Adaptive Routing Protocol(LBAR) using Reinforcement Learning
CS 229 Final Report: Location Based Adaptive Routing Protocol(LBAR) using Reinforcement Learning By: Eunjoon Cho and Kevin Wong Abstract In this paper we present an algorithm for a location based adaptive
More informationPERFORMANCE EVALUATION OF TCP OVER ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
PERFORMANCE EVALUATION OF TCP OVER ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS Md. Abdullah-Al-Mamun, M. Mahbubur Rahman Department of Information and Communication Engineering Islamic University Kushtia
More informationKeywords: - MANETs, Unicast, Network, Classification, Routing
Volume 5, Issue 2, February 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Classification
More informationPERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS
PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS AMANDEEP University College of Engineering, Punjabi University Patiala, Punjab, India amandeep8848@gmail.com GURMEET KAUR University College of Engineering,
More informationPerformance 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