Related papers: An Upper Bound on Multi-hop Transmission Capacity …
Achieving optimal transmission throughput in data networks in a multi-hop wireless networks is fundamental but hard problem. The situation is aggravated when nodes are mobile. Further, multi-rate system make the analysis of throughput more…
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…
Network capacity region is an important character of mobile ad hoc networks. Using cell-partitioned model, an expression of upper bound of delay-tolerant hybrid mobile ad hoc network is deduced regardless of coverage of base stations, types…
We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between sourcedestination…
In this paper, we study the relay selection problem in multi-user, multi-hop relay networks with the objective of minimizing the maximum outage probability across all users. When only one user is present, it is well known that the optimal…
A multi-hop relaying system is analyzed where data sent by a multi-antenna source is relayed by successive multi-antenna relays until it reaches a multi-antenna destination. Assuming correlated fading at each hop, each relay receives a…
We consider the problem of resource allocation and control of multihop networks in which multiple source-destination pairs communicate confidential messages, to be kept confidential from the intermediate nodes. We pose the problem as that…
A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop as the protocol operates to establish new routes. In this…
The availability of very wide spectrum in millimeter wave bands combined with large antenna arrays and ultra dense networks raises two basic questions: What is the true value of overly abundant degrees of freedom and how can networks be…
Network coding is all about combining a variety of packets and forwarding as much packets as possible in each transmission operation. The network coding technique improves the throughput efficiency of multi-hop wireless networks by taking…
We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…
In recent years, the application of artificial intelligence (AI) in wireless communications has demonstrated inherent robustness against wireless channel distortions. Most existing works empirically leverage this robustness to yield…
We consider the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of…
We study the problem of geometric optimization of medium access control in multi-hop wireless network. We discuss the optimal placements of simultaneous transmitters in the network and our general framework allows us to evaluate the…
Multi-hop relaying is an economically efficient architecture for coverage extension and throughput enhancement in future wireless networks. OFDM, on the other hand, is a spectrally efficient physical layer modulation technique for broadband…
This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general…
Consider networks on $n$ vertices at average density 1 per unit area. We seek a network that minimizes total length subject to some constraint on journey times, averaged over source-destination pairs. Suppose journey times depend on both…
This paper presents a dual method of closed-form analysis and lightweight simulation that enables an evaluation of the performance of mobile ad hoc networks that is more realistic, efficient, and accurate than those found in existing…
The control problem of a linear discrete-time dynamical system over a multi-hop network is explored. The network is assumed to be subject to packet drops by malicious and nonmalicious nodes as well as random and malicious data corruption…
Inspired by the Statistical Physics of complex networks, wireless multihop ad hoc communication networks are considered in abstracted form. Since such engineered networks are able to modify their structure via topology control, we search…