Sciweavers

108 search results - page 16 / 22
» Spreading of Messages in Random Graphs
Sort
View
COCOON
2005
Springer
14 years 28 days ago
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
Xiang-Yang Li, Peng-Jun Wan
INFOCOM
2011
IEEE
12 years 11 months ago
Spherical representation and polyhedron routing for load balancing in wireless sensor networks
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...
Xiaokang Yu, Xiaomeng Ban, Wei Zeng, Rik Sarkar, X...
GCC
2005
Springer
14 years 28 days ago
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
Habib Rostami, Jafar Habibi
AHSWN
2008
92views more  AHSWN 2008»
13 years 7 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
INFOCOM
2009
IEEE
14 years 2 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...