Published Paper Details:

Both energy and information measure are scarce resources in detector networks. Within the past, the energy economical routing drawback has been extensively studied in efforts to maximise sensor network lifetimes, however the link information measure has been optimistically assumed to be abundant. As a result of energy constraint affects however knowledge ought to be routed, link information measure affects not solely the routing topology, however additionally the allowed rate on every link, which in tum affects the time period. Previous analysis that concentrate on energy economical operations in sensor networks with {the sole the solely the only real} objective of increasing network time period only think about the energy constraint ignoring the information measure constraint. This thesis shows how ever impracticable these solutions are often once information measure will gift a constraint. It provides a brand new mathematical model that address each energy and information measure constraints and proposes two economical heuristics for routing and rate allocation. Simulation results show that these heuristics offer additional possible routing solutions than previous work, and considerably improve output. A technique of distribution the slot supported the given link rates is presented. The cross layer style approach improves channel utility considerably and completely solves the hidden terminal and exposed terminal issues