Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
Author(s) -
Changhee Joo,
Xiaojun Lin,
Ness B. Shroff
Publication year - 2008
Publication title -
2008 proceedings ieee infocom - the 27th conference on computer communications
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1109/infocom.2007.165
Subject(s) - pooling , network topology , wireless network , computer science , scheduling (production processes) , hop (telecommunications) , upper and lower bounds , greedy algorithm , topology (electrical circuits) , graph theory , wireless , algorithm , distributed computing , mathematical optimization , mathematics , computer network , combinatorics , telecommunications , mathematical analysis , artificial intelligence
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom