EVALUATION OF K-/LATTICE-CLUSTERING ALGORITHMS FOR RANDOM WIRELESS MULTI-HOP NETWORKS
Toshihiko Sasama, Ryo Monde, Hiroshi Masuyama
2008
Abstract
A k-clustering protocol is an algorithm in which the wireless network is divided into non-overlapping sub networks, referred to as clusters, and where every node of a sub network is at most k hops from a distinguished station called the cluster-head. A lattice-clustering protocol is an algorithm in which a given area is divided by lattices and randomly distributed hosts in a lattice are one hop from the cluster-head. In this paper, we evaluated the energy eficiencies for the broadcasts designed in both k-clustering and lattice-clustering protocols. The evaluation showed that the k-clustering protocol is characterized by the smallest broadcasting power of each node, and a lattice-clustering protocol constitutes a characteristic feature of the most minimal total energy consumption. The main source of greater energy consumption in k-clustering protocol is a large number of transmissions between adjacent node pairs.
References
- V. Ravelomanana (2005). Distributed k-clustering algorithms for random wireless multihop networks. IEEE ICN.
Paper Citation
in Harvard Style
Sasama T., Monde R. and Masuyama H. (2008). EVALUATION OF K-/LATTICE-CLUSTERING ALGORITHMS FOR RANDOM WIRELESS MULTI-HOP NETWORKS . In Proceedings of the Fourth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-8111-26-5, pages 236-239. DOI: 10.5220/0001521302360239
in Bibtex Style
@conference{webist08,
author={Toshihiko Sasama and Ryo Monde and Hiroshi Masuyama},
title={EVALUATION OF K-/LATTICE-CLUSTERING ALGORITHMS FOR RANDOM WIRELESS MULTI-HOP NETWORKS},
booktitle={Proceedings of the Fourth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2008},
pages={236-239},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001521302360239},
isbn={978-989-8111-26-5},
}
in EndNote Style
TY - CONF
JO - Proceedings of the Fourth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - EVALUATION OF K-/LATTICE-CLUSTERING ALGORITHMS FOR RANDOM WIRELESS MULTI-HOP NETWORKS
SN - 978-989-8111-26-5
AU - Sasama T.
AU - Monde R.
AU - Masuyama H.
PY - 2008
SP - 236
EP - 239
DO - 10.5220/0001521302360239