Energy efficient sectoring based routing in Wireless Sensor Networks for delay constrained applications: A mixed approach

In this paper we consider the problem of designing localization algorithm in a wireless sensor network where location information of the sensor nodes in the network is unknown. In previous localization techniques they pinpoint the co-ordinates of each and every node in network, which makes it complex and energy inefficient. But in most of the cases it is sufficient to know the area, sector in which the event has occurred. For this purpose we have proposed a new idea of the spider web based localization protocol, where we can know event up to the sector of a level. The motivation behind this algorithm is spider web, where the sensor network is divided in to the levels and then into sectors which resembles a web.