Download now Free registration required
Finding maximum number of node-disjoint paths for transmission has always been a prime aim to achieve reliability, security, load balancing and improved performance. Finding paths that lead to maximum network lifetime is the other extreme that is desired. Algorithm that aims at one of the requirements tends to oppose the other. In this paper, the authors propose an Application Aware Energy Efficient Geographic Greedy Forwarding (AAEEGF) routing algorithm for Wireless Multimedia Sensor Networks (WMSNs) that is a trade-off between finding maximum number of node disjoint paths and finding paths with maximum network lifetime. AAEEGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs.
- Format: PDF
- Size: 639.2 KB