Providing efficient services for smartphone applications

Mobile applications are becoming an indispensable part of people\u27s lives, as they allow access to a broad range of services when users are on the go. We present our efforts towards enabling efficient mobile applications in smartphones. Our goal is to improve efficiency of the underlying services, which provide essential functionality to smartphone applications. In particular, we are interested in three fundamental services in smartphones: wireless communication service, power management service, and location reporting service.;For the wireless communication service, we focus on improving spectrum utilization efficiency for cognitive radio communications. We propose ETCH, a set of channel hopping based MAC layer protocols for communication rendezvous in cognitive radio communications. ETCH can fully utilize spectrum diversity in communication rendezvous by allowing all the rendezvous channels to be utilized at the same time.;For the power management service, we improve its efficiency from three different angles. The first angle is to reduce energy consumption of WiFi communications. We propose HoWiES, a system-for WiFi energy saving by utilizing low-power ZigBee radio. The second angle is to reduce energy consumption of web based smartphone applications. We propose CacheKeeper, which is a system-wide web caching service to eliminate unnecessary energy consumption caused by imperfect web caching in many smartphone applications. The third angle is from the perspective of smartphone CPUs. We found that existing CPU power models are ill-suited for modern multicore smartphone CPUs. We present a new approach of CPU power modeling for smartphones. This approach takes CPU idle power states into consideration, and can significantly improve power estimation accuracy and stability for multicore smartphones.;For the location reporting service, we aim to design an efficient location proof solution for mobile location based applications. We propose VProof, a lightweight and privacy-preserving location proof scheme that allows users to construct location proofs by simply extracting unforgeable information from the received packets

ETCH: Efficient Channel Hopping for Communication Rendezvous in Dynamic Spectrum Access Networks

In a dynamic spectrum access (DSA) network, communication rendezvous is the first step for two secondary users to be able to communicate with each other. In this step, the pair of secondary users meet on the same channel, over which they negotiate on the communication parameters, to establish the communication link. This paper presents ETCH, Efficient Channel Hopping based MAC-layer protocols for communication rendezvous in DSA networks. We propose two protocols, SYNC-ETCH and ASYNC-ETCH. Both protocols achieve better time-to-rendezvous and throughput compared to previous work

Cognitive radio adaptive rendezvous protocols to establish network services for a disaster response

Disasters are catastrophic events that cause great damage or loss of life. In disasters, communication services might be disrupted due to damage to the existing network infrastructure. Temporary systems are required for victims and first responders, but installing them requires information about the radio environment and available spectrum. A cognitive radio (CR) can be used to provide a flexible and rapidly deployable temporary system due to its sensing, learning and decision-making capabilities. This thesis initially examines the potential of CR technology for disaster response networks (DRN) and shows that they are ideally suited to fulfill the requirements of a DRN. A software defined radio based prototype for multiple base transceiver stations based cellular network is proposed and developed. It is demonstrated that system can support a large number of simultaneous calls with sufficient call quality, but only when the background interference is low. It is concluded that to provide call quality with acceptable latency and packet losses, the spectrum should be used dynamically for backhaul connectivity. The deployment challenges for such a system in a disaster include the discovery of the available spectrum, existing networks, and neighbours. Furthermore, to set up a network and to establish network services, initially CR nodes are required to establish a rendezvous. However, this can be challenging due to unknown spectrum information, primary radio (PR) activity, nodes, and topology. The existing rendezvous strategies do not fulfill the DRN requirements and their time to rendezvous (TTR) is long. Therefore, we propose an extended modular clock algorithm (EMCA) which is a multiuser blind rendezvous protocol, considers the DRN requirements and has short TTR. For unknown nodes and topologies, a general framework for self-organizing multihop cooperative fully blind rendezvous protocol is also proposed, which works in different phases, can terminate when sufficient nodes are discovered, and is capable of disseminating the information of nodes which enter or leave a network. A synchronization mechanism is presented for periodic update of rendezvous information. An information exchange mechanism is also proposed which expedites the rendezvous process. In both single and multihop networks, EMCA provides up to 80% improvement in terms of TTR over the existing blind rendezvous strategies while considering the PR activity. A simple Random strategy, while being poorer than EMCA, is also shown to outperform existing strategies on average. To achieve adaptability in the presence of unknown PR activity, different CR operating policies are proposed which avoid the channels detected with PR activity to reduce the harmful interference, provide free channels to reduce the TTR, and can work with any rendezvous strategy. These policies are evaluated over different PR activities and shown to reduce the TTR and harmful interference significantly over the basic Listen before Talk approach. A proactive policy, which prefers to return to channels with recent lower PR activity, is shown to be best, and to improve the performance of all studied rendezvous strategies

Medium access in cognitive radio networks: From single hop to multiple hops

If channel assembling is enabled, this technique can be utilized for potential performance improvement in CRNs. Two use cases are envisaged for channel assembling. In the first use case, the system can accommodate parallel SU services in multiple channels, while in the second use case, the system allows only one SU service at a time. In the use case where parallel SU services are allowed, various channel assembling strategies are proposed and modeled in order to investigate their performance and to acquire better comprehension of the behavior of CRNs with channel assembling. Moreover, the capacity upper bound for CRNs with channel assembling in the quasistationary regime is derived. In the use case when there is only one SU service that can utilize the vacant channels at a time, we formulate channel access into two optimization problems on power allocation in multi-channel CRNs and propose various algorithms to solve these problems