English
Related papers

Related papers: On the Impact of Geometry on Ad Hoc Communication …

200 papers

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design…

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

In this paper we initiate a study of distributed deterministic broadcasting in ad-hoc wireless networks with uniform transmission powers under the SINR model. We design algorithms in two settings: with and without local knowledge about…

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

We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic results in this model rely on various additional features or…

Data Structures and Algorithms · Computer Science 2018-01-15 Tomasz Jurdzinski , Dariusz R. Kowalski , Michal Rozanski , Grzegorz Stachowiak

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 paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received power of a signal at a receiver against the sum of strengths…

Data Structures and Algorithms · Computer Science 2011-03-25 Erez Kantor , Zvi Lotker , Merav Parter , David Peleg

We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the…

Networking and Internet Architecture · Computer Science 2012-03-20 Eyjolfur I. Asgeirsson , Magnus M. Halldorsson , Pradipta Mitra

Radio networks are a long-studied model for distributed system of devices which communicate wirelessly. When these devices are mobile or have limited capabilities, the system is often best modeled by the ad-hoc variant, in which the devices…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-15 Artur Czumaj , Peter Davies

This paper studies broadcasting and gossiping algorithms in random and general AdHoc networks. Our goal is not only to minimise the broadcasting and gossiping time, but also to minimise the energy consumption, which is measured in terms of…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Petra Berenbrink , Colin Cooper , Zengjian Hu

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

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

The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signal-to-interference & noise ratio (SINR) model. For a collection of simultaneously transmitting stations…

Networking and Internet Architecture · Computer Science 2008-12-10 Chen Avin , Yuval Emek , Erez Kantor , Zvi Lotker , David Peleg , Liam Roditty

We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set…

Networking and Internet Architecture · Computer Science 2012-10-17 Magnus M. Halldorsson , Pradipta Mitra

In this paper we present a methodology employing statistical analysis and stochastic geometry to study geometric routing schemes in wireless ad-hoc networks. In particular, we analyze the network layer performance of one such scheme, the…

Networking and Internet Architecture · Computer Science 2014-01-21 Armin Banaei , Daren B. H. Cline , Costas N. Georghiades , Shuguang Cui

We give efficient algorithms for the fundamental problems of Broadcast and Local Broadcast in dynamic wireless networks. We propose a general model of communication which captures and includes both fading models (like SINR) and graph-based…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-05-10 Magnus M. Halldorsson , Tigran Tonoyan , Yuexuan Wang , Dongxiao Yu

In the light of energy conservation and the expansion of existing networks, wireless networks face the challenge of nodes with heterogeneous transmission power. However, for more realistic models of wireless communication only few…

Data Structures and Algorithms · Computer Science 2014-04-29 Fabian Fuchs , Dorothea Wagner

We consider protocols that serve communication requests arising over time in a wireless network that is subject to interference. Unlike previous approaches, we take the geometry of the network and power control into account, both allowing…

Networking and Internet Architecture · Computer Science 2012-03-07 Thomas Kesselheim

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example…

Statistical Mechanics · Physics 2007-05-23 Ingmar Glauche , Wolfram Krause , Rudolf Sollacher , Martin Greiner

Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise…

Performance · Computer Science 2007-05-23 Ashutosh Deepak Gore , Srikanth Jagabathula , Abhay Karandikar

In a wireless network the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Previously, connectivity in wireless networks was analyzed using static geometric graphs, and as we show leads to an…

Information Theory · Computer Science 2015-03-13 RadhaKrishna Ganti , Martin Haenggi

Considerable literature has been developed for various fundamental distributed problems in the SINR (Signal-to-Interference-plus-Noise-Ratio) model for radio transmission. A setting typically studied is when all nodes transmit a signal of…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-02-08 William K. Moses , Shailesh Vaya
‹ Prev 1 2 3 10 Next ›