Modified Convex Hull Algorithm For Recovering Smashed Wireless Sensor Networks

Authors(1) :-M. Rajya Laksmi

Because of its minute form factor and also inadequate onboard energy, sensor nodes are prone to failure. As a component of two step network design, a set of relay nodes is supplemented into the sensor network to enable collating data from the sensor nodes. The sink is supposed to receive data from multiple relay nodes simultaneously. Thus will create a collision between the nodes and affect efficient data delivery in partitioned network. The primary aim of this paper is to examine an approach in order to restore unattended mobile sensor node from damage through the placement of relay nodes, mainly collects data without data traffic. This particular scheme introduces a convex hull algorithm to reestablish the connectivity in an unpredictable environment of large scale relay deployments. Such a topology reduces the delay and enhances performance and further avoids compromization. Efficiency of this recovery algorithm is proven through the simulation results.

Authors and Affiliations

M. Rajya Laksmi
CSE department, Vignan's Nirula Institute of Technology & Science for Women, Guntur, Andhra Pradesh, India

Convex Hull Algorithm, Sensor, Nodes Delay Wireless Sensor Networks.

  1. Abbasi, M. Younis, and K. Akkaya, "Movement-assisted connectivity restoration in wireless sensor and actor networks," IEEE Trans. Parallel Distrib . Syst., vol. 20, no. 9, pp. 1366-1379, Sep. 2009.
  2. A. Cerpa and D. Estrin, "ASCENT: Adaptive self-configuring sensor networks topologies," in Proc. IEEE INFOCOM, New York, Jun. 2002, pp. 1278-1287.
  3. Abbasi, K. Akkaya, and M. Younis, "A distributed connectivity restoration algorithm in wireless sensor and actor networks," in Proc. IEEE LCN, Dublin, Ireland, Oct. 2007, pp. 496-503.
  4. B. Hao, H. Tang, and G. Xue, "Fault-tolerant relay node placement in wireless sensor networks: Formulation and approximation," in Proc. Workshop High Perform. Switching Routing, Phoenix, AZ, Apr. 2004, pp. 246-250.
  5. D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang, and G. Xue, "Approximations for Steiner trees with minimum number of Steiner points," J. Global Optim., vol. 18, no. 1, pp. 17- 33, Sep. 2000.
  6. Senturk, I. F., K. Akkaya, and S. Janansefat. "Towards realistic connectivity restoration in partitioned mobile sensor networks." International Journal of Communication Systems 29.2 (2016): 230-250.
  7. Renold, A. Pravin, and S. Chandrakala. "Survey on state scheduling-based topology control in unattended wireless sensor networks." Computers & Electrical Engineering (2016).
  8. Uzun, Erkay, et al. "Distributed connectivity restoration in Underwater Acoustic Sensor Networks via depth adjustment." Communications (ICC), 2015 IEEE International Conference on. IEEE, 2015

Publication Details

Published in : Volume 2 | Issue 4 | July-August 2017
Date of Publication : 2017-08-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 495-502
Manuscript Number : CSEIT1724121
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

M. Rajya Laksmi, "Modified Convex Hull Algorithm For Recovering Smashed Wireless Sensor Networks", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 4, pp.495-502, July-August-2017.
Journal URL :

Article Preview