A wireless sensor network consists from a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is reduced after each transmission, depending on the transmission distance. One of the major problems in wireless ad hoc network is designing a route network traffic algorithm that will maximize the lifetime of the network i.e., the number of successful transmissions. Our objective is to construct a broadcast routing tree rooted at the source node with the longest possible lifetime. We perform a simulative study of the problem and show an improvement to currently existing BIP algorithm.
|Original language||English GB|
|Number of pages||13|
|Journal||Network Protocols and Algorithms|
|State||Published - 2009|