English
Related papers

Related papers: A Cut-off Phenomenon in Location Based Random Acce…

200 papers

This paper analyzes the asymptotic behavior of a multiple-access network comprising a large number of selfish transmitters competing for access to a common wireless communication channel, and having different utility functions for…

Information Theory · Computer Science 2016-11-15 Hazer Inaltekin , Mung Chiang , Harold Vincent Poor , Stephen B. Wicker

This paper considers a conjecture-based distributed learning approach that enables autonomous nodes to independently optimize their transmission probabilities in random access networks. We model the interaction among multiple…

Computer Science and Game Theory · Computer Science 2009-12-09 Yi Su , Mihaela van der Schaar

The Nash equilibrium point of the transmission probabilities in a slotted ALOHA system with selfish nodes is analyzed. The system consists of a finite number of heterogeneous nodes, each trying to minimize its average transmission…

Computer Science and Game Theory · Computer Science 2015-10-28 Fu-Te Hsu , Hsuan-Jung Su

This paper studies an interference interaction (game) between selfish and independent wireless communication systems in the same frequency band. Each system (player) has incomplete information about the other player's channel conditions. A…

Information Theory · Computer Science 2015-05-18 Yair Noam , Amir Leshem , Hagit Messer

In distributed wireless networks, nodes often do not know the topology (network size, connectivity and the channel gains) of the network. Thus, they have to compute their transmission and reception parameters in a distributed fashion. In…

Information Theory · Computer Science 2009-10-21 Vaneet Aggarwal , Salman Avestimehr , Ashutosh Sabharwal

In a wireless mesh network (WMN), high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. WMNs provide reliable connectivity and…

Cryptography and Security · Computer Science 2012-09-09 Jaydip Sen

We consider a network of nodes distributed in physical space without physical links communicating through message broadcasting over specified distances. Typically, communication using smaller distances is desirable due to savings in energy…

Adaptation and Self-Organizing Systems · Physics 2009-11-13 May Lim , Dan Braha , Sanith Wijesinghe , Stephenson Tucker , Yaneer Bar-Yam

A novel scenario-adapted distributed signaling technique in the context of opportunistic communications is presented in this work. Each opportunistic user acquires locally sampled observations from the wireless environment to determine the…

Information Theory · Computer Science 2021-11-01 Jordi Borras , Gregori Vazquez

Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to…

Cryptography and Security · Computer Science 2010-11-09 Jaydip Sen , Kaustav Goswami

Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to…

Cryptography and Security · Computer Science 2021-09-07 Jaydip Sen

In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…

Information Theory · Computer Science 2015-03-19 Zhou Zhang , Hai Jiang

Practical wireless networks are finite, and hence non-stationary with nodes typically non-homo-geneously deployed over the area. This leads to a location-dependent performance and to boundary effects which are both often neglected in…

Information Theory · Computer Science 2014-01-03 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

Distributed Opportunistic Scheduling (DOS) is inherently harder than conventional opportunistic scheduling due to the absence of a central entity that has knowledge of all the channel states. With DOS, stations contend for the channel using…

Networking and Internet Architecture · Computer Science 2015-03-19 Albert Banchs , Andres Garcia-Saavedra , Pablo Serrano , Joerg Widmer

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 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

We analyze Age of Information (AoI) in wireless networks where nodes use a spatially adaptive random access scheme to send status updates to a central base station. We show that the set of achievable AoI in this setting is convex, and…

Networking and Internet Architecture · Computer Science 2023-01-06 Nicholas Jones , Eytan Modiano

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

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…

Systems and Control · Computer Science 2018-09-24 Ahmet Cetinkaya , Hideaki Ishii , Tomohisa Hayakawa

A statistical model of interference in wireless networks is considered, which is based on the traditional propagation channel model and a Poisson model of random spatial distribution of nodes in 1-D, 2-D and 3-D spaces with both uniform and…

Information Theory · Computer Science 2009-06-01 Vladimir Mordachev , Sergey Loyka

Wireless networks are fundamentally limited by the intensity of the received signals and by their inherent interference. It is shown here that in finite ad hoc networks where node placement is modelled according to a Poisson point process…

Networking and Internet Architecture · Computer Science 2015-04-09 Orestis Georgiou , Shanshan Wang , Mohammud Z. Bocus , Carl P. Dettmann , Justin P. Coon
‹ Prev 1 2 3 10 Next ›