552 search results - page 12 / 111 » Routing complexity of faulty networks |
MOBIHOC
2012
ACM
11 years 10 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—This paper presents an architectural solution to address the problem of scalable routing in very large sensor networks. The control complexities of the existing sensor routing p...
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
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 ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...