Algorithm To Improve Survivability Of Self-organized Ambulance Network

When a disaster or war happens, almost all the infrastructure would be damaged. We need to build a temporary network naming self-organized ambulance network to provide communication service as soon as possible. Ad Hoc network is an alternative way.However, the existing mature routing protocol of Ad Hoc can't match the requirement of self-organized ambulance network. They only focus on how to efficiently use wireless channel, decrease the average end-to-end delay and so on, without dealing with node's energy constrained. If these protocols are applied, some nodes will leave the network earlier because their too much relays for other nodes result in energy consumption very quickly. This situation will affect network lifetime. In order to maximize network lifetime, a new routing algorithm naming AORE is proposed.AORE uses a route's energy remaining percent instead of direction vector to evaluate a route. By using it, new found route could escape the node whose energy is consumed too quickly. While network lifetime couldn't be extended a lot with AORE, game theory is adopted.In this thesis, an extending two-person zero-sum game is built, resulting in Nash equilibrium. Besides of these, Dead lock and idle nodes rejecting relays are considered. On the base of AORE, a new algorithm AORE-G is presented. AODV routing algorithm asks the node, who receives relay requirement, to relay. But In AORE-G algorithm, a node could decide whether it should relay for other nodes according to its own interest. When it rejects, it should inform source node to find a new route with AORE. By using AORE-G, energy consumption between nodes becomes more balanced and the network lifetime become more longer.