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 条
  • [1] Adya A., 2004, P IEEE BROADNETS
  • [2] AKESTER R, 2000, P LOND COMM S
  • [3] ANDREWS JG, 2005, FLEXIBILITY CD UNPUB
  • [4] [Anonymous], 1999, P WMCSA 99 2 IEEE WO
  • [5] [Anonymous], 2005, P ACM MOBICOM
  • [6] [Anonymous], 80211E IEEE
  • [7] [Anonymous], P ACM MOBICOM
  • [8] BAHL P, 2004, 80211 IEEE
  • [9] BAHL V, 2007, WIRELESS MESH NETWOR
  • [10] Bertsekas D., 1999, NONLINEAR PROGRAMMIN