1174061
Combined QoS Scheduling and Call Admission Control Algorithm in Cellular Networks
In this paper, a scheduling problem in wireless networks is considered when there simultaneously exist CBR (constant bit rate) users requiring exact minimum average throughput guarantee and EMG (elastic with minimum guarantee) users requiring minimum average throughput guarantee and more if possible. By exploiting utility maximization problem without minimum throughput constraint and newly defined utility functions, we propose a combined scheduling and call admission control scheme that exactly guarantees the minimum requirements of CBR and EMG users and then allocates the leftover capacity to EMG users. In the proposed scheme, it is easy to give priority to particular users so that they are guaranteed their requirements prior to any other user. Moreover, the priority structure enables the proposed measurement-based call admission control algorithm to perform admission trial without affecting the minimum performance of existing users. We show through mathematical analysis and simulations that our scheme works as designed.
21234984
A distributed utility max-min flow control algorithm
A fair allocation of utility (application-layer performance) is essential in providing QoS (Quality of Service) guarantee. However, there have been few researches in the literature of utility-fair network resource allocation scheme. In this paper, we propose a distributed utility max-min flow control algorithm which accommodates application diversity in that it does not require the concavity of utility functions, and is scalable in that it does not require any per-flow operation in the network. The algorithm is proved to be convergent under the assumption that there exists a single bottleneck link and the communication delay between any two links in the network is bounded. Although the convergence of the algorithm is analyzed only for the case of a single bottleneck link, we show through simulations that the proposed algorithm works as designed for the case of multiple bottleneck links as well.
8279890
Location tracking using quorums in mobile ad hoc networks
Abstract We explore applications of quorum systems to the problem of tracking locations of mobile users in mobile ad hoc networks (MANETs). The location tracking system uses biquorum systems, a generalization of traditional quorum systems. We performed extensive simulations of the location tracking system. The simulation results show that our strict biquorum implementation has better performance than the traditional strict quorum implementations. Moreover, our results show that randomized dynamic quorum implementations have better overall performance than strict (bi)quorum implementations.
2200598
When to use a compilation service?
Modern handheld computers are certainly capable of running general purpose applications, such as Java virtual machines. However, short battery life rather than computational capability often limits the usefulness of handheld computers. This paper considers how to reduce the energy consumption of Java applications.Broadly speaking, there are three interleaved steps in running Java programs in a compiled environment: downloading the bytecodes, compiling and possibly optimizing the bytecodes, and running the compiled code. Optimized code typically runs faster than non-optimized code but the optimization process itself may consume significant energy. We consider the possibility of moving compilation (optimizing or non-optimizing) to a tethered server. We demonstrate that there is a significant benefit to moving compilation to a server (up to 67% reduction in energy for a realistic handheld configuration). We also demonstrate that there is no single best compilation strategy for all methods.
7244802
Design, implementation and testing of an interactive video retrieval system
In this paper we present and discuss the system we developed for the search task of the TRECVID 2002, and its evaluation in an interactive search task. To do this we will look at the strategy we used in designing the system, and we discuss and evaluate the experiments used to determine the value and effectiveness of one system incorporating both feature evidence and transcript retrieval compared to a transcript-only retrieval system. Both systems tested are built on the foundation of the Físchlár System developed and running for a number of years at the CDVP. The system is fully MPEG-7 compliant and uses XML for exchange of information within the overall architecture.
15007668
Wakeup scheduling in wireless sensor networks
A large number of ractical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation commands. In this a er,we consider the design of efficient wakeup scheduling schemes for energy constrained sensor nodes that adhere to the bidirectional end-to-end delay constraints posed by such applications. We evaluate several existing scheduling schemes and propose novel scheduling methods that outperform existing ones.We also resent a new family of wakeu methods,called multi-parent schemes, which take a cross-layer a roach where multiple routes for transfer of messages and wakeup schedules for various nodes are crafted in synergy to increase longevity while reducing message delivery latencies. We analyze the power-delay and lifetime-latency tradeoffs for several wakeup methods and show that our proposed techniques significantly improve the performance and allow for much longer network lifetime while satisfying the latency constraints.
36948650
Constructing SSML Documents with Automatically Generated Intonation Information in a Combinatory Categorial Grammar Framework
As of now, Text-to-Speech (TTS) systems are widely used throughout the full spectrum of our activities, and various natural language processing techniques have been utilized to enhance the performance of such TTS systems. As TTS systems begin to play an important role for communication between human and machine, naturalness is considered the most crucial measure of performance for TTS systems, in addition to correctness. General statistical approaches, though widely adopted, are not appropriate for the phenomena as they assign the same intonation to the same sentence. We analyze various kinds of corpus to extract informative features for intonation generation in a Combinatory Categorial Grammar framework, and express intonation-annotated document using Speech Synthesis Markup Language for target system neutral application.