109 search results - page 14 / 22 » k-hop Backbone Formation in Ad Hoc Networks |
ISPAN
2002
IEEE
15 years 2 months ago
2002
IEEE
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
122
click to vote
ICDCS
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
ICDCSW
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we investigate the survivability of multilevel ad-hoc groups for critical operations through a case study. We aim to provide a formal trust framework for establishin...
PERCOM
2005
ACM
15 years 9 months ago
2005
ACM
This paper investigates a real-world problem termed "Bluetooth (BTH) pollution", which is expected to become commonplace as the mass deployment of BTH devices continues....
SPW
2000
Springer
15 years 1 months ago
2000
Springer
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...