545 search results - page 75 / 109 » Routing in Multi-Channel Wireless Ad-hoc Networks: OSPF-MCDS... |
142
click to vote
MOBIHOC
2002
ACM
16 years 1 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...
124
click to vote
MSWIM
2006
ACM
15 years 7 months ago
2006
ACM
The simulation of wireless networks has been an important tool for researchers and the industry in the last years. Especially in the field of Mobile Ad Hoc Networking, most curre...
142
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
102
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
133
click to vote
CIIT
2007
15 years 2 months ago
2007
The cooperation of wireless nodes in ad hoc networks is crucial to ensure the proper working of the whole network due to the absence of infrastructure. Misbehaving nodes can drama...