Related papers: Optimizing Local Capacity of Wireless Ad Hoc Netwo…
In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…
The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Assuming that the transmitter locations are…
In this paper, we present a framework for distributively optimizing the transmission strategies of secondary users in an ad hoc cognitive radio network. In particular, the proposed approach allows secondary users to set their transmit…
This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in…
We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…
We propose a selection region based multi-hop routing protocol for random mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and a selection angle. At each hop, a relay is chosen as the…
In this paper, we study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies which rely on the use of centralized scheduling algorithm and/or centralized routing algorithm to achieve the optimal…
We develop a framework for communication-control co-design in a wireless networked control system with multiple geographically separated controllers and controlled systems, modeled via a Poisson point process. Each controlled system…
Previous work on ad hoc network capacity has focused primarily on source-destination throughput requirements for different models and transmission scenarios, with an emphasis on delay tolerant applications. In such problems, network…
We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…
Capacity scaling of a large hybrid network with unit node density, consisting of $n$ wireless ad hoc nodes, base stations (BSs) equipped with multiple antennas, and one remote central processor (RCP), is analyzed when wired backhaul links…
Accommodating the needs of a large number of diverse users in the Internet of Things (IoT), notably managing how the users access the common channel, has posed unique challenges to the network designers. In this paper, we study a…
A key feature in the design of any MAC protocol is the throughput it can provide. In wireless networks, the channel of a user is not fixed but varies randomly. Thus, in order to maximize the throughput of the MAC protocol at any given time,…
In a cognitive radio (CR) network, CR users intend to operate over the same spectrum band licensed to legacy networks. A tradeoff exists between protecting the communications in legacy networks and maximizing the throughput of CR…
This work aims at combining adaptive protocol design, utility maximization and stochastic geometry. We focus on a spatial adaptation of Aloha within the framework of ad hoc networks. We consider quasi-static networks in which mobiles learn…
In this paper, we propose a selection region based multihop routing protocol with directional antennas for wireless mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and the beamwidth of…
In wireless networks, where each node transmits independently of other nodes in the network (the ALOHA protocol), the expected delay experienced by a packet until it is successfully received at any other node is known to be infinite for…
Ad-hoc networks, a promising trend in wireless technology, fail to work properly in a global setting. In most cases, self-organization and cost-free local communication cannot compensate the need for being connected, gathering urgent…
We consider a wireless ad hoc network in the presence of eavesdroppers (EDs), where the nodes are distributed according to independent Poisson point processes (PPPs). The legitimate nodes follow the half-duplex mode of operation employing…
Full exploitation of the bandwidth resources of Wireless Networks is challenging because of the sharing of the radio medium among neighboring nodes. Practical algorithms and distributed schemes that tries to optimising the use of the…