Advanced Network Approaches for Wireless Environment
|
|
- Hilary Goodwin
- 5 years ago
- Views:
Transcription
1 Advanced Network Approaches for Wireless Environment Branislav JARÁBEK Slovak University of Technology Faculty of Informatics and Information Technologies Ilkovičova 3, Bratislava, Slovakia Abstract. An ad-hoc network is a special kind of network, where all of the nodes move in time. So the topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring, because of the concept of no stable infrastructure takes a place. There are two different research areas according to wireless networks: Networking for Pervasive Computing, and Wireless Ad-Hoc Networks. This paper focuses on a Service Discovery problematic from the first area describes existing discovery protocols as JINI, UPnP, etc. and routing algorithms in MANETs from the network point of view, which are now-a-days as experimental internet RFCs. 1 Introduction Wireless networks in today meaning are usually set up with a centralized access point for each area of connectivity. The access point has knowledge of all devices in its area and routing to them is done in a table driven manner. Following the trend of mobility, it becomes important to give users the possibility of finding service they need anywhere in the network. Users would like to obtain access to services automatically, without reconfiguring their system. Especially with mobile devices dynamic discovery of services in other than home or corporate network and automatic network configuration will be very useful. An ad-hoc network is a special kind of network, where all of the nodes move in time. So the topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring, because of the concept of no Supervisor: doc. Ing. Margaréta Kotočová, PhD., Institute of Computer Systems and Networks, Faculty of Informatics and Information Technologies STU in Bratislava M. Bieliková (Ed.), IIT.SRC 2005, April 27, 2005, pp
2 Advanced Network Approaches for Wireless Environment 109 stable infrastructure takes a place. Each node in the network must be able to take care of routing of the data and this is the domain of ad-hoc routing. So the concept of centralized network with pre-defined central routing tables could be applied only with difficulties or with the loss of the advantage of on-the-fly nodes changing. There are two different research areas according to described problems in wireless networks [1]. First is Service Discovery Algorithms, which focuses on service propagation and discovery. Second research area is Mobile Ad-Hoc Network, which maintains design, prototype and evaluates protocols and algorithms to facilitate adoption and use of wireless ad-hoc networks for appropriately selected application areas and facilitate development of standards for such networks. 2 Service discovery Future software services and automated devices will exist in large numbers and will operate in a networked world where they can never be quite sure about the connectivity available, about the other services and devices nearby, or about the state of the network neighborhood a few minutes in the future. In such uncertain environments, individual components will need to discover and maintain awareness of their surroundings and to configure and adapt themselves in response to changing situations. The beginnings of the necessary capabilities for service discovery have emerged over the past few years in the form of service and device discovery protocols, such as Jini Networking Technology, Universal Plug-and-Play, (UPnP) the Service Location Protocol (SLP), Bluetooth service discovery, the Salutation Consortium protocol suite. Despite differences, all of these initiatives aim to allow small collections of commercial devices and services to auto-configure, to cooperate, and to adapt to changes. 2.1 Service Location Protocol (SLP) The Service Location Protocol is developed by the IETF working group called SvrLoc [2]. Focus of this group is to design a vendor-independent standard based on TCP/IP network. SLP architecture consists of three main components: Service Agents are service careers, takes a place somewhere in the area (location), which is advertised with service characteristics. User Agents are client applications, which use services, so they are service discoverers. Directory Agents are collectors of information received from Service Agents and they responds to User Agents on their queries. They could also create different groups of services and service agents and categorize them. The concept is very simple. Each new service must register its service to the Directory Agent. When a user wants a certain service, the User Agent asks Directory Agent for available services in the network. Directory Agent sends appropriate addresses and characteristics and user could select and use one. The main goal before this concept could be reliable is how to find a Directory Agent. There are three different methods defined: static SLP agent obtains an
3 110 Branislav Jarábek address to Discovery Agent via DHCP while connecting into the network, active User and Service Agents request to the multicast group and listening Directory Agent replies directly via unicast, passive Directory Agent periodically sends multicast advertisements and User and Service Agents listen to them, and after receiving that multicast are able to communicate via unicast. There is also a concept, which omits Directory Agent. If there is no DA (for example small home networks) UA repeatedly send multicast requests for a service until one or more listening SAs send out their response via unicast. 2.2 JINI Jini technology [3] is based on the Java language. Jini creates an issue of how devices connect with each other in order to form a simple ad-hoc network (a Jini community ) and how these devices provide services to other devices in this network. Jini consists of architecture and programming model. Each Jini device must have running a Java Virtual Machine. The architecture principles are similar to that of SLP. Devices and applications register within Jini network through a Discovery and Join process. Application also places itself into the Lookup Table on a lookup server (always needed). Besides pointers stores Lookup Table also Java-based program code for these services. This means that services may upload device drivers, an interface, and other programs that help user to access the service. When client wants to utilize the service, the object code is downloaded from the Lookup Table to the JVM of the client. This code mobility replaces the necessity of pre-installing drivers on the client. 2.3 Bluetooth SDP Bluetooth is technology created for wireless short range transmission. Bluetooth protocol stack contains also a definition of the Service Discovery Protocol (SDP). This protocol is designed to categorize and to advertise the services provided by each node. But only advertise. It is specifically developed for this short range environment. Discovering could be done via searching for service by service attributes, searching for services by service type and browsing without any service characteristics. SDP does not cover accessing services. Any other mechanism as selection and accessing are out of scope of SDP. But there are co-existence patterns with other service discovery protocols, but it does not require them. 2.4 UPnP UPnP Device Architecture [4] is more than just simple extension of the plug and play peripheral model. Universal means that no device drivers are needed common protocols are used instead. UPnP devices can be implemented using any programming language.
4 Advanced Network Approaches for Wireless Environment 111 Each device must have a DHCP client to connect to the network and obtain appropriate address. Then five steps take care about device and service handling: 1. Discovery discovery protocol (Simple Service Discovery Protocol SSDP) allows device to advertise its service to control points on the network. Similarly, when a control point is added to the network, the UPnP discovery protocol allows that control point to search for devices of interest. 2. Description has two parts: device and service description. Device description contains vendor specific information. For each service included, the device description lists the service type, name, and other access URLs. Service description includes a list of actions with parameters, the service responds to, and also list of variables of the state of the service. 3. Control a control point can ask services to invoke actions and receive responses. To do this, a control point sends a suitable control message to the control URL. In response, the service returns any results or errors from the action. Action could change state of the variables that describe internal state events are published to all interested control points (see eventing). 4. Eventing uses standard publisher-subscriber model. 5. Presentation retrieving it is a simple HTTP-based process. 3 Mobile Ad-Hoc Networks (MANETs) There are plenty of routing algorithms suitable for ad-hoc networking problems. Conventional approaches to routing like link state or distance vector are well tested. But the main problem is that they are made for a network with static topology. They will be working well for MANETs with low dynamic parameters, but they could be devastating for larger MANETs because of their dependency on periodicity of control messages and potential large number of destination hosts (network nodes). Due to mobile devices resources (battery power, bandwidth, CPU for example PDAs) and wireless environment constraints (e.g. not bi-directional) both link-state and distance vector wastes resources trying to maintain routes to all reachable destinations and must be modified to achieve new performance issues. [5, 6]. MANET IETF working group will develop two standard track routing protocols for: Reactive MANET Protocol (RMP) and Proactive MANET Protocol (PMP). From the most common candidates for reactive protocols DSR (Dynamic Source Routing) and AODV (Ad-hoc On-demand Distance Vector, experimental RFC) routing and from proactive approach OLSR (Optimized Link State Routing) and Topology Broadcast (Dissemination) based on Reverse Path Forwarding (RFC Draft) are described below. Reactive Ad-Hoc Routing Algorithms use on-demand routing, so the routes are only requested when they are needed. This approach stores only active routes in memory and does not waste bandwidth maintaining information about unused routes.
5 112 Branislav Jarábek Main disadvantage is the latency before first packet is sent caused by the route discovery. Proactive Ad-Hoc Routing Algorithms (table-driven) maintain routes to all nodes in the network, so they heavily rely according to tables. Difference to reactive is that there is no need to construct new route before transmitting but only fetch the next hop node from routing table. 3.1 Dynamic Source Routing (DSR) Main concepts of DSR [7] are route discovery, route caching and route maintenance. Routing by this method means that the path is discovered. The first data (this means that no data has been sent to that destination before) initialize the route discovery from the source to the destination. Route discovery: Can be done in two ways active or passive. A source node can flood the network with a route request (RREQ) for a node it needs a route to. Its neighbors propagate this RREQ in the same manner until it reaches the destination node or a node that already has a route to the destination. Each hop of the RREQ is recorder within the RREQ message. The second way for a node to discover a route is by caching RREPs that it happens to pass on or overhear from other nodes. Route caching: Upon arrival of the RREQ at the destination node or at a node that already has a route for the destination, the inverse route is cached. In the case of a node that already has a route, the existing route is appended. A route reply (RREP) is then sent back the same way the RREQ traveled. The RREP contains a list of all the intermediate nodes between source and destination. On the way back, the RREP is cached by all intermediate nodes it passes on the way. When the RREP reaches back to the source, the source can send the data and cache the new route for future use. Route maintenance: Whenever a node discovers that the link to one of its neighbor nodes has failed, it will send a route error (RERR) packet to the source of any cached routes that use the failed link. This RERR will propagate through all intermediate nodes that also have cached this route. Upon receipt of a RERR a node will update their caches accordingly and purge the now failed route. In the case of nodes using promiscuous listening, the node should note that all RERRs might not be heard (the node may have moved) and the route should be treated differently than route where the node is an intermediate node. 3.2 Ad-hoc On-demand Distance Vector Routing (AODV) As the name applies, this protocol adds specific on-demand modification to the distance vector routing algorithm [8]. The reason to this is to acquire low bandwidth cost as DSR has with lower time to discover a route. The idea behind is to use only local broadcast and also modified discovery algorithm. In route discovery AODV uses RREQ packets as DSR in the same meaning packet is broadcasted into the network. The difference is that the hosts on the way of RREQ packet to the destination maintain back pointers from where they received the
6 Advanced Network Approaches for Wireless Environment 113 packet. This creates reverse path from the destination to the source. When the packet reaches the destination (or a host whit path to the destination), the destination sends a RREP packed back, which validates reverse path and sets up the forward path. All hosts, which maintain back pointers and do not receive RREP packet in specified time, will de-allocate the pointer. This approach guarantees that the only one route is in use. So this is the difference to DSR algorithm first builds up a tree of possible paths from source to destination and then validates only one of these routes. The only one shortest path can be selected when intermediate nodes uses the sequence numbers of the RREQ and RREP packets (in opposite to DSR which can multiple routes). So this algorithm is better to use in larger networks (path is not stored in packets, only one route from the tree of paths is used). Route maintenance: If the source node moves, nodes on the path will send a special RREP. If next node fails to communicate, the node will send information upstream the path (RREP failure packet). All nodes will remove appropriate information from their route caches. Local connectivity management: AODV uses local HELLO messages which transmit to the immediate neighbors. These messages detect link failures in active routes as described before. 3.3 The Optimized Link State Routing Protocol (OLSR) OLSR [9] is an optimization of a link state protocol for mobile ad-hoc networks. OLSR uses Multipoint relays (MPRs) and MPR Selectors to reduce the bandwidth cost of maintaining routes by limiting the broadcast of link-state updates. So each node selects a subset of its neighbors, as MPRs and these nodes are the only ones that forward packets from this node. The MPRs record that another node has selected it as MPR so node is MPR Selector for MPRs. OLSR uses local broadcast of HELLO messages, which are no forwarded more than one hop so nodes maintain bi-directional links. Each HELLO message contains a list of neighbors, which this node has received a HELLO message from. This is recorded in a neighbor-table with sequence numbers. If a node receives HELLO messages from all of its neighbors, it has knowledge of all nodes in the distance of two hops. The MPR set should be smaller than the set of neighbors, to take advantage of relaying through another host. The MPR set is included in HELLO messages, so the nodes, which take this node as MPR, know to which nodes is this node MPR Selector. The MPR set is recomputed whenever the link to the neighbor node goes down or a new node is added. For calculating the routing table OLSR uses a Topology Control message. This packet is broadcast to all nodes of the network, using MPRs and contains the nodes for which source node is MPR Selector. These packets can be used by the node as the list of last-hop nodes for destination node and are stored in topology table with a sequence number. Constructing of the route table begins with appending of entries of topology table (node, last-hop node) starting from each destination in the network and followed until a node in neighborhood is the last-hop node. So the complete routing table of the
7 114 Branislav Jarábek network is created and only optimal routes with minimal hop are chosen. When any of the entries in topology or neighbor table change, the routing table has to be recalculated. 3.4 Topology Broadcast (Dissemination) based on Reverse Path Forwarding (TBRPF) TBRPF [10] is pro-active link-state routing protocol based on existing reverse path forwarding algorithms. It has two modes of operation and two main system functions: discovery and routing. The operating modes Full Topology (TBRPF-FT) and Partial Topology (TBRPF- PT) are different in amount of information each node has. As name implies in full topology mode each node has knowledge of all links in network. In partial topology mode, a node has enough knowledge to compute minimal route (min. hop distance) to any other node. Each topology has its advantage in other network: FT mode is suitable in open networks with high scattering and PT mode is better for use in dense networks where the amount of routing information is high and all the information is not needed. Like OLSR, TBRPF sends a Hello message to first-hop neighbors. But the message differs TBRPF sends out only Ids of new and lost neighbors in Hello message, not the complete set. A new node is node that has been recently seen, but two-way link has not been established. A two-way link is in the meaning when the new node responds with a HELLO and receives an update request. This brings decreasing of control data, which is sent over network, and increased frequency of messages could minimize convergence time. Topology update and routing function: Each node keeps a source tree of links, which determines the network topology. A link (a, b) is in the source tree of a node if it is reported by the next hop parent node to be the shortest path to a. The source tree is the basis for a node's reportable sub tree. The report from node b to node a include b's links to all its neighbors and the branch of its source tree rooted at the node that b is the next hop of for a to reach. In FT and PT mode forwarding of update messages is done only for link, which does not contain a leaf node. PT also restricts forwarding so only changes of source tree of the node are reported. In this approach each node creates its source tree and computes route to the destination by computing the minimal-hop path. TBRPF also uses aggregation of control messages to minimalize the total amount of messages sent. 4 Conclusions This paper has cleared research in two major areas of wireless networking of today. The focus has been given to the new service oriented view on the computer network and also routing standards has been considered. Regarding the mobile device s reduced power supply, the radio transmission have to be as low as possible. So on-demand
8 Advanced Network Approaches for Wireless Environment 115 (reactive) protocols have been introduced in opposition to proactive, as they do not need constant topology updates. It will be possible to aim next work to couple routing techniques with basic discovery services (as simple as for example Bluetooth SDP has) in small networks and measure performance against severity of routing and discovering separately. Acknowledgement: This work has been supported by the Grant Agency of Slovak Republic grant No. VG1/0157/03. References 1. The Advanced Network Technologies Division of National Institute of Standards and Technology, 2. Service Location Protocol, RFC 2165, June 1997, 3. AR-Jini Architecture Specification, Sun Microsystems, January 2005, 4. UPnP Device Architecture version 1.0, Jun 2000, 5. Larson, T., Hedman, N.: Routing protocols in Wireless Ad-Hoc Networks A Simulation Study (Master Thesis), Lulea Tekniska Universitet, ISSN: , Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations, RFC 2501, January 2001, 7. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR), RFC Draft, July 2004, 8. Ad hoc On-Demand Distance Vector (AODV) Routing, RFC 3561, July 2003, 9. Optimized Link State Routing Protocol (OLSR), RFC 3626, October 2003, Topology Dissemination Based on Reverse-Path Forwarding (TBRPF), RFC 3684, February 2004,
2013, IJARCSSE All Rights Reserved Page 85
Volume 3, Issue 12, December 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Overview of
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 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 informationMobile Communications. Ad-hoc and Mesh Networks
Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between
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 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 informationSimulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Abstract Keywords:
Volume-9 Number-1 Jan -June 2017 pp. 16-21 available online at www.csjournalss.com Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Sachin Lalar, Arun Kumar Yadav
More informationMANET is considered a collection of wireless mobile nodes that are capable of communicating with each other. Research Article 2014
Throughput Analysis of Proactive and Reactive MANET Routing Protocols Kiranveer Kaur 1 Surinderjit Kaur 2 Vikramjit Singh 3 Department of Computer Science, University College of Engineering, Department
More informationAd Hoc Networks: Issues and Routing
Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/
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 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 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 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 informationOutline. CS5984 Mobile Computing. Taxonomy of Routing Protocols AODV 1/2. Dr. Ayman Abdel-Hamid. Routing Protocols in MANETs Part I
CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part I Outline Routing Protocols for Ad hoc Networks Example of a reactive routing protocol AODV: Ad hoc On-demand
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 informationPerformance Analysis of MANET Routing Protocols OLSR and AODV
VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz
More informationA Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network
ShriRam College of Engineering & Management 1 A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network M.Ramaiya Rohit Gupta Rachit Jain Head,Dept. Computer Science Dept. Computer
More informationQoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET
2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar
More 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 informationQoS Routing in Ad-hoc Networks
QoS Routing in Ad-hoc Networks Seminar Presentation for Advanced Topics in Broadband Networks Nirmal Mahadevan Balasubramanyam Guruprasad Sudharsan Srinivasan Outline QoS Parameters of QoS Challenges,
More informationSimulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol
Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol V.S.Chaudhari 1, Prof.P.N.Matte 2, Prof. V.P.Bhope 3 Department of E&TC, Raisoni College of Engineering, Ahmednagar Abstract:-
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 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 informationINTERNATIONAL JOURNAL FOR ADVANCE RESEARCH IN ENGINEERING AND TECHNOLOGY WINGS TO YOUR THOUGHTS..
INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH An Overview of Mobile Ad-Hoc Networks: Architecture, Routing and Challenges Avadhesh Kumar 1 Sonali Yadav 2 Kamalesh Chandra Maurya 3 1 Assistant Professor, avadhesh@iul.ac.in
More informationAd-hoc and Infrastructured Networks Interconnection
tel. 22 209 4000 fax 22 209 4050 e-mail www@inescporto.pt internet Ad-hoc and Infrastructured Networks Interconnection Tânia Pinto Calçada and Manuel Ricardo RTCM Aveiro 18th February 2005 INESC Porto
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 informationPerformance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV
MIT International Journal of Electrical and Instrumentation Engineering, Vol. 3, No. 2, August 2013, pp. 57 61 57 Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through
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 informationPerformance Evaluation of AODV DSDV and OLSR Routing Protocols with Varying FTP Connections in MANET
Performance Evaluation of AODV DSDV and OLSR Protocols with Varying FTP Connections in MANET Alok Upadhyay, Rupali Phatak Research Scholar, Asst. Professor -Department of Electronics & Communication Engineering
More informationDistributed Systems 26. Mobile Ad Hoc Mesh Networks
Distributed Systems 26. Mobile Ad Hoc Mesh Networks Paul Krzyzanowski pxk@cs.rutgers.edu 12/16/2011 1 Mesh Networks Mobile Ad-hoc networks, sensor networks, Decentralized networking No need for routers
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 informationPerformance evaluation of reactive and proactive routing protocol in IEEE ad hoc network
Author manuscript, published in "ITCom 6 - next generation and sensor networks, Boston : United States (26)" DOI :.7/2.68625 Performance evaluation of reactive and proactive routing protocol in IEEE 82.
More informationName Resolution and Service Discovery on the Internet and in Ad Hoc Networks
Chapter 8 Name Resolution and Service Discovery on the Internet and in Ad Hoc Networks Paal E. Engelstad and Geir Egeland CONTENTS Name Resolution... 172 An Architecture for Naming Services... 173 A Generic
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 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 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 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 informationThe Performance Evaluation of AODV & DSR (On-Demand. emand- Driven) Routing Protocols using QualNet 5.0 Simulator
IJCSN International Journal of Computer Science and Network, Vol 2, Issue 2, April 2013 29 The Performance Evaluation of AODV & DSR (On-Demand ( emand- Driven) Routing Protocols using QualNet 5.0 Simulator
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 informationGurleen Kaur Walia 1, Charanjit Singh 2
Simulation based Performance Evaluation and Comparison of Proactive and Reactive Routing Protocols in Mobile Ad-hoc Networks Gurleen Kaur Walia 1, Charanjit Singh 2 1,2 UCoE Department, Punjabi University,
More informationA COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE
Journal of Engineering Science and Technology Vol. 4, No. 2 (2009) 132-141 School of Engineering, Taylor s University College A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE 802.11 AND IEEE
More informationA Survey on Path Weight Based routing Over Wireless Mesh Networks
A Survey on Path Weight Based routing Over Wireless Mesh Networks Ankush Sharma Assistant Professor, Dept. Of C.S.E, Chandigarh University Gharuan, India Anuj Gupta Head C.S.E and M.C.A Dept, RIMT Mandi
More informationImpact of Link Discovery Delay on Optimized Link State Routing Protocol for Mobile ad hoc Networks
Impact of Link Discovery Delay on Optimized Link State Routing Protocol for Mobile ad hoc Networks Akhila Kondai Problem Report submitted to the Benjamin M. Statler College of Engineering and Mineral Resources
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 informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK COMPARISON OF MANET REACTIVE ROUTING PROTOCOLS USING OPNET SIMULATOR SANGEETA MONGA
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 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 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 informationMobile Ad-hoc Networks
Mobile Ad-hoc Networks Fred Baker 1 The manet problem Mobile Random and perhaps constantly changing Ad-hoc Not engineered Networks Elastic data applications which use networks to communicate 2 Examples
More informationPNR: New Position based Routing Algorithm for Mobile Ad Hoc Networks
PNR: New Position based Routing Algorithm for Mobile Ad Hoc Networks Hossein Ashtiani, Shahpour Alirezaee, seyed mohsen mir hosseini, HamidKhosravi Abstract An ad hoc network (MANET) has no fixed networking
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 informationRouting protocols in Mobile Ad Hoc Network
Routing protocols in Mobile Ad Hoc Network Presented By :- Nitesh Jain Date:-26/10/2005 SCHOOL OF INFORMATION TECHNOLOGY INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR KHARAGPUR Types of Wireless Networks Infrastructure
More informationANALYSIS OF DIFFERENT REACTIVE, PROACTIVE & HYBRID ROUTING PROTOCOLS: A REVIEW
ANALYSIS OF DIFFERENT REACTIVE, PROACTIVE & HYBRID ROUTING PROTOCOLS: A REVIEW Kirandeep Kaur 1, Mr.Pawan Luthra 2, Er.Gagandeep 3 1 Department of Computer Science and Engineering, Shaheed Bhagat Singh
More informationInvestigation on OLSR Routing Protocol Efficiency
Investigation on OLSR Routing Protocol Efficiency JIRI HOSEK 1, KAROL MOLNAR 2 Department of Telecommunications Faculty of Electrical Engineering and Communication, Brno University of Technology Purkynova
More informationMobile Ad Hoc Networking Working Group
Mobile Ad Hoc Networking Working Group Ryuji Wakikawa INTERNET DRAFT Keio University 23 Oct 2003 Jari T. Malinen Charles E. Perkins Nokia Research Center Anders Nilsson University of Lund Antti J. Tuominen
More informationPerformance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols
www.ijcsi.org 551 Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols Kashif Ibrahim Qazi Javed Ahmed Abdul Qudoos Mirza Aamir Mehmood Department of Computer Science, Balochistan
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 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 informationPerformance Analysis of Aodv Protocol under Black Hole Attack
International Journal of Scientific & Engineering Research Volume 2, Issue 8,August-2011 1 Performance Analysis of Aodv Protocol under Black Hole Attack Monika Roopak, Dr. Bvr Reddy ABSTRACT- Mobile Ad-hoc
More informationPerformance Comparison of DSDV, AODV, DSR, Routing protocols for MANETs
2012 International Conference on Computer Networks and Communication Systems (CNCS 2012) IPCSIT vol.35(2012) (2012) IACSIT Press, Singapore Performance Comparison of DSDV, AODV, DSR, Routing protocols
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 informationROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS
ROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS Ganga S 1, Binu Chandran R 2 1, 2 Mohandas College Of Engineering And Technology Abstract: Wireless Ad-Hoc Network is a collection of wireless mobile
More informationIntroduction to Mobile Ad hoc Networks (MANETs)
Introduction to Mobile Ad hoc Networks (MANETs) 1 Overview of Ad hoc Network Communication between various devices makes it possible to provide unique and innovative services. Although this inter-device
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 informationImpact of Hello Interval on Performance of AODV Protocol
Impact of Hello Interval on Performance of AODV Nisha Bhanushali Priyanka Thakkar Prasanna Shete ABSTRACT The multi-hop ad hoc networks are self organizing networks with dynamic topology. The reactive
More informationMobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV
Journal of Computer Science 8 (1): 13-17, 2012 ISSN 1549-3636 2011 Science Publications Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV 1 S. Deepa and 2 G.M. Kadhar
More informationMobile Ad-hoc and Sensor Networks Lesson 05 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2
Mobile Ad-hoc and Sensor Networks Lesson 05 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2 Oxford University Press 2007. All rights reserved. 1 Temporally ordered routing algorithm (TORA) A reactive
More informationFigure 1: Ad-Hoc routing protocols.
Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks Sukhchandan Lally and Ljiljana Trajković Simon Fraser University Vancouver, British Columbia Canada E-mail: {lally, ljilja}@sfu.ca
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 informationEstimate the Routing Protocols for Internet of Things
Estimate the Routing Protocols for Internet of Things 1 Manjushree G, 2 Jayanthi M.G 1,2 Dept. of Computer Network and Engineering Cambridge Institute of Technology Bangalore, India Abstract Internet of
More informationA New Approach for Energy Efficient Routing in MANETs Using Multi Objective Genetic Algorithm
A New Approach for Energy Efficient in MANETs Using Multi Objective Genetic Algorithm Neha Agarwal, Neeraj Manglani Abstract Mobile ad hoc networks (MANET) are selfcreating networks They contain short
More informationAppointed BrOadcast (ABO): Reducing Routing Overhead in. IEEE Mobile Ad Hoc Networks
Appointed BrOadcast (ABO): Reducing Routing Overhead in IEEE 802.11 Mobile Ad Hoc Networks Chun-Yen Hsu and Shun-Te Wang Computer Network Lab., Department of Electronic Engineering National Taiwan University
More informationAd 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 informationA Comparative Study between AODV and DSDV Routing Protocols in Mobile Ad Hoc Networks using Network Simulator NS2
A Comparative Study between AODV and DSDV Routing Protocols in Mobile Ad Hoc Networks using Network Simulator NS2 Marwan Aziz Mohammed Dept. of Software Engineering Faculty of Engineering, Koya University,
More informationGateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario
Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario K.Gautham 1, Nagajothi A 2 Student, Computer Science and Engineering,
More informationModeling and Performance Evaluation of MANET Handover
Ph.D. in Electronic and Computer Engineering Dept. of Electrical and Electronic Modeling and Performance Evaluation of MANET Handover Ing. Bernardo Leal Advisor: Dott. Ing. Luigi ATZORI Curriculum: ING-INF/03
More informationA Quick Guide to AODV Routing
Luke Klein-Berndt Wireless Communications Technologies Group National Institute of Standards and Technology AODV is a method of routing messages between mobile computers. It allows these mobile computers,
More informationComparative Study of Routing Protocols in MANET
Comparative Study of Routing Protocols in MANET First Author-PrernaYadav 1 Student,Second Author-ShubhraSaxena 2 Professor Abstract-An ad hoc network is basically a collection of wireless nodes not having
More informationBanwari, Deepanshu Sharma, Deepak Upadhyay
Routing Algorithms for MANET: A Comparative Study Banwari, Deepanshu Sharma, Deepak Upadhyay Abstract this paper presents a comparative study of existing routing algorithms for MANET. A mobile ad-hoc network
More informationName Resolution in Mobile Ad-hoc Networks
Name Resolution in Mobile Ad-hoc Networks Paal Engelstad, Do Van Thanh, Tore E. Jonvik University of Oslo (UniK) / Telenor R&D, 1331 Fornebu, Norway {Paal.Engelstad, thanh-van.do, tore-erling.jonvik}@telenor.com
More informationA Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET
A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET Bhabani Sankar Gouda Department of Computer Science & Engineering National Institute
More informationConsiderable Detection of Black Hole Attack and Analyzing its Performance on AODV Routing Protocol in MANET (Mobile Ad Hoc Network)
Editorial imedpub Journals http://www.imedpub.com/ American Journal of Computer Science and Information Technology DOI: 10.21767/2349-3917.100025 Considerable Detection of Black Hole Attack and Analyzing
More informationA REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS
A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS M. Sanabani 1, R. Alsaqour 2 and S. Kurkushi 1 1 Faculty of Computer Science and Information Systems, Thamar University, Thamar, Republic of Yemen
More informationConfiguring IP Multicast Routing
CHAPTER 46 This chapter describes how to configure IP multicast routing on the Catalyst 3750-E or 3560-E switch. IP multicasting is a more efficient way to use network resources, especially for bandwidth-intensive
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 5 CMPE 257 Winter'11 1 Announcements Project proposals. Student presentations. 10 students so
More informationRouting in ad-hoc networks Marina Dupcinov, Srdjan Krco Applied Research Lab, EEI, Ericsson Ireland
Routing in ad-hoc networks Marina Dupcinov, Srdjan Krco Applied Research Lab, EEI, Ericsson Ireland I Introduction Ad-hoc networks are formed by users or devices wishing to communicate, without the necessity
More informationG.Narasa Reddy, 2 A.Avanthi, 3 R.Prasanth Reddy 1
ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Enhancing DSR Protocol Performance in Mobile Ad Hoc Networks
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 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 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 informationMitigating Superfluous Flooding of Control Packets MANET
Mitigating Superfluous Flooding of Control Packets MANET B.Shanmugha Priya 1 PG Student, Department of Computer Science, Park College of Engineering and Technology, Kaniyur, Coimbatore, India 1 Abstract:
More informationMulticast Technology White Paper
Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission
More informationStudy and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs
Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate
More informationComparison 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 informationArvind 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 informationCHAPTER 2 LITERATURE REVIEW
39 CHAPTER 2 LITERATURE REVIEW This chapter gives a brief summary of the MANET routing protocol types and their details. 2.1 ROUTING IN AD-HOC NETWORKS Routing is the act of moving information from source
More informationPerformance Analysis of AODV, DSR and OLSR in MANET
1 MEE10:04 Performance Analysis of AODV, DSR and OLSR in MANET Department of Electrical Engineering with emphasis on Telecommunication Blekinge Institute of Technology, Sweden 2009 By Sajjad Ali & Asad
More informationPerformance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols
Performance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols Akshay Shankar, Lavanya Chelle Information Science Engineering RNS Institute of Technology Bangalore, India Abstract- A Mobile
More informationOptimizing Performance of Routing against Black Hole Attack in MANET using AODV Protocol Prerana A. Chaudhari 1 Vanaraj B.
IJSRD - International Journal for Scientific Research & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Optimizing Performance of Routing against Black Hole Attack in MANET using AODV Protocol
More informationAd-Hoc routing taxonomy and Resource Discovery
Ad-Hoc routing taxonomy and Resource Discovery Jose Costa-Requena Helsinki University of Technology Networking Laboratory Jose@netlab.hut.fi Abstract This paper analyzes the recent development regarding
More information