Multi-User Opportunistic Scheduling using Power Controlled Hierarchical Constellations

In this letter, we study an application of hierarchical constellations (known also as embedded, multi-resolution, or asymmetrical constellations) for multi-user opportunistic scheduling. The key idea is to rely on hierarchical constellations to transmit information to two or more best users simultaneously in each transmission. The transmit power as well as the constellation parameter is changed according to the link qualities of the selected users in a way that a given target bit error rate (BER) is satisfied. The expressions for the average transmit power, and the outage probability with truncated channel inversion power control are presented. We also analyze and compare buffer distribution, average buffer occupancy, and packet loss probability of different; schemes via queuing analysis. We finally compare the hierarchical scheme for multi-user scheduling with a uniform constellation-based time-slotted scheme     

QoS-oriented packet scheduling for wireless multimedia CDMA communications

In the third-generation (and beyond) wireless communication systems, there will be a mixture of different traffic classes, each having its own transmission rate characteristics and quality-of-service (QoS) requirements. In this paper, a QoS-oriented medium access control (MAC) protocol with fair packet loss sharing (FPLS) scheduling is proposed for wireless code-division multiple access (CDMA) communications. The QoS parameters under consideration are the transmission bit error rate (BER), packet loss, and delay requirements. The MAC protocol exploits both time-division and code-division statistical multiplexing. The BER requirements are guaranteed by properly arranging simultaneous packet transmissions and controlling there transmit power levels, whereas the packet loss and delay requirements are guaranteed by proper packet scheduling. The basic idea of FPLS is to schedule the transmission of multimedia packets in such a way that all the users have a fair share of packet loss according to their QoS requirements, which maximizes the number of the served users under the QoS constraints. Simulation results demonstrate effectiveness of the FPLS scheduler, in comparison with other previously proposed scheduling algorithms.     

QoS-oriented access control for 4G mobile multimedia CDMAcommunications

An efficient medium access control protocol with fair packet loss sharing packet scheduling is proposed for wireless code-division multiple access communications. The proposed MAC protocol exploits both time-division and code-division statistical multiplexing. The FPLS scheduler uses the information of traffic rate distribution and quality of service requirements to assign priorities to the users and determines an efficient combination of the packets for transmission in the time slots of each frame, so the number of the served users is maximized under the QoS constraints. Simulation results demonstrate the effectiveness of the FPLS scheduler, in comparison with other previously proposed scheduling algorithms     

Power Efficient Video Multipath Transmission over Wireless Multimedia Sensor Networks

This paper proposes a power efficient multipath video packet scheduling scheme for minimum video distortion transmission (optimised Video QoS) over wireless multimedia sensor networks. The transmission of video packets over multiple paths in a wireless sensor network improves the aggregate data rate of the network and minimizes the traffic load handled by each node. However, due to the lossy behavior of the wireless channel the aggregate transmission rate cannot always support the requested video source data rate. In such cases a packet scheduling algorithm is applied that can selectively drop combinations of video packets prior to transmission to adapt the source requirements to the channel capacity. The scheduling algorithm selects the less important video packets to drop using a recursive distortion prediction model. This model predicts accurately the resulting video distortion in case of isolated errors, burst of errors and errors separated by a lag. Two scheduling algorithms are proposed in this paper. The Baseline scheme is a simplified scheduler that can only decide upon which packet can be dropped prior to transmission based on the packet’s impact on the video distortion. This algorithm is compared against the Power aware packet scheduling that is an extension of the Baseline capable of estimating the power that will be consumed by each node in every available path depending on its traffic load, during the transmission. The proposed Power aware packet scheduling is able to identify the available paths connecting the video source to the receiver and schedule the packet transmission among the selected paths according to the perceived video QoS (Peak Signal to Noise Ratio—PSNR) and the energy efficiency of the participating wireless video sensor nodes, by dropping packets if necessary based on the distortion prediction model. The simulation results indicate that the proposed Power aware video packet scheduling can achieve energy efficiency in the wireless multimedia sensor network by minimizing the power dissipation across all nodes, while the perceived video quality is kept to very high levels even at extreme network conditions (many sensor nodes dropped due to power consumption and high background noise in the channel).     

Energy efficient and perceived QoS aware video routing over Wireless Multimedia Sensor Networks

Wireless Sensor Networks (WSNs) have an ever increasing variety of multimedia based applications. Ιn these types of applications, network nodes should ideally maximize QoS and minimize energy expenditures in video communication. This article presents PEMuR, a novel dual scheme for efficient video communication, which aims at both energy saving and high QoS attainment. To achieve its objectives, PEMuR proposes the combined use of an energy aware hierarchical routing protocol with an intelligent video packet scheduling algorithm. The adopted routing protocol enables the selection of the most energy efficient routing paths, manages the network load according to the energy residues of the nodes and prevents useless data transmissions through the proposed use of an energy threshold. In this way, an outstanding level of energy efficiency is achieved. Additionally, the proposed packet scheduling algorithm enables the reduction of the video transmission rate with the minimum possible increase of distortion. In order to do so, it makes use of an analytical distortion prediction model that can accurately predict the resulted video distortion due to any error pattern. Thus, the algorithm may cope with limited available channel bandwidth by selectively dropping less significant packets prior to their transmission. Simulation results demonstrate the effectiveness of the proposed scheme.     

一种数据包合并跨层优化编码方案

在传统分层系统中,信息数据包首先在数据链路层进行数据包级的检错码编码,然后一个数据包对应一个信息分组在物理层进行符号级的纠错码编码,最后送入信道中传输。为提高系统的传输效率,提出了一种基于数据包合并的物理层与数据链路层编码的跨层优化方案,即数据链路层的多个数据包合并对应物理层的一个信息分组,然后进行纠错编码后再传输。通过理论推导得出了使系统传输效率最大的最优合并数据包个数和数据包长度表达式。通过仿真验证了理论推导的正确性,并与传统方案进行了比较,结果表明,该方案能有效提高系统的传输效率。     

Cross‐layer design for MIMO systems over spatially correlated and keyhole Nakagami‐m fading channels

Cross‐layer design is a generic designation for a set of efficient adaptive transmission schemes, across multiple layers of the protocol stack, that are aimed at enhancing the spectral efficiency and increasing the transmission reliability of wireless communication systems. In this paper, one such cross‐layer design scheme that combines physical layer adaptive modulation and coding (AMC) with link layer truncated automatic repeat request (T‐ARQ) is proposed for multiple‐input multiple‐output (MIMO) systems employing orthogonal space‐‐time block coding (OSTBC). The performance of the proposed cross‐layer design is evaluated in terms of achievable average spectral efficiency (ASE), average packet loss rate (PLR) and outage probability, for which analytical expressions are derived, considering transmission over two types of MIMO fading channels, namely, spatially correlated Nakagami‐m fading channels and keyhole Nakagami‐m fading channels. Furthermore, the effects of the maximum number of ARQ retransmissions, numbers of transmit and receive antennas, Nakagami fading parameter and spatial correlation parameters, are studied and discussed based on numerical results and comparisons. Copyright © 2009 John Wiley & Sons, Ltd.     

A latency-aware scheduling algorithm for all-optical packet switching networks with FDL buffers

Optical buffers implemented by fiber delay lines (FDLs) have a volatile nature due to signal loss and noise accumulation. Packets suffer from excessive recirculation through FDLs, and they may be dropped eventually in their routing paths. Because of this, packet scheduling becomes more difficult in FDL buffers than in RAM buffers, and requires additional design considerations for reducing packet loss. We propose a latency-aware scheduling scheme and an analytical model for all-optical packet switching networks with FDL buffers. The latency-aware scheduling scheme is intended to minimize the packet loss rate of the networks by ranking packets in the optimal balance between latency and residual distance. The analytical model is based on non-homogeneous Markovian analysis to study the effect of the proposed scheduling scheme on packet loss rate and average delay. Furthermore, our numerical results show how various network parameters affect the optimal balance. We demonstrate quantitatively how to achieve the proper balance between latency and residual distance so that the network performance can be improved significantly. For instance, we find that under a given latency limit and light traffic load our scheduling scheme achieves a packet loss rate 71% lower than a scheduling scheme that ranks packets simply based on latency.     

一种新的GEO/LEO双层星座路由算法

针对多层卫星星座网络的复杂通信环境和特殊应用背景,提出一种新的基于优先级的星上分布式路由算法( PDRA)。 PDRA算法采用新的分层管理策略,根据信息重要程度设置优先级,在拓扑快照起始时刻进行路由计算与更新,信息传输过程中采用拥塞回避策略。理论分析和仿真验证表明,PDRA算法与现有典型卫星星座网络路由算法相比性能优越,能够很好地利用GEO/LEO双层星座特点,有较低的数据丢包率和较高的吞吐量,可有效避免链路拥塞,并能保证重要信息实时可靠传输。     

An OFDM-TDMA/SA MAC Protocol with QoS Constraints for Broadband Wireless LANs

Orthogonal frequency division multiplexing (OFDM) is an important technique to support high speed transmission of broadband traffic in wireless networks, especially broadband wireless local area networks (LANs). Based on OFDM, a new multiple access scheme, called OFDM-TDMA with subcarrier allocation (OFDM-TDMA/SA), is proposed in this paper. It provides more flexibility in resource allocation than other multiple access schemes such as OFDM-TDMA, OFDM-frequency division multiple access (OFDM-FDMA), and orthogonal frequency division multiple access (OFDMA). With OFDM-TDMA/SA, a medium access control (MAC) is designed for broadband wireless LANs. It optimizes bit allocation in subcarriers so that maximum bits are transmitted in each OFDM symbol under a frequency selective fading environment. The OFDM-TDMA/SA MAC protocol also supports three classes of traffic such as guaranteed, controlled-load, and best effort services. Based on the optimum subcarrier bit-allocation algorithm and considering heterogeneous QoS constraints of multimedia traffic, a hierarchical scheduling scheme is proposed to determine the subcarriers and time slots in which a mobile terminal can transmit packets. In such a way, the OFDM-TDMA/SA MAC protocol significantly increases system throughput in a frequency selective fading environment and guarantees QoS of multimedia traffic. Computer simulation is carried out to evaluate the performance of the OFDM-TDMA/SA MAC protocol. Results show that the new MAC protocol outperforms other MAC protocols for OFDM-based wireless LANs. This work was supported by the State of Georgia Yamacraw Project (E21-105).     

A slotted CDMA protocol with BER scheduling for wireless multimedianetworks

In future wireless multimedia networks, there will be a mixture of different traffic classes which have their own maximum tolerable bit error rate (BER) requirements. In this paper, a novel medium access control (MAC) protocol called wireless multimedia access control protocol with BER scheduling (in short form, WISPER) for CDMA-based systems is proposed. WISPER utilizes the novel idea of scheduling the transmission of multimedia packets according to their BER requirements. The scheduler assigns priorities to the packets, and performs an iterative procedure to determine a good accommodation of the highest-priority packets in the slots of a frame so that packets with equal or similar BER requirements are transmitted in the same slots. The proposed WISPER protocol has been validated using a software emulator on the cellular environment. Performance evaluation results based on the implementation are also included     

QoS based fair resource allocation in multi-cell TD/CDMA communication systems

Abstract-In a wireless multimedia code division multiple access (CDMA) system, the resources in terms of transmission rate and power should be efficiently distributed to each user to guarantee its quality-of-service (QoS) requirements. In, this paper, a resource allocation algorithm which combines packet scheduling and power assignment is proposed to achieve efficient resource utilization under QoS constraints. The packet scheduling is based on the fair packet loss sharing (FPLS) principle, and the power assignment is determined by the received power limited (RPL) scheme. The basic idea of FPLS is to schedule the transmission of multimedia packets in such a way that, all the users have a fair share of packet loss according to their QoS requirements, which maximizes the number of the served users with QoS satisfaction. The RPL scheme minimizes the received power for each packet. Given the propagation path loss, it in turn minimizes the transmitted power as well. The intercell interference from the scheduled packets is also limited in order to increase the system capacity.     

Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters]

An efficient policy allocation algorithm for the transmission of embedded bit streams over noisy channels with feedback is proposed. The transmission is based on the type- II hybrid ARQ/FEC protocol and uses a nested sequence C of channel codes to protect the packets. There are also constraints on the total bit budget and on the allowed number of retransmissions per packet. The allocation algorithm assigns different protection policies, each policy being a subset of C, to different packets to maximize the average number of correctly received source bits. We study the performance and the complexity of the proposed scheme through the transmission of images encoded by JPEG2000 over mobile channels with correlated Rayleigh fading. We demonstrate by simulations that the proposed multiplepolicy scheme provides significant improvements over a purely FEC scheme with no feedback and also the existing fixed-policy schemes. Our results show that feedback is particularly helpful for poor channel conditions and that the proposed scheme is very robust against changes in the channel signal-to-noise ratio (SNR) and the mobile speed.     

Performance of hybrid ARQ for IP packet transmission on fadingchannel

This paper proposes and analyzes the performance of a hybrid selective repeat (SR)/multicopy (MC) automatic repeat request (ARQ) scheme to transmit fragmented Internet protocol (IP) packets. The ARQ scheme works in the SR mode until the last IP packet fragment is transmitted. If a fragment is negatively acknowledged after the last fragment is transmitted, then the system goes in the MC mode. In the MC mode, multiple copies of the erroneous fragment are transmitted. After all IP fragments are received without error, the system goes back to the SR mode. The performance of the proposed scheme is evaluated in terms of the bit error rate (BER), IP packet size, and fragmentation size with and without Bose Chaudhuri Hocquenghem (BCH) error correction codes. Both the results are obtained under additive white Gaussian noise (AWGN) as well as flat Rayleigh fading channels. The proposed scheme gives a throughput of 0.9, even at high BER conditions, for any IP packet size under an AWGN channel while, an 8-dB improvement is achieved, when using BCH(63, 51, 2) for throughput of 0.9, over selective repeat+stutter scheme 2 (SR+ST 2) under a flat Rayleigh fading channel     

An in-band signaling protocol for optical packet switching networks

Advances in optical networking reveal that all optical networks offering a multigigabit rate per wavelength will soon become economical as the underlying backbone in wide-area networks, in which the optical switch plays a central role. One of the central issues is the design of efficient signaling protocols which can support diversified traffic types, in particular the bursty IP traffic. This paper introduces a novel signaling protocol called the sampling probe algorithm (or SPA) to be used in a class of optical packet switching systems based on wavelength division multiplexing (WDM). The proposed scheme takes a drastically different approach from all existing signaling protocols. The salient features are 1) the pretransmission coordination is using an in-band signaling protocol, and thus does not require separate control channel(s) for transmission coordination; 2) the protocol is based on a reservation (connection) scheme which is capable of supporting multimedia traffic; 3) a gated service is adopted in which each successful reservation allows multiple packets (train of packets) to be transmitted, which can significantly reduce the per packet overhead; 4) the scheduling algorithm is adaptive by allowing flexible assignment of bandwidth on-demand; 5) the channel status gathering is done in a distributed fashion, and uses a passive listening mechanism, which itself does not interfere with packet transmissions. The results demonstrate that the proposed in-band signaling protocol can achieve high throughput and stability under heavy traffic condition.     

A channel reuse strategy with adaptive channel allocation for all-optical WDM networks

The fundamental problems of WDM networks are: (1) high rate of control packet loss and (2) high propagation delay for each (re)transmission. In this paper, we minimize the station randomness to access the control architecture introducing a collisions-free access scheme. We propose a synchronous protocol according which at the end of the propagation delay each station applies a distributed algorithm for packet transmission following the data channel collisions and the receiver collisions avoidance algorithms. We introduce two data transmission stages. The time difference between them is one packet transmission time. At the end of the first stage all data channels are free and can be reused by the remaining data packets during the second stage. The proposed protocol ensures a totally collisions-free performance. The main advantage is that the data channels reuse strategy applied during the second stage provides enhanced transmission probability to the rejected packets during the first stage. This allows the data packets to try retransmission in the same cycle without requiring control packets re-coordination that increases propagation delay. Thus, we achieve large number of data packets transmission, even more than the data channels number, providing throughput improvement and delay reduction, comparing with other studies.     

A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209].     

A Dynamic Resource Allocation Scheme for the Downlink Heterogeneous Traffic of Internet Protocol (IP) Based OFDM networks

Radio Resource management mechanisms such as physical-centric radio resource allocation and medium access control (MAC)—centric packet scheduling are expected to play a substantial role in the performance of orthogonal frequency division multiplexing (OFDM) based wireless networks. OFDM provide fine granularity for resource allocation since they are capable of dynamically assigning sub-carriers to multiple users and adaptively allocating transmit power. The current layered networking architecture, in which each layer is designed and operated independently, results in inefficient resource use in wireless networks due to the nature of the wireless medium, such as time-varying channel fading. Thus, we need an integrated adaptive design across different layers, allowing for a cross-layer design. In this paper, a scheduling scheme is proposed to dynamically allocate resources for the downlink data transmission of internet protocol based OFDM networks. Generally to maximize the capacity and user satisfaction improvements in packet data admission, scheduling and policing are necessary. Of the three, efficient scheduling has the greatest impact on increased system capacity or effective spectrum usage. In addition, proper scheduling can greatly improve user satisfaction. The contribution of this work is twofold: first we evaluate current allocation schemes by exploiting the knowledge of channel sate information (CSI) and traffic characteristics in terms of queue state information (QSI) to acquire the system performance on a real time network. Second, the resource allocation scheme is extended by incorporating MAC layer information as well as opportunistic packet scheduling in the time-domain-based on minimum weight cost function. The key factors that affect the overall system performance in terms of system average throughput and delay are identified, evaluated and discussed.     

Channel-aware priority-based groupwise packet scheduling for non-real time data service with burst-switching DS/CDMA system

The algorithm of scheduling scheme of channel-aware priority-based groupwise transmission is investigated for non-real time data service for the uplink direct sequence code division multiple access (DS/CDMA) system using the burst-switching scheme to support the integrated voice/data service. The proposed scheme optimally determines the transmission-time groups and assigns optimal data rates to the users with packets in the transmission-time group depending on priority metric, which involves several parameters such as delay threshold, waiting time, length of packet, and state of the channel, in a way of minimizing the average transmission delay. Simulation results show that the proposed algorithm gives better performance of average transmission delay and packet loss probability than any other conventional algorithms.     

Robust full-diversity full-rate quasi-orthogonal STBC for four transmit antennas

A novel quasi-orthogonal space-time block code (QSTBC) with full-diversity full-rate transmission and double-symbol decoding is proposed for a system with four transmit antennas, which is constructed by linearly combining two optimally power-scaled component Alamouti codes. Compared with the existing QSTBC with optimal constellation rotation, the proposed code provides excellent robustness, in terms of bit error rate performance, against spatially correlated and/or time-selective fading channels.