We propose a new blind multiuser signal model and detection framework for solving the near-far problem in synchronous CDMA in this paper. Compared with existing blind detectors, the proposed framework requires a minimum number of previously received signals, which is about the number of interfering users, and no sub-space separation or sequence estimation. Hence its computation complexity and detection delay are much reduced. Following this framework, several blind multiuser detectors are developed using least squares (LS) estimation, best least unbiased (BLU) estimation and minimum mean-square error (MMSE) estimation criteria and a recursively adaptive procedure is developed for further decreasing the complexity. All these can be easily extended for asynchronous CDMA. The near-far performance of this framework and the trade-off between the complexity and performance are discussed. Computer simulations are provided to demonstrate the performance of the proposed schemes too.

We propose SWAN, a stateless network model which uses distributed control algorithms to deliver service differentiation in mobile wireless ad hoc networks in a simple, scalable and robust manner. We use rate control for UDP and TCP best-effort traffic, and sender-based admission control for UDP real-time traffic. SWAN uses explicit congestion notification (ECN) to dynamically regulate admitted real-time traffic in the face of network dynamics brought on by mobility or traffic overload conditions. We use the term "soft" real-time services to indicate that real-time sessions could be regulated or dropped due to mobility or excessive traffic overloading at mobile wireless routers. SWAN is designed to limit such conditions, however. A novel aspect of SWAN is that it does not require the support of a QOS-capable MAC. Rather, soft real-time services are built using existing best effort wireless MAC technology. Simulation, analysis, and results from an experimental wireless testbed show that real-time applications experience low and stable delays under various multi-hop, traffic and mobility conditions. The wireless testbed and ns-2 simulator source code are available from the Web (comet.columbia.edu/swan).

We propose SWAN, a stateless network model which uses distributed control algorithms to deliver service differentiation in mobile wireless ad hoc networks in a simple, scalable and robust manner. The proposed architecture is designed to handle both real-time UDP traffic, and best effort UDP and TCP traffic without the need for the introduction and management of per-flow state information in the network. SWAN supports per-hop and end-to-end control algorithms that primarily rely on the efficient operation of TC/IP protocols. In particular, SWAN uses local rate control for best-effort traffic, and sender-based admission control for real-time UDP traffic. Explicit congestion notification (ECN) is used to dynamically regulate admitted real-time sessions in the face of network dynamics brought on by mobility or traffic overload conditions. SWAN does not require the support of a QoS-capable MAC to deliver service differentiation. Rather, real-time services are built using existing best effort wireless MAC technology. Simulation, analysis, and results from an experimental wireless testbed show that real-time applications experience low and stable delays under various multihop, traffic, and mobility conditions.

We have developed a linear programming procedure to partition bandwidth to voice and data connections in a wireless integrated system in order to minimize voice delay and maximize data throughput with voice packet loss constrained. Results show that the linear programming performance can be approached quite closely by a simple round-robin scheme with adaptive threshold. An analytical procedure is developed for the round-robin scheme in order to determine the threshold, based on the number of voice connections. Simulation results indicate that when the number of connections or state space is large, the threshold value can be approximated by extrapolating linearly with a slope which equals the average rate of a connection. The round- robin scheme with adaptive threshold is thus shown to be a well-performing and easily-implementable scheme.

This paper investigates differentiated services in wireless packet networks using a fully distributed approach that supports service differentiation, radio monitoring, and admission control. While our proposal is generally applicable to distributed wireless access schemes, we design, implement, and evaluate our framework within the context of existing wireless technology. Service differentiation is based on the IEEE 802.11 distributed coordination function (DCF) originally designed to support best-effort data services. We analyze the delay experienced by a mobile host implementing the IEEE 802.11 DCF and derive a closed-form formula. We then extend the DCF to provide service differentiation for delay-sensitive and best-effort traffic based on the results from the analysis. Two distributed estimation algorithms are proposed. These algorithms are evaluated using simulation, analysis, and experimentation. A virtual MAC (VMAC) algorithm passively monitors the radio channel and estimates locally achievable service levels. The VMAC estimates key MAC level statistics related to service quality such as delay, delay variation, packet collision, and packet loss. We show the efficiency of the VMAC algorithm through simulation and consider significantly overlapping cells and highly bursty traffic mixes. In addition, we implement and evaluate the VMAC in an experimental differentiated services wireless testbed. A virtual source (VS) algorithm utilizes the VMAC to estimate application-level service quality. The VS allows application parameters to be tuned in response to dynamic channel conditions based on "virtual delay curves." We demonstrate through simulation that when these distributed victual algorithms are applied to the admission control of the radio channel then a globally stable state can be maintained without the need for complex centralized radio resource management.