MAC PROTOCOLS FOR AD HOC WIRELESS NETWORKS
Issues in designing a MAC Protocol- Classification of MAC Protocols- Contention based protocols- Contention based protocols with Reservation Mechanisms- Contention based protocols with Scheduling Mechanisms – Multi channel MAC-IEEE 802.11
Proactive routing protocol
Each node maintain a routing table.
Sequence number is used to update the topology information
Update can be done based on event driven or periodic
Observations
May be energy expensive due to high mobility of the nodes
Delay can be minimized, as path to destination is already known to all nodes.
Fisheye State Routing (FSR) - Protocol OverviewYoav Francis
Overview of the Fisheye State Routing (FSR) for cellular networks, IDC 2012
By Yoav Francis and Nir Solomon
(Part of a performance comparison of various routing algorithms in cellular networks)
Hello People.. Welcome to GURUKULA!!!
Have you ever thought that how the protocols that are required for the effective delivery of the messages from one place to anpther place take place in a real time internet..... This video explains about the concept called PROTOCOL LAYERING, where you can learn the way how the protocols are layered in such a way..
Simple examples are also used to make the concepts clean nd clear.
This video will help you to learn:
What is protocol layering in networks, OSI Model in Computer Networks, Layers of OSI Model, OSI Model, OSI Internet Module, OSI Layers and their Functions, Examples of OSI Models, 7 layers of OSI Models, Principles of Protocol Layering, Why layering the Protocols,
Thanks for Watching, Keep Supporting and Keep Sharing...
UNIT IV WIRELESS SENSOR NETWORKS (WSNS) AND MAC PROTOCOLS 9 Single node architecture: hardware and software components of a sensor node - WSN Network architecture: typical network architectures-data relaying and aggregation strategies -MAC layer protocols: self-organizing, Hybrid TDMA/FDMA and CSMA based MAC- IEEE 802.15.4.
UNIT III ROUTING PROTOCOLS AND TRANSPORT LAYER IN AD HOC WIRELESS NETWORKS -Issues in designing a routing and Transport Layer protocol for Ad hoc networks- proactive routing, reactive routing (on-demand), hybrid routing- Classification of Transport Layer solutions-TCP over Ad hoc wireless Networks.
Proactive routing protocol
Each node maintain a routing table.
Sequence number is used to update the topology information
Update can be done based on event driven or periodic
Observations
May be energy expensive due to high mobility of the nodes
Delay can be minimized, as path to destination is already known to all nodes.
Fisheye State Routing (FSR) - Protocol OverviewYoav Francis
Overview of the Fisheye State Routing (FSR) for cellular networks, IDC 2012
By Yoav Francis and Nir Solomon
(Part of a performance comparison of various routing algorithms in cellular networks)
Hello People.. Welcome to GURUKULA!!!
Have you ever thought that how the protocols that are required for the effective delivery of the messages from one place to anpther place take place in a real time internet..... This video explains about the concept called PROTOCOL LAYERING, where you can learn the way how the protocols are layered in such a way..
Simple examples are also used to make the concepts clean nd clear.
This video will help you to learn:
What is protocol layering in networks, OSI Model in Computer Networks, Layers of OSI Model, OSI Model, OSI Internet Module, OSI Layers and their Functions, Examples of OSI Models, 7 layers of OSI Models, Principles of Protocol Layering, Why layering the Protocols,
Thanks for Watching, Keep Supporting and Keep Sharing...
UNIT IV WIRELESS SENSOR NETWORKS (WSNS) AND MAC PROTOCOLS 9 Single node architecture: hardware and software components of a sensor node - WSN Network architecture: typical network architectures-data relaying and aggregation strategies -MAC layer protocols: self-organizing, Hybrid TDMA/FDMA and CSMA based MAC- IEEE 802.15.4.
UNIT III ROUTING PROTOCOLS AND TRANSPORT LAYER IN AD HOC WIRELESS NETWORKS -Issues in designing a routing and Transport Layer protocol for Ad hoc networks- proactive routing, reactive routing (on-demand), hybrid routing- Classification of Transport Layer solutions-TCP over Ad hoc wireless Networks.
UNIT II MEDIA ACCESS & INTERNETWORKING 9
Media access control – Ethernet (802.3) – Wireless LANs – 802.11 – Bluetooth – Switching and bridging – Basic Internetworking (IP, CIDR, ARP, DHCP,ICMP )
UNIT I FUNDAMENTALS & LINK LAYER 9
Building a network – Requirements – Layering and protocols – Internet Architecture – Network software – Performance ; Link layer Services – Framing – Error Detection – Flow control
UNIT I INTRODUCTION 7
Examples of Distributed Systems–Trends in Distributed Systems – Focus on resource sharing – Challenges. Case study: World Wide Web.
UNIT II COMMUNICATION IN DISTRIBUTED SYSTEM 10
System Model – Inter process Communication – the API for internet protocols – External data representation and Multicast communication. Network virtualization: Overlay networks. Case study: MPI Remote Method Invocation And Objects: Remote Invocation – Introduction – Request-reply protocols – Remote procedure call – Remote method invocation. Case study: Java RMI – Group communication – Publish-subscribe systems – Message queues – Shared memory approaches – Distributed objects – Case study: Enterprise Java Beans -from objects to components.
Mobile Device Operating Systems – Special Constrains & Requirements – Commercial Mobile Operating Systems – Software Development Kit: iOS, Android, BlackBerry, Windows Phone – M-Commerce – Structure – Pros & Cons – Mobile Payment System – Security Issues.
Distributed contention based mac protocol for cognitive radioIffat Anjum
Introduction
System Model
DC-MAC Design
Network Initialization
DC-MAC Working
Data Transfer on Home Channel
Data Transfer on a Foreign Channel
Performance Analysis
Conclusion
References
MODULE III Parallel Processors and Memory Organization 15 Hours
Parallel Processors: Introduction to parallel processors, Concurrent access to memory and cache
coherency. Introduction to multicore architecture. Memory system design: semiconductor memory
technologies, memory organization. Memory interleaving, concept of hierarchical memory
organization, cache memory, cache size vs. block size, mapping functions, replacement
algorithms, write policies.
Case Study: Instruction sets of some common CPUs - Design of a simple hypothetical CPU- A
sequential Y86-64 design-Sun Ultra SPARC II pipeline structure
MODULE II Control unit, I/O systems and Pipelining 15 Hours
CPU control unit design: Hardwired and micro-programmed design approaches, Peripheral
devices and their characteristics: Input-output subsystems, I/O device interface, I/O transfersprogram controlled, interrupt driven and DMA, privileged and non-privileged instructions, software
interrupts and exceptions. Programs and processes-role of interrupts in process state transitions,
I/O device interfaces - SCII, USB. Basic concepts of pipelining, throughput and speedup, pipeline
hazards.
Functional Blocks of a Computer: Functional blocks and its operations. Instruction set architecture of a CPU - registers, instruction execution cycle, Data path, RTL interpretation of
instructions, instruction set. Performance metrics. Addressing modes. Data Representation:
Signed number representation, fixed and floating point representations, character representation.
Computer arithmetic - integer addition and subtraction, ripple carry adder, carry look-ahead
adder, etc. multiplication - shift-and add, Booth multiplier, carry save multiplier, etc. Division
restoring and non-restoring techniques, floating point arithmetic.
Module II - Distributed objects and file systems:
Introduction - Communication between distributed objects - Remote procedure call - Events and notifications - case study - Operating system support - introduction - operating system layer - protection - process and threads - communication and invocation - architecture - Introduction to DFS - File service architecture - Sun network file system - Andrew file system - Enhancements and future developments.
Module 2 - Distributed Objects and File Systems
Introduction - Communication between distributed objects - Remote procedure call - Events and notifications - case study - Operating system support - introduction - operating system layer - protection - process and threads - communication and invocation - architecture - Introduction to DFS - File service architecture - Sun network file system - Andrew file system - Enhancements and future developments.
Module I
Introduction to Distributed systems - Examples of distributed systems, resource sharing and the web, challenges - System model - introduction - architectural models - fundamental models - Introduction to inter-process communications - API for Internet protocol - external data.
Module I
Introduction to Distributed systems - Examples of distributed systems, resource sharing and the web, challenges - System model - introduction - architectural models - fundamental models - Introduction to inter-process communications - API for Internet protocol - external data.
Module 6: IP and System Security
IP security overview-IP security policy-Encapsulating Security payload-intruders-intrusion detectionvirus/worms-countermeasure-need for firewalls-firewall characteristics-types of fire
Module 4: Key Management and User Authentication
X.509 certificates- Public Key infrastructure-remote user authentication principles-remote user
authentication using symmetric and asymmetric encryption-Kerberos V5
Module 1: Introduction to Cryptography and Symmetric Key Ciphers
Computer Security Concepts - OSI Security Architecture -Security Attacks - Services, Mechanisms -
Symmetric Cipher Model - Traditional Block Cipher Structure - The Data Encryption Standard -The Strength of DES - Advanced Encryption Standard.
Module 6
Advanced Networking
Security problems with internet architecture, Introduction to Software defined networking, Working of SDN, SDN in data centre, SDN applications, Data centre networking, IoT.
Module 6: Standards for Information Security Management
Information Security Management Systems (ISMS) - ISO 27001 - Framing Security Policy of
Organization- Committees- Security Forum, Core Committee, Custodian and Users, Business
Continuity Process Team & Procedure- Information Security Auditing Process. IT Security Incidents
HEAP SORT ILLUSTRATED WITH HEAPIFY, BUILD HEAP FOR DYNAMIC ARRAYS.
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and place the minimum element at the beginning. Repeat the same process for the remaining elements.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
TOP 10 B TECH COLLEGES IN JAIPUR 2024.pptxnikitacareer3
Looking for the best engineering colleges in Jaipur for 2024?
Check out our list of the top 10 B.Tech colleges to help you make the right choice for your future career!
1) MNIT
2) MANIPAL UNIV
3) LNMIIT
4) NIMS UNIV
5) JECRC
6) VIVEKANANDA GLOBAL UNIV
7) BIT JAIPUR
8) APEX UNIV
9) AMITY UNIV.
10) JNU
TO KNOW MORE ABOUT COLLEGES, FEES AND PLACEMENT, WATCH THE FULL VIDEO GIVEN BELOW ON "TOP 10 B TECH COLLEGES IN JAIPUR"
https://www.youtube.com/watch?v=vSNje0MBh7g
VISIT CAREER MANTRA PORTAL TO KNOW MORE ABOUT COLLEGES/UNIVERSITITES in Jaipur:
https://careermantra.net/colleges/3378/Jaipur/b-tech
Get all the information you need to plan your next steps in your medical career with Career Mantra!
https://careermantra.net/
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
1. CS6003 ADHOC & SENSOR
NETWORKS
UNIT – II
Dr.A.Kathirvel, Professor and Head, Dept of CSE
Anand Institute of Higher Technology, Chennai
2. Unit - II
MAC PROTOCOLS FOR AD HOC WIRELESS
NETWORKS
Issues in designing a MAC Protocol- Classification of MAC
Protocols- Contention based protocols- Contention based
protocols with Reservation Mechanisms- Contention
based protocols with Scheduling Mechanisms – Multi
channel MAC-IEEE 802.11
2
3. 3
Issues
The main issues need to be addressed while designing a
MAC protocol for ad hoc wireless networks:
Bandwidth efficiency is defined at the ratio of the
bandwidth used for actual data transmission to the total
available bandwidth. The MAC protocol for ad-hoc
networks should maximize it.
Quality of service support is essential for time-
critical applications. The MAC protocol for ad-hoc
networks should consider the constraint of ad-hoc
networks.
Synchronization can be achieved by exchange of
control packets.
4. 4
Issues
The main issues need to be addressed while designing a MAC protocol for ad
hoc wireless networks:
Hidden and exposed terminal problems:
Hidden nodes:
Hidden stations: Carrier sensing may fail to detect another station.
For example, A and D.
Fading: The strength of radio signals diminished rapidly with the
distance from the transmitter. For example, A and C.
Exposed nodes:
Exposed stations: B is sending to A. C can detect it. C might want to
send to E but conclude it cannot transmit because C hears B.
Collision masking: The local signal might drown out the remote
transmission.
Error-Prone Shared Broadcast Channel
Distributed Nature/Lack of Central Coordination
Mobility of Nodes: Nodes are mobile most of the time.
5. A)THE HIDDEN STATION PROBLEM. (B) THE EXPOSED STATION PROBLEM.
Hidden & exposed terminal problem
5
6. 6
The Hidden Terminal Problem
Wireless stations have transmission ranges
and not all stations are within radio range of
each other.
Simple CSMA will not work!
C transmits to B.
If A “senses” the channel, it will not hear
C’s transmission and falsely conclude that A
can begin a transmission to B.
7. 7
The Exposed Station Problem
The inverse problem.
B wants to send to C and listens to the
channel.
When B hears A’s transmission, B falsely
assumes that it cannot send to C.
9. 9
Design goals of a MAC Protocol
Design goals of a MAC protocol for ad hoc wireless
networks
The operation of the protocol should be distributed.
The protocol should provide QoS support for real-
time traffic.
The access delay, which refers to the average delay
experienced by any packet to get transmitted, must be
kept low.
The available bandwidth must be utilized efficiently.
The protocol should ensure fair allocation of
bandwidth to nodes.
10. 10
Design goals of a MAC Protocol
Control overhead must be kept as low as possible.
The protocol should minimize the effects of hidden
and exposed terminal problems.
The protocol must be scalable to large networks.
It should have power control mechanisms.
The protocol should have mechanisms for adaptive
data rate control.
It should try to use directional antennas.
The protocol should provide synchronization among
nodes.
11. 11
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
12. 12
Classifications of MAC protocols
MAC Protocols for Ad Hoc
Wireless Networks
Contention-Based
Protocols
Contention-based
protocols with
reservation mechanisms
Other MAC
Protocols
Contention-based
protocols with
scheduling mechanisms
Sender-Initiated
Protocols
Receiver-Initiated
Protocols
Synchronous
Protocols
Asynchronous
Protocols
Single-Channel
Protocols
Multichannel
Protocols
MACAW
FAMA
BTMA
DBTMA
ICSMA
RI-BTMA
MACA-BI
MARCH
D-PRMA
CATA
HRMA
RI-BTMA
MACA-BI
MARCH
SRMA/PA
FPRP
MACA/PR
RTMAC
Directional
Antennas
MMAC
MCSMA
PCM
RBAR
13. 13
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.
14. 14
Classifications of MAC Protocols
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.
15. 15
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.
16. 16
Contention-based protocols
MACAW: A Media Access Protocol for
Wireless LANs is based on MACA (Multiple
Access Collision Avoidance) Protocol
MACA
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.
17. 17
Contention-based protocols
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.
The problem is solved by MACAW.
19. 19
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
MACA examples
A B C
RTS
CTSCTS
20. 20
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
MACA examples
A B C
RTS
CTS
RTS
21. 21
MACAW
Variants of this method can be found in IEEE 802.11
as DFWMAC (Distributed Foundation Wireless
MAC),
MACAW (MACA for Wireless) is a revision of
MACA.
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.
22. 22
MACAW
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.
23. 23
MACA variant:DFWMAC in 802.11
idle
wait for the
right to send
wait for ACK
sender receiver
packet ready to send; RTS
time-out;
RTS
CTS; data
ACK
RxBusy
idle
wait for
data
RTS; RxBusy
RTS;
CTS
data;
ACK
time-out
data;
NAK
ACK: positive acknowledgement
NAK: negative acknowledgement
RxBusy: receiver busy
time-out
NAK;
RTS
24. 24
Contention-based protocols
Floor acquisition Multiple Access Protocols
(FAMA)
Based on a channel access discipline which consists
of a carrier-sensing operation and a collision-
avoidance dialog between the sender and the intended
receiver of a packet.
Floor acquisition refers to the process of gaining
control of the channel.
At any time only one node is assigned to use the
channel.
25. 25
Contention-based protocols
Carrier-sensing by the sender, followed by the RTS-
CTS control packet exchange, enables the protocol to
perform as efficiently as MACA.
Two variations of FAMA
RTS-CTS exchange with no carrier-sensing uses the
ALOHA protocol for transmitting RTS packets.
RTS-CTS exchange with non-persistent carrier-
sensing uses non-persistent CSMA for the same
purpose.
26. 26
Contention-based protocols
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.
27. 27
Contention-based protocols
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.
28. 28
Contention-based protocols
Receiver-Initiated Busy Tone Multiple Access Protocol
(RI-BTMA)
The transmission channel is split into two:
a data channel for data packet transmissions
a control channel used for transmitting the busy
tone signal
A node can transmit on the data channel only if it
finds the busy tone to be absent on the control
channel.
The data packet is divided into two portions: a
preamble and the actual data packet.
29. 29
Contention-based protocols
MACA-By Invitation (MACA-BI) is a receiver-
initiated MAC protocol.
By eliminating the need for the RTS packet it
reduces the number of control packets used in
the MACA protocol which uses the three-way
handshake mechanism.
Media Access with Reduced Handshake
(MARCH) is a receiver-initiated protocol.
30. 30
Contention-based Protocols with
Reservation Mechanisms
Contention-based Protocols with Reservation
Mechanisms
Contention occurs during the resource (bandwidth)
reservation phase.
Once the bandwidth is reserved, the node gets
exclusive access to the reserved bandwidth.
QoS support can be provided for real-time traffic.
31. 31
Contention-based Protocols with
Reservation Mechanisms
Distributed packet reservation multiple access protocol
(D-PRMA)
It extends the centralized packet reservation multiple
access (PRMA) scheme into a distributed scheme that
can be used in ad hoc wireless networks.
PRMA was designed in a wireless LAN with a base
station.
D-PRMA extends PRMA protocol in a wireless
LAN.
D-PRMA is a TDMA-based scheme. The channel is
divided into fixed- and equal-sized frames along the
time axis.
32. 32
Access method DAMA: Reservation-
TDMA
Reservation Time Division Multiple Access
every frame consists of N mini-slots and x data-slots
every station has its own mini-slot and can reserve up to k
data-slots using this mini-slot (i.e. x = N * k).
other stations can send data in unused data-slots according to a
round-robin sending scheme (best-effort traffic)
N mini-slots N * k data-slots
reservations
for data-slots
other stations can use free data-slots
based on a round-robin scheme
e.g. N=6, k=2
33. 33
Distributed Packet Reservation
Multiple Access Protocol (D-PRMA)
Implicit reservation (PRMA - Packet
Reservation Multiple Access)
frame1
frame2
frame3
frame4
frame5
1 2 3 4 5 6 7 8 time-slot
collision at
reservation
attempts
A C D A B A F
A C A B A
A B A F
A B A F D
A C E E B A F D
t
ACDABA-F
ACDABA-F
AC-ABAF-
A---BAFD
ACEEBAFD
reservation
33
34. Distributed Packet Reservation
Multiple Access Protocol (D-PRMA)
a certain number of slots form a frame, frames are
repeated
stations compete for empty slots according to the
slotted aloha principle
once a station reserves a slot successfully, this slot is
automatically assigned to this station in all following
frames as long as the station has data to send
competition for this slots starts again as soon as the
slot was empty in the last frame
34
35. 35
Contention-based protocols
with Reservation Mechanisms
Collision avoidance time allocation protocol (CATA)
based on dynamic topology-dependent transmission
scheduling
Nodes contend for and reserve time slots by means
of a distributed reservation and handshake
mechanism.
Support broadcast, unicast, and multicast
transmissions.
36. 36
Contention-based protocols
with Reservation Mechanisms
The operation is based on two basic principles:
The receiver(s) of a flow must inform the potential source
nodes about the reserved slot on which it is currently
receiving packets. The source node must inform the
potential destination node(s) about interferences in the
slot.
Usage of negative acknowledgements for reservation
requests, and control packet transmissions at the beginning
of each slot, for distributing slot reservation information to
senders of broadcast or multicast sessions.
37. 37
Contention-based protocols
with Reservation Mechanisms
Hop reservation multiple access protocol (HRMA)
a multichannel MAC protocol which is based on
half-duplex, very slow frequency-hopping spread
spectrum (FHSS) radios
uses a reservation and handshake mechanism to
enable a pair of communicating nodes to reserve a
frequency hop, thereby guaranteeing collision-free
data transmission.
can be viewed as a time slot reservation protocol
where each time slot is assigned a separate frequency
channel.
38. 38
Contention-based protocols
with Reservation Mechanisms
Soft reservation multiple access with priority
assignment (SRMA/PA)
Developed with the main objective of
supporting integrated services of real-time and
non-real-time application in ad hoc networks,
at the same time maximizing the statistical
multiplexing gain.
Nodes use a collision-avoidance handshake
mechanism and a soft reservation mechanism.
39. 39
Five-Phase Reservation Protocol (FPRP)
a single-channel time division multiple access
(TDMA)-based broadcast scheduling protocol.
Nodes uses a contention mechanism in order to
acquire time slots.
The protocol assumes the availability of global time
at all nodes.
The reservation takes five phases: reservation,
collision report, reservation confirmation, reservation
acknowledgement, and packing and elimination
phase.
Contention-based protocols
with Reservation Mechanisms
40. 40
MACA with Piggy-Backed Reservation (MACA/PR)
Provide real-time traffic support in multi-hop
wireless networks
Based on the MACAW protocol with non-persistent
CSMA
The main components of MACA/PR are:
A MAC protocol
A reservation protocol
A QoS routing protocol
Contention-based protocols
with Reservation Mechanisms
41. 41
Real-Time Medium Access Control Protocol (RTMAC)
Provides a bandwidth reservation mechanism for
supporting real-time traffic in ad hoc wireless networks
RTMAC has two components
A MAC layer protocol is a real-time extension of the
IEEE 802.11 DCF.
A medium-access protocol for best-effort traffic
A reservation protocol for real-time traffic
A QoS routing protocol is responsible for end-to-end
reservation and release of bandwidth resources.
Contention-based protocols
with Reservation Mechanisms
42. 42
Protocols in this category focus on packet
scheduling at the nodes and transmission
scheduling of the nodes.
The factors that affects scheduling decisions
Delay targets of packets
Traffic load at nodes
Battery power
Contention-based protocols
with Scheduling Mechanisms
43. 43
Distributed priority scheduling and medium
access in Ad Hoc Networks present two
mechanisms for providing quality of service
(QoS)
Distributed priority scheduling (DPS) – piggy-backs
the priority tag of a node’s current and head-of-line
packets o the control and data packets
Multi-hop coordination – extends the DPS scheme to
carry out scheduling over multi-hop paths.
Contention-based protocols
with Scheduling Mechanisms
44. 44
Distributed Wireless Ordering Protocol (DWOP)
A media access scheme along with a scheduling
mechanism
Based on the distributed priority scheduling scheme
Contention-based protocols
with Scheduling Mechanisms
45. 45
Distributed Laxity-based Priority Scheduling (DLPS)
Scheme
Scheduling decisions are made based on
The states of neighboring nodes and feed back from
destination nodes regarding packet losses
Packets are recorded based on their uniform laxity
budgets (ULBs) and the packet delivery ratios of the
flows. The laxity of a packet is the time remaining
before its deadline.
Contention-based protocols
with Scheduling Mechanisms
46. 46
MAC protocols that use directional antennas have
several advantages:
Reduce signal interference
Increase in the system throughput
Improved channel reuse
MAC protocol using directional antennas
Make use of an RTS/CTS exchange mechanism
Use directional antennas for transmitting and
receiving data packets
MAC Protocols that use directional
Antennas
47. 47
Directional Busy Tone-based MAC Protocol (DBTMA)
It uses directional antennas for transmitting the RTS,
CTS, data frames, and the busy tones.
Directional MAC Protocols for Ad Hoc Wireless
Networks
DMAC-1, a directional antenna is used for
transmitting RTS packets and omni-directional antenna
for CTS packets.
DMAC-1, both directional RTS and omni-directional
RTS transmission are used.
MAC Protocols that use directional
Antennas
48. 48
Other MAC Protocols
Multi-channel MAC Protocol (MMAC)
Multiple channels for data transmission
There is no dedicated control channel.
Based on channel usage channels can be classified into three types: high
preference channel (HIGH), medium preference channel (MID), low
preference channel (LOW)
Multi-channel CSMA MAC Protocol (MCSMA)
The available bandwidth is divided into several channels
Power Control MAC Protocol (PCM) for Ad Hoc Networks
Allows nodes to vary their transmission power levels on a per-packet basis
Receiver-based Autorate Protocol (RBAR)
Use a rate adaptation approach
Interleaved Carrier-Sense Multiple Access Protocol (ICSMA)
The available bandwidth is split into tow equal channels
The handshaking process is interleaved between the two channels.
49. What is IEEE 802.11?
Standard for wireless local area networks (wireless
LANs) developed in 1990 by IEEE
Intended for home or office use (primarily indoor)
802.11 standard describes the MAC layer, while
other substandards (802.11a, 802.11b) describe the
physical layer
Wireless version of the Ethernet (802.3) standard
49
50. Network Setup
Ethernet
MT
AP AP AP
MT MT
Basic Network Setup is Cellular
Mobile Terminals (MT) connect with Access Points (AP)
Standard also supports ad-hoc networking where MT’s talk directly to MT’s
50
52. Media Access Control - Ethernet
CSMA/CD (Carrier Sense Multiple Access with Collision
Detection)
If media is sensed idle, transmit
If media is sensed busy, wait until idle and then transmit
immediately
Collisions can occur if more than one user transmits at the same
time
If a collision is detected, stop transmitting.
Reschedule transmission according to exponential backoff
Desktop System Desktop System Desktop System
Ethernet
52
53. Media Access Control (802.11)
Would like to use CSMA
Nice for bursty traffic
Make for seamless replacement of wired LANs with
wireless LANS
Use CSMA, but can’t use CD
PT/PR ratio is too high
Don’t want to waste energy on mobiles
Use Collision Avoidance instead
Don’t always start transmitting immediately after
someone else
53
54. CSMA/CA Details
SIFS (Short Interframe Space)
DIFS (Distributed Interframe Space)
Packet A ACK
B C
SIFS DIFS
Packet C ACK
SIFS DIFS
Packet B
Scenario:
B and C want to transmit, but A currently has control of medium
B randomly selects 7 slots of backoff, C selects 4 slots
C transmits first, then B
54
55. What is HIPERLAN/2?
European standard developed by ETSI/BRAN
(European Telecommunications Standards
Institute/Broadband Radio Access Networks)
Physical Layer is very similar to 802.11a
(OFDM operating in the 5 GHz spectrum)
Standard based on wireless ATM
(Asynchronous Transfer Mode)
55
56. HIPERLAN/2 MAC
BCH – Miscellaneous header
FCH – Details how the DL and UL phases will be allocated
ACH – Feedback on which resource requests were received
RCH – Random access resource request
56
58. IEEE 802.11
IEEE 802.11 is a widely accepted standard in the United
States for wireless LANs
Primarily a “cellular” random access scheme with
provisions for ad hoc networking and contention free
access
802.11b products are available now, but better to wait
for 802.11a products later this year
HIPERLAN/2 is being pushed in Europe
Wireless ATM solution for real-time traffic
Standard reflects the network topology
58