English
Related papers

Related papers: Broadcast Analysis for Large Cooperative Wireless …

200 papers

The present paper focuses on the problem of broadcasting information in the most efficient manner in a large two-dimensional ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed,…

Information Theory · Computer Science 2016-11-18 Serj Haddad , Olivier Leveque

In this paper, we analyze the performance of cooperative transmissions in wireless ad hoc networks with random node locations. According to a contention probability for message transmission, each source node can either transmits its own…

Information Theory · Computer Science 2016-11-17 M. Mohammadi , H. A. Suraweera , X. Zhou

In this letter, we characterize the performance of broadcast approach with continuum of transmission layers in random wireless networks where the channel state information (CSI) is assumed to be known only at the receiver. By modeling the…

Information Theory · Computer Science 2019-04-09 Praful D. Mankar , Harpreet S. Dhillon

The aim of this paper is to study the effect of cooperation on system delay, quantified as the number of retransmissions required to deliver a broadcast message to all intended receivers. Unlike existing works on broadcast scenarios, where…

Information Theory · Computer Science 2013-06-19 Anvar Tukmanov , Zhiguo Ding , Said Boussakta , Abbas Jamalipour

A distributed adaptive algorithm to estimate a time-varying signal, measured by a wireless sensor network, is designed and analyzed. One of the major features of the algorithm is that no central coordination among the nodes needs to be…

Distributed, Parallel, and Cluster Computing · Computer Science 2008-10-22 Carlo Fischione , Alberto Speranzon , Karl H. Johansson , Alberto Sangiovanni-Vincentelli

In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of links, and hence, it needs to be accurately estimated for the efficient design and operation of wireless networks. In this paper, we address the…

Information Theory · Computer Science 2012-01-24 Sunil Srinivasa , Martin Haenggi

We consider a noncoherent wireless network, where the transmitters and receivers are cognizant of the statistics of the fading coefficients, but are ignorant of their realizations. We demonstrate that if the nodes do not cooperate, if they…

Information Theory · Computer Science 2015-07-02 Grace Villacrés , Tobias Koch

We consider distributed average consensus in a wireless network with partial communication to reduce the number of transmissions in every iteration/round. Considering the broadcast nature of wireless channels, we propose a probabilistic…

Multiagent Systems · Computer Science 2023-01-30 Daniel Pérez Herrera , Zheng Chen , Erik G. Larsson

A framework is developed for analyzing capacity gains from user cooperation in slow fading wireless networks when the number of nodes (network size) is large. The framework is illustrated for the case of a simple multipath-rich Rayleigh…

Information Theory · Computer Science 2009-09-29 Ashish Khisti , Uri Erez , Gregory Wornell

In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…

Information Theory · Computer Science 2012-01-24 Sunil Srinivasa , Martin Haenggi

This paper presents a two-phase cooperative communication strategy and an optimal power allocation strategy to transmit sensor observations to a fusion center in a large-scale sensor network. Outage probability is used to evaluate the…

Networking and Internet Architecture · Computer Science 2012-08-23 Li Li , Kamesh Namuduri , Shengli Fu

Broadcasting problem is an important issue in the wireless networks, especially in dynamic wireless networks. In dynamic wireless networks the node density and mobility is high, due to several problems which arise during broadcasting. Two…

Networking and Internet Architecture · Computer Science 2015-10-28 Ashima Goel , Debasis Das

WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…

Information Theory · Computer Science 2009-11-03 Georg Böcherer , Alexandre de Baynast

We investigate the use of network coding for information dissemination over a wireless network. Using network coding allows for a simple, distributed and robust algorithm where nodes do not need any information from their neighbors. In this…

Information Theory · Computer Science 2016-11-18 Mohammad Hamed Firooz , Sumit Roy

This paper derives the outage probability and transmission capacity of ad hoc wireless networks with nodes employing multiple antenna diversity techniques, for a general class of signal distributions. This analysis allows system performance…

Information Theory · Computer Science 2016-11-15 Andrew M. Hunter , Jeffrey G. Andrews , Steven Weber

Consider the communication of a single-user aided by a nearby relay involved in a large wireless network where the nodes form an homogeneous Poisson point process. Since this network is interference-limited the asymptotic error probability…

Information Theory · Computer Science 2011-03-14 Andres Altieri , Leonardo Rey Vega , Cecilia G. Galarza , Pablo Piantanida

We characterize the maximum achievable broadcast rate in a wireless network under various fading assumptions. Our result exhibits a duality between the performance achieved in this context by collaborative beamforming strategies and the…

Information Theory · Computer Science 2016-01-26 Serj Haddad , Olivier Leveque

A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the…

Information Theory · Computer Science 2007-11-05 Brooke Shrader , Anthony Ephremides

Connectivity is one of the most fundamental properties of wireless multi-hop networks. A network is said to be connected if there is a path between any pair of nodes. A convenient way to study the connectivity of a random network is by…

Information Theory · Computer Science 2012-10-08 Guoqiang Mao , Brian DO Anderson

An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a…

Information Theory · Computer Science 2009-10-10 V. Kurlin , L. Mihaylova
‹ Prev 1 2 3 10 Next ›