AD HOC NETWORKS. RAJINI M 2 ND SEM M.Tech DECS PESIT
|
|
- Gabriel Lindsey
- 6 years ago
- Views:
Transcription
1 AD HOC NETWORKS RAJINI M 2 ND SEM M.Tech DECS PESIT
2 OUTLINE Introduction Features of Ad hoc network Types of ad hoc network MANETs Network architecture MAC protocols Routing protocols Denial of service attacks Solution to Denial of service attack
3 INTRODUCTION An Ad-hoc network is a local area network or some other small network, especially one with wireless (or temporary plug in connections), in which some of the network devices are the part of the network only for the duration of a communications session. Allows new network devices to be quickly added. Each user has a unique network address that is recognized as the part of the network. Collection of nodes that do not rely on a predefined infrastructure Auto-configurable network and Self organizing Nodes are mobile and hence have dynamic network topology. Nodes in ad-hoc networks play both the roles of routers and terminals. Routing protocol required
4 EXAMPLES Classroom Ad hoc network between student PDAs and workstation of the instructor Large IT campus Employees of a company moving within a large campus with PDAs, laptops, and cell phones Moving soldiers with wearable computers Eavesdropping, denial-of-service and impersonation attacks can be launched Shopping mall, restaurant, coffee shops Customers spend part of the day in a networked mall of specialty shops, coffee shops, and restaurants
5 AD HOC NETWORK
6 FEATURES There are certain features that can determine the efficiency and effectiveness of wireless ad hoc network. Network settling time. Network join time Network depart time Network recovery time Frequency of updates(overhead) Memory byte requirement Network scalability
7 Knowledge of nodal location Effect to topology changes Adaptation to radio communication environment Power consciousness Single or multi channel Bidirectional or unidirectional links Preservation of network security QoS :Routing and handling of priority messages. real time voice and video services
8 DIFFERENCE BETWEEN CELLULAR AND AD-HOC NETWORKS Cellular Networks Ad-hoc Networks Fixed, pre-located cell sites and base stations. Static backbone network topology Relatively favorable environment and stable connectivity. Detailed planning before base stations can be installed. No fixed base stations, very rapid deployment. Highly dynamic network topologies, with multi-hop. Hostile environment (losses, noise) and irregular connectivity. Ad-hoc network automatically forms and conforms to change.
9 TYPES OF AD HOC NETWORKS MANET WSN WMN VANETs
10 MANET A Mobile Ad-hoc Network (MANET) is a collection of autonomous nodes or terminals which communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner over relativelybandwidth constrained wireless links.. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. The topology is highly dynamic and frequent changes in the topology may be hard to predict.
11 CRITERIA NODE TO BE PART OF A NETWORK To be connected to a network, a node should must be within the area of influence of at least one node on the network. A node with no remaining power, or one that is off, is not currently a part of the network. Even if the source and the destination nodes are not within each other s communication range, data packets are forwarded to the destination by relaying transmission through other nodes that exist between the two nodes.
12 MANET CONSTRAINTS AND ISSUES Lack of a centralized entity Network topology changes frequently and unpredictably Routing and Mobility Management Channel access/bandwidth availability Hidden/Exposed station problem Lack of symmetrical links Physical security is limited due to the wireless transmission. Affected by higher loss rates, and can experience higher delays and jitter than fixed networks due to the wireless transmission. As nodes are battery operated (power constraint), energy savings are an important system design criterion.
13 NETWORK ARCHITECTURE MANETs is formed by set of mobile nodes such as laptops, mobile phones etc. Mobile ad hoc networks are based on wireless links(air). It can use single hop or multi hop communication. In single hop communication, all hosts are in one coverage area and hence communication is direct from host to host In multi hop communication, host communicate using intermediate hosts as many coverage area intersects with each other.
14 CELLULAR WIRELESS Single hop wireless connectivity to the wired world Space divided into cells A base station is responsible to communicate with hosts in its cell Mobile hosts can change cells while communicating Hand-off occurs when a mobile host starts communicating via a new base station
15 MULTI HOP COMMUNICATION May need to traverse multiple links to reach destination Mobility causes route changes
16 Single hop architecture multi hop architecture
17 EFFECT OF MOBILITY ON THE PROTOCOL STACK Application new applications and adaptations Transport congestion and flow control Network addressing and routing Link media access and handoff Physical transmission errors and interference
18 MAC PROTOCOLS The topology is highly dynamic and frequent changes in the topology may be hard to predict. MAC is responsible for resolving the conflicts among different nodes for channel access. There are two problems Hidden terminal problem Exposed terminal problem
19 HIDDEN AND EXPOSED TERMINALS Hidden terminals A sends to B, C cannot receive A C wants to send to B, C senses a free medium (CS fails) collision at B, A cannot receive the collision (CD fails) A is hidden for C Exposed terminals A B C B sends to A, C wants to send to another terminal (not A or B) C senses carrier, finds medium in use and has to wait A is outside the radio range of C, therefore waiting is not necessary C is exposed to B
20 CLASSIFICATIONS OF MAC PROTOCOLS Ad hoc network MAC protocols can be classified into three types: Contention-based protocols Contention-based protocols with reservation mechanisms Contention-based protocols with scheduling mechanisms Other MAC protocols MAC Protocols for Ad Hoc Wireless Networks Sender-Initiated Protocols Single-Channel Protocols MACAW FAMA Contention-Based Protocols Receiver-Initiated Protocols Multichannel Protocols BTMA DBTMA ICSMA Contention-based protocols with reservation mechanisms Synchronous Protocols RI-BTM A MACA-BI MARCH D-PRM A CATA HRMA SRM A/PA FPRP Asynchronous Protocols Contention-based protocols with scheduling mechanisms MACA/PR RTMAC RI-BTM A MACA-BI MARCH Other MAC Protocols Directional Antennas MMAC MCSMA PCM RBAR
21 CLASSIFICATIONS OF MAC PROTOCOLS Contention-based protocols Sender-initiated protocols: Packet transmissions are initiated by the sender node. Single-channel sender-initiated protocols: A node that wins the contention to the channel can make use of the entire bandwidth. Multichannel sender-initiated protocols: The available bandwidth is divided into multiple channels. Receiver-initiated protocols: The receiver node initiates the contention resolution protocol. Contention-based protocols with reservation mechanisms Synchronous protocols: All nodes need to be synchronized. Global time synchronization is difficult to achieve. Asynchronous protocols: These protocols use relative time information for effecting reservations. 21
22 CLASSIFICATIONS OF MAC PROTOCOLS Contention-based protocols with scheduling mechanisms Node scheduling is done in a manner so that all nodes are treated fairly and no node is starved of bandwidth. Scheduling-based schemes are also used for enforcing priorities among flows whose packets are queued at nodes. Some scheduling schemes also consider battery characteristics. Other protocols are those MAC protocols that do not strictly fall under the above categories.
23 MULTIPLE ACCESS WITH COLLISION AVOIDANCE(MACA) MACA uses signaling packets for collisionavoidance RTS (request to send) :sender request the right to send from a receiver with a short RTS packet before it sends a data packet CTS (clear to send) :receiver grants the right to send as soon as it is ready to receive Signaling packets contain sender address receiver address packet size The neighbor node that overhears an RTS packet has to defer its own transmission until the associated CTS packet is transmitted.
24 Then any node overhearing a CTS packet would defer for the length of expected data transmission When a node wants to transmit a data packet, it first transmit a RTS (Request To Send) frame. The receiver node, on receiving the RTS packet, if it is ready to receive the data packet, transmits a CTS (Clear to Send) packet. Once the sender receives the CTS packet without any error, it starts transmitting the data packet. If a packet transmitted by a node is lost, the node uses the binary exponential back-off (BEB) algorithm to back off a random interval of time before retrying. The binary exponential back-off mechanism used in MACA might starves flows sometimes.
25 MACA EXAMPLES MACA avoids the problem of hidden terminals A and C want to send to B A sends RTS first C waits after receiving CTS from B RTS CTS CTS A B C MACA avoids the problem of exposed terminals B wants to send to A, C to another terminal now C does not have to wait for it cannot receive CTS from A RTS RTS CTS A B C 25
26 Limitations MACA does not provide ACK RTS-CTS approach does not always solve the hidden node problem Example A sends RTS to B B sends CTS to A; At the same time, D sends RTS to C The CTS & RTS packets collide at C A transmits data to B; D resends RTS to C; C sends CTS to D The data & CTS packets collide at B
27 MACAW MACAW (MACA for Wireless) is a revision of MACA(without ACK). The sender senses the carrier to see and transmits a RTS (Request To Send) frame if no nearby station transmits a RTS. The receiver replies with a CTS (Clear To Send) frame. Neighbors see CTS, then keep quiet. see RTS but not CTS, then keep quiet until the CTS is back to the sender. The receiver sends an ACK when receiving an frame. Neighbors keep silent until see ACK. Collisions There is no collision detection. The senders know collision when they don t receive CTS. They each wait for the exponential backoff time. 27
28 MACAW (MACA FOR WIRELESS) RTS-CTS-DS-DATA-ACK RTS from A to B CTS from B to A Data Sending (DS) from A to B Data from A to B ACK from B to A Random wait after any successful/unsuccessful transmission Significantly higher throughput than MACA Does not completely solve hidden & exposed node problems
29 POWER AWARE MAC PROTOCOLS Minimize expensive retransmissions due to collisions Transceivers should be kept in standby mode as much as possible Switch to low power mode sufficient for the destination to receive the packet Two categories Alternate between sleep and awake cycles Vary transmission power
30 PAMAS (POWER AWARE MEDIUM ACCESS CONTROL WITH SIGNALING) RTS-CTS exchanges over a signaling channeling Data transmission over a separate data channel Receiver sends out a busy tone, while receiving a data packet over the signaling channel Nodes listen to the signaling channel to determine when it is optimal to power down transceivers A node powers itself off if it has nothing to transmit and its neighbor is transmitting A node powers off if at least one neighbor is transmitting and another is receiving Use of ACK and transmission of multiple packets can enhance performance Radio transceiver turnaround time was not considered
31 PCM: POWER CONTROL MEDIUM ACCESS CONTROL Send RTS & CTS packets using max available power Send DATA & ACK with the min power required to communicate between the sender and receiver Based on the received signal strength of the RTS/CTS packet, adjust the power level for DATA transmission Drawbacks Requires rather accurate estimation of the received signal strength, which is hard in wireless communication Difficult to implement frequent changes in the transmission power level
32 PCMA: POWER CONTROLLED MULTIPLE ACCESS Control transmit power of the sender The receiver is just able to receive the packet Avoid interfering other neighboring nodes not involved in the packet exchange Two channels: one for busy tone & another for data Request Power To Send (RTPS) & Accept Power To Send (APTS) on the data channel Every receiver periodically sends out a busy tone Sender does carrier sensing
33 Busy Tone Multiple Access Protocols (BTMA) The transmission channel is split into two: a data channel for data packet transmissions a control channel used to transmit the busy tone signal When a node is ready for transmission, it senses the channel to check whether the busy tone is active. If not, it turns on the busy tone signal and starts data transmissions Otherwise, it reschedules the packet for transmission after some random rescheduling delay. Any other node which senses the carrier on the incoming data channel also transmits the busy tone signal on the control channel, thus, prevent two neighboring nodes from transmitting at the same time. Dual Busy Tone Multiple Access Protocol (DBTMAP) is an extension of the BTMA scheme. a data channel for data packet transmissions a control channel used for control packet transmissions (RTS and CTS packets) and also for transmitting the busy tones.
34 ROUTING PROTOCOLS
35 CONVENTIONAL ROUTING PROTOCOLS? Not designed for highly dynamic, low bandwidth networks Count-to-infinity problem and slow convergence Loop formation during temporary node failures and network partitions Protocols that use flooding techniques create excessive traffic and control overhead
36 MANET PROTOCOLS Proactive Protocols Table driven Continuously evaluate routes No latency in route discovery Large capacity to keep network information current A lot of routing information may never be used! Reactive Protocols On Demand Route discovery by some global search Bottleneck due to latency of route discovery May not be appropriate for realtime communication
37 Table Driven Routing Protocol Send periodic updates of the routes. Each node uses routing information to store the location information of other nodes in the network and this information is then used to move data among different nodes in the network. Have lower latency since routes are maintained at all times 37
38 DESTINATION SEQUENCED DISTANCE VECTOR (DSDV) Each Route is tagged with a sequence number originated by destination Hosts perform periodic & triggered updates, issuing a new sequence number Sequence number indicates the freshness of a route Routes with more recent sequence numbers are preferred for packet forwarding If same sequence number, one having smallest metric used
39 TOPOLOGY CHANGES Broken links assigned a metric of Any route through a hop with a broken link is also assigned a metric of routes are assigned new sequence numbers by any host and immediately broadcast via a triggered update If a node has an equal/later sequence number with a finite metric for an route, a route update is triggered
40 DSDV OPERATION
41 DAMPING FLUCTUATIONS Routes preferred if later sequence numbers, or smaller metric for same sequence numbers Problem : Table fluctuations if worse metrics are received first, causing a ripple of triggered updates Solution : Use average settling time as a parameter before advertising routes Tantamount to using two tables, one for forwarding packets and another for advertising routes
42 DYNAMIC SOURCE ROUTING (DSR) Each packet header contains a route, which is represented as a complete sequence of nodes between a source-destination pair Protocol consists of two phases route discovery route maintenance Optimizations for efficiency Route cache Piggybacking Error handling
43 DSR ROUTE DISCOVERY Source broadcasts route request (id, target) Intermediate node action Discard if id is in <initiator, request id> or node is in route record If node is the target, route record contains the full route to the target; return a route reply Else append address in route record; rebroadcast Use existing routes to source to send route reply; else piggyback
44 DSR ROUTE MAINTENANCE Use acknowledgements or a layer-2 scheme to detect broken links; inform sender via route error packet If no route to the source exists Use piggybacking Send out a route request and buffer route error Sender truncates all routes which use nodes mentioned in route error Initiate route discovery
45 ROUTE DISCOVERY IN DSR Y Z S E A B H C I G F K J D M N L Represents a node that has received RREQ for D from S
46 ROUTE DISCOVERY IN DSR Broadcast transmission Y [S] Z S E A B H C I G F K J D M N L Represents transmission of RREQ [X,Y] Represents list of identifiers appended to RREQ
47 ROUTE DISCOVERY IN DSR Y S E [S,E] Z A B H C [S,C] I G F K J D M N L Node H receives packet RREQ from two neighbors: potential for collision
48 ROUTE DISCOVERY IN DSR Y Z S E A B H C I G F [S,C,G] [S,E,F] K J D M N L Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once
49 ROUTE DISCOVERY IN DSR Y Z A B H S C I E G F [S,E,F,J] M J D K [S,C,G,K] N L Nodes J and K both broadcast RREQ to node D Since nodes J and K are hidden from each other, their transmissions may collide
50 ROUTE DISCOVERY IN DSR Y Z A B H S C I E G F K J [S,E,F,J,M] M L D N Node D does not forward RREQ, because node D is the intended target of the route discovery
51 ROUTE DISCOVERY IN DSR Destination D on receiving the first RREQ, sends a Route Reply (RREP) RREP is sent on a route obtained by reversing the route appended to received RREQ RREP includes the route from S to D on which RREQ was received by node D
52 ROUTE REPLY IN DSR Y S E RREP [S,E,F,J,D] Z A B H C I G F K J M D N L Represents RREP control message
53 DYNAMIC SOURCE ROUTING (DSR) Node S on receiving RREP, caches the route included in the RREP When node S sends a data packet to D, the entire route is included in the packet header hence the name source routing Intermediate nodes use the source route included in a packet to determine to whom a packet should be forwarded
54 DATA DELIVERY IN DSR Y DATA [S,E,F,J,D] Z S E A B H C I G F K J D M N L Packet header size grows with route length
55 DSR OPTIMIZATION: ROUTE CACHING Each node caches a new route it learns by any means When node S finds route [S,E,F,J,D] to node D, node S also learns route [S,E,F] to node F When node K receives Route Request [S,C,G] destined for node, node K learns route [K,G,C,S] to node S When node F forwards Route Reply RREP [S,E,F,J,D], node F learns route [F,J,D] to node D When node E forwards Data [S,E,F,J,D] it learns route [E,F,J,D] to node D A node may also learn a route when it overhears Data Problem: Stale caches may increase overheads
56 OPTIMIZATIONS FOR EFFICIENCY Route Cache Use cached entries for during route discovery Promiscuous mode to add more routes Use hop based delays for local congestion Must be careful to avoid loop formation Non propagating RREQs
57 OPTIMIZATIONS Piggybacking Data piggybacked on route request Packet Problem : route caching can cause piggybacked route replies to be discarded Improved Error Handling when network becomes partitioned, buffer packets and use exponential back-off for route discovery Listen to route replies promiscuously to remove entries Use negative information to ignore corrupt replies
58 DYNAMIC SOURCE ROUTING: ADVANTAGES Routes maintained only between nodes who need to communicate reduces overhead of route maintenance Route caching can further reduce route discovery overhead A single route discovery may yield many routes to the destination, due to intermediate nodes replying from local caches
59 DSR: DISADVANTAGES Packet header size grows with route length due to source routing Flood of route requests may potentially reach all nodes in the network Potential collisions between route requests propagated by neighboring nodes insertion of random delays before forwarding RREQ Increased contention if too many route replies come back due to nodes replying using their local cache Route Reply Storm problem Stale caches will lead to increased overhead
60 AODV Route Requests (RREQ) are forwarded in a manner similar to DSR When a node re-broadcasts a Route Request, it sets up a reverse path pointing towards the source AODV assumes symmetric (bi-directional) links When the intended destination receives a Route Request, it replies by sending a Route Reply (RREP) Route Reply travels along the reverse path set-up when Route Request is forwarded
61 AODV FORWARD PATH SETUP RREQ arrives at a node that has current route to the destination ( larger/same sequence number) unicast request reply (RREP)<source_addr, dest_addr, dest_sequence_#, hop_cnt,lifetime> to neighbor RREP travels back to the source along reverse path each upstream node updates dest_sequence_#, sets up a forward pointer to the neighbor who transmit the RREP
62 AODV REVERSE PATH SETUP Counters : Sequence number, Broadcast id Reverse Path Broadcast route request (RREQ) < source_addr, source_sequence-#, broadcast_id, dest_addr, dest_sequence_#, hop_cnt > RREQ uniquely identified by <source_addr, broadcast_id> Route reply (RREP) if neighbor is the target, or knows a higher dest_sequence_# Otherwise setup a pointer to the neighbor from whom RREQ was received Maintain reverse path entries based on timeouts
63 ROUTE REQUESTS IN AODV Y Z S E A B H C I G F K J D M N L Represents a node that has received RREQ for D from S
64 ROUTE REQUESTS IN AODV Broadcast transmission Y Z S E A B H C I G F K J D M N L Represents transmission of RREQ
65 ROUTE REQUESTS IN AODV Y Z S E A B H C I G F K J D M N L Represents links on Reverse Path
66 REVERSE PATH SETUP IN AODV Y Z S E A B H C I G F K J D M N L Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once
67 REVERSE PATH SETUP IN AODV Y Z S E A B H C I G F K J D M N L
68 REVERSE PATH SETUP IN AODV Y Z S E A B H C I G F K J D M N L Node D does not forward RREQ, because node D is the intended target of the RREQ
69 FORWARD PATH SETUP IN AODV Y Z S E A B H C I G F K J D M N L Forward links are setup when RREP travels along the reverse path Represents a link on the forward path
70 ROUTE REQUEST AND ROUTE REPLY Route Request (RREQ) includes the last known sequence number for the destination An intermediate node may also send a Route Reply (RREP) provided that it knows a more recent path than the one previously known to sender Intermediate nodes that forward the RREP, also record the next hop to destination A routing table entry maintaining a reverse path is purged after a timeout interval A routing table entry maintaining a forward path is purged if not used for a active_route_timeout interval
71 LINK FAILURE A neighbor of node X is considered active for a routing table entry if the neighbor sent a packet within active_route_timeout interval which was forwarded using that entry Neighboring nodes periodically exchange hello message When the next hop link in a routing table entry breaks, all active neighbors are informed Link failures are propagated by means of Route Error (RERR) messages, which also update destination sequence numbers
72 ROUTE ERROR When node X is unable to forward packet P (from node S to node D) on link (X,Y), it generates a RERR message Node X increments the destination sequence number for D cached at node X The incremented sequence number N is included in the RERR When node S receives the RERR, it initiates a new route discovery for D using destination sequence number at least as large as N When node D receives the route request with destination sequence number N, node D will set its sequence number to N, unless it is already larger than N
73 AODV: SUMMARY Routes need not be included in packet headers Nodes maintain routing tables containing entries only for routes that are in active use At most one next-hop per destination maintained at each node DSR may maintain several routes for a single destination Sequence numbers are used to avoid old/broken routes Sequence numbers prevent formation of routing loops Unused routes expire even if topology does not change
74 DSR VS. AODV DSR AODV routing table format full path next hop route checking passive acks hello pings rate of propogation of fast slower topology changes ability to handle frequent good fair topology change CPU / memory usage high low scalability poor excellent 74
75 FISHEYE STATE ROUTING PROTOCOL The basic principle is that it can capture pixel information with greater accuracy near its eye s focal point. This accuracy decreases with increase in the distance from the centre of the focal point. Each node exchanges topology information with its neighbor only instead of flooding. This is done periodically rather than being driven by an event. It defines routing scopes, which is the set of nodes that are reachable in specific number of hops. The frequency of exchange decreases with the increase in scope. This process reduces the overhead in routing. Advantages: the reduces the BW consumed by the link state update packets. So used for large and highly mobile ad hoc networks.
76 DENIAL OF SERVICE ATTACKS A Denial of service attack is an explicit attempt to prevent the legitimate user of a service or data. The common method of attack involves overloading the target system with requests, such that it cannot respond to legitimate traffic. it makes the system or service unavailable for the user. The basic types of attack are: consumption of bandwidth or consumption of processor time, obstructing the communication between two machines, disruption of service to a specific system or person, disruption of routing information, disruption of physical components etc. If the sensor network encounters DoS attacks, the attack gradually reduces the functionality as well as the overall performance of the wireless sensor network.
77
78 MODES OF ATTACK The three basic types of attack are: a. Consumption of limited or scares resources(network bandwidth, memory) b. Alteration or destruction of configuration information. c. Physical destruction of network components.
79 the hidden terminal problem reduces the capacity of a network due to increasing the number of collisions, while the exposed terminal problem reduces the network capacity due to the unnecessarily deferring nodes from transmitting.
80
81
82
83
84 KEY BENEFITS OF MOBILE AD-HOC NETWORKS No expensive infrastructure must be installed Use of unlicensed frequency spectrum Quick distribution of information around sender Use of ad-hoc networks can increase mobility and flexibility, as ad-hoc networks can be brought up and torn down in a very short time. Ad-hoc networks can be more economical in some cases, as they eliminate fixed infrastructure costs and reduce power consumption at mobile nodes. Because of multi-hop support in ad-hoc networks, communication beyond the Line of Sight (LOS) is possible at high frequencies.
85 KEY BENEFITS OF MOBILE AD-HOC NETWORKS Multi-hop ad-hoc networks can reduce the power consumption of wireless devices. More transmission power is required for sending a signal over any distance in one long hop than in multiple shorter hops Reduced interference levels, increases spectrum reuse efficiency, and makes it possible to use unlicensed unregulated frequency bands(because of short communication links radio emission levels can be kept low).
Wireless 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 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 informationMAC protocols. Lecturer: Dmitri A. Moltchanov
MAC protocols Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2616/ OUTLINE: Problems for MAC to deal with; Design goals; Classification of MAC protocols Contention-based
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 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 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 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 informationMAC protocols for ad hoc networks
MAC protocols for ad hoc networks Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2756/ OUTLINE: Problems for MAC to deal with; Design goals; Classification of
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 informationChapter 7. Wireless Ad Hoc Networks. 7: Wireless Ad Hoc Networks 7-1
Chapter 7 Wireless Ad Hoc Networks 7: Wireless Ad Hoc Networks 7-1 What is an Ad Hoc Network? Definitions: An ad-hoc network is one that comes together as needed, not necessarily with any assistance from
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 information15-441: Computer Networking. Wireless Networking
15-441: Computer Networking Wireless Networking Outline Wireless Challenges 802.11 Overview Link Layer Ad-hoc Networks 2 Assumptions made in Internet Host are (mostly) stationary Address assignment, routing
More informationMobile Ad Hoc Networks
Mobile Ad Hoc Networks Tutorial at CIT 2000 Bhubaneshwar, Dec 20 23 Sridhar Iyer IIT Bombay http://www.it.iitb.ernet.in.in/~sri sri@it.iitb.ernet.in Acknowledgements Many figures, slides and reference
More informationWireless Mesh Networks
Wireless Mesh Networks COS 463: Wireless Networks Lecture 6 Kyle Jamieson [Parts adapted from I. F. Akyildiz, B. Karp] Wireless Mesh Networks Describes wireless networks in which each node can communicate
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 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 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 informationPolitecnico di Milano Facoltà di Ingegneria dell Informazione. WI-7 Ad hoc networks. Wireless Internet Prof. Antonio Capone
Politecnico di Milano Facoltà di Ingegneria dell Informazione WI-7 Ad hoc networks Wireless Internet Prof. Antonio Capone Acknowlegments o This class notes are mostly based on the teaching material of:
More information2013, 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 informationAd Hoc Networks: Introduction
Ad Hoc Networks: Introduction Module A.int.1 Dr.M.Y.Wu@CSE Shanghai Jiaotong University Shanghai, China Dr.W.Shu@ECE University of New Mexico Albuquerque, NM, USA 1 Ad Hoc networks: introduction A.int.1-2
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 informationCS551 Ad-hoc Routing
CS551 Ad-hoc Routing Bill Cheng http://merlot.usc.edu/cs551-f12 1 Mobile Routing Alternatives Why not just assume a base station? good for many cases, but not some (military, disaster recovery, sensor
More informationMobile & Wireless Networking. Lecture 10: Mobile Transport Layer & Ad Hoc Networks. [Schiller, Section 8.3 & Section 9] [Reader, Part 8]
192620010 Mobile & Wireless Networking Lecture 10: Mobile Transport Layer & Ad Hoc Networks [Schiller, Section 8.3 & Section 9] [Reader, Part 8] Geert Heijenk Outline of Lecture 10 Mobile transport layer
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 3 CMPE 257 Winter'11 1 Announcements Accessing secure part of the class Web page: User id: cmpe257.
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 informationWireless Mul*hop Ad Hoc Networks
Wireless Mul*hop Guevara Noubir noubir@ccs.neu.edu Some slides are from Nitin Vaidya s tutorial. Infrastructure vs. Ad Hoc Wireless Networks Infrastructure networks: One or several Access- Points (AP)
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 informationMedia Access Control in Ad Hoc Networks
Media Access Control in Ad Hoc Networks The Wireless Medium is a scarce precious resource. Furthermore, the access medium is broadcast in nature. It is necessary to share this resource efficiently and
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 informationUNIT-III MAC PROTOCOLS FOR WIRELESS SENSOR NETWORKS
UNIT-III MAC PROTOCOLS FOR WIRELESS SENSOR NETWORKS Syllabus: Issues in Designing a MAC protocol for Ad Hoc Wireless Networks, Design goals of a MAC Protocol for Ad Hoc Wireless Networks, Classifications
More informationADHOC NETWORKS. Sub Code : 10IS841/10CS841 IA Marks : 25 Hrs/Week : 04 Exam Hours : 03 Total Hrs : 52 Exam Marks : 100 PART A
Sub Code : 10IS841/10CS841 IA Marks : 25 Hrs/Week : 04 Exam Hours : 03 Total Hrs : 52 Exam Marks : 100 PART A UNIT 1 6 Hours Introduction: Ad hoc Networks: Introduction, Issues in Ad hoc wireless networks,
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 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 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 informationWireless Medium Access Control Protocols
Wireless Medium Access Control Protocols Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 Classification of wireless MAC protocols Wireless
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions
More informationMobile Ad Hoc Networks: Routing, MAC and Transport Issues
Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Nitin H. Vaidya University of Illinois at Urbana-Champaign nhv@uiuc.edu http://www.crhc.uiuc.edu/~nhv 2004 Nitin Vaidya 1 Notes Names in brackets,
More 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 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 informationMedium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV
Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV CS: 647 Advanced Topics in Wireless Networks Drs. Baruch Awerbuch & Amitabh Mishra Department of Computer Science Johns Hopkins University
More informationIEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall
IEEE 802.11, Token Rings 10/11/06 CS/ECE 438 - UIUC, Fall 2006 1 Medium Access Control Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 10/11/06
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 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 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 informationChapter 6: MAC Protocols for Ad Hoc Wireless Networks. Jang Ping Sheu
Chapter 6: MAC Protocols for Ad Hoc Wireless Networks Jang Ping Sheu Outline Issues in designing a MAC protocol Contention-based protocols Contention-based protocols with reservation mechanisms Contention-based
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 information15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks
15-441: Computer Networking Lecture 24: Ad-Hoc Wireless Networks Scenarios and Roadmap Point to point wireless networks (last lecture) Example: your laptop to CMU wireless Challenges: Poor and variable
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 informationMAC LAYER. Murat Demirbas SUNY Buffalo
MAC LAYER Murat Demirbas SUNY Buffalo MAC categories Fixed assignment TDMA (Time Division), CDMA (Code division), FDMA (Frequency division) Unsuitable for dynamic, bursty traffic in wireless networks Random
More informationCSE 461: Wireless Networks
CSE 461: Wireless Networks Wireless IEEE 802.11 A physical and multiple access layer standard for wireless local area networks (WLAN) Ad Hoc Network: no servers or access points Infrastructure Network
More informationAd Hoc Networks. Advanced Mobile Communication Networks. Integrated Communication Systems Group Ilmenau University of Technology
Ad Hoc Networks Advanced Mobile Communication Networks Integrated Communication Systems Group Ilmenau University of Technology Outline Introduction Medium Access Control (MAC) in Multi-Channel Scenario
More informationA Survey - Energy Efficient Routing Protocols in MANET
, pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram
More informationPerformance Evaluation of Route Failure Detection in Mobile Ad Hoc Networks
Performance Evaluation of Route Failure Detection in Mobile Ad Hoc Networks Dimitri Marandin 4. Würzburger Workshop "IP Netzmanagement, IP Netzplanung und Optimierung" 27.-28. July 2004 www.ifn.et.tu-dresden.de/tk/
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 informationUnicast Routing in Mobile Ad-Hoc Networks
Unicast Routing in Mobile Ad-Hoc Networks Overview Introduction MaNet Protocols Proactive & Hybrid Protocols WRP/GSR/FSR/LAR ZRP Reactive Protocols DSR/DSDV/AODV Challenges in Ad-Hoc Networks References
More 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 informationLecture 12 December 04, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
Lecture 12 December 04, 2017 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2017-2018 Random Medium Access Control Part II - CSMA and Collision
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 informationPerformance Evaluation of AODV and DSR routing protocols in MANET
Performance Evaluation of AODV and DSR routing protocols in MANET Naresh Dobhal Diwakar Mourya ABSTRACT MANETs are wireless temporary adhoc networks that are being setup with no prior infrastructure and
More informationWireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking
Wireless Challenges 15-441: Computer Networking Lecture 25: Wireless Networking Force us to rethink many assumptions Need to share airwaves rather than wire Don t know what hosts are involved Host may
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 4 1 Announcements Project proposals. Due April 17 th. Submit by e-mail to katia@soe.ucsc.edu.
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 informationPart I. Wireless Communication
1 Part I. Wireless Communication 1.5 Topologies of cellular and ad-hoc networks 2 Introduction Cellular telephony has forever changed the way people communicate with one another. Cellular networks enable
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 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 informationDynamic Source Routing in Ad Hoc Wireless Networks
Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213-3891 dbj@cs.cmu.edu Abstract
More informationIntelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang
Intelligent Transportation Systems Medium Access Control Prof. Dr. Thomas Strang Recap: Wireless Interconnections Networking types + Scalability + Range Delay Individuality Broadcast o Scalability o Range
More informationMedium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem
Medium Access Control IEEE 802.11, Token Rings Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 9/15/06 CS/ECE 438 - UIUC, Fall 2006 1 9/15/06 CS/ECE
More informationIEEE Medium Access Control. Medium Access Control
IEEE 802.11 Medium Access Control EECS3214 3 April 2018 Medium Access Control reliable data delivery access control MAC layer covers three functional areas: security 2 1 MAC Requirements To avoid interference
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 informationRouting Protocols in MANET: Comparative Study
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119
More informationMobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading
Mobile Routing 15-744: Computer Networking L-10 Ad Hoc Networks Mobile IP Ad-hoc network routing Assigned reading Performance Comparison of Multi-Hop Wireless Ad Hoc Routing Protocols A High Throughput
More informationLecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday
Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing
More 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 informationAnalysis of Black-Hole Attack in MANET using AODV Routing Protocol
Analysis of Black-Hole Attack in MANET using Routing Protocol Ms Neha Choudhary Electronics and Communication Truba College of Engineering, Indore India Dr Sudhir Agrawal Electronics and Communication
More informationMODIFICATION AND COMPARISON OF DSDV AND DSR PROTOCOLS
MODIFICATION AND COMPARISON OF DSDV AND DSR PROTOCOLS Department of computer science Thadomal Shahani engineering college Mumbai-400051, ABSTRACT: In this era of mobile devices, mobile ad-hoc network (MANET)
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 informationPerformance Analysis of Wireless Mobile ad Hoc Network with Varying Transmission Power
, pp.1-6 http://dx.doi.org/10.14257/ijsacs.2015.3.1.01 Performance Analysis of Wireless Mobile ad Hoc Network with Varying Transmission Power Surabhi Shrivastava, Laxmi Shrivastava and Sarita Singh Bhadauria
More informationA Priority based Congestion Prevention Technique for Vehicular Ad-Hoc Networks
Computing For Nation Development, March 10 11, 2011 Bharati Vidyapeeth s Institute of Computer Applications and Management, New Delhi A Priority based Congestion Prevention Technique for Vehicular Ad-Hoc
More informationCSE 461: Multiple Access Networks. This Lecture
CSE 461: Multiple Access Networks This Lecture Key Focus: How do multiple parties share a wire? This is the Medium Access Control (MAC) portion of the Link Layer Randomized access protocols: 1. Aloha 2.
More informationWireless Ad-Hoc Networks
Wireless Ad-Hoc Networks Dr. Hwee-Pink Tan http://www.cs.tcd.ie/hweepink.tan Outline Part 1 Motivation Wireless Ad hoc networks Comparison with infrastructured networks Benefits Evolution Topologies Types
More informationLast Lecture: Data Link Layer
Last Lecture: Data Link Layer 1. Design goals and issues 2. (More on) Error Control and Detection 3. Multiple Access Control (MAC) 4. Ethernet, LAN Addresses and ARP 5. Hubs, Bridges, Switches 6. Wireless
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 informationDSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks David B. Johnson David A. Maltz Josh Broch Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213-3891
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 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 informationA Survey on Wireless Routing Protocols (AODV, DSR, DSDV)
RESEARCH ARTICLE International Journal of Computer Techniques - Volume 2 Issue 1, 2015 OPEN ACCESS A Survey on Wireless Routing Protocols (AODV, DSR, DSDV) Sejal D Mello 1, Priyanka B. Patil 2, Tarannum
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 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 informationPower aware Multi-path Routing Protocol for MANETS
Power aware Multi-path Routing Protocol for MANETS Shruthi P Murali 1,Joby John 2 1 (ECE Dept, SNGCE, India) 2 (ECE Dept, SNGCE, India) Abstract: Mobile Adhoc Network consists of a large number of mobile
More informationExpected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network
Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network K Anandkumar, D.Vijendra Babu PG Student, Chennai, India Head, Chennai, India ABSTRACT : Wireless mesh networks (WMNs)
More informationMohamed Khedr.
Mohamed Khedr http://webmail.aast.edu/~khedr Tentatively Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Week 7 Week 8 Week 9 Week 10 Week 11 Week 12 Week 13 Week 14 Week 15 Overview Packet Switching IP addressing
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 informationPerformance Evaluation of MANET through NS2 Simulation
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation
More informationMedium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols
Medium Access Control MAC protocols: design goals, challenges, contention-based and contention-free protocols 1 Why do we need MAC protocols? Wireless medium is shared Many nodes may need to access the
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 informationAd Hoc Networks. Mobile Communication Networks (RCSE) Winter Semester 2012/13. Integrated Communication Systems Group Ilmenau University of Technology
Ad Hoc Networks Mobile Communication Networks (RCSE) Winter Semester 2012/13 Integrated Communication Systems Group Ilmenau University of Technology Outline Introduction Medium Access Control (MAC) Routing
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 informationTransport layer issues
Transport layer issues Dmitrij Lagutin, dlagutin@cc.hut.fi T-79.5401 Special Course in Mobility Management: Ad hoc networks, 28.3.2007 Contents Issues in designing a transport layer protocol for ad hoc
More information