A solution for network life time problem using content based energy efficient routing algorithm

In This Project we consider an overarching problem that encompasses both performance metrics. In particular, we study the network capacity problem under a given network lifetime requirement. Specifically, for a wireless sensor network where each node is provisioned with an initial energy, if all nodes are required to live up to a certain lifetime criterion, what is themaximum amount of bit volume that can be generated by the entire network? In particular, thosenodes that consume the least amount of power on their data path toward the base station are allocated with much more bit rates than other nodes in the network. Consequently, the data collection behaviour for the entire network only favours certain nodes that have this property, while other nodes will be unfavourably penalized with much smaller bit rates. We apply the content based energy routing algorithm for each of the nodes. This is thoroughly a distributed algorithm (the algorithm which has no centralized controller, each node can be seen as autonomous units, functioning independently). Thus the flexibility of the network is wide open. Any numberof nodes can be added dynamically as per requirements.