Cross Layer MMRE AOMDV Model for Multimedia Transmission in Wireless Sensor Networks

The proposed algorithm has to run in the sink node which is assumed to have large computational power and no energy constraint. A source node will broadcast a Route Request Packet (RREQ) packet to its neighbor nodes when it requires establishing one session to as in k node. Whenever an intermediate node, receives the RREQpacket, the node appends its remaining battery energy, l i n k g a i n ( g j ), n o d e i d a n d a v e r a g e n o i s e p o w e r ( n j ) a n d n u m b e r o f p a c k e t s i n t h e i m a g e ( m ) to this RREQpacket. On receiving the RREQpackets, on the multiple paths the sink node finds all the node disjoint paths which satisfy the quality constraints. For nodes belonging to each path which meets the quality constraint the sink also finds the optimal powers so as to minimize the total energy of the path. Intuitively we can conclude that the path with minimal total energy consumption is the winner. This may be true if we assume that initial battery energy of the nodes is the same. If we assume that initial energies of all the nodes are different, it is required to improve the lifetimes of the nodes with least residual energy. Usually these will be the nodes very close to sink, since these nodes are used by most of the traffic in the network. To improve the lifetime of the network we have to improve the lifetime of the nodes with minimal residual energy.