Professional Documents
Culture Documents
Adhoc Networks (UNIT III)
Adhoc Networks (UNIT III)
by
Dr.P.SAMUNDISWARY Dept. of Electronics Engineering Pondicherry University
and
Detailed planning before Ad hoc network base stations can be automatically forms and installed adapts to changes
AD HOC NETWORK
Collection of mobile wireless nodes forming a network without the aid of any infrastructure or centralized administration Nodes have limited transmission range Nodes act as a routers
Dynamic topologies Limited channel bandwidth Variable capacity links Energy-constrained operation Limited physical security
APPLICATIONS
Military battlefield networks Personal Area Networks (PAN) Disaster and rescue operation Peer to peer networks
Challenges
Limited wireless transmission range Broadcast nature of the wireless medium Packet losses due to transmission errors Mobility-induced route changes Mobility-induced packet losses Battery constraints Potentially frequent network partitions Ease of snooping on wireless transmissions (security hazard)
Uses DSDV as an underlying protocol and Least Cluster Change (LCC) clustering algorithm A cluster-head is able to control a group of ad-hoc hosts Each node maintains 2 tables:
1.
2.
A cluster member table, containing the cluster head for each destination node A DV-routing table, containing the next hop to the destination
Lookup of the cluster-head of the destination node Lookup of next hop Packet send to destination Destination: cluster-head delivers packet
CGSR
CGSR
Drawbacks: Too frequent cluster head selection can be an overhead and cluster nodes and Gateway can be a bottleneck
Table-based protocol with the goal of maintaining routing information among all nodes in the network Each node is responsible for four tables:
Distance table Routing table Link-cost table Message retransmission list (MRL) table
Link exchanges are propagated using update messages sent between neighboring nodes Hello messages are periodically exchanged between neighbors This protocol avoids count-to-infinity problem by forcing each node to check predecessor information Drawbacks: 4 tables requires a large amount of memory and periodic hello message consumes power and bandwidth
Based on the concept of source routing Mobile nodes are required to maintain route caches that contain the source routes of which the mobile is aware 2 major phases:
Route discovery uses route request and route reply packets Route maintenance uses route error packets and acknowledgments
Advantages: No periodic hello message and fast recovery - cache can store multiple paths to a destination Drawbacks: the packets m ay be forwarded along stale cached routes. It has a major scalability problem due to the nature of source routing. Same as AODV, nodes use the routing caches to reply to route queries
N1-N2
N2 N5
N1-N2-N5
N8
N7
N1 N4 N1-N3 N1 N1-N3-N4 N6 N3 N1-N3-N4-N6
N5
N1-N2-N5-N8 Source
N7 N1
N4
N6 N3
basic functions:
Route creation Route maintenance Route erasure
provides loop free paths at all instants and multiple routes so that if one path is not available, other is readily available. It establishes routes quickly so that they may be used before the topology changes. Drawbacks: exhibits instability behavior similar to "count-to-infinity" problem in distance vector routing protocols.
ABR
If node A has in his Route Cache a route to the destination E, this route is immediately used. If not, the Route Discovery protocol is started
ABR
ABR
Advantages: free from duplicate packets Drawbacks: Short beaconing interval to reflect association degree precisely
SBR
DRP is responsible for maintenance of signal stability table and routing table SRP processes packets by passing the packets up the stack if it is the intended receiver and forwarding the packet if it is not Advantages: to select strong connection leads to fewer route reconstruction Drawbacks: long delay since intermediate nodes cant answer the path (unlike AODV, DSR)
Contention free MAC TDMA,FDMA,CDMA divides the channel by time, frequency and code. Contention based MAC Nodes compete to access the shared medium (channel) through random access
CLASSIFICATION
DBMA (Dual busy tone multiple access), Multichannel CSMA MAC protocol, etc.
MACA
If node A wants to transmit to B, it first sends an RTS packet to B, indicating the length of the data transmission to follow B returns A a CTS packet with the expected length of the transmission A starts transmission when it receives CTS
A neighboring node overhearing an RTS defers its own transmission until the corresponding CTS would have been finished A node hearing the CTS defers for the expected length of the data transmission
Contd..
MACA can handle hidden node & exposed node problems unsolved by CSMA
Hidden node: A sends to B; C sends to B -> Collision at B -> In MACA, B sends CTS to A; C can hear the CTS & defer its own transmission to B in MACA Exposed node: B sends to A; C unnecessarily delays transmission to B -> In MACA, C can overhear Bs RTS sent to A but C cannot hear CTS from A; So, C transmits to B
Contd..
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
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
Very popular wireless MAC protocol Two modes: DCF (distributed coordination function) & PCF (point coordination function) DCF is based on CSMA/CA CSMA + MACA
RTS-CTS-DATA-ACK Physical carrier sensing + NAV (network allocation vector) containing time value that indicates the duration up to which the medium is expected to be busy due to transmissions by other nodes Every packet contains the duration info for the remainder of the message Every node overhearing a packet continuously updates its own NAV
MACA-BI
Receiver initiated Reduce number of control packets
Receiver needs a traffic prediction algorithm Works well given predictable traffic patterns
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
RT nodes jam the channel in proportion to waiting time Observe the channel Node with the longest jam transmits
Use reserved time slots to provide bounded & required bandwidth for RT traffic; Non-RT traffic is treated like 802.11
SECURITY GOALS
Authentication Confidentiality Integrity Freshness Access control Privacy
Passive Attacks Eavedropping Traffic analysis i) traffic analysis at the physical layer ii) traffic analysis at the MAC layer iii) Traffic analysis by event correlation Active Attacks Physical i) Tampering and ii) EMI Masquerade, Message modification Denial of service
Networking regime
Traffic