TY - GEN
T1 - Routing and uplink-downlink scheduling in ad hoc CDMA networks
AU - Neishaboori, A.
AU - Kesidis, G.
PY - 2006
Y1 - 2006
N2 - In multihop ad hoc CDMA networks, uplink-downlink schedules are needed to forward packet flows throughout the network without conflict. Also, a routing algorithm and a power control mechanism are required to route the flows while satisfying the QoS needs of the users. Tb maximize bandwidth utilization efficiency, scheduling tables of minimum length are desired. We suggest an incremental contention-based algorithm as a heuristic distributed solution to the NP-hard uplink-downlink scheduling problem. Also, we propose a routing strategy that considers these schedules, i.e., integrated routing and scheduling.
AB - In multihop ad hoc CDMA networks, uplink-downlink schedules are needed to forward packet flows throughout the network without conflict. Also, a routing algorithm and a power control mechanism are required to route the flows while satisfying the QoS needs of the users. Tb maximize bandwidth utilization efficiency, scheduling tables of minimum length are desired. We suggest an incremental contention-based algorithm as a heuristic distributed solution to the NP-hard uplink-downlink scheduling problem. Also, we propose a routing strategy that considers these schedules, i.e., integrated routing and scheduling.
UR - http://www.scopus.com/inward/record.url?scp=42549137983&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=42549137983&partnerID=8YFLogxK
U2 - 10.1109/ICC.2006.254826
DO - 10.1109/ICC.2006.254826
M3 - Conference contribution
AN - SCOPUS:42549137983
SN - 1424403553
SN - 9781424403554
T3 - IEEE International Conference on Communications
SP - 926
EP - 931
BT - 2006 IEEE International Conference on Communications, ICC 2006
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2006 IEEE International Conference on Communications, ICC 2006
Y2 - 11 July 2006 through 15 July 2006
ER -