Dynamic data aggregation protocol based on multiple objective tree in Wireless Sensor Networks

Lu, Yao; Comsa, Ioan Sorin; Kuonen, Pierre; Hirsbrunner, Béat

doi:10.1109/issnip.2015.7106965

Cited by 14 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The optimal routing structure for data aggregation is described as Multi-Objective Steiner Tree (MOST), and the detailed definition can be found in [5]. Four common objectives are considered: reducing the energy consumption, prolonging the network lifetime, reducing the aggregation delay and the communication interference.…”

Section: A Optimal Routing Structure For Data Aggregationmentioning

confidence: 99%

“…Aggregation timers are set up to control the time point of packet transmission and aggregation [5]. The configuration of the timer interval needs to consider two objectives.…”

Section: B Appropriate Interval Of Aggregation Timermentioning

confidence: 99%

“…In Fig.2(a), ACO denotes the previous work [5], ACO-GA is the proposed hybrid approach. ACO-GA has faster convergence rate.…”

Section: Simulation and Performance Evaluationmentioning

confidence: 99%

“…There is no explicit binding relationship between nodes, and the occurrence of the aggregation is probabilistic [4]. Ant Colony Optimization (ACO) algorithm has been utilized to discover the optimal aggregation tree in [5]. In order to reduce the transmission delay, the timer intervals are shortened according to certain principles.…”

Section: Introductionmentioning

confidence: 99%

“…This paper overcomes the shortcomings of the previous work [5]. Genetic Algorithm (GA) is introduced to enhance the convergence rate of the exploration of routing structure.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Probabilistic Data Aggregation Protocol Based on ACO-GA Hybrid Approach in Wireless Sensor Networks

Comşa

Kuonen

et al. 2015

2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)

Self Cite

View full text Add to dashboard Cite

In Wireless Sensor Networks (WSNs), data aggregation techniques have the ability of reducing the data redundancy and the communication load. The probabilistic aggregation protocols make the dynamic routing decision, the nodes do not have explicit knowledge of downstream and upstream neighbors, and then it is difficult to obtain high aggregation efficiency. In order to address this problem, this paper proposes a new probabilistic aggregation protocol based on Ant Colony Optimization (ACO)-Genetic Algorithm (GA) hybrid approach. The Multi-Objective Steiner Tree (MOST) is defined as the optimal structure for data aggregation, which can be explored and frequently exploited during the routing process. Moreover, by using the prediction model based on the sliding window for the future arriving packets, the adaptive timing policy can adjust the timer interval to reduce the transmission delay and to enhance the aggregation probability. Finally, simulation results validate the feasibility and the high efficiency of the novel protocol when compared against other existing approaches.

show abstract

Section: A Optimal Routing Structure For Data Aggregationmentioning

confidence: 99%

“…Aggregation timers are set up to control the time point of packet transmission and aggregation [5]. The configuration of the timer interval needs to consider two objectives.…”

Section: B Appropriate Interval Of Aggregation Timermentioning

confidence: 99%

“…In Fig.2(a), ACO denotes the previous work [5], ACO-GA is the proposed hybrid approach. ACO-GA has faster convergence rate.…”

Section: Simulation and Performance Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…This paper overcomes the shortcomings of the previous work [5]. Genetic Algorithm (GA) is introduced to enhance the convergence rate of the exploration of routing structure.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations