Results 41 to 50 of about 89,804 (156)
Performance Evaluation of a Topology Control Algorithm for Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2010 A main design challenge in the area of sensor networks is energy efficiency to prolong the network operable lifetime. Since most of the energy is spent for radio communication, an effective approach for energy conservation is scheduling sleep intervals ...
Nedal Ababneh
doaj +1 more source
Hyperbolic intersection graphs and (quasi)-polynomial time
, 2019 We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$.
Kisfaludi-Bak, Sándor
core +1 more source
Relaxed spanners for directed disk graphs [PDF]
, 2010 Let $(V,\delta)$ be a finite metric space, where $V$ is a set of $n$ points and $\delta$ is a distance function defined for these points. Assume that $(V,\delta)$ has a constant doubling dimension $d$ and assume that each point $p\in V$ has a disk of ...
Peleg, David, Roditty, Liam
core +4 more sources
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs [PDF]
, 2017 We give algorithms with running time 2^{O({sqrt{k}log{k}})} n^{O(1)} for the following problems. Given an n-vertex unit disk graph G and an integer k, decide whether G contains (i) a path on exactly/at least k vertices, (ii) a cycle on exactly k ...
Fomin, Fedor V. +4 more
core +2 more sources
Void Traversal for Guaranteed Delivery in Geometric Routing
, 2005 Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only.
Nesterenko, Mikhail, Vora, Adnan
core +1 more source
Determining Distributions of Security Means for WSNs Based on the Model of a Neighborhood Watch
IEEE AccessNeighbourhood watch is a concept allowing a community to distribute a complex security task in between all members. Members carry out security tasks in a distributed and cooperative manner ensuring their mutual security and reducing the individual ...
Benjamin Forster +2 more
doaj +1 more source
A PTAS for the minimum dominating set problem in unit disk graphs [PDF]
, 2004 We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs. In contrast to previously known approximation schemes for the minimum dominating set problem on unit disk graphs, our approach does not ...
Hurink, Johann, Nieberg, Tim
core +1 more source
Recognizing Weighted Disk Contact Graphs
, 2015 Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph.
Klemz, Boris +2 more
core +2 more sources
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
, 2017 Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS$_o$) algorithm to solve minimum dominating set problem in large graphs ...
Chalupa, David
core +1 more source
NP-hardness of the cluster minimization problem revisited
, 2005 The computational complexity of the "cluster minimization problem" is revisited [L. T. Wille and J. Vennik, J. Phys. A 18, L419 (1985)]. It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as ...
Artur B Adib +7 more
core +1 more source