Sciweavers

121 search results - page 5 / 25
» On the degree distribution of the nodes in increasing trees
Sort
View
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Combinatorial Models for Cooperation Networks
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
TCS
2010
13 years 6 months ago
A combinatorial approach to the analysis of bucket recursive trees
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
Markus Kuba, Alois Panholzer
AUTONOMICS
2008
ACM
13 years 9 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber

Presentation
956views
12 years 1 months ago
A Method for Distributed Computaion of Semi-Optimal Multicast Tree in MANET
In this paper, we propose a new method to construct a semi-optimal QoS-aware multicast tree on MANET using distributed computation of the tree based on Genetic Algorithm (GA). This...
APCHI
2008
IEEE
14 years 2 months ago
On Generating Backbone Trees through Robust Multi-hop Clusters in Wireless Sensor Networks
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...
Inyoung Shin, Moonseong Kim, Hyunseung Choo