A Distributed Routing Algorithm for Supporting Connection-Oriented Service in Wireless Networks with Time-Varying Connectivity
|
|
- Malcolm Evans
- 5 years ago
- Views:
Transcription
1 A Distributed Routing Algorithm for Supporting Connection-Oriented Service in Wireless Networks with Time-Varying Connectivity Anastassios Michail Department of Electrical Engineering and Institute for Systems Research University of Maryland at College Park College Park, MD 07, USA Anthony Ephremides Department of Electrical Engineering and Institute for Systems Research University of Maryland at College Park College Park, MD 07, USA Abstract We develop and simulate a distributed dynamic routing algorithm, capable of identifying paths for establishing and maintaining connection-oriented sessions in wireless communication networks which are characterized by frequent and unpredictable changes in connectivity. Our approach is a new protocol which runs atop a protocol for connectionless datagram service and establishes circuit routes for initial connection based on a mechanism of short packets exchange and on distributed information about availability of network resources. We explore the idea of predictive rerouting in that the algorithm takes advantage of the possibility to convert a connectivity change into a soft failure to maintain and re-route on-going sessions. The algorithm is simulated in Opnet and results show that the softening of link failures can improve performance as captured in terms of new call blocking probability and probability of forced termination of on-going sessions.. Introduction We consider the problem of dynamic routing in mobile wireless networks which are characterized by frequent and unpredictable changes in connectivity. We examine ad-hoc networks consisting only of mobile wireless communication nodes which move arbitrarily and do not pertain to any form of fixed network architecture, such as that of cellular networks. The existence of communication links between nodes depends on nodes location and distance, and on various physical layer factors such as transmission power levels, Prepared through collaborative participation in the Advanced Telecommunications/Information Distribution Research Program (ATIRP) Consortium sponsored by the U.S. Army Research Laboratory under Cooperative Agreement DAAL channel interference, antenna patterns and multipath propagation effects. Prior work [,,, 5] has focused on connectionless datagram service networks. The shift to connectionoriented type of service dictates the use of routing algorithms that can satisfy three main objectives: () discover routes as fast as possible, () establish connections between pairs of nodes through the discovered paths by reserving network resources and () react to connectivity fluctuations and maintain ongoing sessions, to the extent this can be feasible. Under these circumstances solutions to the routing problem should be provided by algorithms that execute in a distributed fashion without any need for global connectivity information. To these ends we have developed a fully distributed algorithm for identifying and maintaining paths between communicating pairs of nodes, based on a mechanism of short packets exchange. The starting point of our approach is a distributed routing algorithm for connection-less datagram service that was presented in [] and to which we will refer further on as CE algorithm. This algorithm assumes adequate bandwidth and an underlying access protocol, which is interference free. It relies on the execution by all nodes and separately for each potential destination of a two-phase procedure. The first phase ( query-reply message exchange) results in the establishment of a directed graph on a subset of the network that is rooted at the destination node and thus provides an initial set of routes. The second phase involves a similar structured exchange of control messages to react to the failure of an element of the previously established route and is intended to discover a new by-pass route. The algorithm adapts to large amounts of topological changes with no need for global topological knowledge, by building routes only as needed, instead of maintaining routes from all nodes to the potential destination nodes. Additionally, the extra routes built during
2 the query-reply phase increase protocol reliability. The most important properties of the CE algorithm encompass discovery of loop-free routes, deadlock-free operation and capability of detecting catastrophic network partitions. Shifting our focus to session-oriented service and, as is natural in this case, to the core of limited available bandwidth, we propose a new algorithm that establishes circuit routes for initial connection in the same manner of the CE data algorithm but that reacts differently, as it should, in the case of a link failure or connectivity change. The algorithm maintains the main properties of the CE routing algorithm but is modified to include in the message exchange additional information on the availability of network resources. In addition, in order to maintain on-going sessions in the presence of topological changes the algorithm takes advantage of the possibility to convert a wireless connectivity change to a soft failure. In the next section we present algorithm operation, starting with an overview and continueing with a definition of the network model, the router structure and a detailed description of the algorithm execution rules. In section we discuss performance evaluation and simulation results of the algorithm and we conclude in section with a short discussion of the main results and plans for future work.. Algorithm description.. Overview We consider multiple independently executing versions of the distributed routing CE algorithm, each one running for a specific destination node. The new algorithm for connection-oriented service runs atop the CE protocol and utilizes route information to establish new connections. The existing or new routes are explored in a hop-by-hop packet transmission mechanism in search of those paths which will guarantee admission of the request. As the CE protocol reacts to connectivity changes by reorganizing its routes, the overlaid protocol updates its information to be used either for attempts to accommodate new connection requests or to dynamically re-route on going sessions which experience quality degradation as a result of the changes in connectivity... Network model We model the network with a graph G =(N; L), where N represents the finite set of nodes and L the set of communication links. Each node i N has a unique node identifier (ID) and each link (i; j) L can be used either for one-way or two-way communication between nodes i and j, depending on the circumstances. All nodes are mobile and connectivity changes continuously, resulting in a time-varying set of communication links L. Each active link (i; j) L can either be undirected or directed. If the latter is true, then if the link is directed from i to j, node j is characterized as downstream (DN) neighbor of i. Similarly, if the link is directed from j to i node j is an upstream (UP) neighbor of i. An underlying link-level protocol is assumed which assures distributed knowledge of the changes in connectivity, in the sense that each node i is aware of all its adjacent nodes at all times, which are referred to as its neighbors. The set of the neighbors of node i varies also with time. We assume for simplicity that transmitted packets are received correctly and simultaneous two-way transmission over a link that would cause interference does not occur. The detailed mechanism of this link-level protocol operation is beyond the scope of this paper and will not be addressed at the present time... Router structure Every node has a fixed number of transmitter-receiver pairs (transceivers) used to set up communication links with other nodes. The number of transceivers that are in an IDLE state, varies dynamically with time depending on the traffic load and the average session duration. A necessary condition for a new connection to be established is that at least one transceiver is available at every node in the path to the destination. New connection requests are blocked when one or more nodes along the path do not have any of their transceivers idle. A pure first-come first-serve policy is assumed without considering any preemptive policies in which a high priority session can preempt an ongoing session of lower priority. For simplicity no priority is given to hand-off requests which have to compete against new connection requests in search of communication paths. A modified version of our algorithm in which hand-off requests are given priority over new call arrivals was presented in []. Sessions are distinguished by a unique ID, a numeric triple consisting of the source and destination IDs and a counter which is incremented by one for every new connection between the same source destination pair. Each node maintains a Connectivity Table with information on all sessions for which it serves as a source, destination or intermediate relay node. The connectivity table keeps a separate entry for each transceiver with the transceiver ID, the session ID, the incoming and outgoing link indices and the status of the communication transceiver... Algorithm execution Algorithm execution can be viewed as occurring in three logical phases, the Construction phase, the Maintenance phase and the Termination Phase, which execute simultaneously in a dynamic topology.
3 A. Construction phase During the construction phase mobile nodes desiring communication with other mobile users in the network, place connection requests which travel along paths provided by the underlying CE algorithm that terminate at the destination node. A request may be admitted and the session will be established if the chosen path can provide the sufficient network resources required for end-to-end flow of information. Without loss of generality we assume that at some point in time a node not adjacent to the destination node,, desires a connection. We also assume for simplicity that the QRY-RPY process (construction phase of CE) has already occurred and the part of the network under discussion can be represented by a directed acyclic graph V G rooted at the (figure (a)). Hence any node in this graph will always have at least one DN neighbor and by properties of the CE protocol there definitely exists at least one route initiating at any source node and terminating at the. A source node which desires a connection to the transmits a Connection-Request () packet along one of the existing DN links. If multiple DN links exist a decision over which link to transmit is made either upon information on the resources available along the existing paths or randomly, if no such information has been obtained. In particular the parameter for the selection of the DN link is the available number of transceivers along the outgoing paths and such information is collected during the algorithm construction phase by messages piggybacked in the transmitted acknowledgments. Unless it is the node, any other node receiving a temporarily reserves a transceiver (if at least one idle transceiver is available) and retransmits the to a DN node (see example in figure (b)(c)). If no idle transceiver is available at the time the is received, a Negative Acknowledgment control packet (NAK) is generated and sent back to the UP neighbor to indicate temporary lack of resources, and the particular link is blocked for future transmissions of the same. The NAK is a control packet generated by a node to indicate lack of resources to accommodate the request for a connection. Any node receiving a NAK attempts to retransmit the rejected to a different DN neighbor (if such a neighbor exists). To avoid multiple unnecessary attempts of transmitting over the same link, a link blocking rule is considered according to which reception of a NAK over a DN link automatically marks this link as Blocked for the specific. If a reaches the and the request is admitted, the destination node updates the corresponding entry in its connectivity table and transmits backwards to the source an Acknowledgment () control message (node in the example of figure (d)). Otherwise if the request cannot be serviced by the, a NAK is transmitted back to the (a) Initiate transmission (d) propagation CH (g) Link - fails Connection Handoff Request (j) Session handed-off to new path (b) propagation (e) propagation in reverse direction (cont) CH (h) CH reaches node (already in the path) (k) tears down session (c) propagation ) reached (f) propagation (session established) (i) propagation in reverse direction (cont) (l) tears down session Figure. Example of algorithm execution link over which the was received. messages are generated and transmitted by destination nodes, are destined to the source node of the and must follow the same path of the in the reverse direction (see example in Figure (d-f)), updating the connectivity tables of each node in the path. Link failures may destroy a path before the - phase is completed and this may result in reception of an over a DN link but for a session that has already been interrupted (before even acknowledged). A node receiving an updates the connectivity table by confirming the reservation and forwards the to the upstream node. A more enhanced version of the algorithm is when every is broadcast by a node to all its upstream neighbors. The advantage of this mechanism is based on a slight modification of the packet format to also carry the maximum number of available transceivers among all possible paths to the destination. This value is compared to the receiving node s idle transceivers and the minimum value replaces the entry in the packet field. Nodes do not anymore select randomly over which DN link to transmit a, but make their choice based on collected side information. This mechanism provides all nodes with the maximum amount of information but at the cost of outdated information in cases of large networks with high rate of topological changes, since by the moment the is received the information may already be inaccurate. It also results in a high number of control packets transmissions which could
4 slow down execution of the algorithm. B. Maintenance phase During the maintenance phase the algorithm reacts to connectivity changes that affect on-going sessions. In order to maintain connectivity for an additional amount of time, the algorithm takes advantage of the possibility to convert a wireless connectivity change to a soft failure, and search for a by pass route to handoff the on going session. We employ the notion of a soft failure (opposed to a hard failure which is a complete loss of connectivity) to characterize degradation in the link quality. A link which experiences a soft failure may still be used for transmission at some cost, for instance at a lower information rate, but the algorithm has the chance to locate and reserve a by pass route to be used by the failing session. The physical layer mechanisms during a soft failure could involve adaptive demodulation and efficient bit allocation algorithms which are beyond the scope of this paper. A node reacts to a soft failure by generating and transmitting a Connection-Handoff (CH) control message in search of by-pass routes. In general CH propagation follows the same rules as the with main difference that an may be generated either by the or also by any other node that is already in the path but is not affected by the link failure (see example in figure (g-j)). Accordingly or NAK propagation differs from the construction phase in that it ceases when the node which requested the hand off has been reached. Note that a node already in the path knows that a received CH is being served by comparing the session ID to in its connectivity table entries. Of course, when a hard link failure takes place connectivity is completely lost and the source node has to re establish the connection to the destination through the construction phase procedure. C. Termination phase During the termination phase, nodes clear entries in their connectivity tables that are no longer needed either because a connection was terminated or because it was interrupted due to a link failure or was handed off to a new path. When a session is completed the source node which initiated the call tears it down by generating a control message and broadcasting it along the session path to the (see example in figure (k-l)). Another situation where a packet is needed is when a link experiences a hard failure. In that case the two edges of the link lose communication with each other and therefore must notify the rest of the nodes located in the two resulting segments of the path to tear down the connection and clear the relevant entries in their tables.. Performance analysis We have simulated the system in Opnet Modeler, a discrete event simulator with the required features in modeling a distributed algorithm. In this section we highlight the main properties of the simulation model and present some initial simulation results... Mobile call model New call arrivals to the network are assumed to be Poisson with rate = request/min. The call holding time is exponentially distributed with mean = 0 sec. Each new call arrival is equally likely to arrive at any node as its source, and any of the remaining nodes is equally likely to be its destination... Connectivity model To capture node mobility and physical layer impairment, we employ a model of fixed-node topology but with dynamic link status. In particular, the source and destination of each call remain fixed as long as the call is in progress. Instead, the status of each link is assumed to be subject to dynamic (perhaps random) changes throughout the call duration. A simple three state probabilistic link status model is assumed. In particular, the possible states of the link status are FULL, HALF, or ZERO, corresponding to the status of the link being able to support transmissions at the full rate, half rate, or link out-of-service, respectively. Specifically, the transition from FULL to HALF state models a soft link failure, which parallels a link quality degradation situation, whereas the FULL to ZERO state transition corresponds to a hard link failure implying complete loss of connectivity. This model allows a unified treatment of node mobility and physical impairment in a flexible fashion. The difference from other commonly used two-state models [] is that we can model both a soft and a hard failure. We run simulations for different values of average holding times for each state and steady state distribution. The steady state distribution gives an indication of how much time on average each link spends at each case, while the holding times determine the average rate of topological changes, which gets higher when the holding times are decreasing... Simulation results Performance is measured end to end in terms of new call blocking probability and forced termination probability and compared under the assumptions of hard link failures only, against soft link failures. We consider a baseline topology of 0 nodes but examine two different connectivity senarios, topology (with a maximum of 7 links) and
5 topology (with a maximum of links). In all cases links are on average 95% of the time FULL and in the case of the state model % of the time under a soft failure situation whereas in the case of the state model 5% of the time under a hard failure Topology Topology Probability Probability Pf state model Pf state model Pb state model Pb state model Pf state model Pf state model Pb state model Pb state model Average rate of link status change (changes/min) Figure. Results for Topology Average rate of link status change (changes/min) Figure. Results for Topology Figures and show the end to end probabilities of forced termination P f and of new call blocking P b as functions of the average rate of link status change l (in number of changes per link per minute) for the cases of topo and topo respectively. Note that P f increases as l increases since more sessions are interrupted. Clearly the use of the three state probabilistic model for the link status results in some improvement in P f. We also observe that P b decreases when l increases. In other words, as the link failures become more frequent, the new call requests have a better chance of being admitted end-to-end. The reason is that more capacity is made available at all nodes when more calls in progress get force terminated, so it is more likely for a new call to find capacity end to end. This indicates that a combination of blocking and forced-termination probabilities, rather than blocking alone, has to be considered in the end-to-end designs for such systems. Comparison of the results for the two topologies shows that the additional route diversity of topo results in a significant drop of P b whereas the improvement in P f is not that dramatic, mainly because of a limitation of the CE protocol which temporarily blocks some DN links in order to avoid formation of loops. Hence the temporary link blocking rule prevents our algorithm from taking full advantage of route redundancy.. Conclusion and future work We have presented an algorithm capable of supporting connection-oriented service in wireless all-mobile net- works. We have based our approach on a protocol for connectionless type of service to discover routes between source and destination pairs. The algorithm features a predictive re-routing scheme, where by the appropriate mechanisms wireless connectivity changes can be modeled as soft link failures and can maintain on-going sessions until bypass routes have been discovered. Simulation results show that performance improves when the three state probabilistic model is used. Our future work will focus on investigating the joint problem of routing and call admission control in order to achieve better improvement in performance as far as forced termination is concerned. We are also going to look into physical layer issues and power saving related procedures. References [] M. Corson and A. Ephremides. A distributed routing algorithm for mobile wireless networks. Wireless Networks, :6 8, 995. [] J. J. Garcia-Luna-Aceves and S. Murthy. A path-finding algorithm for loop-free routing. IEEE/ACM Transactions on Networking, 5:8 60, February 997. [] A. Michail, W. Chen, and A. Ephremides. Distributed routing and resource allocation for connection-oriented traffic in ad-hoc wireless networks. In Conference on Information Sciences and Systems, March 998. [] V. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proc. IEEE INFOCOM 97, Japan, April 997. [5] C. Perkins and P. Bhagwat. Highly dynamic destinationsequenced distance vector routing (dsdv) for mobile computers. In ACM SIGCOMM, October 99. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government.
TECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT Routing Algorithms in All-Mobile Wireless Networks by A. Michail, A. Ephremides CSHCN T.R. 97- (ISR T.R. 97-) The Center for Satellite and Hybrid Communication Networks is a NASA-sponsored
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 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 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 informationA Study on Mobile Internet Protocol and Mobile Adhoc Network Routing Protocols
International Journal of Computer Science & Communication Vol. 1, No. 2, July-December 2010, pp. 185-189 A Study on Mobile Internet Protocol and Mobile Adhoc Network Routing Protocols B.V. Manikyala Rao
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 informationSTUDY ON MOBILE ADHOC NETWORK ROUTING PROTOCOLS
International Journal of Information Technology and Knowledge Management January-June 2012, Volume 5, No. 1, pp. 155-158 STUDY ON MOBILE ADHOC NETWORK ROUTING PROTOCOLS Monika ABSTRACT: In Many wireless
More 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 informationPerformance Analysis of Broadcast Based Mobile Adhoc Routing Protocols AODV and DSDV
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND MOBILE APPLICATIONS IJCSMA Performance Analysis of Broadcast Based Mobile Adhoc Routing Protocols AODV and DSDV Er. Sandeep Singh Khehra 1, Er. Abhinash Singla
More informationZone-based Proactive Source Routing Protocol for Ad-hoc Networks
2014 IJSRSET Volume i Issue i Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Science Zone-based Proactive Source Routing Protocol for Ad-hoc Networks Dr.Sangheethaa.S 1, Dr. Arun Korath
More informationVarying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network
Journal of Computer Science 7 (5): 678-682, 2011 ISSN 1549-3636 2011 Science Publications Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network 1 V. Balaji and 2 V. Duraisamy
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 informationA Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver
1 A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois
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 informationIN a mobile ad hoc network, nodes move arbitrarily.
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 5, NO. 6, JUNE 2006 609 Distributed Cache Updating for the Dynamic Source Routing Protocol Xin Yu Abstract On-demand routing protocols use route caches to make
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 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 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 informationSubject: Adhoc Networks
ISSUES IN AD HOC WIRELESS NETWORKS The major issues that affect the design, deployment, & performance of an ad hoc wireless network system are: Medium Access Scheme. Transport Layer Protocol. Routing.
More informationLecture 9. Quality of Service in ad hoc wireless networks
Lecture 9 Quality of Service in ad hoc wireless networks Yevgeni Koucheryavy Department of Communications Engineering Tampere University of Technology yk@cs.tut.fi Lectured by Jakub Jakubiak QoS statement
More information554 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 2, FEBRUARY /$ IEEE
554 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 2, FEBRUARY 2008 Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks Yalin Evren Sagduyu, Member, IEEE, and
More informationBandwidth Efficient Distant Vector Routing for Ad Hoc Networks
Bandwidth Efficient Distant Vector Routing for Ad Hoc Networks Ralph Jansen and Bernd Freisleben Department of Electrical Engineering & Computer Science University of Siegen Hölderlinstr. 3 D 57068 Siegen
More informationDYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET
DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET S. J. Sultanuddin 1 and Mohammed Ali Hussain 2 1 Department of Computer Science Engineering, Sathyabama University,
More informationDesign and Implementation of a Simulator for Ad Hoc Network Routing Protocols
Design and Implementation of a Simulator for Ad Hoc Network Routing Protocols Mudit, Sachin Chaudhary Abstract In consideration of adaptability to the environment and flexibility in protocol construction,
More informationRED behavior with different packet sizes
RED behavior with different packet sizes Stefaan De Cnodder, Omar Elloumi *, Kenny Pauwels Traffic and Routing Technologies project Alcatel Corporate Research Center, Francis Wellesplein, 1-18 Antwerp,
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 informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
More informationRouting Security in Mobile Ad Hoc Networks: An Extension of DSR
Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS) 2 (1): 155-159 Scholarlink Research Institute Journals, 2011 (ISSN: 2141-7016) jeteas.scholarlinkresearch.org Journal of Emerging
More informationBeacon Update for Greedy Perimeter Stateless Routing Protocol in MANETs
Beacon Update for Greedy erimeter Stateless Routing rotocol in MANETs Abstract Dhanarasan 1, Gopi S 2 1 M.E/CSE Muthayammal Engineering College, getdhanarasan@gmail.com 2 Assistant rofessor / IT Muthayammal
More informationSpectrum Management in Cognitive Radio Networks
Spectrum Management in Cognitive Radio Networks Jul 14,2010 Instructor: professor m.j omidi 1/60 BY : MOZHDEH MOLA & ZAHRA ALAVIKIA Contents Overview: Cognitive Radio Spectrum Sensing Spectrum Decision
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 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 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 information1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol Vahid Zangeneh i and Shahriar Mohammadi ii * ABSTRACT In recent years, routing has been the most focused area in ad hoc networks
More informationMulticasting in ad hoc networks: Energy efficient
Multicasting in ad hoc networks: Energy efficient Blerta Bishaj Helsinki University of Technology 1. Introduction...2 2. Sources of power consumption... 3 3. Directional antennas... 3 4. TCP... 3 5. Energy-efficient
More informationChapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.
Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.
More informationSecure Routing and Transmission Protocols for Ad Hoc Networks
MobiHoc 2002 Working Session on Security in Ad Hoc Networks Secure Routing and Transmission Protocols for Ad Hoc Networks Zygmunt J. Haas and P. Papadimitratos (Panos) Cornell University Wireless Networks
More informationEffect of Variable Bit Rate Traffic Models on the Energy Consumption in MANET Routing Protocols
Volume 1, Issue 3, October 2013 ISSN: 2320-9984 (Online) International Journal of Modern Engineering & Management Research Website: www.ijmemr.org Effect of Variable Bit Rate Traffic Models on the Energy
More informationIN distributed random multiple access, nodes transmit
414 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 2, FEBRUARY 2006 Power Levels and Packet Lengths in Random Multiple Access With Multiple-Packet Reception Capability Jie Luo, Member, IEEE, and
More informationOptimized Paging Cache Mappings for efficient location management Hyun Jun Lee, Myoung Chul Jung, and Jai Yong Lee
Optimized Paging Cache Mappings for efficient location management Hyun Jun Lee, Myoung Chul Jung, and Jai Yong Lee Abstract Cellular IP maintains distributed cache for location management and routing purposes.
More informationENSC 427: COMMUNICATION NETWORKS
ENSC 427: COMMUNICATION NETWORKS Simulation of ZigBee Wireless Sensor Networks Final Report Spring 2012 Mehran Ferdowsi Mfa6@sfu.ca Table of Contents 1. Introduction...2 2. Project Scope...2 3. ZigBee
More informationWhat is the fundamental purpose of a communication system? Discuss the communication model s elements.
What is the fundamental purpose of a communication system? The fundamental purpose of a communication system is the exchange of data between two parties. Discuss the communication model s elements. The
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 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 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 informationWSN Routing Protocols
WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before
More informationActive source routing for ad-hoc network: seamless integration of wireless environment
Active source routing for ad-hoc network: seamless integration of wireless environment 1. Introduction Active networking is the emerging technology that will provide new network environment where lots
More informationEXAMINING OF RECONFIGURATION AND REROUTING APPROACHES: WDM NETWORKS
International Journal of Information Technology and Knowledge Management January-June 2012, Volume 5, No. 1, pp. 69-72 EXAMINING OF RECONFIGURATION AND REROUTING APPROACHES: WDM NETWORKS Sushil Chaturvedi
More informationPerformance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator
Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator Dr. S. K. Singh Professor, Department of EC, India Dr. R. Gupta Asst. Prof. Department of EC, India Abstract: The
More informationTCP PERFORMANCE FOR FUTURE IP-BASED WIRELESS NETWORKS
TCP PERFORMANCE FOR FUTURE IP-BASED WIRELESS NETWORKS Deddy Chandra and Richard J. Harris School of Electrical and Computer System Engineering Royal Melbourne Institute of Technology Melbourne, Australia
More informationThe Performance of MANET Routing Protocols for Scalable Video Communication
Communications and Network, 23, 5, 9-25 http://dx.doi.org/.4236/cn.23.522 Published Online May 23 (http://www.scirp.org/journal/cn) The Performance of MANET Routing Protocols for Scalable Video Communication
More informationDynamic Search Technique Used for Improving Passive Source Routing Protocol in Manet
African Journal of Basic & Applied Sciences 9 (1): 27-32, 2017 ISSN 2079-2034 IDOSI Publications, 2017 DOI: 10.5829/idosi.ajbas.2017.27.32 Dynamic Search Technique Used for Improving Passive Source Routing
More informationEnhanced Broadcasting and Code Assignment in Mobile Ad Hoc Networks
Enhanced Broadcasting and Code Assignment in Mobile Ad Hoc Networks Jinfang Zhang, Zbigniew Dziong, Francois Gagnon and Michel Kadoch Department of Electrical Engineering, Ecole de Technologie Superieure
More informationRouting Protocol Based Shared and Session Key Exchange Protocol for Wireless Mobile Ad-hoc Network
Routing Protocol Based Shared and Session Key Exchange Protocol for Wireless Mobile Ad-hoc Network Md. Golam Kaosar Victoria University, Australia golam.kaosar@vu.edu.au Abstract Mobile Ad-hoc Network
More informationAdmission Control in Time-Slotted Multihop Mobile Networks
dmission ontrol in Time-Slotted Multihop Mobile Networks Shagun Dusad and nshul Khandelwal Information Networks Laboratory Department of Electrical Engineering Indian Institute of Technology - ombay Mumbai
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 informationImproving TCP Performance over Wireless Networks using Loss Predictors
Improving TCP Performance over Wireless Networks using Loss Predictors Fabio Martignon Dipartimento Elettronica e Informazione Politecnico di Milano P.zza L. Da Vinci 32, 20133 Milano Email: martignon@elet.polimi.it
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 informationCS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP
CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering
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 informationOPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS
Chapter 2 OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS Hanan Luss and Wai Chen Telcordia Technologies, Piscataway, New Jersey 08854 hluss@telcordia.com, wchen@research.telcordia.com Abstract:
More informationShortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks
Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks Salmu K.P 1, Chinchu James 2 1,2 Department of Computer Science, IIET, Nellikuzhi Abstract- ZigBee is a worldwide standard for wireless
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 informationA Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network
A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network Humayun Bakht Research Fellow, London School of Commerce, United Kingdom humayunbakht@yahoo.co.uk
More information2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service)
2. LITERATURE REVIEW I have surveyed many of the papers for the current work carried out by most of the researchers. The abstract, methodology, parameters focused for performance evaluation of Ad-hoc routing
More informationCurrent Project Work on Routing Protocols for MANET: A Literature Survey Mr. Chethan Chandra S Basavaraddi, Smt. Geetha N.B. M.Tech.
International Journal of Scientific & Engineering Research Volume 3, Issue 5, May-2012 1 Current Project Work on Routing Protocols for MANET: A Literature Survey Mr. Chethan Chandra S Basavaraddi, Smt.
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 informationStudy of Route Reconstruction Mechanism in DSDV Based Routing Protocols
Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Sharma Shelja, Kumar Suresh and Rathy R. K. Department of CSE, FET, MRIU, Faridabad, India Email: sharma.shelja@gmail.com, enthusk@yahoo.com,
More informationModule 2 Communication Switching. Version 1 ECE, IIT Kharagpur
Module 2 Communication Switching Lesson 4 Connectionless And Connection Oriented Packet Switching LESSON OBJECTIVE General This lesson is intended to give the reader the understanding of two important
More informationA System and Trac Dependent Adaptive Routing. Algorithm for Ad Hoc Networks 1. neighbor which leads to a shortest path to the destination.
A System and Trac Dependent Adaptive Routing Algorithm for Ad Hoc Networks 1 Piyush Gupta 2 and P. R. Kumar 3 Abstract An ad hoc network consists of a number of mobile hosts who communicate with each other
More informationA Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks
A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks P.Madhan Mohan #, J.James Johnson #, K.Murugan $ and V.Ramachandran % # Under Graduate Student $ Senior
More informationSTUDY AND COMPARISION OF PROACTIVE AND REACTIVE ROUTING PROTOCOL FOR MULTICHANNEL WIRELESS AD-HOC NETWORK
STUDY AND COMPARISION OF PROACTIVE AND REACTIVE ROUTING PROTOCOL FOR MULTICHANNEL WIRELESS AD-HOC NETWORK 1 Arpita Singh, 2 Navendu Nitin, 3 Neelesh Agrawal, 4 Arvind Kumar Jaiswal 1 PG student, SHIATS-DU,
More informationAd Hoc Routing Protocols and Issues
Ad Hoc Routing Protocols and Issues Stefano Basagni ECE Dept Northeastern University Boston, Jan 2003 Ad hoc (AD-HAHK or AD-HOKE)-Adjective a) Concerned with a particular end or purpose, and b) formed
More information/99/$10.00 (c) 1999 IEEE
COLLISION-FREE MEDIUM ACCESS CONTROL SCHEME FOR AD-HOC NETWORKS Zygmunt J. Haas and Jing Deng School of Electrical Engineering Cornell University Ithaca, NY 14853 haas@ee.cornell.edu Siamak Tabrizi US
More informationMultipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network
1 Multipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network Nilima Walde, Assistant Professor, Department of Information Technology, Army Institute of Technology, Pune, India Dhananjay
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 informationPerformance of UMTS Radio Link Control
Performance of UMTS Radio Link Control Qinqing Zhang, Hsuan-Jung Su Bell Laboratories, Lucent Technologies Holmdel, NJ 77 Abstract- The Radio Link Control (RLC) protocol in Universal Mobile Telecommunication
More informationUNIT- 2 Physical Layer and Overview of PL Switching
UNIT- 2 Physical Layer and Overview of PL Switching 2.1 MULTIPLEXING Multiplexing is the set of techniques that allows the simultaneous transmission of multiple signals across a single data link. Figure
More informationKeywords Mobile Ad hoc Networks, Multi-hop Routing, Infrastructure less, Multicast Routing, Routing.
Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Study on Various
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 informationTECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT A Scalable Extension of Group Key Management Protocol by R. Poovendran, S. Ahmed, S. Corson, J. Baras CSHCN T.R. 98-5 (ISR T.R. 98-14) The Center for Satellite and Hybrid Communication
More informationSCTP Congestion Window Overgrowth During Changeover
SCTP Congestion Window Overgrowth During Changeover Janardhan R. Iyengar, Armando L. Caro, Jr., Paul D. Amer, Gerard J. Heinz Computer and Information Sciences University of Delaware iyengar, acaro, amer,
More information/$10.00 (c) 1998 IEEE
Dual Busy Tone Multiple Access (DBTMA) - Performance Results Zygmunt J. Haas and Jing Deng School of Electrical Engineering Frank Rhodes Hall Cornell University Ithaca, NY 85 E-mail: haas, jing@ee.cornell.edu
More informationA CDCA-TRACE MAC PROTOCOL FRAMEWORK IN MOBILE AD-HOC NETWORK
Research Manuscript Title A CDCA-TRACE MAC PROTOCOL FRAMEWORK IN MOBILE AD-HOC NETWORK Jaichitra.I, Aishwarya.K, P.G Student, Asst.Professor, CSE Department, Arulmigu Meenakshi Amman College of Engineering,
More information2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS Collision Free Protocols 2.3 FDDI 2.4 DATA LINK LAYER DESIGN ISSUES 2.5 FRAMING & STUFFING
UNIT-2 2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS 2.2.1 Pure ALOHA 2.2.2 Slotted ALOHA 2.2.3 Carrier Sense Multiple Access 2.2.4 CSMA with Collision Detection 2.2.5 Collision Free Protocols 2.2.5.1
More informationPerformance Evaluation of Modified IEEE MAC for Multi-Channel Multi-Hop Ad Hoc Network *
Performance Evaluation of Modified IEEE 802.11 MAC for Multi-Channel Multi-Hop Ad Hoc Network * Jiandong LI ISN Lab., Xidian University JL384@cornell.edu Zygmunt J. Haas Cornell University haas@ece.cornell.edu
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 informationWhat is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals
What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting
More informationRouting Protocols Wireless for Ad Hoc Wireless Networks: Classifications of Protocols and A review of Table Driven Protocols Abstract:
Routing Protocols Wireless for Ad Hoc Wireless Networks: Classifications of Protocols and A review of Table Driven Protocols Amr Ergawy aergawy@cc.hut.fi Abstract: Ad Hoc wireless networks have their own
More informationMcGill University - Faculty of Engineering Department of Electrical and Computer Engineering
McGill University - Faculty of Engineering Department of Electrical and Computer Engineering ECSE 494 Telecommunication Networks Lab Prof. M. Coates Winter 2003 Experiment 5: LAN Operation, Multiple Access
More informationResource allocation in networks. Resource Allocation in Networks. Resource allocation
Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers
More informationChapter 5 Ad Hoc Wireless Network. Jang Ping Sheu
Chapter 5 Ad Hoc Wireless Network Jang Ping Sheu Introduction Ad Hoc Network is a multi-hop relaying network ALOHAnet developed in 1970 Ethernet developed in 1980 In 1994, Bluetooth proposed by Ericsson
More informationEnergy-Aware Routing in Wireless Ad-hoc Networks
Energy-Aware Routing in Wireless Ad-hoc Networks Panagiotis C. Kokkinos Christos A. Papageorgiou Emmanouel A. Varvarigos Abstract In this work we study energy efficient routing strategies for wireless
More informationDynamic Behavior of Bandwidth Control Management in Mobile Ad-Hoc Network
Dynamic Behavior of Bandwidth Control Management in Mobile Ad-Hoc Network Kumar Manoj Member, IAENG, S. C. Sharma & S.P. Singh Abstract Quality of Service (QoS) support in Mobile Ad-hoc NETworks (MANETs)
More informationUnicast Routing. Information About Layer 3 Unicast Routing CHAPTER
CHAPTER 1 This chapter introduces the underlying concepts for Layer 3 unicast routing protocols in Cisco 1000 Series Connected Grid Routers (hereafter referred to as the Cisco CG-OS router) and WAN backhaul
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 informationSIMULATING CDPD NETWORKS USING OPNET
Michael Jiang Stephen Hardy Ljiljana Trajkovic SIMULATING CDPD NETWORKS USING OPNET TM Communication Networks Laboratory School of Engineering Science Simon Fraser University Road Map Introduction Simulation
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 informationInstitute of Computer Technology - Vienna University of Technology. L73 - IP QoS Integrated Services Model. Integrated Services Model
Integrated Services Model IP QoS IntServ Integrated Services Model Resource Reservation Protocol (RSVP) Agenda Integrated Services Principles Resource Reservation Protocol RSVP Message Formats RSVP in
More informationHybrid gateway advertisement scheme for connecting mobile ad hoc networks to the Internet
* gateway advertisement scheme for connecting mobile ad hoc networks to the Internet Jeongkeun Lee (), Dongkyun Kim (2), J.J.Garcia-Luna-Aceves (3), Yanghee Choi (), Jihyuk Choi (4), Sangwoo Nam (4) ()
More information