Routing and uplink-downlink scheduling in ad hoc CDMA networks

A. Neishaboori, George Kesidis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Communications, ICC 2006
Pages926-931
Number of pages6
Volume2
DOIs
StatePublished - 2006
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: Jul 11 2006Jul 15 2006

Other

Other2006 IEEE International Conference on Communications, ICC 2006
CountryTurkey
CityIstanbul
Period7/11/067/15/06

Fingerprint

Code division multiple access
Scheduling
Routing algorithms
Power control
Quality of service
Bandwidth

All Science Journal Classification (ASJC) codes

  • Media Technology

Cite this

Neishaboori, A., & Kesidis, G. (2006). Routing and uplink-downlink scheduling in ad hoc CDMA networks. In 2006 IEEE International Conference on Communications, ICC 2006 (Vol. 2, pp. 926-931). [4024247] https://doi.org/10.1109/ICC.2006.254826
Neishaboori, A. ; Kesidis, George. / Routing and uplink-downlink scheduling in ad hoc CDMA networks. 2006 IEEE International Conference on Communications, ICC 2006. Vol. 2 2006. pp. 926-931
@inproceedings{9fe5b558720445259441fbfd7a9e0c65,
title = "Routing and uplink-downlink scheduling in ad hoc CDMA networks",
abstract = "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.",
author = "A. Neishaboori and George Kesidis",
year = "2006",
doi = "10.1109/ICC.2006.254826",
language = "English (US)",
isbn = "1424403553",
volume = "2",
pages = "926--931",
booktitle = "2006 IEEE International Conference on Communications, ICC 2006",

}

Neishaboori, A & Kesidis, G 2006, Routing and uplink-downlink scheduling in ad hoc CDMA networks. in 2006 IEEE International Conference on Communications, ICC 2006. vol. 2, 4024247, pp. 926-931, 2006 IEEE International Conference on Communications, ICC 2006, Istanbul, Turkey, 7/11/06. https://doi.org/10.1109/ICC.2006.254826

Routing and uplink-downlink scheduling in ad hoc CDMA networks. / Neishaboori, A.; Kesidis, George.

2006 IEEE International Conference on Communications, ICC 2006. Vol. 2 2006. p. 926-931 4024247.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Routing and uplink-downlink scheduling in ad hoc CDMA networks

AU - Neishaboori, A.

AU - Kesidis, George

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

VL - 2

SP - 926

EP - 931

BT - 2006 IEEE International Conference on Communications, ICC 2006

ER -

Neishaboori A, Kesidis G. Routing and uplink-downlink scheduling in ad hoc CDMA networks. In 2006 IEEE International Conference on Communications, ICC 2006. Vol. 2. 2006. p. 926-931. 4024247 https://doi.org/10.1109/ICC.2006.254826