Sciweavers

100 search results - page 8 / 20
» Least Cost Multicast Spanning Tree Algorithm for Local Compu...
Sort
View
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 7 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
AINTEC
2006
Springer
13 years 11 months ago
A Topology-Aware Overlay Multicast Approach for Mobile Ad-Hoc Networks
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
Mohamed Ali Kâafar, Cyrine Mrabet, Thierry T...
ICUMT
2009
13 years 5 months ago
sDLS - Distributed Least Squares localization for large Wireless Sensor Networks
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solut...
Ralf Behnke, Jakob Salzmann, Dominik Lieckfeldt, D...
WINET
2010
224views more  WINET 2010»
13 years 5 months ago
Hierarchical geographic multicast routing for wireless sensor networks
Wireless sensor networks comprise typically dense deployments of large networks of small wireless capable sensor devices. In such networks, multicast is a fundamental routing servi...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...
AINA
2007
IEEE
14 years 1 months ago
A Distributed and Dynamic Data Gathering Protocol for Sensor Networks
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
Hüseyin Özgür Tan, Ibrahim Korpeogl...