Research Of Geographical Routing In Multimedia Wireless Sensor Networks

With the development of manufacturing industry, extensive applications of sensor network and requirements from users, multimedia wireless sensor networks (MWSN) have attract unprecedented. Just like the same to traditional wireless sensor networks, MWSN has limited energy, short communicaiton range, and limited storage and so on. However, MWSN has some personality characteristics, such as rich collected information, huge data traffic, and equal energy-consumption of units and so on. Because of these special characteristics of MWSN, it is very difficult to directly transplant research products of traditional scalar wireless sensor networks (SWSN) to MWSN.Routing is a key research hotspot in multimedia wireless sensor networks. Multimedia data have more serious requirements about delay, jitter, synchronization, and bandwidth and so on. It was important to find an effective way to enhance routing performance. In all kinds of routing protocol, geographical routing has been regarded as a promising routing method for sensor networks due to its simplicity and scalability. This thesis focuses on the research of geographic routing in multimedia wireless sensor networks.Firstly, this thesis introduces geographical routing in multimedia wireless sensor networks and summarizes void handling techniques and classic geographical routing protocols. Main work of this thesis is:1. Analyzing characteristic of data flow in multimedia wireless sensor networks2. A high efficiency geographical routing, called AOGR (Asymptotically Optimal Geographical Routing),has been proposed for multimedia wireless sensor networks. Existing geographical routing protocols aimed at optimizing single packet routing performance, while the new algorithm improves the average performance of all packets in a session. In AOGR, the reference of delivered packets to subsequent packets in routing will be exploited. With the increase of routed packets, AOGR converges to the shortest path asymptotically.3. Simulation results show that the proposed algorithm can mitigate inefficient detour on the routes obtained by GPSR (Greedy Perimeter Stateless Routing) in its perimeter mode and improve average performance.