Mixed Integer Programming Model of MCCA-aware Acknowledging in Wireless Mesh Networks
Author
Summary, in English
The paper investigates advantages of using an
MCCA-aware acknowledging system in IEEE 802.11s Wireless
Mesh Networks (WMN). The MCCA (MCF controlled channel
access) protocol allows for reserving time slots for a point-topoint
transmission over a wireless link. The protocol assures
that the transmission will not be hindered by any other 802.11
device that uses MCCA, by preventing all neighbors of both
sender and receiver from accessing the medium or accepting
reservations during the reserved time window. Communication
in the reserved time window is bidirectional, as it consists of data
frames sent by the sender and ACK frames sent by the receiver.
In the paper, benefits of using separate time window reservations
for the data frames and the ACK frames are presented and
confirmed numerically.
MCCA-aware acknowledging system in IEEE 802.11s Wireless
Mesh Networks (WMN). The MCCA (MCF controlled channel
access) protocol allows for reserving time slots for a point-topoint
transmission over a wireless link. The protocol assures
that the transmission will not be hindered by any other 802.11
device that uses MCCA, by preventing all neighbors of both
sender and receiver from accessing the medium or accepting
reservations during the reserved time window. Communication
in the reserved time window is bidirectional, as it consists of data
frames sent by the sender and ACK frames sent by the receiver.
In the paper, benefits of using separate time window reservations
for the data frames and the ACK frames are presented and
confirmed numerically.
Department/s
Publishing year
2012
Language
English
Pages
17-22
Publication/Series
[Host publication title missing]
Document type
Conference paper
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
Polish Teletraffic Symposium 2012 (PTS 2012)
Conference date
2012-12-05
Conference place
Zakopane, Poland
Status
Published
ISBN/ISSN/Other
- ISBN: 978-83-62652-45-7