@article{(Open Science Index):https://publications.waset.org/pdf/10005307,
	  title     = {Tree Based Data Fusion Clustering Routing Algorithm for Illimitable Network Administration in Wireless Sensor Network},
	  author    = {Y. Harold Robinson and  M. Rajaram and  E. Golden Julie and  S. Balaji},
	  country	= {},
	  institution	= {},
	  abstract     = {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.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {10},
	  number    = {6},
	  year      = {2016},
	  pages     = {1215 - 1222},
	  ee        = {https://publications.waset.org/pdf/10005307},
	  url   	= {https://publications.waset.org/vol/114},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 114, 2016},
	}