1017 search results - page 60 / 204 » On Measuring Anonymity For Wireless Mobile Ad-hoc Networks |
110
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
EUROMICRO
2004
IEEE
15 years 1 months ago
2004
IEEE
The class of wireless and mobile networks features a dissimilar set of characteristics and constraints compared to traditional fixed networks. The various dimensions of these char...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
118
click to vote
MOBIHOC
2003
ACM
15 years 9 months ago
2003
ACM
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
MSWIM
2005
ACM
15 years 3 months ago
2005
ACM
In the last few years, the advance of multimedia applications has prompted researchers to undertake the task of routing multimedia data through Manet. This task is rather difficul...