English
Related papers

Related papers: Broadcast Analysis for Large Cooperative Wireless …

200 papers

In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…

Information Theory · Computer Science 2010-10-11 RadhaKrishna Ganti , Martin Haenggi

In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting…

Networking and Internet Architecture · Computer Science 2013-04-09 Md. Nazrul Islam , M. M. A. Hashem , A. M. Moshiur Rahman

The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as…

Data Structures and Algorithms · Computer Science 2014-08-29 Noga Alon , Mohsen Ghaffari , Bernhard Haeupler , Majid Khabbazian

Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of making available the same message to all collaborating nodes…

Information Theory · Computer Science 2016-11-17 Lun Dong , Athina P. Petropulu , H. Vincent Poor

In the advent of large-scale multi-hop wireless technologies, such as MANET, VANET, iThings, it is of utmost importance to devise efficient distributed protocols to maintain network architecture and provide basic communication tools. One of…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-19 Tomasz Jurdzinski , Dariusz R. Kowalski , Tomasz Maciejewski , Grzegorz Stachowiak

In this work, we explore the potential and optimal use of transmitter cooperation in wireless interference networks with deep fading conditions. We consider a linear interference network with K transmitter-receiver pairs, where each…

Information Theory · Computer Science 2017-12-11 Yasemin Karacora , Tolunay Seyfi , Aly El Gamal

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

Information Theory · Computer Science 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

In this paper, we study the broadcast problem in wireless networks when the broadcast is helped by a labelling scheme. We focus on two variants of broadcast: broadcast without acknowledgment (i.e. the initiator of the broadcast is not…

Networking and Internet Architecture · Computer Science 2020-01-30 Gewu Bu , Maria Potop-Butucaru , Mikael Rabie

This letter proposes a novel random medium access control (MAC) based on a transmission opportunity prediction, which can be measured in a form of a conditional success probability given transmitter-side interference. A transmission…

Networking and Internet Architecture · Computer Science 2019-12-16 Jinho Choi , Seung-Woo Ko , Koji Yamamoto , Seong-Lyun Kim

In wireless distributed computing, networked nodes perform intermediate computations over data placed in their memory and exchange these intermediate values to calculate function values. In this paper we consider an asymmetric setting where…

Information Theory · Computer Science 2017-08-10 Linqi Song , Sundara Rajan Srinivasavaradhan , Christina Fragouli

Recent research has demonstrated the importance of boundary effects on the overall connection probability of wireless networks, but has largely focused on convex domains. We consider two generic scenarios of practical importance to wireless…

Information Theory · Computer Science 2014-03-06 Mohammud Z. Bocus , Carl P. Dettmann , Justin P. Coon , Mohammed R. Rahman

In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the locations of the transmitters is often modeled as a Poisson…

Information Theory · Computer Science 2016-11-17 Radha Krishna Ganti , Jeffrey G. Andrews , Martin Haenggi

It is widely perceived that leveraging the success of modern machine learning techniques to mobile devices and wireless networks has the potential of enabling important new services. This, however, poses significant challenges, essentially…

Machine Learning · Computer Science 2023-04-13 Matei Moldoveanu , Abdellatif Zaidi

One formal way of studying cooperation and incentive mechanisms in wireless ad hoc networks is to use game theory. In this respect, simple interaction models such as the forwarder's dilemma have been proposed and used successfully. However,…

Networking and Internet Architecture · Computer Science 2020-12-04 Sara Berri , Samson Lasaulce , Mohammed Said Radjef

Outage probabilities and single-hop throughput are two important performance metrics that have been evaluated for certain specific types of wireless networks. However, there is a lack of comprehensive results for larger classes of networks,…

Information Theory · Computer Science 2016-11-18 Martin Haenggi

This paper presents results on the typical number of simultaneous point-to-point transmissions above a minimum rate that can be sustained in a network with $n$ transmitter-receiver node pairs when all transmitting nodes can potentially…

Information Theory · Computer Science 2014-12-10 Hengameh Keshavarz , Ravi R. Mazumdar , Rahul Roy , Farshid Zoghalchi

In this paper, we consider the performance of a random-access time-slotted wireless network with a single access point and a mix of half- and full- duplex stations. Full-duplex transmissions involve data transmitted simultaneously in both…

Information Theory · Computer Science 2014-07-15 Vaneet Aggarwal , N. K. Shankaranarayanan

In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., $n$ nodes are placed uniformly at random in a square region of area $n$). They…

Information Theory · Computer Science 2016-11-17 Urs Niesen , Piyush Gupta , Devavrat Shah

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…

Information Theory · Computer Science 2015-11-20 Ayşe Ünsal , Raymond Knopp

We study the transmission capacities of two coexisting wireless networks (a primary network vs. a secondary network) that operate in the same geographic region and share the same spectrum. We define transmission capacity as the product…

Information Theory · Computer Science 2016-11-17 Changchuan Yin , Long Gao , Tie Liu , Shuguang Cui