1,449 research outputs found

    E2MaC: an energy efficient MAC protocol for multimedia traffic

    Get PDF
    Energy efficiency is an important issue for mobile computers since they must rely on their batteries. We present a novel MAC protocol that achieves a good energy efficiency of wireless interface of the mobile and provides support for diverse traffic types and QoS. The scheduler of the base station is responsible to provide the required QoS to connections on the wireless link and to minimise the amount of energy spend by the mobile. The main principles of the E2MaC protocol are to avoid unsuccessful actions, minimise the number of transitions, and synchronise the mobile and the base-station. We will show that considerable amounts of energy can be saved using these principles. In the protocol the actions of the mobile are minimised. The base-station with plenty of energy performs actions in courtesy of the mobile. We have paid much attention in reducing the cost of a mobile for just being connected. The protocol is able to provide near-optimal energy efficiency (i.e. energy is only spent for the actual transfer) for a mobile within the constraints of the QoS of all connections in a cell, and only requires a small overhead

    Architecture for Cooperative Prefetching in P2P Video-on- Demand System

    Full text link
    Most P2P VoD schemes focused on service architectures and overlays optimization without considering segments rarity and the performance of prefetching strategies. As a result, they cannot better support VCRoriented service in heterogeneous environment having clients using free VCR controls. Despite the remarkable popularity in VoD systems, there exist no prior work that studies the performance gap between different prefetching strategies. In this paper, we analyze and understand the performance of different prefetching strategies. Our analytical characterization brings us not only a better understanding of several fundamental tradeoffs in prefetching strategies, but also important insights on the design of P2P VoD system. On the basis of this analysis, we finally proposed a cooperative prefetching strategy called "cooching". In this strategy, the requested segments in VCR interactivities are prefetched into session beforehand using the information collected through gossips. We evaluate our strategy through extensive simulations. The results indicate that the proposed strategy outperforms the existing prefetching mechanisms.Comment: 13 Pages, IJCN

    Energy-efficient wireless communication

    Get PDF
    In this chapter we present an energy-efficient highly adaptive network interface architecture and a novel data link layer protocol for wireless networks that provides Quality of Service (QoS) support for diverse traffic types. Due to the dynamic nature of wireless networks, adaptations in bandwidth scheduling and error control are necessary to achieve energy efficiency and an acceptable quality of service. In our approach we apply adaptability through all layers of the protocol stack, and provide feedback to the applications. In this way the applications can adapt the data streams, and the network protocols can adapt the communication parameters

    Wireless cache invalidation schemes with link adaptation and downlink traffic

    Get PDF
    Providing on-demand data access in client-server wireless networks is an important support to many interesting mobile computing applications. Caching frequently accessed data by mobile clients can conserve wireless bandwidth and battery power, at the expense of some system resources to maintain cache consistency. The basic cache consistency strategy is the use of periodic invalidation reports (IRs) broadcast by the server. Recently, IR-based approaches have been further improved by using additional updated invalidation reports (UIRs) (i.e., the IR+UIR algorithm) to reduce the long query latency. However, the performance of the IR+UIR approach in a practical system is still largely unknown. Specifically, previous results are based on two impractical simplifying assumptions: 1 ) broadcast traffic is error-free and 2) no other downlink traffic (e.g., voice) exists in the system. The first assumption is clearly unrealistic as signal propagation impairments (e.g., multipath fading) and, hence, packet reception failures are inevitable in a practical situation. The second assumption is also inapplicable in real life because mobile devices are usually multipurposed (e.g., a mobile phone equipped with a browser may be used for Web surfing while having a phone conversation). In this paper, we first study the performance of the IR+UIR approach under a realistic system model: The quality of the wireless channel is time-varying, and there are other downlink traffics in the system. Our simulation results show that query delay significantly increases as a result of broadcast error and the additional downlink traffics experience longer delay due to extended broadcast period. Exploiting link adaptation (i.e., transmission rate is adjusted dynamically according to channel quality), we then propose three schemes to tackle these two problems. Our results indicate that the proposed schemes outperform IR+UIR under a wide range of system parameters.published_or_final_versio

    Content Scheduling in Multimedia Interactive Mobile Games

    Get PDF
    In this paper, we study how to implement interactive multimedia services using a DVB-H broadcast channel combined with a point-to-point channel, such as 3G or GPRS. We study the problem in the context of a location-based interactive mobile game. The technical challenge is to schedule the sending of data over the broadcast channel while maintaining Quality-of-Service, that is, sending the right data to the right user at the right time to provide a seamless interactive experience. We explore design issues and problems related to the scheduling of content in the game, present a usecase study to describe scheduling problems and propose a content scheduling algorithm to solve these problems. Moreover, we provide a simulation of the system and the experimental results to show how different game parameters influence the in-time delivery of the multimedia content to the players. We conclude that most of the problems involved with our approach can be expressed as the problem of defining delivery deadlines for a scheduling algorithm

    Low-complexity medium access control protocols for QoS support in third-generation radio access networks

    Get PDF
    One approach to maximizing the efficiency of medium access control (MAC) on the uplink in a future wideband code-division multiple-access (WCDMA)-based third-generation radio access network, and hence maximize spectral efficiency, is to employ a low-complexity distributed scheduling control approach. The maximization of spectral efficiency in third-generation radio access networks is complicated by the need to provide bandwidth-on-demand to diverse services characterized by diverse quality of service (QoS) requirements in an interference limited environment. However, the ability to exploit the full potential of resource allocation algorithms in third-generation radio access networks has been limited by the absence of a metric that captures the two-dimensional radio resource requirement, in terms of power and bandwidth, in the third-generation radio access network environment, where different users may have different signal-to-interference ratio requirements. This paper presents a novel resource metric as a solution to this fundamental problem. Also, a novel deadline-driven backoff procedure has been presented as the backoff scheme of the proposed distributed scheduling MAC protocols to enable the efficient support of services with QoS imposed delay constraints without the need for centralized scheduling. The main conclusion is that low-complexity distributed scheduling control strategies using overload avoidance/overload detection can be designed using the proposed resource metric to give near optimal performance and thus maintain a high spectral efficiency in third-generation radio access networks and that importantly overload detection is superior to overload avoidance
    • 

    corecore