118
click to vote
IWDC
15 years 2 months ago
2005 Springer
:- The wide availability of mobile devices equipped with wireless communication capabilities together with the technical possibility to form ad hoc networks paves the way for build...
IWDC
15 years 2 months ago
2005 Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
IWDC
15 years 2 months ago
2005 Springer
Most of the proposed algorithms in ad hoc networks assume homogeneous nodes with similar transmission range and capabilities. However, in heterogeneous ad hoc network, it is not ne...
IWDC
15 years 2 months ago
2005 Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
IWDC
15 years 2 months ago
2005 Springer |