Name
Abstract | ||
|---|---|---|
In Wireless Sensor Network, dynamic cluster based routing protocol approach is mostly used. In this approach, cluster reelection algorithm is most frequently performed due to the energy depletion of cluster heads. This repeated cluster head reelection increases the number of advertisement messages which in turn depletes the energy of overall sensor network. In this work, we propose a novel Bound Time Approach (BTA) that reduces the cluster set up communication overhead. This is achieved by sending the single multipurpose advertisement message which has the capability to learn available alternative paths from sensor nodes to sink and also reelect the stand by cluster heads in well advance. This makes our routing protocol more energy efficient, fault tolerant and load balanced. The simulation results show that our approach is better than LEACH and also significantly reduces the total number of setup messages. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ARTCom.2009.218 | ARTCom |
Keywords | Field | DocType |
data mining,wireless sensor network,wireless sensor networks,fault tolerant,load balanced,energy efficiency,fault tolerance,steady state,load balance,energy efficient,sensor network,routing protocol,routing protocols | Load balancing (computing),Computer science,Efficient energy use,Computer network,Fault tolerance,Wireless sensor network,Sink (computing),Routing protocol,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-0-7695-3845-7 | 0 | 0.34 |
References | Authors | |
2 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Senthilkumar | 1 | 21 | 6.28 |
| Lakshmipathi R | 2 | 3 | 2.40 |
| M. Chandrasekaran | 3 | 18 | 2.77 |
| Y. Suresh | 4 | 21 | 4.25 |
| V. Mohanraj | 5 | 18 | 6.46 |