An Intersection Point Based Optimal Node Placement Algorithm for Wireless Sensor Networks
Shaik Imam Saheb1, Khaleel-Ur-Rahman Khan2, C. ShobaBindu3
1Shaik Imam Saheb, Research Scholar, Department of CSE, JNTUA, Anantha puramu (Andhra Pradesh), India.
2Dr. Khaleel-Ur-Rahman Khan, Professor & Dean Academics, Department of ACE, Engineering College, Hyderabad (Telangana), India.
3Dr. C. Shoba Bindu, Professor, Department of CSE, JNTUA, Anantha puramu (Andhra Pradesh), India.
Manuscript received on 02 June 2019 | Revised Manuscript received on 10 June 2019 | Manuscript published on 30 June 2019 | PP: 3371-3380 | Volume-8 Issue-8, June 2019 | Retrieval Number: H7246068819/19©BEIESP
Open Access | Ethics and 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: Wireless Sensor Network (WSN) is an innovation, which has unfathomable improvement for open and the shield. In Wireless sensor networks, Node course of action is a pivotal endeavor and is a multi-objective combinational issue. Degree issues are caused in light of the limited correspondence with recognizing range between sensor nodes. The extension issue tosses an eventual outcome of, how well a range is checked or pursued by sensors. A not too bad sensor sending count gives us least union of sensor’s range as well as expands the overall zone sensible using sensors. Here, we recommend a self-course of action method intended for exchange node circumstance issue which is named as crossing point based ideal node situation (IPONP) calculation. Precisely, without noteworthy the degree of the ruin and the amount of portions included, the hand-off nodes be at first sent on a particular zone of the harmed zone alongside they reschedule themselves in a network arranged custom close assurance accessibility. Twofold estimations towards being available of stress here remain the amount of hand-off nodes to stay sent with their expense of improvement that should exist restricted. Also, this computation gives most prominent locale verified by the sensor nodes by ousting crossing point between the sensors run. Sensors are directly off the bat sent using the fundamental co-ordinates gave and short time later new co-ordinates are made using the hidden co-ordinates to oust crossing point and get most outrageous locale scope.
Keyword: Wireless sensor networks (WSN’s), Network configuration, Node deployment, Coverage, Mobile sensor network (MSN), ACO, intersection area, GTM and optimal routing.
Scope of the Article: Wireless ad hoc & Sensor Networks.