Sciweavers

13214 search results - page 401 / 2643
» Pseudorandomness for network algorithms
Sort
View
PIMRC
2008
IEEE
16 years 1 months ago
Distributed network utility optimization in wireless sensor networks using power control
—We extend the existing network utility maximization (NUM) framework for wired networks to wireless sensor networks by formulating it in order to take into account interference a...
George Tichogiorgos, Kin K. Leung, Archan Misra, T...
ONDM
2001
15 years 8 months ago
Mapping of Arbitrary Traffic Demand and Network Topology on a Mesh of Rings Network
An efficient algorithm is presented to map an arbitrary traffic pattern and network topology on a mesh of rings network. The network is described by a two-layer model. The first la...
Christian Mauz
TWC
2010
15 years 1 months ago
PIE: cooperative peer-to-peer information exchange in network coding enabled wireless networks
In this paper, we study the issue of scheduling transmission opportunities among nodes (peers) to achieve higher network throughput and lower transmission delay for network coding ...
Yanfei Fan, Yixin Jiang, Haojin Zhu, Xuemin Shen
PODC
2009
ACM
16 years 7 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
IPPS
1996
IEEE
15 years 11 months ago
A Class of Interconnection Networks for Multicasting
Multicast, or one-to-many, communication arises frequently in parallel computing and telecommunication applications. Multicast networks can simultaneously support multiple multicas...
Yuanyuan Yang