Tree Based Data Fusion Clustering Routing Algorithm for Illimitable Network Administration in Wireless Sensor Network

In wireless sensor networks, locality and positioning information can be captured using Global Positioning System (GPS). This message can be congregated initially from spot to identify the system. Users can retrieve information of interest from a wireless sensor network (WSN) by injecting queries and gathering results from the mobile sink nodes. Routing is the progression of choosing optimal path in a mobile network. Intermediate node employs permutation of device nodes into teams and generating cluster heads that gather the data from entity cluster’s node and encourage the collective data to base station. WSNs are widely used for gathering data. Since sensors are power-constrained devices, it is quite vital for them to reduce the power utilization. A tree-based data fusion clustering routing algorithm (TBDFC) is used to reduce energy consumption in wireless device networks. Here, the nodes in a tree use the cluster formation, whereas the elevation of the tree is decided based on the distance of the member nodes to the cluster-head. Network simulation shows that this scheme improves the power utilization by the nodes, and thus considerably improves the lifetime.

• Y. Harold Robinson
• M. Rajaram
• E. Golden Julie
• S. Balaji

• WSN
• TBDFC
• LEACH
• PEGASIS
• TREEPSI.

[1] M. Al-Rabayah and R. Malaney, “A new scalable hybrid routing protocol for VANETs,” IEEE Trans. Veh. Technol., vol. 61, no. 6, pp. 2625–2635, Jul. 2012.
[2] Harold Robinson, Y., & Rajaram, M. (2015). “Trustworthy link failure recovery algorithm for highly dynamic mobile adhoc networks”, World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering, vol.9, no.2, 233–236.
[3] S. Nithya, G. Arul Kumar and P. Adhavan, “Destination-Sequenced Distance Vector Routing (DSDV) using Clustering Approach in Mobile Adhoc Network”. 2012 International Conference on Radar, Communication and Computing (ICRCC).
[4] Naveen Chauhan, L. K. Awasthi, Narottamchand, Vivek Katiyar, and Ankit Chug, “A Distributed Weighted Cluster Based Routing Protocol for Manets,” World Academy of Science, Engineering and Technology 75, pp.1167-1171, 2011.
[5] Alshanyour, M. and Baroudi, U. Bypass “AODV: Improving Performance of Ad Hoc On-Demand Distance Vector (AODV) Routing Protocol in Wireless Ad Hoc Networks”, Ambi-sys, 2008.
[6] Sanjit Biswas, Robert Morris, “ExOR: opportunistic multi-hop routing for wireless networks”, Proceedings of conference on Applications, technologies, architectures, and protocols for computer communications, Pages 133-144, 2005
[7] A. Trivino-Cabrera, S. Canadas-Hurtado, “Survey on Opportunistic Routing in Multihop Wireless Networks”, International Journal of Communication Networks and Information Security (IJCNIS), Vol. 3, No. 2, August 2011
[8] Harold Robinson, Y., & Rajaram, M. (2016), “A memory aided broadcast mechanism with fuzzy classification on a device-to-device mobile Ad Hoc network”, Wireless Personal Communications, 1–23, doi:10.1007/s11277-016-3213-0.
[9] T.J. Kwon, M. Gerla, V.K. Varma, T. Russel Hsing. “Efficient Flooding with Passive clustering-An Overhead-Free Selective Forward Mechanism for Ad Hoc/Sensor Networks”, proceedings of the IEEE, Vol.91, No.8, 2003, pp.1210-1220.
[10] Stepanov, D. Herrscher, K. Rothermel, “On the impact of radio propagation models on MANET simulation results”, Proceedings of 7th International Conference on Mobile and Wireless Communications Networks (MWCN 2005), Marrakech, Morocco, September 2005.
[11] Harold Robinson, Y., & Rajaram, M. (2015), “Energy-aware multipath routing scheme based on particle swarm optimization in mobile ad hoc networks”, The Scientific World Journal, 1–9. doi:10.1155/2015/284276.
[12] Harold Robinson, Y., &Rajaram, M. (2015), “Establishing pairwise keys using key Predistribution schemes for sensor networks”, World Academy of Science, Engineering and Technology International Journal of Computer, Electrical, Automation, Control and Information Engineering, 9(2), 608–612.