Related papers: On Distributed Function Computation in Structure-F…
The introduction of relay station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's long term evolution advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game…
This paper studies the power of the "abstract MAC layer" model in a single-hop asynchronous network. The model captures primitive properties of modern wireless MAC protocols. In this model, Newport [PODC '14] proves that it is impossible to…
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of sampling random walks efficiently in a…
Wireless sensor networks require communication protocols for efficiently propagating data in a distributed fashion. The Trickle algorithm is a popular protocol serving as the basis for many of the current standard communication protocols.…
Massive numbers of nodes will be connected in future wireless networks. This brings great difficulty to collect a large amount of data. Instead of collecting the data individually, computation over multi-access channel (CoMAC) provides an…
We consider collocated wireless sensor networks, where each node has a Boolean measurement and the goal is to compute a given Boolean function of these measurements. We first consider the worst case setting and study optimal block…
In this article, we consider a random access scheme for an indoor Internet of Things (IoT) framework that uses optical wireless communication (OWC). We focus on a Slotted ALOHA (SA)-based solution where a number of OWC IoT users contend to…
This paper is concerned with the scaling of the number of hops in a large scale wireless ad-hoc network (WANET), a quantity we call network latency. A large network latency affects all aspects of data communication in a WANET, including an…
The feasibility of practical in-band full-duplex radios has recently been demonstrated experimentally. One way to leverage full-duplex in a network setting is to enable three-node full-duplex, where a full- duplex access point (AP)…
Data communication in sensor networks can have timing constraints like end to end deadlines. If the deadlines are not met either a catastrophe can happen in hard real time systems or performance deterioration can occur in soft real time…
We study multi-hop data-dissemination in a wireless network from one source to multiple nodes where some of the nodes of the network act as re-transmitting nodes and help the source in data dissemination. In this network, we study two…
This paper presents a tractable analytical framework for the exact calculation of probability of node isolation and minimum node degree distribution when $N$ sensor nodes are independently and uniformly distributed inside a finite square…
We consider a wireless distributed computing system, in which multiple mobile users, connected wirelessly through an access point, collaborate to perform a computation task. In particular, users communicate with each other via the access…
We consider a single-cell massive MIMO full-duplex wireless communication system, where the base-station (BS) is equipped with a large number of antennas. We consider the setup where the single-antenna mobile users operate in half- duplex,…
The topology of a wireless multi-hop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based distributed topology control algorithm. This algorithm, introduced in…
This paper studies the problem of broadcasting real-time flows in multi-hop wireless networks. We consider that each packet has a stringent deadline, and each node in the network obtains some utility based on the number of packets delivered…
Performing random walks in networks is a fundamental primitive that has found numerous applications in communication networks such as token management, load balancing, network topology discovery and construction, search, and peer-to-peer…
In this paper, we study distributed consensus in the radio network setting. We produce new upper and lower bounds for this problem in an abstract MAC layer model that captures the key guarantees provided by most wireless MAC layers. In more…
Franceschetti et al. have recently shown that per-node throughput in an extended, ad hoc wireless network with $\Theta(n)$ randomly distributed nodes and multihop routing can be increased from the $\Omega({1 \over \sqrt{n} \log n})$ scaling…
This paper considers max-min fair rate allocation and routing in energy harvesting networks where fairness is required among both the nodes and the time slots. Unlike most previous work on fairness, we focus on multihop topologies and…