Broadcast Tree Construction for Shortest Path Finding with Secure Data Aggregation Techniques in Wireless Sensor Networks

Vidya H. Deshmukh, Vidya H. Deshmukh, Pramod Jagan Deore, Pramod Jagan Deore, S. B. Deosarkar

2025

Abstract

A wireless sensor network (WSN) consists of a large number of deployed sensing devices that consume little power and computing capabilities. Data packet switching in sensing devices is commonly achieved by using multi-hop transmission due to the limited range of connectivity and the dense distribution of sensor nodes. Dynamic routing in WSN has been increasingly popular in recent years. In modern times, sensor networks extensively employ the multi-path data transmitting technique to optimize system performance by using the available bandwidth. The main objective of this paper is to elucidate the concept of multi-path routing, along with its inherent challenges and fundamental justifications for its application in sensor networks. This study presents a method for finding the shortest path using the Broadcast Tree Construction (BTC) algorithm, which incorporates data aggregation techniques to reduce network overhead during communication. This method is suitable for both cluster networks and Wireless Sensor networks. The suggested work was assessed utilizing the NS2 environment in a thorough experimental investigation. Four alternative procedures were used to explore the system efficiency. Through rigorous experimental investigation, the system is able to conserve 15% of energy while operating with 100 internal nodes. Additionally, it improves network life by 7% when utilizing the SAODV routing protocol. This performance is superior to the distance-based method of determining the shortest path in a WSN. It also improves the data transfer rate and decreases the number of lost packets compared to previous methods of identifying the shortest path in WSN’s.

Paper Citation

in Harvard Style

Deshmukh V., Deore P. and Deosarkar S. (2025). Broadcast Tree Construction for Shortest Path Finding with Secure Data Aggregation Techniques in Wireless Sensor Networks. In Proceedings of the 3rd International Conference on Futuristic Technology - Volume 2: INCOFT; ISBN 978-989-758-763-4, SciTePress, pages 685-693. DOI: 10.5220/0013600100004664

in Bibtex Style

@conference{incoft25,
author={Vidya Deshmukh and Pramod Jagan Deore and S. B. Deosarkar},
title={Broadcast Tree Construction for Shortest Path Finding with Secure Data Aggregation Techniques in Wireless Sensor Networks},
booktitle={Proceedings of the 3rd International Conference on Futuristic Technology - Volume 2: INCOFT},
year={2025},
pages={685-693},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0013600100004664},
isbn={978-989-758-763-4},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 3rd International Conference on Futuristic Technology - Volume 2: INCOFT
TI - Broadcast Tree Construction for Shortest Path Finding with Secure Data Aggregation Techniques in Wireless Sensor Networks
SN - 978-989-758-763-4
AU - Deshmukh V.
AU - Deore P.
AU - Deosarkar S.
PY - 2025
SP - 685
EP - 693
DO - 10.5220/0013600100004664
PB - SciTePress