Simulation Research Of Opportunistic Routing Orient To Network Metrics

Internet is the world’s largest and most widely computer network, which depends on the physical link. With the development of micro-electronics technology and military applications, a new class of networks began to appear. The node in such network has the character of large random mobility; the resources are relatively limited; the node density is sparse. It is known as“opportunistic network”.Opportunistic network is one of the most interesting evolutions of MANETs. It also has some character of DTN (Delay Tolerant Network). In opportunistic networks, nodes are not supposed to possess or acquire any knowledge about the network. Routing is built dynamically. Successful delivery of messages at low costs and delays in such networks is thus challenging. Most opportunistic routing aim at increasing the likelihood of finding a path, the routing metrics are uncertain. Sometimes it’s necessary to optimize a specific routing metric such as the average delay or delivery ratio.The main objective of this paper is to design one opportunistic routing named ORONM (Opportunistic Routing Oriented to Network Metrics). ORONM allocates resources to packets to optimize a specific routing metric.In this paper we describe how to calculate the utility value, and prove the feasibility of the routing using statistical methods. Statistics prove that interval time between independent random mobile nodes is exponentially distributed. We describe the algorithm of estimating delay between nodes. At last, we use QualNet to simulate the protocol, and compare with the traditional routing, including Epidemic and Spray and Wait. The results demonstrate ORONM achieve better performance in the case of some nodes which have limited resources. In addition, this research of this paper can also provide references for other related works on opportunistic routing.