The Routing Protocol Based On The Backbone Structure Of Mobile Ad Hoc Networks

In recent years, the development of many emerging network drive the research ofDelay Tolerant Network(DTN). One of the most widely used application scenario ofDTN is the Mobile Ad Hoc networks(MANETS), which is constituted by the mobiledevices such as cell phone, PDA,and other the equipment of short-range wirelesscommunication ability. A MANET has the characteristics of the DTN, which has nostable end-to-end path and limited resources in each node. At the same time, themobile devices are usually attached to human beings, so, the contact and mobilitymode between nodes are related with human mobility and human sociality features.For the routing protocol of MANETs, the sociality of mobile nodes should beconsidered besides the common features in the routing protocol of DTN.In social networks, the information spread alone the path of frequent activenodes rapidly and widely. These active nodes and the relationship links between themconstitute the social relationship backbone structure which plays important part ofrole in information dissemination process. In the Mobile Ad Hoc network, mobileusers will transmit information alone the backbone path to improve the success rate oftransimission and reduce the transmission delay.The paper proposes the routing algorithm based on the idea of network backbone.The contact records between mobile nodes constitutes the social graph and use thePrim algorithm to compute the minimum spanning tree to construct the backbonenetwork. According to the changes of the density of the social graph, the backbonenetwork is updated. With time passing, backbone network will gradually be more andmore stable, and the cost of updating will be smaller and smaller. In the process ofinformation forwarding, the nodes which are in the backbone network and the higherprobability to destination node is selected to be the next information forwarding node.In order to prove the effectiveness of the algorithm, we implement it on theOpportunity Network Enviornment (ONE) and choose Epidemic and PROPHET asthe contrast example. All these three routing algorithms are worked in the mode ofWorkingDayMovement. Experimental results show that the success informationtransmission rate of our algorithm is13%higher than Epidemic routing and close toPROPHET routing, and the information delay is lower than Epidemic and PROPHET.Because the backbone network will construct at first and gradually stability,performance of our algorithm is not better than Epidemic and PROPHET in the beginning of the experiment. But when the backbone network is relatively stable state,the routing performance of our algorithm is better than Epidemic and PROPHET.Because the moving model of WorkingDayMovement makes the nodes meeting moreregularity, Epidemic and PROPHET which ignore the social quality and the nodesregularity moving have poor routing performance. So, the routing algorithm based onbackbone network is more accord with the information transmission of Mobile AdHoc network.