Data Aggregation through Hybrid Optimal Probability in Wireless Sensor Networks

Abstract

  INTRODUCTION: In the realm of Wireless Sensor Networks (WSN), effective data dissemination is vital for applications like traffic alerts, necessitating innovative solutions to tackle challenges such as broadcast storms. OBJECTIVES: This paper proposes a pioneering framework that leverages probabilistic data aggregation to optimize communication efficiency and minimize redundancy. METHODS: The proposed adaptable system extracts valuable insights from the knowledge base, enabling dynamic route adjustments based on application-specific criteria. Through simulations addressing bandwidth limitations and local broadcast issues, we establish a robust WSN-based traffic information system. RESULTS: By employing primal-dual decomposition, the proposed approach identifies optimal packet aggregation probabilities and durations, resulting in reduced energy consumption while meeting latency requirements. CONCLUSION: The efficacy of proposed method is demonstrated across various traffic and topology scenarios, affirming that probabilistic data aggregation effectively mitigates the local broadcast problem, ultimately leading to decreased bandwidth demands.