Performance evaluation of an intention sharing MAC scheme in wireless LANs with hidden nodes
Fitzgerald, Emma LU
and Pioro, Michal
LU
(2016)
17th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)
- Abstract
We have previously presented Intent, a medium access control scheme for WLANs based on cooperative, distributed, non-binding frame scheduling. The main idea behind Intent is intention sharing - a mechanism that allows a node to be aware of transmissions previously scheduled by its neighbors. We now extend this scheme to networks with hidden nodes. We give a formulation of the scheduling problem and solve for the optimal solution using mixed-integer programming in a range of scenarios covering both mesh and infrastructure networks of varying density. We also provide an algorithmic solution and perform simulations using four variants of this, comparing the results with both the optimal solution and standard 802.11. Our algorithmic... (More)
We have previously presented Intent, a medium access control scheme for WLANs based on cooperative, distributed, non-binding frame scheduling. The main idea behind Intent is intention sharing - a mechanism that allows a node to be aware of transmissions previously scheduled by its neighbors. We now extend this scheme to networks with hidden nodes. We give a formulation of the scheduling problem and solve for the optimal solution using mixed-integer programming in a range of scenarios covering both mesh and infrastructure networks of varying density. We also provide an algorithmic solution and perform simulations using four variants of this, comparing the results with both the optimal solution and standard 802.11. Our algorithmic solution gives significantly better performance than 802.11 and comes within 1.1 times optimal performance when full, two-hop scheduling information is available. In addition, we show that it is not necessary to exchange complete scheduling information in order to perform distributed scheduling effectively but rather a conflict resolution or avoidance mechanism combined with non-binding schedules allows for similar performance with only a single round of information exchange between neighbouring nodes.
(Less)
- author
- Fitzgerald, Emma
LU
and Pioro, Michal
LU
- organization
- publishing date
- 2016-07-26
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- 802.11, cooperative scheduling, MAC, optimisation, WLAN
- host publication
- WoWMoM 2016 - 17th International Symposium on a World of Wireless, Mobile and Multimedia Networks
- article number
- 7523501
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 17th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)
- conference location
- Coimbra, Portugal
- conference dates
- 2016-06-21 - 2016-06-24
- external identifiers
-
- scopus:84983739054
- ISBN
- 9781509021857
- DOI
- 10.1109/WoWMoM.2016.7523501
- project
- ELLIIT LU P01: WP2 Networking solutions
- language
- English
- LU publication?
- yes
- id
- 132cd7b2-97db-48a7-8af2-8c89cceb189c
- date added to LUP
- 2016-12-19 15:28:50
- date last changed
- 2022-01-30 08:38:06
@inproceedings{132cd7b2-97db-48a7-8af2-8c89cceb189c,
abstract = {{<p>We have previously presented Intent, a medium access control scheme for WLANs based on cooperative, distributed, non-binding frame scheduling. The main idea behind Intent is intention sharing - a mechanism that allows a node to be aware of transmissions previously scheduled by its neighbors. We now extend this scheme to networks with hidden nodes. We give a formulation of the scheduling problem and solve for the optimal solution using mixed-integer programming in a range of scenarios covering both mesh and infrastructure networks of varying density. We also provide an algorithmic solution and perform simulations using four variants of this, comparing the results with both the optimal solution and standard 802.11. Our algorithmic solution gives significantly better performance than 802.11 and comes within 1.1 times optimal performance when full, two-hop scheduling information is available. In addition, we show that it is not necessary to exchange complete scheduling information in order to perform distributed scheduling effectively but rather a conflict resolution or avoidance mechanism combined with non-binding schedules allows for similar performance with only a single round of information exchange between neighbouring nodes.</p>}},
author = {{Fitzgerald, Emma and Pioro, Michal}},
booktitle = {{WoWMoM 2016 - 17th International Symposium on a World of Wireless, Mobile and Multimedia Networks}},
isbn = {{9781509021857}},
keywords = {{802.11; cooperative scheduling; MAC; optimisation; WLAN}},
language = {{eng}},
month = {{07}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Performance evaluation of an intention sharing MAC scheme in wireless LANs with hidden nodes}},
url = {{http://dx.doi.org/10.1109/WoWMoM.2016.7523501}},
doi = {{10.1109/WoWMoM.2016.7523501}},
year = {{2016}},
}