TY - JOUR
T1 - Wireless mesh networks based on CDMA
AU - Neishaboori, A.
AU - Kesidis, G.
N1 - Funding Information:
This research was supported by NSF NeTS Grant 0721545.
PY - 2008/5/25
Y1 - 2008/5/25
N2 - In this paper, we study hybrid contention-free/contention-based traffic management schemes in presence of delay-sensitive and delay-insensitive data in multihop CDMA wireless mesh networks. We suggest a greedy incremental contention-based ordering algorithm for contention-free schedules and also propose a time-scale-based framework for integration of contention and contention-free traffic management schemes. Further, for the contention-free phase, we propose a power control algorithm that gives an end-to-end throughput guarantee. With the aid of simulation, we observe the additional end-to-end throughput that can be achieved when scheduling and tight power control are applied.
AB - In this paper, we study hybrid contention-free/contention-based traffic management schemes in presence of delay-sensitive and delay-insensitive data in multihop CDMA wireless mesh networks. We suggest a greedy incremental contention-based ordering algorithm for contention-free schedules and also propose a time-scale-based framework for integration of contention and contention-free traffic management schemes. Further, for the contention-free phase, we propose a power control algorithm that gives an end-to-end throughput guarantee. With the aid of simulation, we observe the additional end-to-end throughput that can be achieved when scheduling and tight power control are applied.
UR - http://www.scopus.com/inward/record.url?scp=42749092441&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=42749092441&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2008.01.020
DO - 10.1016/j.comcom.2008.01.020
M3 - Article
AN - SCOPUS:42749092441
SN - 0140-3664
VL - 31
SP - 1513
EP - 1528
JO - Computer Communications
JF - Computer Communications
IS - 8
ER -