Ad-hoc networks beyond unit disk graphs
In this paper we study a model for ad-hoc networks close enough to reality as to represent
existing networks, being at the same time concise enough to promote strong theoretical …
existing networks, being at the same time concise enough to promote strong theoretical …
Emerging communication technologies based on wireless sensor networks: current research and future applications
MH Rehmani, ASK Pathan - 2016 - books.google.com
This book fills a gap in the existing literature by combining a plethora of WSN-based
emerging technologies into a single source so that reviewers can form opinions regarding …
emerging technologies into a single source so that reviewers can form opinions regarding …
Deterministic boundary recognition and topology extraction for large sensor networks
We present a new framework for the crucial challenge of self-organization of a large sensor
network. The basic scenario can be described as follows: Given a large swarm of immobile …
network. The basic scenario can be described as follows: Given a large swarm of immobile …
Localization and routing in sensor networks by local angle information
Location information is useful both for network organization and for sensor data integrity. In
this article, we study the anchor-free 2D localization problem by using local angle …
this article, we study the anchor-free 2D localization problem by using local angle …
On a conjecture related to geometric routing
CH Papadimitriou, D Ratajczak - Theoretical Computer Science, 2005 - Elsevier
We conjecture that any planar 3-connected graph can be embedded in the plane in such a
way that for any nodes s and t, there is a path from s to t such that the Euclidean distance to t …
way that for any nodes s and t, there is a path from s to t such that the Euclidean distance to t …
[PDF][PDF] Survey and taxonomy of unicast routing protocols for mobile ad hoc networks
N Meghanathan - The International Journal on Applications of …, 2009 - researchgate.net
The purpose of this paper is to survey the unicast routing protocols for mobile ad hoc
networks (MANETs) and study their primary route selection principle. In this context, we did …
networks (MANETs) and study their primary route selection principle. In this context, we did …
An algorithmic approach to geographic routing in ad hoc and sensor networks
The one type of routing in ad hoc and sensor networks that currently appears to be most
amenable to algorithmic analysis is geographic routing. This paper contains an introduction …
amenable to algorithmic analysis is geographic routing. This paper contains an introduction …
Hole detection or: " how much geometry hides in connectivity?"
S Funke, C Klein - Proceedings of the twenty-second annual symposium …, 2006 - dl.acm.org
Wireless sensor networks typically consist of small, very simple network nodes without any
positioning device like GPS. After an initialization phase, the nodes know with whom they …
positioning device like GPS. After an initialization phase, the nodes know with whom they …
Functional completeness of planar Rydberg blockade structures
The construction of Hilbert spaces that are characterized by local constraints as the low-
energy sectors of microscopic models is an important step towards the realization of a wide …
energy sectors of microscopic models is an important step towards the realization of a wide …
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
The distributed complexity of computing a maximal independent set in a graph is of both
practical and theoretical importance. While there exists an elegant O (log n) time …
practical and theoretical importance. While there exists an elegant O (log n) time …