A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS

1. A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS Conference :   2009 Sixth IFIP International Conference on Network and Parallel Computing (NPC 2009) Date: 19-21 October 2009 in Gold Coast, Queensland, Australia 89864005 王 文 毅 99.06.07

2. Outline • Introduction • Specifications of the network • Design of the proposed algorithm • Performance evaluation • Conclusions

3. Introduction • WSNs have attention of the research community in the recent years, recent advances have led to the availability of low­cost hardware such as CMOS cameras and microphones, develop the concept of Wireless Multimedia Sensor Networks (WMSNs) • WMSNs mostly need real­time communication and are usually delay tolerant. Supporting data between nodes and the sink requires certain quality of service (QoS) metrics • The next challenge in WSNs is power constraints and lifetime. Therefore, in this paper new algorithms for WMSNs must meet QoS requirements at minimum energy cost.

4. Introduction(cont)

5. Background review • Many algorithms have been proposed for routing in wireless sensor networks , most of them are not proper for real­time communication. • Energy Aware Routing. It uses directed flooding of control messages to find all possible paths between sources and the sink, in addition to energy costs of these paths. but not consider about delay in it approach.(IEEE WCC, Orlando, 2002, pp. 17–21.) • The Dijkstra algorithm first in addition to end­to­end delay calculations to find a least cost path during the connection. suffers from overhead of maintaining global information of all nodes on different possible paths .(in ICSDSW '03, Providence, 2003).

6. Dijkstra algorithm

7. Specifications of the network • We should inspired for Dijkstra algorithm algorithm is intrusion detection in our protocol. • Divide sensor nodes of the network to three types of border nodes, intermediate nodes and the sink. border nodes: divided to scalar and multimedia nodes. monitor the environment and measure ambient conditions or detect an intrusion. intermediate nodes: localization solutions and send data when a border node detects an event, it triggers and begins to send data.

8. Specifications of the network • Three working modes for the nodes: Active Mode, Idle Mode, and Off Mode. Active Mode: with full functions. (Border nodes) listening, sensing, capturing, receiving and sending data. Idle Mode: only listen to the medium (Intermediate nodes) Off Mode: when a node depletes all of its power, and goes to the off mode. • The last but not least characteristic of a node is the queuing model of it.

9. Queuing model • Each node with two separate queues for multimedia and scalar packets. which always prioritizes multimedia traffic over scalar data. • Our proposed algorithm is designed with existing CSMA/CA（Carrier Sense Multiple Access with collision Avoidance） protocols as its MAC. In the end, we should emphasize that our approach is a cross­layer design method between MAC and network layer.

10. Design of the proposed algorithm • The proposed algorithm has two phases: Setup phase : • It needs some information to decide which path is better. • Sink start to broadcast of a control packet. This packet consists of three different fields: • distance to sink in term of hop. • percentage of residual energy. • location information of the sink and the sender node. i.e: From control packet node I , add energy hj ，so add life time

11. Proposed algorithm(cont.) Data delivery phase : • This phase is to find the least cost path which meets end­to­end delay requirements. • Base on AODV algorithm , nodes need only information of their one­hop neighbors. (AODV: Ad-hoc On-demand Distance Vector routing) • Two stage consists: • the first stage, we take QoS requirements into account. • the second stage belongs to energy considerations and finally forwarding decision.

12. Data delivery phase description • Suppose that a node i receives a new multimedia packet and puts it into multimedia queue. Ttot =[Tc + Ttr + Tpp]previous hop contention delay (Tc), transmission delay (Ttr), propagation delay (Tpp) • node i to sink needed speed of the packet to meet Tmax as follows. Presented node i after j to sink needed speed for the packet

13. Description • Finaly: node I and j cost function = residual energy of neighbor j + number of hops to sink crossing j. • So this selected neighbor in addition to meeting delay requirements and has the minimum cost. • These two phases repeat at each node until packet reaches the sink.

14. Description

15. Issue highlighting • A new method for updating nodes information which has low overhead. • When node k consumes 10%, it send its neighbors a small control packet. • its neighbors update the REk and increase the value of ak in their routing tables. • Finally, energy cost with node k and its neighbors will be average. • If the energy level of a node k reaches threshold • it ready to die and using a different control packet. • This warning control packet causes neighbors omit node k. • except when k is the only choice which meets the deadline of a multimedia packet.

16. Performance evaluation • Implement the algorithm in Network Simulator NS2 to simulation its effectiveness. focus : • network lifetime. • average delay. • The simulation consists of 150 nodes. • Placed random in a 750 m × 500 m area divided into 50 m × 50 m grids.

17. Performance evaluation(cont) • Delay – Number of nodes

18. Performance evaluation(cont) • In this experiment consists of 100 nodes. Delay – Source data

19. Conclusion • Introduced an approach of routing protocol in sensor networks that in addition to be low overhead and capable of QoS provisioning. • This protocol is to support both scalar and real-time traffic in a heterogeneous network. • Simulations show that can increases the lifetime. • Compared to the most important existing routing protocols for WSN and it has better behavior for the delay-sensitive packets.

20. THANKS FOR YOUR ATTENTION