Font Size: a A A

Research On Routing Algorithm Of Self-organizing Network For Base Stationin Emergency Communication

Posted on:2018-01-29Degree:MasterType:Thesis
Country:ChinaCandidate:Z PengFull Text:PDF
GTID:2348330569486244Subject:Information and Communication Engineering
Abstract/Summary:PDF Full Text Request
After the emergency incident,normal communication in the affected area cannot be guaranteed since the network infrastructure is damaged.MANET network has the advantages of fast networking and strong survivability,nodes in MANET can establish multi-hop route from source to destination node through wireless link.Thus,it can quickly set up a mobile deployment of emergency communication network in the absence of the network infrastructure,so as to ensure communication between disaster area and command center.Therefore,it is very important to study routing algorithm of MANET in emergency communication.Mobility model is one of the key factors that affect the performance of routing algorithm,in order to design high quality routing algorithm in emergency communication,it is necessary to establish a network model that can simulate the real emergency scene.In consideration of this,SNBS model is proposed on the basis of RWP in this thesis.SNBS model consists of backpack base stations and vehicle base stations,these two types of nodes have different mobile and communication methods.The backpack base station node selects the nearest vehicle base station as the destination node,which can avoids the arbitraryity of the data transmission during the simulation.The vehicle base station acts as a relay node between the backpack base station and the command center to ensure the communication between the disaster area and the command center.The transmission of data relies on nodes’ energy.However,the battery of nodes is limited in the emergency scene,repeated usage of a single node in the routing process will not only cause premature death of key nodes,but also reduce the efficiency and reliability of communication.Combined with hops and nodes’ residual energy,we proposed RAHE routing algorithm,which adjusted the process of RREQ packet processing.Through the routing metric factor,nodes with higher performance will be selected to set up a route,and thus avoiding the problem of uneven energy consumption caused by repeated usage of key nodes.The simulation results show that RAHE algorithm can balance the energy consumption by avoid premature death of the key nodes,and reduce the end-to-end delay while improving the high data delivery rate.It can also improve the reliability of the data transmission and prolong the network lifetime.Lifetime of MANET is related to the participation of nodes,active collaboration of nodes can effectively extend the survival time of the whole network.However,forwarding data will increase node’s energy consumption,and thus reducing its own lifetime.In this thesis,ECE routing algorithm is proposed.A binary forwarding probability function is set combined with residual energy and the income value of node.By selecting nodes with higher forwarding probability to transmit data,ECE algorithm can promote the cooperation of nodes,and balance node energy consumption while improving robustness of route,so as to ensure the efficiency and reliability of communication,and thus extending the network lifetime time.
Keywords/Search Tags:Emergency Communication, MANET Network, Self-organizing Network for Base Station, Routing Algorithm
PDF Full Text Request
Related items