International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 98 - Number 12 |
Year of Publication: 2014 |
Authors: Neha Thapar, Shilpa Mahajan |
10.5120/17234-7562 |
Neha Thapar, Shilpa Mahajan . Path Determination using Improved BFS approach in Wireless Sensor Network. International Journal of Computer Applications. 98, 12 ( July 2014), 10-16. DOI=10.5120/17234-7562
Wireless Sensor Network (WSN) is type of network which consists of a collection of tiny devices called sensor nodes. The effective communication type in sensor network is aggregative communication. In such a path is constructed between all the participant nodes and generate an aggregative path. Each node includes its data to this aggregative path and perform the communication to the sink node. In this work, we will be proposing an energy efficient method 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. The base station is placed at the corner with specific range. The nodes in the range of base station can perform direct communication with base station. The presented work, will generate and effective route under the energy, sensing range and fault criticality parameters. It is important to memo that this method will always locate minimum path and alternate path in case of node crash . To identify the effective route, a BFS based approach is suggested in this work. The work will improve the network life, reduce the energy consumption and improve the network communication.