2009 2nd International Conference on Computer Science and Its Applications 2009
DOI: 10.1109/csa.2009.5404303
|View full text |Cite
|
Sign up to set email alerts
|

AEEC-Adaptive and Energy Efficient Clustering Algorithm for Content Based Wireless Sensor Networks

Abstract: Wireless sensor network (WSN) has increasingly been used for many applications such as building distributed systems, military applications, remote environmental monitoring and target tracking among others. This has been enabled by the availability, particularly in recent years, of sensors that are smaller, cheaper and intelligent. However, sensor nodes operate on limited battery power, energy usage is a very important concern in a WSN. There has been significant research focus that revolves around harvesting a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 10 publications
0
6
0
Order By: Relevance
“…To evaluate the performances of the different versions of BLAC, we perform some simulations under the WSNET simulator 2 . We compare the four variants of BLAC to three close approaches of the literature: DDR [11] and density-based clustering [10] because of their algorithmic proximity to BLAC and LEACH [7] because of its energy efficiency concern.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…To evaluate the performances of the different versions of BLAC, we perform some simulations under the WSNET simulator 2 . We compare the four variants of BLAC to three close approaches of the literature: DDR [11] and density-based clustering [10] because of their algorithmic proximity to BLAC and LEACH [7] because of its energy efficiency concern.…”
Section: Resultsmentioning
confidence: 99%
“…Some focus on pre-deployment analysis [13], [8] and thus are not scalable. Very few of them are energyefficient [15], [2] and even if it is the case, they require additional information [9] which is not necessarily available at nodes (like GPS position), require expensive data exchange or need a declared sink [5].…”
Section: Related Workmentioning
confidence: 99%
“…When solutions have energy concerns [2,3,9,[11][12][13][14][15][16], they require not straightforward nodes features (like GPS). They can also require a lot of control messages or, in the case of [12], a declared sink.…”
Section: Isrn Sensor Networkmentioning
confidence: 99%
“…Existing approaches on lifetime maximization problem can be largely classified into two categories: centralized methods [23][24][25][26][27][28][29][30][31][32][33][34][35][36] and distributed methods [13][14][15][37][38][39]. Centralized methods typically require knowledge of the sensors' locations to achieve global optimization with respect to certain performance metrics.…”
Section: Lifetime Maximization Problemmentioning
confidence: 99%
“…• Dynamic clustering algorithms adopting the same network model and design objective as ours. They included: LEACH [13], TL-LEACH [90], EECS [15], PEGASIS [91], HEED [14], GROUP [92], MOECS [36], AEEC [39], and pLEACH [35]. Amongst these algorithms, LEACH was first proposed and widely served as a benchmark for comparison with other algorithms.…”
Section: Clustering Algorithms In Battery Powered Wsnmentioning
confidence: 99%