Sciweavers

416 search results - page 25 / 84
» Engineering Route Planning Algorithms
Sort
View
COMCOM
2006
120views more  COMCOM 2006»
13 years 8 months ago
Explicit routing in multicast overlay networks
Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems....
Torsten Braun, Vijay Arya, Thierry Turletti
AINA
2010
IEEE
14 years 1 months ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
ICUMT
2009
13 years 6 months ago
Towards real implementations of dynamic robust routing exploiting path diversity
In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed throu...
Luca Muscariello, Diego Perino, Bruno Nardelli
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 8 months ago
Performance Analysis of an Improved Graded Precision Localization Algorithm for Wireless Sensor Networks
In this paper an improved version of the graded precision localization algorithm GRADELOC, called IGRADELOC is proposed. The performance of GRADELOC is dependent on the regions fo...
Sanat Sarangi, Subrat Kar
ISPD
1998
ACM
97views Hardware» more  ISPD 1998»
14 years 28 days ago
Device-level early floorplanning algorithms for RF circuits
—High-frequency circuits are notoriously difficult to lay out because of the tight coupling between device-level placement and wiring. Given that successful electrical performan...
Mehmet Aktuna, Rob A. Rutenbar, L. Richard Carley