Abstract—Recent development in low powered and less sized senor devices make implementation of wireless sensor network in health care a reality. Moreover, Routing protocols in network determine network lifetime and efficiency of a network. Conventional AODV routing protocol consumes more energy and increased end-to-end delay. In this paper, we propose a successive convex approximation routing scheme (SCAR). The routing scheme increases network lifetime and end-to-end delay compared to AODV scheme. In successive convex approximation, routing (SCAR) nodes elect a convex head. The convex approximation approach minimizes data collision and prolongs network lifetime. The routing scheme simulate in network platform and the same implement in hardware to validate proposed scheme effectualness.
Index Terms—
successive convex approximation, network lifetime, end to end delay
P. Bagyalakshmi is with Department of Computer Applications, Queen Mary’s College (Autonomous), Chennai, TamilNadu, India (e-mail:
gacbagyalakshmi@gmail.com).
A. Muruganandam is with Principal, Department of Computer Science, Sri Aravindar College of Arts & Science, Villupuram, TamilNadu, India (e-mail:
murugandbc1976@gmail.com).
[PDF]
Cite: P. Bagyalakshmi, and A. Muruganandam, " Successive Convex Approximation with Adaptive Beam Scanning Antenna to Fore Fend Data Collision in WSN," Journal of Advances in Computer Networks vol. 10, no. 1, pp. 10-15, 2022.
Copyright © 2022 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
