Research Of Routing Algorithm Based On Fire Rescue Scenario In Opportunistic Sensor Network

With the development of information technology,a large amount of small,low-cost equipments with perceptual computing ability have been widely used.Most of the data can be effectively transmitted through the traditional routing and the switching network.But when the data is transmitted to some areas where the infrastructure communication facilities are lacked or damaged.To this end,we usually utilize the mobile devices to establish networks for data resource sharing,which produces the opportunistic sensor networks.This network type is rapidly evolving into many forms,such as automotive networks,wildlife tracking networks,pocket-switched-networks and emergency rescue networks.However,due to the environment complexity,the difference of content processing,the energy and capacity limitations of sensor equipments,bringing a great challenge to the data forwarding issue.Therefore,it is necessary to propose different mobility models and opportunistic forwarding algorithms for different scenarios.Compared with other networks,the emergency rescue network has more research significance and application value.After the serious disasters,such as earthquakes and conflagrations,most of infrastructures including communication devices and electricity equipment will be destroyed.It is very important to rely on the firemen and their carried mobile sensor nodes in the emergency rescue scenario to form a temporary communication network.However,the complexities and dynamics of the emergency rescue sce nario make it difficult to obtain the law of node mobility,and thus the communications between nodes are hardly guaranteed.This thesis firstly introduces the stability concept,and the stability value nodes are associated with their neighbors.The nodes can be classified into three types: fireman nodes,small-range mobile nodes and large-range mobile nodes,and their typical mobility models are proposed.Theoretically,the node with larger stability value is prone to accept and store the data packets.Therefore,in this work,the small-range mobile nodes have the priority to forward the data packets.In addition,considering the dynamic and complexity of the fire rescue scenario,the algorithm will dynamically update the stability of the node s.This thesis also exploits the active movements of firemen for data forwarding,and tries to take advantage of the three types of nodes to make the forwarding decisions reasonably.According to simulation results,the results show that under different network environments,the opportunistic forwarding algorithm based on the stability factor can transmit the data to the target nodes effectively and reduce the transmission delay.Especially,through the active movements of fireman nodes,the data delivery rate and the routing overhead can be improved.