English
Related papers

Related papers: Broadcast Analysis for Large Cooperative Wireless …

200 papers

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad A. Maddah-Ali , Amir K. Khandani

We study the flow-level performance of random wireless networks. The locations of base stations (BSs) follow a Poisson point process. The number and positions of active users are dynamic. We associate a queue to each BS. The performance and…

Information Theory · Computer Science 2013-08-23 Richard Combes , Eitan Altman

As the use of wireless sensor networks increases, the need for (energy-)efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of…

Networking and Internet Architecture · Computer Science 2014-07-24 Thomas M. M. Meyfroyt , Sem C. Borst , Onno J. Boxma , Dee Denteneer

We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordinate system in the plane, further they do not know their…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-06-15 Bogdan S. Chlebus , Dariusz R. Kowalski , Shailesh Vaya

The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can significantly increase the overall throughput of wireless networks by…

Information Theory · Computer Science 2007-07-13 Salim Y. El Rouayheb , Mohammad Asad R. Chaudhry , Alex Sprintson

Relaying techniques for millimeter-wave wireless networks represent a powerful solution for improving the transmission performance. In this work, we quantify the benefits in terms of delay and throughput for a random-access multi-user…

Networking and Internet Architecture · Computer Science 2019-03-08 Cristian Tatino , Nikolaos Pappas , Ilaria Malanchini , Lutz Ewe , Di Yuan

The problem of decentralized detection in a sensor network subjected to a total average power constraint and all nodes sharing a common bandwidth is investigated. The bandwidth constraint is taken into account by assuming non-orthogonal…

Information Theory · Computer Science 2007-07-13 Sudharman K. Jayaweera

This paper analyzes the behavior of selfish transmitters under imperfect location information. The scenario considered is that of a wireless network consisting of selfish nodes that are randomly distributed over the network domain according…

Information Theory · Computer Science 2009-07-03 Hazer Inaltekin , Mung Chiang , H. Vincent Poor

Wireless networks are characterized by a dynamic topology triggered by the nodes mobility. Thus, the wireless multi-hops connection and the channel do not have a determinist behaviour such as: interference or multiple paths. Moreover, the…

Networking and Internet Architecture · Computer Science 2012-02-09 A. Rhattoy , A. Zatni

The spectral efficiency of a representative uplink of a given length, in interference-limited, spatially-distributed wireless networks with hexagonal cells, simple power control, and multiantenna linear Minimum-Mean-Square-Error receivers…

Information Theory · Computer Science 2015-03-18 Siddhartan Govindasamy , Daniel W. Bliss , David H. Staelin

In this paper, a cooperative transmission design for a general multi-node half-duplex wireless relay network is presented. It is assumed that the nodes operate in half-duplex mode and that channel information is available at the nodes. The…

Information Theory · Computer Science 2009-11-17 Debdeep Chatterjee , Tan F. Wong , Tat M. Lok

We consider nanonodes randomly distributed in a circular area and characterize the received signal strength when a pair of these nodes employ molecular communication. Two communication methods are investigated, namely free diffusion and…

Emerging Technologies · Computer Science 2018-01-29 Rafay Iqbal Ansari , Chrysostomos Chrysostomou , Taqwa Saeed , Marios Lestas , Andreas Pitsillides

In large wireless networks, acquiring full network state information is typically infeasible. Hence, nodes need to flow the information and manage the interference based on partial information about the network. In this paper, we consider…

Information Theory · Computer Science 2015-03-17 Alireza Vahid , Vaneet Aggarwal , Amir Salman Avestimehr , Ashutosh Sabharwal

This letter presents a probabilistic omnidirectional millimeter-wave path loss model based on real-world 28 GHz and 73 GHz measurements collected in New York City. The probabilistic path loss approach uses a free space line-of-sight…

Information Theory · Computer Science 2016-11-17 Mathew K. Samimi , Theodore S. Rappaport , George R. MacCartney

We investigate methods for network association that improve the reliability of uplink transmissions in dense wireless heterogeneous networks. The stochastic geometry analysis shows that the double association, in which an uplink…

Information Theory · Computer Science 2016-04-05 Dong Min Kim , Petar Popovski

Consider n nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated to all other nodes. Time is slotted, and a time slot is long enough for each node to broadcast one packet. Each…

Information Theory · Computer Science 2021-07-23 Mark A. Graham , Ayalvadi J. Ganesh , Robert J. Piechocki

This paper reviews the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the…

Information Theory · Computer Science 2021-01-19 Ali Tajer , Avi Steiner , Shlomo Shamai

A two-hop wireless communication link in which a source sends data to a destination with the aid of an intermediate relay node is studied. It is assumed that there is no direct link between the source and the destination, and the relay…

Information Theory · Computer Science 2011-07-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

Many analytic results for the connectivity, coverage, and capacity of wireless networks have been reported for the case where the number of nodes, $n$, tends to infinity (large-scale networks). The majority of these results have not been…

Information Theory · Computer Science 2012-11-12 Ali Eslami , Mohammad Nekoui , Hossein Pishro-Nik , F. Fekri

A collaborative distributed binary decision problem is considered. Two statisticians are required to declare the correct probability measure of two jointly distributed memoryless process, denoted by $X^n=(X_1,\dots,X_n)$ and…

Information Theory · Computer Science 2016-04-11 Gil Katz , Pablo Piantanida , Merouane Debbah