Sciweavers

13214 search results - page 187 / 2643
» Pseudorandomness for network algorithms
Sort
View
ISPAN
2005
IEEE
16 years 4 days ago
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
Doina Bein, Ajoy Kumar Datta, Chakradhar R. Jaggan...
TWC
2008
135views more  TWC 2008»
15 years 6 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
ICC
2011
IEEE
239views Communications» more  ICC 2011»
14 years 6 months ago
The Insights of DV-Based Localization Algorithms in the Wireless Sensor Networks with Duty-Cycled and Radio Irregular Sensors
—Location information of nodes is the basis for many applications in wireless sensor networks (WSNs). However, most previous localization methods make the unrealistic assumption:...
Yuanfang Chen, Lei Shu, Mingchu Li, Ziqi Fan, Lei ...
P2P
2002
IEEE
103views Communications» more  P2P 2002»
15 years 11 months ago
Request Algorithms in Freenet-Style Peer-to-Peer Systems
In most peer-to-peer systems, edge resources self-organize into overlay networks. At the core of Freenet-style peer-to-peer systems are insert and request algorithms that dynamica...
Jens Mache, Melanie Gilbert, Jason Guchereau, Jeff...
ALGOSENSORS
2009
Springer
16 years 1 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal