Amazing technological breakthrough possible @S-Logix pro@slogix.in

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • pro@slogix.in
  • +91- 81240 01111

Social List

k-coverage m-connected node placement using shuffled frog leaping: Nelder–Mead algorithm in WSN - 2020

k-coverage m-connected node placement using shuffled frog leaping: Nelder–Mead algorithm in WSN

Research Area:  Wireless Sensor Networks

Abstract:

In wireless sensor network (WSN) target-based coverage plays a vital role in forwarding the information from source to destination via multiple sensors by covering the given targets in location specific wise. The coverage of targets and connectivity among the sensors are the two most addressable issues that are to be considered for effective data transmission. In this paper, a mathematical model called Nelder–Mead method is imposed with shuffled frog leaping algorithm for improvised local search to deploy the sensors to cover the given targets without violating the constraints in coverage as well as connectivity. The proposed algorithm is evaluated with standard performance metrics and compared with the existing algorithms and shows the significance of the proposed algorithm.

Keywords:  

Author(s) Name:  Poongavanam Natarajan & Latha Parthiban

Journal name:  Journal of Ambient Intelligence and Humanized Computing

Conferrence name:  

Publisher name:  Springer

DOI:  10.1007/s12652-020-02223-4

Volume Information: