Author(s)

Shilpa Mahajan, Jyoteesh Malhotra

.

The wireless sensor networks (WSN) are formed by a large number of sensor nodes working together to provide a specific duty. However, the low energy capacity assigned to each node prompts users to look at an important design challenge such as lifetime maximization. Therefore, designing effective routing techniques that conserve scarce energy resources is a critical issue in WSN. Though, the chain-based routing is one of significant routing mechanisms but several common flaws, such as data propagation delay and redundant transmission, are associated with it. In this paper, we will be proposing an energy efficient technique based on graph theory that can be used to find out minimum path based on some defined conditions from a source node to the destination node. Initially, a sensor area is divided into number of levels by a base station based on signal strength. It is important to note that this technique will always found out minimum path and even alternate path are also saved in case of node failure.

Graph Theory, Breadth First Search, Energy Efficient, Cost, Shortest Path

S. Mahajan and J. Malhotra, "Energy Efficient Path Determination in Wireless Sensor Network Using BFS Approach," Wireless Sensor Network, Vol. 3 No. 11, 2011, pp. 351-356. doi: 10.4236/wsn.2011.311040.