Leveling sectoring algorithm
Mohammed Nazeer, Garimella Rama Murthy, Rhishi Pratap Singh · 2017
In this paper, we quantitatively (mathematically) reason the energy savings achieved in a wireless sensor grid network, by using circular leveling and sectoring routing algorithm. Due to the energy constraints on the sensor nodes (in terms of transmission and reception of energy) energy awareness has become crucial in networking protocol stack. We provide analytical expression for the energy wastage that occurs when traditional routing algorithm such as gossip is utilized. The expression is based on Gauss's Lattice Point problem which deals with counting the number of lattice points (in two dimensions) enclosed in a circle of nite radius. Analytical results are validated through simulation,in MATLAB and NS2 simulator which shows the promising potentials of our leveling and sectoring technique.