Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

DIALM
2003
ACM

favoriteEmaildiscussreport

133views Algorithms» more DIALM 2003»

Ad-hoc networks beyond unit disk graphs

13 years 9 months ago

Ad-hoc networks beyond unit disk graphs

Download dcg.ethz.ch

In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufﬁciently close to reality as to represent practical realworld networks while at the same time being concise enough to promote strong theoretical results. The quasi unit disk graph model contains all edges shorter than a

Fabian Kuhn, Aaron Zollinger

Real-time Traffic

DIALM 2003 | Practical Realworld Networks | Quasi Unit Disk | Wireless Ad Hoc |

claim paper

Related Content

» Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range

» Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks

» Geometric Spanners for Wireless Ad Hoc Networks

» A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks

» Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks

» SPTbased topology algorithm for constructing power efficient wireless ad hoc networks

» Localized construction of bounded degree and planar spanner for wireless ad hoc networks

» 3d local algorithm for dominating sets of unit disk graphs

» Virtual coordinates for ad hoc and sensor networks

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	DIALM
Authors	Fabian Kuhn, Aaron Zollinger

Comments (0)