Routing protocols in ad hoc network

Routing protocols in ad hoc networks: A survey Presented By: Mr. JOGESWAR TRIPATHY M.Tech In Dept. Of CSIT From S’O’A University, Bhubaneswar6/23/19 1

Abstract  The main objective of this paper is to create a taxonomy of the ad hoc routing protocols.  It also survey and compare the representative examples for each class of protocols.  Here authors wants to uncover the requirements considered by the different protocols , the resource limitations under which they operate and the design decisions made by the authors.  Here authors also provides the sweet spot deployment scenarios and performance metric combinations of the protocols where they out perform their competitors for which it make easy to choose the routing protocols. 6/23/19 2

Outline  Introduction  Characteristics of ad hoc networks  Applications of ad hoc networks  Types of routing  Protocols in details  Conclusion  Future work  References 6/23/19 3

Introduction  The principle behind ad hoc networking is multi-hop relaying in which messages are sent from the source to the destination by relaying through the intermediate hops (nodes).  In multi-hop wireless networks, communication between two end nodes is carried out through a number of intermediate nodes whose function is to relay information from one point to another. A static string topology is an example of such network:  It is useful when infrastructure not available, impractical, or expensive  Here Information is transmitted in a store-and forward manner using multi hop routing. 0 1 2 3 4 5 6 7 6/23/19 4

Introduction (Contd.)  Mobility and traffic are two significant factors affecting protocol performance. In current simulation,  Mobility Pattern: usually, uniformly and randomly chosen destinations (random waypoint model)  Traffic Pattern: usually, uniformly and randomly chosen communicating nodes  Impact of mobility on ad hoc routing protocols is expected to be significant  The following figure represents different wireless networks.  Infrastructure: cellular wireless networks  Ad hoc: wireless sensor networks  Hybrid: mesh networks Cellular Wireless Networks Wireless Mesh Networks Hybrid Wireless Network s Wireless Sensor Networks 6/23/19 5

Characteristics of ad hoc networks  Dynamic topologies: Network topology may change dynamically as the nodes are free to move.  Bandwidth-constrained, variable capacity links: Realized throughput of wireless communication is less than the radio’s maximum transmission rate. Collision occurs frequently.  Energy-constrained operation: Some nodes in the ad hoc network may rely on batteries or other exhaustible means for their energy.  Limited physical security: More prone to physical security threats than fixed cable networks. 6/23/19 6

Applications of ad hoc networks  Network Extension: In this application area , the networking infrastructure exists, but with insufficient coverage. Hence ad hoc network is used to extend the internet connectivity beyond the reach of the access points.  Local interconnection networks: This applications include point to point messaging and audio and video conferencing.  Ubiquitous computing: This is strongly influenced by the physical location and proximity devices which are close to each other are more likely to communicate the remote devices . As ad hoc network are good match for proximity based communication .E.g. – TV set-top box is controlled from a smartphone.  Urban Sensing: This application area exploits the sensing and computation capabilities of smartphones, together with the wide range of their deployment in urban areas  Vehicular Networking: This area covers the applications where one of the communication partner is a vehicle. t is used for emerging intelligent transport systems.  Personal area networks: It is a most popular technology formed by Bluetooth devices which needs to establish a short range communication with infrastructure elements. 6/23/19 7

Types of routing  Table-driven (proactive)  Up-to-date routing information maintained  Routing overhead independent of route usage  Source-initiated (demand-driven / reactive) Routes maintained only for routes in use Explicit route discovery mechanism  Hybrid Protocols Combination of proactive and reactive 6/23/19 8

Types of routing(Contd.) Ad Hoc Routing Protocols Table driven Source-initiated on-demand DSDV WRP AODV DSR TORA ABR SSR Reactive Proactive Hybrid ZRP Hybrid OLSR CGSR Power- aware Geographical Multicast Multicast Hierarchical Multi path Location aware GPSR DRM LAR SMR HSR CEDAR DGR GAMER DEAR MHEDSR NTBR DCMP 6/23/19 9

Protocols in details  Table Driven Routing Protocols:  In table-driven protocols, each node maintain up-to- date routing information to all the nodes in the network  These routing protocols differ in the method by which the topology change information is distributed across the network and the number of necessary routing-related tables.  some of the existing table-driven ad hoc routing protocols are : DSDV(Dynamic Destination-Sequenced Distance-Vector Routing Protocol) WRP (The Wireless Routing Protocol) 6/23/19 10

Protocols in details(Contd.)  Hybrid Routing Protocols:  Proactive mechanism of node discovery within a node’s immediate neighborhood while inter-zone communication is carried out by using reactive approaches .  Each node individually creates its own neighborhood which it calls a routing zone.  The zone is defined as a collection of nodes whose minimum distance in hops from the node in question is no greater than a value that is called the “zone radius” .  Note that routing zones of nodes might overlap heavily . E.g.- ZRP(Zone Routing Protocol) 6/23/19 11

Protocols in details(Contd.)  Source Initiated Protocol:  Route is created only when the source requests a route to a destination  Route discovery process  Route maintenance  Reactive Protocols acquire routing information only when it is actually needed. The Advantage is that due to the high uncertainty in the position of the nodes, however, the reactive protocols are much suited and perform better for ad-hoc networks.  The Disadvantages of reactive protocols include high latency time in route finding and excessive flooding leading to network clogging. Some of the Reactive Routing Protocols are: ABR (Associativity Based Routing) AODV (Ad hoc on-demand Distance Vector) DSR (Dynamic Source Routing) 6/23/19 12

Protocols in details(Contd.)  Location Aware Routing Protocol:  Location-aware routing schemes in mobile ad hoc networks assume that the individual nodes are aware of the locations of all the nodes within the network.  It utilizes location information to minimize the search space for route discovery towards the destination node.  Here, there are two flooding region in LAR protocol, i.e. the expected zone and request zone.  When source node wants to send packet to destination node, first source node should get the position of destination node by using location services which is used to get position of node.  If the source node has no information about the speed and the direction of the destination node, the entire network is considered as the expected zone. 6/23/19 13

Protocols in details(Contd.)  Multi path Routing Protocol:  Instead of only a single path, it can be useful to compute multiple paths between a given source/destination pair.  Multiple paths can be disjoint or braided.  It can be Used simultaneously, alternatively or randomly.  Multipath routing protocols create multiple routes from source to destination 6/23/19 14

Protocols in details(Contd.)  Hierarchical Routing Protocol:  Hierarchical ad hoc routing protocols build a hierarchy of nodes, typically through clustering techniques .  Nodes at the higher levels of the hierarchy provide special services, improving the scalability and the efficiency of routing .  Creation of cluster  Election of cluster head 6/23/19 15

Protocols in details(Contd.)  Multicast Routing Protocol:  Distribute a packet to all reachable nodes (broadcast) or to a somehow (explicitly) denoted subgroup (multicast)  Basic options:  Source-based tree: Construct a tree (one for each source) to reach all addressees  Minimize total cost (= sum of link weights) of the tree  Minimize maximum cost to each destination Shared, core-based trees  Use only a single tree for all sources  Every source sends packets to the tree where they are distributed  Mesh  Trees are only 1-connected ! use meshes to provide higher redundancy and thus robustness in mobile environments 6/23/19 16

Protocols in details(Contd.)  Geographical Multicast Routing Protocol:  It construct virtual coordinates that preserve enough neighborhood information to be useful in geographic routing but do not require actual position determination.  Use polar coordinates from a center point.  Assign “virtual angle range” to neighbors of a node, bigger radius .  Angles are recursively redistributed to children nodes. 6/23/19 17

Protocols in details(Contd.)  Power-aware Routing Protocols:  Create a efficient route between source node and destination node  Active : - Transmission power control - Load distribution Inactive period - Sleep mode or simply turns it off when there is no data to transmit or receive 6/23/19 18

Conclusion and Future work  In this paper several representative protocols are reviewed and compared , while different classes of protocols operate under different scenarios, but they usually share the common goal to reduce control packet overhead, maximized throughput and minimize end-to-end delay.  The main differentiating factor between the protocols is the ways of finding and/or maintaining the routes between source and destination pairs.  It will be more helpful for choosing the appropriate routing protocol .  It can be make more reusable and deployable by using security issues in future. 6/23/19 19

References [1] J.-D. Abdulai, M. Ould-Khaoua, L. Mackenzie, Adjusted probabilistic route discovery in mobile ad hoc networks, Computers and Electrical Engineering 35 (1) (2009) 168–182. [2] P. Papadimitratos and Z.J. Haas, “Secure Link State Routing for Mobile Ad Hoc Networks,” Proc. IEEE Workshop on Security and Assurance in Ad Hoc Networks, IEEE Press, 2003, pp. 27–31. [3] D.B. Johnson, “Routing in Ad Hoc Networks of Mobile Hosts,” Proc. IEEE Workshop on Mobile Computing Systems and Applications (WMCSA’94), IEEE Press, 1994, pp. 158–163. [4] Suraj Sharma, Deepak Puthal, Sabah Tazeen, Mukesh Prasad, Albert Y. Zomaya, "MSGR: A Mode-Switched Grid-Based Sustainable Routing Protocol for Wireless Sensor Networks", Access IEEE, vol. 5, pp. 19864-19875, 2017. [5] Sobinder Singh, Abhishek Swaroop, Ajay Kumar, Anamika, "A survey on techniques to achive energy efficiency in cloud computing", Computing Communication and Automation (ICCCA) 2016 International Conference on, pp. 1281-1285, 2016. 6/23/19 21

Routing protocols in ad hoc network

More Related Content

What's hot

Similar to Routing protocols in ad hoc network

Recently uploaded

Routing protocols in ad hoc network