403 search results - page 16 / 81 » Merging Clustering Algorithms in Mobile Ad Hoc Networks |
109
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Many previously proposed routing metrics and algorithms for ad hoc networks work well in static networks, however, when nodes are moving and wireless links may fail from time t...
BROADNETS
2004
IEEE
15 years 3 months ago
2004
IEEE
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along mu...
WWW
2004
ACM
16 years 11 days ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
WONS
2005
IEEE
15 years 5 months ago
2005
IEEE
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--A novel cluster-head selection and update algorithm "Typebased Cluster-forming Algorithm (TCA)" is proposed, which outperforms both the lowest node ID (LID) and...