TY - GEN
T1 - A stable clustering scheme by prediction of the staying time in a cluster for mobile ad hoc networks
AU - Kawai, Yuji
AU - Sasase, Iwao
PY - 2008/12/1
Y1 - 2008/12/1
N2 - We propose a new clustering scheme for Mobile Ad hoc NETworks (MANETs), which can maintain a stable clustering structure by predicting the staying time for a cluster and selecting an optimal clusterhead (CH) which a node affiliates with. In the proposed scheme, when there are multiple CHs in the node's one hop neighbors at the initial clustering set-up or the node's movement to the outside of the transmission range of its CH, each node predicts the time when it would stay in the transmission range of a CH by using past position information of itself and the CH, and selects the CH with the maximum predicted staying time within neighbor CHs, and affiliates with the CH. Therefore, each node can stay in the same cluster for a long time. In addition, the proposed clustering scheme normalizes the system parameters which are used in the weight value calculation. The simulation results show that the proposed clustering scheme can reduce the average numbers of reaffiliations and control overheads compared with Distributed Weighted Clustering Algorithm (DWCA). copyright
AB - We propose a new clustering scheme for Mobile Ad hoc NETworks (MANETs), which can maintain a stable clustering structure by predicting the staying time for a cluster and selecting an optimal clusterhead (CH) which a node affiliates with. In the proposed scheme, when there are multiple CHs in the node's one hop neighbors at the initial clustering set-up or the node's movement to the outside of the transmission range of its CH, each node predicts the time when it would stay in the transmission range of a CH by using past position information of itself and the CH, and selects the CH with the maximum predicted staying time within neighbor CHs, and affiliates with the CH. Therefore, each node can stay in the same cluster for a long time. In addition, the proposed clustering scheme normalizes the system parameters which are used in the weight value calculation. The simulation results show that the proposed clustering scheme can reduce the average numbers of reaffiliations and control overheads compared with Distributed Weighted Clustering Algorithm (DWCA). copyright
UR - http://www.scopus.com/inward/record.url?scp=66149135142&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=66149135142&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:66149135142
SN - 4885522323
SN - 9784885522321
T3 - 2008 14th Asia-Pacific Conference on Communications, APCC 2008
BT - 2008 14th Asia-Pacific Conference on Communications, APCC 2008
T2 - 2008 14th Asia-Pacific Conference on Communications, APCC 2008
Y2 - 14 October 2008 through 16 October 2008
ER -