Data gathering is a fundamental operation in various applications of wireless sensor networks (WSNs), where
sensor nodes sense information and forward data to a sink node
via multi-hop wireless communications. Typically, data in a WSN
is relayed over a tree topology to the sink for effective data gathering. A number of tree-based data gathering schemes have
been proposed in the literature, most of which aim at maximizing
network lifetime.A specific characteristic of sensor network applications is that the major traffic consists of data collection from various sensor source nodes to a sink via a unidirectional tree.Since the reliability of a link is highly related to its signal to interference plus noise ratio (SINR), the SINR of all the currently used links on the data gathering tree should be greater than a threshold to guarantee high reliability. We formulate the joint problem of tree construction, Our simulation results show that the proposed algorithms achieve much lower data gathering latency than existing data gathering strategies while guaranteeing high reliability. Moreover, the algorithms also have a comparable energy efficiency and network lifetime to other algorithms.
Lalit Patil : Pillai HOC College of Engineering and Technology, Rasayani
Raigad,410207, India
Archana Augustine : Pillai HOC College of Engineering and Technology, Rasayani
Raigad,410207, India
Dr. Shrikant Charhate : Pillai HOC College of Engineering and Technology, Rasayani
Raigad,410207, India
Wireless sensor networks (WSNs), data gathering, latency, LLHC, network Life
In this paper, we have studied tree-based data gathering in WSNs. Our objective is to gather data from all sensors with low latency and high reliability, by carefully constructing a data gathering tree, scheduling links on the tree, and assigning transmitting power levels to active links in each time slot. We have formulated the problem into an optimization problem and proved it is NP-hard. We then divided the problem into two subproblems and provided a heuristic algorithm for each subproblem. We have conducted extensive simulations to evaluate the proposed algorithms. The results demonstrate that the proposed algorithms can significantly reduce the data gathering latency under various node densities, SINR thresholds, and traffic demands, while guaranteeing that the SINR of each active link is above the threshold. In addition the algorithms can distribute the relaying traffic well onto the data gathering tree, and have low requirement on the buffer size on sensor nodes. Furthermore, the simulation results show that the proposed algorithms achieve such low latency and high reliability without sacrificing the energy efficiency and lifetime of the network compared to other algorithms.
[1] N. Thepvilojanapong, Y. Tobe, and K. Sezaki, “On the construction of efficient data gathering tree in wireless sensor networks,” in Proc. 2005 IEEE ISCAS, pp. 648–651.
[2] C. Liu, K. Wu, and J. Pei, “An energy-efficient data collection framework for wireless sensor networks by exploiting spatiotemporal correlation,” IEEE Trans. Parallel Distrib. Syst., vol. 18, no. 7, pp. 1010–1023,July 2007.
[3] Y. Wu, S. Fahmy, and N. B. Shroff, “On the construction of a maximum lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm,” in Proc. 2008 IEEE INFOCOM, pp. 356–360.
[4] D. Luo, X. Zhu, X. Wu, and G. Chen, “Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks,” in Proc.
2011 IEEE INFOCOM, pp. 1566–1574.
[5] J. Liang, J. Wang, J. Cao, J. Chen, and M. Lu, “An efficient algorithm for constructing maximum lifetime tree for data gathering without aggregation in wireless sensor networks,” in Proc. 2010 IEEE INFOCOM Mini-Conference, pp. 1–5.
