403 search results - page 19 / 81 » Merging Clustering Algorithms in Mobile Ad Hoc Networks |
134
click to vote
VTC
2007
IEEE
15 years 8 months ago
2007
IEEE
— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...
102
click to vote
ICCCN
2007
IEEE
15 years 8 months ago
2007
IEEE
—Several recent research activities have started to recognize the relevant role of k-hop clustering in Mobile Ad hoc NETworks (MANET) to effectively support many relevant tasks, ...
142
click to vote
TMC
2008
15 years 1 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
118
click to vote
IJACI
2010
15 years 5 days ago
2010
Abstract. Ambient computing requires the integration of multiple mobile heterogeneous networks. Multi-path communication, in such scenarios, can provide reliability and privacy ben...
100
click to vote
ASE
2005
15 years 1 months ago
2005
As devices become smaller and wireless networking technologies improve, the popularity of mobile computing continues to rise. In today's world, many consider devices such as c...