Authors:
Toshihiko Sasama
;
Ryo Monde
and
Hiroshi Masuyama
Affiliation:
Tottori University, Japan
Keyword(s):
Ad hoc networks, Broadcast, Clustering, Energy consumption, Protocol, Simulation, Wireless.
Related
Ontology
Subjects/Areas/Topics:
Internet Technology
;
Protocols and Standards
;
Web Information Systems and Technologies
;
Wireless Applications
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.