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 the maximum amount of bit volume that can be generated by the entire network? In particular, those nodes 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 number of nodes can be added dynamically as per requirements.

[1]  Hanif D. Sherali,et al.  On Node Lifetime Problem for Energy-Constrained Wireless Sensor Networks , 2005, Mob. Networks Appl..

[2]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[3]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[5]  Leandros Tassiulas,et al.  Routing for network capacity maximization in energy-constrained ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[7]  Gil Zussman,et al.  Energy efficient routing in ad hoc disaster recovery networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .