2571 search results - page 145 / 515 » Approximation schemes for wireless networks |
202
click to vote
MOBIHOC
2009
ACM
16 years 1 months ago
2009
ACM
Wireless Mesh Networks (WMNs) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we d...
195
click to vote
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
213
click to vote
MOBIHOC
2002
ACM
16 years 6 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...
207
Voted
MOBIQUITOUS
2007
IEEE
16 years 1 months ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
157
Voted
SUTC
2006
IEEE
16 years 1 months ago
2006
IEEE
To the best of our knowledge, there are only few security schemes for Adhoc networks [1]. In this study, we work on a practical security mechanism for Adhoc networks. To balance b...