28 research outputs found

    Algorithm design for scheduling and medium access control in heterogeneous mobile networks

    Get PDF
    Mención Internacional en el título de doctorThe rapid growth of wireless mobile devices has led to saturation and congestion of wireless channels – a well-known fact. In the recent years, this issue is further exacerbated by the ever-increasing demand for traffic intensed multimedia content applications, which include but are not limited to social media, news and video streaming applications. Therefore the development of highly efficient content distribution technologies is of utmost importance, specifically to cope with the scarcity and the high cost of wireless resources. To this aim, this thesis investigates the challenges and the considerations required to design efficient techniques to improve the performance of wireless networks. Since wireless signals are prone to fluctuations and mobile users are, with high likelihood, have difference channel qualities, we particularly focus on the scenarios with heterogeneous user distribution. Further, this dissertation considers two main techniques to cope with mobile users demand and the limitation of wireless resources. Firstly, we propose an opportunistic multicast scheduling to efficiently distribute or disseminate data to all users with low delay. Secondly, we exploit the Millimeter-Wave (mm-Wave) frequency band that has a high potential of meeting the high bandwidth demand. In particular, we propose a channel access mechanism and a scheduling algorithm that take into account the limitation of the high frequency band (i.e., high path loss). Multicast scheduling has emerged as one of the most promising techniques for multicast applications when multiple users require the same content from the base station. Unlike a unicast scheduler which sequentially serves the individual users, a multicast scheduler efficiently utilizes the wireless resources by simultaneously transmitting to multiple users. Precisely, it multiplies the gain in terms of the system throughput compared to unicast transmissions. In spite of the fact that multicast schedulers are more efficient than unicast schedulers, scheduling for multicast transmission is a challenging task. In particular, base station can only chose one rate to transmit to all users. While determining the rate for users with a similar instantaneous channel quality is straight forward, it is non-trivial when users have different instantaneous channel qualities, i.e., when the channel is heterogeneous. In such a scenario, on one hand, transmitting at a low rate results in low throughput. On the other hand, transmitting at a high rate causes some users to fail to receive the transmitted packet while others successfully receive it but with a rate lower than their maximum rate. The most common and simplest multicasting technique, i.e., broadcasting, transmits to all receivers using the maximum rate that is supported by the worst receiver. In recent years, opportunistic schedulers have been considered for multicasting. Opportunistic multicast schedulers maximize instantaneous throughput and transmit at a higher rate to serve only a subset of the multicast users. While broadcasting suffers from high delay for all users due to low transmission rate, the latter causes a long delay for the users with worse channel quality as they always favor users with better channel quality. To address these problems, we designed an opportunistic multicast scheduling mechanism that aims to achieve high throughput as well as low delay. Precisely, we are solving the finite horizon problem for multicasting. Our goal is that all multicast users receive the same amount of data within the shortest amount of time. Although our proposed opportunistic multicast scheduling mechanism improves the system throughput and reduces delay, a common problem in multicast scheduling is that its throughput performance is limited by the worst user in the system. To overcome this problem, transmit beamforming can be used to adjust antenna gains to the different receivers. This allows improving the SNR of the receiver with the worst channel SNR at the expense of worsening the SNR of the better channel receivers. In the first part of this thesis, two different versions of the finite horizon problem are considered: (i) opportunistic multicast scheduling and (ii) opportunistic multicast beamforming. In recent years, many researchers venture into the potential of communication over mm-Wave band as it potentially solves the existing network capacity problem. Since beamforming is capable to concentrate the transmit energy in the direction of interest, this technique is particularly beneficial to improve signal quality of the highly attenuated mm-Wave signal. Although directional beamforming in mm-Wave offers multi-gigabit-per-second data rates, directional communication severely deteriorates the channel sensing capability of a user. For instance, when a user is not within the transmission coverage or range of the communicating users, it is unable to identify the state of the channel (i.e., busy or free). As a result, this leads to a problem commonly known as the deafness problem. This calls for rethinking of the legacy medium access control and scheduling mechanisms for mm-Wave communication. Further, without omni-directional transmission, disseminating or broadcasting global information also becomes complex. To cope with these issues, we propose two techniques in the second part of this thesis. First, leveraging that recent mobile devices have multiple wireless interface, we present a dual-band solution. This solution exploits the omni-directional capable lower frequency bands (i.e., 2.4 and 5 GHz) to transmit control messages and the mm-Wave band for high speed data transmission. Second, we develop a decentralized scheduling technique which copes with the deafness problem in mm-Wave through a learning mechanism. In a nutshell, this thesis explores solutions which (i) improve the utilization of the network resources through multicasting and (ii) meet the mobile user demand with the abundant channel resources available at high frequency bands.This work has been supported by IMDEA Networks Institute.Programa Oficial de Doctorado en Ingeniería TelemáticaPresidente: Ralf Steinmetz.- Secretario: Carlos Jesús Bernardos Cano.- Vocal: Jordi Domingo Pascua

    Cognitive Communications in White Space: Opportunistic Scheduling, Spectrum Shaping and Delay Analysis

    Get PDF
    abstract: A unique feature, yet a challenge, in cognitive radio (CR) networks is the user hierarchy: secondary users (SU) wishing for data transmission must defer in the presence of active primary users (PUs), whose priority to channel access is strictly higher.Under a common thread of characterizing and improving Quality of Service (QoS) for the SUs, this dissertation is progressively organized under two main thrusts: the first thrust focuses on SU's throughput by exploiting the underlying properties of the PU spectrum to perform effective scheduling algorithms; and the second thrust aims at another important QoS performance of the SUs, namely delay, subject to the impact of PUs' activities, and proposes enhancement and control mechanisms. More specifically, in the first thrust, opportunistic spectrum scheduling for SU is first considered by jointly exploiting the memory in PU's occupancy and channel fading. In particular, the underexplored scenario where PU occupancy presents a {long} temporal memory is taken into consideration. By casting the problem as a partially observable Markov decision process, a set of {multi-tier} tradeoffs are quantified and illustrated. Next, a spectrum shaping framework is proposed by leveraging network coding as a {spectrum shaper} on the PU's traffic. Such shaping effect brings in predictability of the primary spectrum, which is utilized by the SUs to carry out adaptive channel sensing by prioritizing channel access order, and hence significantly improve their throughput. On the other hand, such predictability can make wireless channels more susceptible to jamming attacks. As a result, caution must be taken in designing wireless systems to balance the throughput and the jamming-resistant capability. The second thrust turns attention to an equally important performance metric, i.e., delay performance. Specifically, queueing delay analysis is conducted for SUs employing random access over the PU channels. Fluid approximation is taken and Poisson driven stochastic differential equations are applied to characterize the moments of the SUs' steady-state queueing delay. Then, dynamic packet generation control mechanisms are developed to meet the given delay requirements for SUs.Dissertation/ThesisPh.D. Electrical Engineering 201

    Network Coding Strategies for Satellite Communications

    Get PDF
    Network coding (NC) is an important technology that allows the network services to be optimal. The main advantage of NC is to reduce the necessity for re-transmissions of packets. Satellite Communications (SatComs) are one of the potential applications that can leverage on the benefits of NC due to their challenging fading environments and high round trip times. The motivation is to take the physical layer-awareness into consideration for adapting and hence extend the NC gains. Different rate and energy efficient adaptive NC schemes for time variant channels are proposed. We compare our proposed physical layer adaptive schemes to physical layer non-adaptive NC schemes for time variant channels. The adaptation of packet transmissions is on the basis of the corresponding time-dependent erasures, and allows proposed schemes to achieve significant gains in terms of throughput, delay and energy efficiency. The proposed schemes are robust for large and small size of packets. Although, the energy per bit is affected, a similar rate and energy gains can be arise. However, the performance gains are not motivated by the packet size, but through duty cycle silence of transfer packets. In this thesis, virtual schemes are also proposed to solve an open literature problem in the NC. The objective is to find a quasi-optimal number of coded packets to multicast to a group of independent wireless receivers suffer from a different channel conditions. In particular, we propose two virtual network that allows for the representation of a group of receivers as a multicast group to be visible as one receiver and single channel. Most of the schemes are applied to LEO/MEO/GEO satellite scenarios. They demonstrate remarkable gains compared to that strategy in which the adaptation depends only on one receiver point-to-point

    Distributed Wireless Multicast: Throughput and Delay

    Get PDF
    Multicast transmission, in which data is sent from a source to multiple destinations, is an important form of data communication in wireless networks. Numerous applications require multicast transmission, including content distribution, conferencing, and military and emergency messages, as well as certain network control mechanisms, such as timing synchronization and route establishment. Finding a means to ensure efficient, reliable multicast communication that can adapt to changing channel conditions and be implemented in a distributed way remains a challenging open problem. In this dissertation, we propose to meet that challenge through the use of random coding of data packets coupled with random access to a shared channel. We present an analysis of both the throughput and delay performance of this scheme. We first analyze the multicast throughput in a random access network of finitely many nodes, each of which serves as either a source or a destination node. Our work quantifies throughput in terms of both the Shannon capacity region and the stable throughput region and indicates the extent to which a random linear coding scheme can outperform a packet retransmission scheme. Next, we extend these notions to a random access network of general topology in which each node can act as a receiver or a sender for multiple multicast flows. We present schemes for nodes in the network to compute their random access transmission probabilities in such a way as to maximize a weighted proportional fairness objective function of the multicast throughput. In the schemes we propose, each node can compute its transmission probability using information from neighboring nodes up to two hops away. We then turn our focus to queueing delay performance and propose that random coding of packets be modeled as a bulk-service queueing system, where packets are served and depart the queue in groups. We analyze within this framework two different coding schemes: one with fixed expected coding rate and another with a coding rate that adapts to the traffic load. Finally, we return to the question of multicast throughput and address the effects of packet length, overhead, and the time-varying nature of the wireless channel

    A proxy for reliable 5G (and beyond) mmWave communications. Contributions to multi-path scheduling for a reliability focused mmWave proxy

    Get PDF
    Reliable, consistent and very high data rate mobile communication will become especially important for future services such as, among other things, future emergency communication needs. MmWave technology provides the needed capacity, however, lacks the reliability due to the abrupt capacity changes any one path experiences. Intelligently making use of varying numbers of available mmWave paths, efficiently scheduling data across the paths, perhaps even through multi-operator agreements; and balancing mobile power consumption with path costs and the need for reliable consistent quality will be critical to attaining this aim. In this thesis, the multipath scheduling problem in a mmWave proxy when the paths have dynamically changing path characteristics is considered. To address this problem, a hybrid scheduler is proposed, the performance of which is compared with the Round Robin scheduler, Random scheduler and the Highest Capacity First scheduler. Forward error correction is explored as a means of enhancing the scheduling. Keywords:Multipath Scheduling, mmWave Proxy, Forward Error Correction, beyond 5G

    Progressive Source-Channel Coding for Multimedia Transmission over Noisy and Lossy Channels with and without Feedback

    Get PDF
    Rate-scalable or layered lossy source-coding is useful for progressive transmission of multimedia sources, where the receiver can reconstruct the source incrementally. This thesis considers ``joint source-channel'' schemes for such a progressive transmission, in the presence of noise or loss, with and without the use of a feedback link. First we design image communication schemes for memoryless and finite state channels using limited and explicitly constrained use of the feedback channel in the form of a variable incremental redundancy Hybrid ARQ protocol. Constraining feedback allows a direct comparison with schemes without feedback. Optimized feedback based systems are shown to have useful gains. Second, we develop a controlled Markov chain approach for constrained feedback Hybrid ARQ protocol design. The proposed methodology allows the protocol to be chosen from a collection of signal flow graphs, and also allows explicit control over the tradeoffs in throughput, reliability and complexity. Next we consider progressive image transmission in the absence of feedback. We assign unequal error protection to the bits of a rate-scalable source-coder using rate compatible channel codes. We show that, under the framework, the source and channel bits can be ``scheduled'' in a single bitstream in such a way that operational optimality is retained for different transmission budgets, creating a rate-scalable joint source-channel coder. Next we undertake the design of a joint source-channel decoder that uses ``distortion aware'' ACK/NACK feedback generation. For memoryless channels, and Type-I HARQ, the design of optimal ACK/NACK generation and decoding by packet combining is cast and solved as a sequential decision problem. We obtain dynamic programming based optimal solutions and also propose suboptimal, lower complexity distortion-aware decoders and feedback generation rules which outperform conventional BER based rules such as CRC-check. Finally we design operational rate-distortion optimal ACK/NACK feedback generation rules for transmitting a tree structured quantizer over a memoryless channel. We show that the optimal feedback generation rules are embedded, that is, they allow incremental switching to higher rates during the transmission. Also, we obtain the structure of the feedback generation rules in terms of a feedback threshold function that simplifies the implementation

    Instantly Decodable Network Coding: From Point to Multi-Point to Device-to-Device Communications

    Get PDF
    The network coding paradigm enhances transmission efficiency by combining information flows and has drawn significant attention in information theory, networking, communications and data storage. Instantly decodable network coding (IDNC), a subclass of network coding, has demonstrated its ability to improve the quality of service of time critical applications thanks to its attractive properties, namely the throughput enhancement, delay reduction, simple XOR-based encoding and decoding, and small coefficient overhead. Nonetheless, for point to multi-point (PMP) networks, IDNC cannot guarantee the decoding of a specific new packet at individual devices in each transmission. Furthermore, for device-to-device (D2D) networks, the transmitting devices may possess only a subset of packets, which can be used to form coded packets. These challenges require the optimization of IDNC algorithms to be suitable for different application requirements and network configurations. In this thesis, we first study a scalable live video broadcast over a wireless PMP network, where the devices receive video packets from a base station. Such layered live video has a hard deadline and imposes a decoding order on the video layers. We design two prioritized IDNC algorithms that provide a high level of priority to the most important video layer before considering additional video layers in coding decisions. These prioritized algorithms are shown to increase the number of decoded video layers at the devices compared to the existing network coding schemes. We then study video distribution over a partially connected D2D network, where a group of devices cooperate with each other to recover their missing video content. We introduce a cooperation aware IDNC graph that defines all feasible coding and transmission conflictfree decisions. Using this graph, we propose an IDNC solution that avoids coding and transmission conflicts, and meets the hard deadline for high importance video packets. It is demonstrated that the proposed solution delivers an improved video quality to the devices compared to the video and cooperation oblivious coding schemes. We also consider a heterogeneous network wherein devices use two wireless interfaces to receive packets from the base station and another device concurrently. For such network, we are interested in applications with reliable in-order packet delivery requirements. We represent all feasible coding opportunities and conflict-free transmissions using a dual interface IDNC graph. We select a maximal independent set over the graph by considering dual interfaces of individual devices, in-order delivery requirements of packets and lossy channel conditions. This graph based solution is shown to reduce the in-order delivery delay compared to the existing network coding schemes. Finally, we consider a D2D network with a group of devices experiencing heterogeneous channel capacities. For such cooperative scenarios, we address the problem of minimizing the completion time required for recovering all missing packets at the devices using IDNC and physical layer rate adaptation. Our proposed IDNC algorithm balances between the adopted transmission rate and the number of targeted devices that can successfully receive the transmitted packet. We show that the proposed rate aware IDNC algorithm reduces the completion time compared to the rate oblivious coding scheme

    Proceedings of the Fifth International Mobile Satellite Conference 1997

    Get PDF
    Satellite-based mobile communications systems provide voice and data communications to users over a vast geographic area. The users may communicate via mobile or hand-held terminals, which may also provide access to terrestrial communications services. While previous International Mobile Satellite Conferences have concentrated on technical advances and the increasing worldwide commercial activities, this conference focuses on the next generation of mobile satellite services. The approximately 80 papers included here cover sessions in the following areas: networking and protocols; code division multiple access technologies; demand, economics and technology issues; current and planned systems; propagation; terminal technology; modulation and coding advances; spacecraft technology; advanced systems; and applications and experiments

    Methods for Massive, Reliable, and Timely Access for Wireless Internet of Things (IoT)

    Get PDF

    DYNAMIC RESOURCE ALLOCATION FOR MULTIUSER VIDEO STREAMING

    Get PDF
    With the advancement of video compression technology and wide deployment of wired/wireless networks, there is an increasing demand of multiuser video communication services. A multiuser video transmission system should consider not only the reconstructed video quality in the individual-user level but also the service objectives among all users on the network level. There are many design challenges to support multiuser video communication services, such as fading channels, limited radio resources of wireless networks, heterogeneity of video content complexity, delay and decoding dependency constraints of video bitstreams, and mixed integer optimization. To overcome these challenges, a general strategy is to dynamically allocate resources according to the changing environments and requirements, so as to improve the overall system performance and ensure quality of service (QoS) for each user. In this dissertation, we address the aforementioned design challenges from a resource-allocation point of view and two aspects of system and algorithm designs, namely, a cross-layer design that jointly optimizes resource utilization from physical layer to application layer, and multiuser diversity that explores the source and channel heterogeneity among different users. We also address the impacts on systems caused by dynamic environment along time domain and consider the time-heterogeneity of video sources and time-varying characteristics of channel conditions. To achieve the desired service objectives, a general resource allocation framework is formulated in terms of constrained optimization problems to dynamically allocate resources and control the quality of multiple video bitstreams. Based on the design methodology of multiuser cross-layer optimization, we propose several systems to efficiently transmit multiple video streams, encoded by current and emerging video codecs, over major types of wireless networks such as 3G cellular system, Wireless Local Area Network, 4G cellular system, and future Wireless Metropolitan Area Networks. Owing to the integer nature of some system parameters, the formulated optimization problems are often integer or mixed integer programming problem and involve high computation to search the optimal solutions. Fast algorithms are proposed to provide real-time services. We demonstrate the advantages of dynamic and joint resource allocation for multiple video sources compared to static strategy. We also show the improvement of exploring diversity on frequency, time, and transmission path, and the benefits from multiuser cross-layer optimization
    corecore