Local solutions for global problems in wireless networks (Q2466005): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2006.05.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075105933 / rank | |||
Normal rank | |||
Revision as of 15:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local solutions for global problems in wireless networks |
scientific article |
Statements
Local solutions for global problems in wireless networks (English)
0 references
11 January 2008
0 references
The author reviews the basic mathematical structures that develop local algorithms in unit distance wireless (UDW) networks. The problems reviewed are the following: Given a connected UDW network, can a local algorithm be designed to extract a connected planar subgraph from it? Can a connected subgraph of a UDW network be obtained such that the weight of the graph is close to the weight of the minimum weight spanning tree of the UDW network? The author also presents two new algorithms. The first colours the edges of a planar subgraph of a network, and the second obtains small dominating sets of vertices. These algorithms are local, and use a novel technique of tilings of the plane.
0 references
local algorithms
0 references
routing
0 references
ad hoc and wireless networks
0 references
dominating sets
0 references
local vertex coloring
0 references
