Sciweavers

1578 search results - page 124 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
SPAA
2003
ACM
14 years 2 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
WOA
2003
13 years 10 months ago
Using a Properties Based Naming System in Mobile Agents Environments for Pervasive Computing
— Mobile Agents model is widely accepted as a good solution to simplify the coordination in a complex and distributed environment. Pervasive computing, presents many issues regar...
Fabio Tarantino, Alessio Ravani, Mario Zambrini
WINET
2010
185views more  WINET 2010»
13 years 7 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya
ERSA
2006
113views Hardware» more  ERSA 2006»
13 years 10 months ago
A Sensor Distribution Algorithm for FPGAs with Minimal Dynamic Reconfiguration Overhead
Thermal monitoring of a design plays a vital role to ensure safe and reliable thermal operating conditions. Thermal monitoring by employing thermal sensors is a popular technique ...
Rajarshi Mukherjee, Somsubhra Mondal, Seda Ogrenci...
ALGOSENSORS
2009
Springer
14 years 3 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