Sciweavers

1404 search results - page 117 / 281
» On General Laws of Complex Networks
Sort
View
PODC
2005
ACM
15 years 9 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
IWCMC
2006
ACM
15 years 10 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
MOBIHOC
2008
ACM
16 years 3 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 3 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
MOBIHOC
2003
ACM
16 years 3 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