Identifying Cuts by Linear Search Method
Mani Sharma1, Sunil.J. Wagh2, Archana Sar3
1Mani Sharma, Department of CS & IT, MGM COET, Noida (U.P), India.
2Sunil J. Wagh, Department of CS & IT, MGM COET, Noida (U.P), India.
3Miss. Archana Sar, Department of CS & IT, MGM COET, Noida (U.P), India.
Manuscript received on 22 March 2019 | Revised Manuscript received on 05 April 2019 | Manuscript Published on 11 April 2019 | PP: 5-11 | Volume-8 Issue-4C, April 2019 | Retrieval Number: D24130484C19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© 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: Tracking cuts and their position in wireless sensor network is the main issue of focus now-a -days. This research paper describes cut detection by linear search method in a dynamic table. We are working on the values of node’s related factors. In this method, scanning will be performed on each sensor node on the basis of certain factors and cut will be detected. We hope that our method will be efficiently takes less time in tracking cut and will help in the process of connectivity restoration.
Keywords: Tracking Cuts, Wireless Sensor Network, Linear Search, Scanning.
Scope of the Article: Probabilistic Models and Methods