Sciweavers

5922 search results - page 476 / 1185
» Navigability of Complex Networks
Sort
View
MOBIHOC
2008
ACM
16 years 4 months ago
Optimal relay assignment for cooperative communications
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Komp...
MOBIHOC
2008
ACM
16 years 4 months ago
P2P-based routing and data management using the virtual cord protocol (VCP)
We present Virtual Cord Protocol (VCP), a virtual relative position based routing protocol for sensor networks that also provides methods for data management as known from standar...
Abdalkarim Awad, Reinhard German, Falko Dressler
122
Voted
MOBIHOC
2001
ACM
16 years 4 months ago
Comparison between graph-based and interference-based STDMA scheduling
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
Anders Hansson, Jimmi Grönkvist
117
Voted
MOBIHOC
2003
ACM
16 years 4 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
WISEC
2010
ACM
16 years 6 hour ago
On the reliability of wireless fingerprinting using clock skews
Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. B...
Chrisil Arackaparambil, Sergey Bratus, Anna Shubin...