An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

  • Bomgni A
  • Myoupo J
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes an energy-efficient geocast algorithm for wireless sensor networks with guaranteed de-livery of packets from the sink to all nodes located in several geocast regions. Our approach is different from those existing in the literature. We first propose a hybrid clustering scheme: in the first phase we partition the network in cliques using an existing energy-efficient clustering protocol. Next the set of clusterheads of cliques are in their turn partitioned using an energy-efficient hierarchical clustering. Our approach to con-sume less energy falls into the category of energy-efficient clustering algorithm in which the clusterhead is located in the central area of the cluster. Since each cluster is a clique, each sensor is at one hop to the cluster head. This contributes to use less energy for transmission to and from the clusterhead, comparatively to multi hop clustering. Moreover we use the strategy of asleep-awake to minimize energy consumption during extra clique broadcasts.

Cite

CITATION STYLE

APA

Bomgni, A. B., & Myoupo, J. F. (2010). An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks. Communications and Network, 02(02), 125–133. https://doi.org/10.4236/cn.2010.22019

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free