1074 search results - page 96 / 215 » Energy Conserving Routing in Wireless Ad-hoc Networks |
200
click to vote
MOBIHOC
2002
ACM
16 years 5 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...
184
click to vote
MSWIM
2006
ACM
16 years 7 days 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...
193
click to vote
MOBIHOC
2002
ACM
16 years 5 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...
201
click to vote
IWCMC
2006
ACM
16 years 7 days ago
2006
ACM
Due to the growing interest in mobile wireless Ad-Hoc networks’ (MANETs) applications, researchers have proposed many routing protocols that differ in their objective. Energy ef...
189
click to vote
CIIT
2007
15 years 7 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...