Central Base-Station Controlled Density Aware Clustering Protocol for wireless sensor networks

Ferdous, Mst. Jannatul; Ferdous, Jannatul; Dey, Tanay

doi:10.1109/iccit.2009.5407170

Cited by 7 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this radio model the energy consumed throughout the entire sensor network can be described as the energy consumption for data transmission , energy consumption for sensing data , and energy consumption for processing data . So energy dissipated for transmitting data to the cluster head, E tx = E amplify +E processing (1) Here is the energy consumed during data signal amplification. The major energy consumption factors in sensor networks are shown in a brief in Table I like [8].…”

Section: N Totalmentioning

confidence: 99%

See 1 more Smart Citation

A Comprehensive Analysis of CBCDACP in Wireless Sensor Networks

Ferdous¹,

Ferdous²,

Dey³

2010

JCM

Self Cite

View full text Add to dashboard Cite

<span style="font-family: ";Times New Roman";,";serif";; font-size: 9pt; mso-bidi-font-weight: bold; mso-fareast-font-family: SimSun; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA; mso-fareast-theme-font: minor-fareast;">As wireless sensor networks are equipped with sensor nodes which have a limited energy and sensing capabilities, a good routing protocol must be designed to make the network energy efficient. In [1] we proposed a centralized routing protocol called Central Base Station Controlled Density Aware Clustering Protocol (CBCDACP) where the base station centrally performs the cluster formation task. In CBCDACP, an optimum set of cluster heads is selected by using a new cluster head selection algorithm focusing on both the density of the sensor nodes and the minimum distances among the cluster head and its neighbor nodes. It calculates the optimum set of cluster head by first selecting the candidate node, then calculating the minimum distance and also calculates the density and finally executing the main BS setup algorithm. In this paper, a comprehensive analysis of CBCDACP algorithm is stated varying the simulation parameters to demonstrate the robustness of this algorithm and explaining the algorithm blocks of CBCDACP. The simulation performance of CBCDACP is then compared with some clustering-based schemes such as Static-Clustering, Low Energy Adaptive Clustering Hierarchy (LEACH), Centralized LEACH (LEACH-C). Simulation results show that CBCDACP can improve system life time and energy efficiency in terms of different simulation performance metrics over its comparatives</span><span style="font-family: ";TimesNewRomanPSMT";,";serif";; font-size: 8pt; mso-fareast-font-family: SimSun; mso-ansi-language: EN...

show abstract

Section: N Totalmentioning

confidence: 99%

“…In [1], we proposed CBCDACP where base station performs the most energy intensive task of cluster formation. The nodes having higher Density Factor (DF) are selected as cluster head so that the energy consumption is minimized as well as network lifetime is maximized.…”

Section: Introductionmentioning

confidence: 99%