Search

For the current generation of cellular communication systems, long-term evolution (LTE) has been the major protocol to support high-speed data transmission. It is critical to allocate downlink spectral resource in LTE, namely, resource blocks (RBs), but the issue is not well addressed in the standard. Therefore, the paper develops an efficient RB allocation algorithm with 4 mechanisms to improve both fairness and throughput in LTE. For fairness concern, our RB allocation algorithm uses a resource-reservation mechanism to prevent cell-edge user equipments from starvation, and a credit-driven mechanism to keep track of the amount of resource given to each user equipment. For throughput concern, it adopts both weight-assignment and RB-matching mechanisms to allocate each RB to a packet according to its flow type and length. Through simulations, we demonstrate that the proposed RB allocation algorithm can significantly increase both throughput and fairness while reducing packet dropping and delays of real-time flows, as compared with previous methods. [ABSTRACT FROM AUTHOR]

SUMMARY The WAVE (IEEE 1609) standard and vehicular technology create a new opportunity for telematics service. Safety is one of the top issues of telematics service. In this paper, we propose a proactive safety method that can alert drivers before the accident occurs using WAVE. An algorithm named Early Collision Warning Algorithm (ECWA) was proposed in this paper. In ECWA, vehicles broadcast Relationship Information (RI) to neighboring vehicles periodically. Each vehicle calculates whether potential collisions may happen or not upon receiving RI messages. After calculation, ECWA sends warning messages to drivers if the collision will occur. ECWA allows drivers to set the warning level and warning distance by themselves. In our simulation, not only vehicles's collisions at an intersection were simulated but also the GPS error range was considered in our design. The results show that ECWA has good performance and can always alert drivers suitably if the GPS error range was small. Even though the GPS error range is large, ECWA also can enhance the hit rate of warning messages. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY In this paper we study the resource allocation problem for the multiuser orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) systems with proportional rate constraints. The mutual interference introduced by primary user (PU) and cognitive radio user (also referred to secondary user, SU) makes the optimization problem of CR systems more complex. Moreover, the interference introduced to PUs must be kept under a given threshold. In this paper, the highest achievable rate of each OFDM subchannel is calculated by jointly considering the channel gain and interference level. First, a subchannel is assigned to the SU with the highest achievable rate. The remaining subchannels are always allocated to the SU that suffers the severest unjustness. Second, an efficient bit allocation algorithm is developed to maximize the sum capacity, which is again based on the highest achievable rate of each subchannel. Finally, an adjustment procedure is designed to maintain proportional fairness. Simulation results show that the proposed algorithm maximizes the sum capacity while keeping the proportional rate constraints satisfied. The algorithm exhibits a good tradeoff between sum capacity maximization and proportional fairness. Furthermore, the proposed algorithm has lower complexity compared with other algorithms, rendering it promising for practical applications. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY Channel assignment in multichannel multiradio wireless mesh networks is a powerful resource management tool to exploit available multiple channels. Channels can be allocated either statically on the basis of long-term steady state behavior of traffic or dynamically according to actual traffic demands. It is a common belief that dynamic schemes provide better performance; however, these two broad classes of channel allocation schemes have not been compared in detail. In this paper, we quantify the achievable performance gain and fairness improvement through an optimal dynamic channel allocation scheme. We develop optimal algorithms for a dynamic and three static schemes using mixed integer linear programming and compare them in the context of QoS provisioning, where network performance is measured in terms of acceptance rate of QoS sensitive traffic demands. Our extensive simulations show that static schemes should optimize channel allocation for long-term traffic pattern and maintain max-min fairness to achieve acceptable performances. Although the dynamic and max-min fair static schemes accomplish the same fairness, the dynamic channel allocation outperforms the static scheme about 10% in most cases. In heavily overloaded regimes, especially when network resources are scarce, both have comparable performances, and the max-min fair scheme is preferred because it incurs less overhead. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY In multicarrier communication systems, a time-domain equalizer (TEQ) can be applied to shorten the channel impulse response and to eliminate inter-symbol interference (ISI). However, the presence of impulsive noise in the channel may paralyze the operation of TEQs and subsequently lead to poor error performance. In this paper, a multicarrier receiver that incorporates a constant false alarm rate algorithm and an iterative estimation technique (CFAR-IET) in conjunction with a TEQ is proposed to increase the robustness of the receiver against impulsive noise. Furthermore, an improved version of the CFAR-IET-TEQ scheme, which uses the buffering, sorting, removing and amplitude averaging (BSRA) processes, is presented. Performance comparisons of the proposed schemes with the existing Gaussian-optimized schemes are made. Simulation results show that the BSRA-IET-TEQ scheme is an effective approach to reduce symbol error rate (SER) in impulsive channels while performing satisfactorily in Gaussian channels. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY Gang scheduling is an efficient resource management scheme for distributed systems which combines elements of time sharing and space sharing. It is a suitable technique particularly in the case when parallel tasks have to be running concurrently to make progress in communication. This paper studies the impact on scheduling performance when dynamically generated sequential gangs exist in the workload. In the case of sequential gangs, a subsequent gang can be dynamically generated after the execution of the initial gang based on affinity information which resides on the caches of the previously seized processors. The performance of different gang-scheduling algorithms is examined for various cases of workload compositions which range from cases with a low demand for dynamically generated gangs to cases with a high ratio of sequential gangs to solitary gangs. A simulation model is implemented to address associated performance issues. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY The IEEE 802.16e standard specifies the QoS support at the MAC level for wireless broadband access network. To meet the QoS requirements, an efficient scheduling algorithm at base station (BS), which is not defined in the standard, is necessary for slots allocation. In this paper, a Slot-based BS scheduling algorithm with Maximum Latency Guarantee and Capacity First (SMLG-CF) is proposed. With SMLG-CF, the connection request is satisfied with highest slot capacity first. Together with the use of dynamic sub-frame adjustment, the overall system transmission can be efficiently improved. Through the finer slots calculation and accurate transmission time scheduling, the maximum latency guarantee can be better achieved for urgent requests. In the simulation, we compare the proposed mechanism with the deficit fair priority queue scheduling algorithm and the Highest Urgency First scheduling algorithm. The simulation results reveal that SMLG-CF outperforms both algorithms from the aspect of maximum latency violation rate and average transmission rate. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper addresses the analytical evaluation of broadcast protocols in VANET. We focus on the most popular broadcast algorithm, which consists in the current emitter selecting the furthest receiver as the next forwarder. We propose a general framework based on point process to evaluate this protocol. The radio environment is modelled by a generic Frame Error Rate function. It enables us, through the same model, to assess the performances for different radio environments or radio technologies. We derive simple formulae for different quantities relative to the performance of the broadcast protocol: time to propagate the message, emitters' intensity, mean number of receptions for the same message, etc. Results based on the analytical model are compared with simulations using realistic vehicle traffic in order to determine the contexts for which the analytical model is relevant. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Multiuser orthogonal frequency division multiplexing (OFDM) is a promising technology to achieve high uplink/downlink (DL) capacities in the next generation broadband wireless networks such as WiMAX (Worldwide Interoperability for Microwave Access). In this paper, we investigate the DL adaptive power allocation (APA) in multiuser OFDM system from the perspective of cross-layer design. Specifically, we formulate APA as an optimization problem with the traffic profile of each user asit a priori knowledge. To solve the optimization problem, we develop a fairness-constrained optimal prioritized effective throughput (PET) strategy and the corresponding iterative algorithms, aiming at balancing the prioritized effective throughput and the linear or logarithmic user satisfaction-based fairness. Simulation results show that our proposed APA optimization approach can achieve satisfying performance. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This work presents a distributed time-slot assignment algorithm which adopts TDMA as Medium Access Control, specially suited to support applications with strict delay, jitter, and throughput requirements characterized by convergecast traffic pattern in sensor networks. (e.g. wireless video surveillance sensor networks). The proposed algorithm has three characteristics: (1) every node is guaranteed a path to the base station for its data delivery. In the path, sufficient resource is reserved and weighted fairness can be achieved. (2) It uses cascading time-slot assignment and jitter minimization algorithm in each node to minimize jitter and end-to-end delay. (3) Nodes are only active during their scheduled slots and sleep otherwise. This offers energy saving by reducing idle listening and avoiding overhearing. The performance of the proposed algorithm is evaluated over simulations and analyzed theoretically in comparison with existing slot assignment algorithm. The results show that our algorithm provides lower end-to-end delay, jitter, and higher throughput. Copyright © 2010 John Wiley & Sons, Ltd. In this paper, we introduce a time slot assignment algorithm for real time applications in wireless sensor networks. The algorithm has three characteristics: (1) every node is guaranteed a path to the base station for its data delivery. In the path, sufficient resource is reserved and weighted fairness can be achieved. (2) Cascading time slot assignment and jitter minimization algorithm are proposed to minimize jitter and transmission delay. (3) Nodes are only active during their scheduled slots and sleep otherwise. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper proposes a differentiated service (DiffServ)-based bandwidth-constrained network layer anycast routing for a mobile IPv6 network. The proposed algorithm comprises three steps: (1) When moving into a new foreign network, the mobile node (MN) chooses a feasible path to easily locate the nearest server that can serve it. To perform path selection, a multi-level list structure (MLLS) is defined and used to store the available bandwidth and hop count of a path. (2) An ingress extended edge router (E-ER) uses the multi-level list algorithm (MLLA) to examine the MLLS for selecting the feasible path with the smallest number of hops that satisfies the MN bandwidth request. (3) The E-ER uses a condition of path change (CPC) variable to determine whether it should optimize the route between itself and the server. Simulation results indicate that the proposed algorithm offers better performance than the existing related approaches in terms of the average running time, request blocking rate, and reducing the control overhead of the simulated network. Copyright © 2010 John Wiley & Sons, Ltd. A DiffServ-based bandwidth constrained anycast routing is used to select a new feasible path satisfying an MN QoS request when the MN changes its point of attachment. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Both intersymbol interference (ISI) and multiple-access interference (MAI) are the important issues in code division multiple access (CDMA) multiuser communication systems. The step size of the traditional least-mean-square (LMS) adaptive receivers must be substantially adjusted to overcome the effect due to different channel responses or different numbers of active users. The normalized-LMS (NLMS) algorithm can automatically manipulate the adjustment to avoid the problem just discussed. This paper proposes the symbol-based interference rejection filter with NLMS algorithm and derives both finite impulse response (FIR)- and infinite impulse response (IIR)-type algorithms. We also derive the optimal step sizes and minimum mean-square errors (MSEs) for both the FIR and IIR symbol-based receivers. The complexity of our proposed FIR receiver is lower than that of the conventional chip-based receivers. In addition, it is shown that the bit error rate performance of our proposed symbol-based receivers is superior to conventional one in the simulations. Simulations also show the correctness of our theoretical analysis of minimum MSE. Copyright © 2008 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

QoS Routing is crucial for QoS provisioning in high-speed networks. In general, QoS routing can be classified into two paradigms: source routing and hop-by-hop routing. In source routing, the entire path to the destination node of a communication request is locally computed at the source node based on the global state that it maintains, which does not scale well to large networks. In hop-by-hop routing, a path-selecting process is shared among intermediate nodes between the source node and the destination node, which can largely improve the protocol scalability. In this paper, we present the design of hop-by-hop routing with backup route information such that each intermediate node can recursively update the best known feasible path, if possible, by collectively utilizing the routing information gathered thus far and the information that it locally stores. Such a route is kept as a backup route and its path cost is used as a reference to guide the subsequent routing process to search for a lower-cost constrained path and avoid performance degradation. In this way, the information gathered is maximally utilized for improved performance. We prove the correctness of our presented algorithm and deduce its worst message complexity to be O(∣V∣2), where ∣V∣ is the number of network nodes. Simulation results indicate that, however, the designed algorithm requires much fewer messages on average. Therefore it scales well with respect to the network size. Moreover, simulation results demonstrate that the cost performance of our algorithm is near-optimal. Copyright © 2004 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The paper presents an analytical study aimed to establish a dimensioning procedure for the token bucket algorithm, used as a meter in a Differentiated Services network architecture, when a stochastic model for the multiplexed traffic is available. In the work, we propose an equivalent queueing system method to ‘on line’ estimate the linear bounded arrival processes (LBAP) parameters when a non-zero probability of non-conforming packets is accepted. Then, we validate our approach considering an aggregation of fluidic On-Off processes with exponentially distributed sojourn time in each state, used to model telephone sources with voice activity detection (VAD). To test the goodness of our analytical results, we employ discrete event simulations, which have highlighted the accuracy of the proposed dimensioning procedure in a voice over IP (VoIP) scenario. Moreover, we investigate the multiplexing gain and the effect of different parameters on the LBAP characterization of the VoIP traffic, taking into account a non-zero probability of non-conforming packets. Copyright © 2002 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The low pass filter (LPF) algorithm, which is used to calculate the average queue length in the random early detection (RED) algorithm, results in a poor response time when RED recovers from congestion. In this paper, we propose a new algorithm, called low pass filter/over drop avoidance (LPF/ODA), to improve the response time of RED. LPF/ODA is based on reducing the time required by RED to recover from long-term congestion. Simulation results have been used to show that the proposed LPF/ODA algorithm significantly improves the response time, throughput and delay of RED gateways. Copyright © 2002 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]