Implementation of Disseminate Region Coverage By Mobile Sensor Node Using Hexagonal Scheme

Authors

  • Astitva Tiwari Department of Computer Science and Engineering RKDF Institute Of Science and Technology, Bhopal (MP)
  • Prof. Daya Shankar Pandey Department of Computer Science and Engineering RKDF Institute Of Science and Technology, Bhopal (MP)
  • Prof. Shrikant Lade Department of Computer Science and Engineering RKDF Institute Of Science and Technology, Bhopal (MP)

Keywords:

Mobile sensor node, Hexagon tessellation, Optimum travelling distance, less coverage overlap

Abstract

Mobile sensor nodes are useful in many environments because they can move to increase the
coverage area. After a sensor node failure creates a coverage hole, a mobile sensor node is impelled to cover
the hole in a timely and energy efficient way. In this approach, we are using random uniform organization of N
mobile sensor nodes. Such that each node has equal prospect of falling at any location in region of interest (i.e.
Center of hexagon). Disastrous or hazardous environments where sensor nodes cannot be manually organized.
A rectangular region of interest divided in regular hexagon in tessellation patterns. Mobile sensor nodes are
randomly placed in the region of interest and coverage should be uniform. Purpose of this work is using Mobile
sensor nodes with optimum travelling distance and less coverage overlap.

Downloads

Published

2015-11-25

How to Cite

Astitva Tiwari, Prof. Daya Shankar Pandey, & Prof. Shrikant Lade. (2015). Implementation of Disseminate Region Coverage By Mobile Sensor Node Using Hexagonal Scheme. International Journal of Advance Research in Engineering, Science & Technology, 2(11), 1–7. Retrieved from https://ijarest.org/index.php/ijarest/article/view/331

Issue

Vol. 2 No. 11 (2015): Volume: 02, Issue: 11 - November, 2015.

Section

Articles