An Optimum Relay Sensor Placement Technique to Enhance the Connectivity of Wireless Sensor Network
Arifuzzaman Mohammad1, Keping Yu2, Sato Takuro3
1Arifuzzaman Mohammad, the Graduate School of Global Information and Telecommunication Studies, Waseda University, Tokyo, Japan.
2Keping Yu, the Graduate School of Global Information and Telecommunication Studies, Waseda University, Tokyo, Japan.
3Takuro Sato, the Graduate School of Global Information and Telecommunication Studies, Waseda University, Tokyo, Japan.
Manuscript received on November 20, 2014. | Revised Manuscript received on December 01, 2014. | Manuscript published on December 30, 2014. | PP: 1-6 | Volume-4 Issue-2, December 2014. | Retrieval Number: B3552124214/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper, we have presented a novel algorithm of sensor deployment for re-establishing the connectivity of a disconnected sensor network. We also address the way of achieving k-connectivity which can provide the sensor network with some level of fault tolerance. We combine the concept of Voronoi diagram, Delaunay triangulation, Spanning tree and Steiner heuristic in order to achieve optimum solution. Our proposed algorithm can find optimum number of required relay sensors with reasonable running time complexity. The algorithm also finds the position where the relay nodes are to be place for repairing or enhancing the connectivity. The performance and complexity of our proposed algorithm are also analysed which is incorporate our simulation result.
Keywords: Wireless sensor network, Relay sensor, Network connectivity, Steiner heuristic, Voronoi diagram, Delaunay triangulation.