Energy-Efficient Chain Formation Algorithm for Data Gathering in Wireless Sensor Networks

Lim, Se Jung; Park, Myong Soon

doi:10.1155/2012/843413

Cited by 19 publications

(14 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These techniques use static route to forward or aggregate data without considering the location, residual energy or other routing metrics of the deployed nodes for making decision to construct a routing path dynamically. Some traditional data aggregation protocols that use such routing or aggregation mechanism are LEACH [13], PEGASIS [18], improved PEGASIS [19], PEDAP [29], COSEN [28], BERP [15], TL-LEACH [20], TB-LEACH [12], CHIRON [4], CREEC [25], EECF [17], EA-COSEN [26] etc. These protocols are suitable for data gathering applications and performs well in static wireless sensor networks.…”

Section: Related Workmentioning

confidence: 99%

Evaluation and Comparative Study of Structure Free Aggregation Techniques for Duty Cycled Wireless Sensor Networks

Sran¹,

Kaur²

2017

IJCA

View full text Add to dashboard Cite

For delay sensitive event based applications, structure free data aggregation approach has been found to be more suitable because of the reduced structure maintenance overhead. However, in the literature, it has been observed that increasing the delay at intermediate sensor node increases aggregation and the event notification time. The objective is to investigate various structure free aggregation schemes in terms of aggregation gain, event notification time and the overall energy consumption. To achieve this objective, a comparative study of various structure free aggregation techniques is presented. First, we investigate the potential of aggregation in different structure free aggregation techniques for duty cycled sensor networks. Then the performance of the aggregation techniques is demonstrated with the help of simulations on Cooja network simulator in Contiki operating system. From the results, it has been observed that Tuned delay based aggregation scheme reduces energy consumption (upto 13%) as compared to Collect protocol. Moreover, it reduces the worst event notification time (upto 20%) in comparison to random delay based aggregation scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

Evaluation and Comparative Study of Structure Free Aggregation Techniques for Duty Cycled Wireless Sensor Networks

Sran¹,

Kaur²

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…al [5] have proposed an energy efficient chain formation (EECF) method for resolving uneven energy consumption concern due to long distance communication of few sensor nodes in Efficient power gathering in sensor information systems (PEGASIS) by the help of greedy algorithm. EECF [5] protocol uses the Buttenfield strip tree geometry to form a chain.…”

Section: Related Workmentioning

confidence: 99%

“…This paper deals with the minimization of energy consumption by using an efficient routing protocol and appropriate node deployment which improves the lifetime of the network. Efficient power gathering in sensor information systems (PEGASIS) [4] and energy efficient chain formation (EECF) [5] are the two important link formation techniques. Overhead delay is reduced in EECF algorithm by streamlining message flow over a strip-tree chain formed throughout the network [6,4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Novel Energy Efficient Protocols for Gaussian & Uniform Distributed Heterogeneous Wireless Sensor Networks

Kumar

Devi

Yadav

et al. 2016

TNC

View full text Add to dashboard Cite

Network lifetime is a serious problem in the design of wireless sensor networks (WSNs). Prolonged network lifetime is desired characteristics of WSNs. Gaussian distributed heterogeneous WSNs can fulfill such requirement and are widely deployed in realistic scenarios. In addition, the presence of some heterogeneous sensor nodes leads to performance enhancement in terms of intrusion detection probability, network lifetime, nonstop delay and throughput. In this paper, we have proposed novel routing-chains protocols for Gaussian and uniformly distributed heterogeneous sensor networks. Proposed protocols, lifetime enhancement in Gaussian distributed heterogeneous sensor network (GHetLESN) and lifetime enhancement in uniformly distributed heterogeneous sensor network (UHetLESN) have been compared with existing energy efficient chain formation (EECF) protocol. We have also presented the results that how much percentage of heterogeneity of total nodes will provide good impact on network lifetime. By experimentation, it is shown that proposed protocols GHetLESN provides 4.76 times enhancement in network lifetime compared to existing protocol EECF and UHetLESN provides 1.78 times enhancement in network lifetime compared to EECF.

show abstract

“…Many deal with techniques for efficient processing of aggregate queries [1][2][3]. Other proposals deal with energy-efficient methods to reduce energy consumption during query processing [4][5][6]. The general strategies for join query processing in sensor networks can be classified depending on the location of the join region in the sensor network [7].…”

Section: Related Workmentioning

confidence: 99%

An Efficient Processing of Join Queries for Sensor Networks Using Column-Oriented Databases

Kim

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Recently, the sensor network area is gaining attention both in the industry and academia. Many applications of sensor network such as vehicle tracking and environmental monitoring require joining sensor data scattered over the network. The main performance criterion for queries in a sensor network is to minimize the battery power consumption in each sensor node. Hence, reducing the communication cost of shipping data among sensor nodes is important since it is the main consumer of battery power. In this paper, we propose a technique for join queries in a sensor network that minimizes communication cost. For storage of sensor data, we use a column-oriented database that stores data on disk (or in memory) column-by-column unlike traditional database that store data in rows. The justification for using a column-oriented database technique is not to ship those data columns that do not participate in the actual join. We compare our algorithm with existing join algorithms for sensor networks that are based on traditional roworiented databases. The performance analysis show that our proposed algorithm based on column-oriented databases outperforms existing algorithms in processing binary equi-join (BEJ) queries for sensor networks.

show abstract

Energy-Efficient Chain Formation Algorithm for Data Gathering in Wireless Sensor Networks

Cited by 19 publications

References 15 publications

Evaluation and Comparative Study of Structure Free Aggregation Techniques for Duty Cycled Wireless Sensor Networks

Evaluation and Comparative Study of Structure Free Aggregation Techniques for Duty Cycled Wireless Sensor Networks

Novel Energy Efficient Protocols for Gaussian & Uniform Distributed Heterogeneous Wireless Sensor Networks

An Efficient Processing of Join Queries for Sensor Networks Using Column-Oriented Databases

Contact Info

Product

Resources

About