Wireless mesh networks based on CDMA

被引:4
作者
Neishaboori, A. [1 ]
Kesidis, G.
机构
[1] Penn State Univ, CSE Dept, University Pk, PA 16802 USA
基金
美国国家科学基金会;
关键词
wireless mesh networks; CDMA; scheduling; contention; integration framework;
D O I
10.1016/j.comcom.2008.01.020
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1513 / 1528
页数:16
相关论文
共 59 条
  • [31] KESIDIS G, 2007, INTRO ANAL COMMUNICA
  • [32] KLEINROCK L, 1987, P IEEE
  • [33] KNIGHTLY E, 2007, URBAN MESH NETWORKS
  • [34] KYASANUR P, 2005, P ACM MOBICOM SEP
  • [35] LEE JW, 2005, IEEE ACM T NETW
  • [36] Li Y.-C., 2005, P 38 ANN HAWAII INT, p157b
  • [37] LIN CHR, 1997, P IEEE INFOCOM KOB J
  • [38] Luenberger DG., 2015, LINEAR NONLINEAR PRO
  • [39] MAKANSI T, 1987, TRANSMITTER ORIENTED
  • [40] MITTAL K, 2006, 2 IEEE WORKSH WIR ME