MOBICOM

In this paper we consider a special class of relaying schemes known as decode and forward. The main goal of this work is to quantify the impact of an average delay constraint on the optimal throughput achieved by the source. To this aim, we use Markov ...

In this work we consider the problem of sensor network localization when only the connectivity information is available. More specifically, we compare the performance of the centralized algorithm MDS-MAP with its distributed version HOP-TERRAIN. We show ...

Video broadcast and mobile video challenge the conventional wireless design. In broadcast and mobile scenarios the bit rate supported by the channel differs across receivers and varies quickly over time. The conventional design however forces the source ...

In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, for two cases: i. communication link's capacity is fixed; and ii. the sum capacity of all links in the system is fixed. Byzantine is a classical problem in ...

Efficient operation of wireless networks and switches requires using simple scheduling algorithms. In general, simple greedy algorithms (known as Greedy Maximal Scheduling - GMS) are guaranteed to achieve only a fraction of the maximum possible ...

It is often stated that sensing based opportunistic spectrum sharing requires several tens of sensors or infrastructure support to achieve a reliable Primary User (PU) detection. This is considered a significant entry barrier for opportunistic, sensing ...

We conduct a large-scale user study to measure the energy consumption characteristics of 17300 BlackBerry smartphone users. Our dataset consists of over 1050 years of cumulative data and is several orders of magnitude larger than any previous work. We ...

The limitations of contact-logging experiments, particularly those based on periodic Bluetooth neighborhood scans, prevent them from detecting many contact opportunities. This paper highlights recent results on inferring a plausible movement from ...

User association logs collected from real-world wireless LANs have facilitated wireless network research greatly. To protect user privacy, the common practice in sanitizing these data before releasing them to the public is to anonymize users' sensitive ...

This paper presents PUMA, a novel declarative constraint-solving architecture that achieves efficient policy-based adaptive routing and channel selection for wireless networks. PUMA is based on declarative networking, a database-inspired extensible ...

Despite of findings that only 5.2% of the spectrum from 30 MHz to 3 GHz is utilized, there is much talk of an impending spectrum crisis. This is no contradiction - spectrum is inefficiently utilized, with some part of the spectrum being heavily used ...

In this paper, we describe the design, implementation, and evaluation of Bologna, a practical block-based IEEE 802.11 data transmission recovery protocol. Bologna is built on a well-known recovery scheme that identifies corrupted bit blocks by ...

We have deployed a large-scale multi-tier wireless network in one of Houston's most economically disadvantaged neighborhoods. The network serves two objectives: empowering under-resourced communities with access to technology, education and work-at-home ...

In this paper, we present WARPLab, a framework for the rapid prototyping and implementation of physical layer algorithms for wireless LANs. WARPLab is based on WARP, an FPGA-based, wireless experimental platform. We first give an overview of WARPLab and ...

Wireless mesh network research has been an active area in the past few years. In order to expand on the wealth of mesh network research, we have deployed a wireless mesh network in a natural reserve to serve as a research platform. QuRiNet, the Quail ...