Local solutions for global problems in wireless networks (Q2466005)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Local solutions for global problems in wireless networks |
scientific article; zbMATH DE number 5225235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local solutions for global problems in wireless networks |
scientific article; zbMATH DE number 5225235 |
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
0 references
0 references
0 references
0.86599183
0 references
0.86539364
0 references
0.8536707
0 references
0.8533132
0 references
0 references
