Font Size: a A A

Routing Algorithm Based On Node Mobuity In Opportunistic Networks

Posted on:2014-04-06Degree:MasterType:Thesis
Country:ChinaCandidate:W RenFull Text:PDF
GTID:2268330401481035Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Opportunistic networks are one of the most interesting evolutions of mobile ad hocnetworks. In opportunistic networks, the mobility of nodes makes the opportunity of multi-hop data transferring between the source and destination under the case of disconnected end-to-end path. The routing algorithms in opportunistic networks try to accurately predict themobility pattern of nodes of maximize the performance of message forwarding.The characteristics of predicting of node mobility pattern include the contact rate, thefrequency of contact, contact duration, contact period, the distribution of contact, inter contactperiod and etc. These properties can quantity the contact, but they can not present theforwarding opportunities of contact. For the opportunistic networks forming by the mobiledevices, like mobile phone, Bluetooth device and Wi-Fi enabled device, they have the socialproperties since these devices usually carries by human beings.The thesis tries to explore the social properties to improve the routing performance. Inthe previous research of social-based routing algorithms, the social metrics usually are thecommunity, centrality and similarity of nodes. They do not consider the message transferringcapabilities of nodes. Based on Bubble Rap routing algorithm, the thesis proposes themobility based opportunistic routing algorithm. When making the routing decisions, thealgorithm tries to find the most active and mobile nodes besides the most central nodes sincethose social and highly mobile node has much message transferring ability than those socialbut less active nodes.In this thesis, three datasets including MIT Reality Mining, Infocom05and Infocom06are used and run on the opportunistic network environment emulator (One). The comparisonexperiments with epidemic routing and Bubble Rap routing show the effectiveness of themobility based algorithm. The three algorithms have closely delivery success ratio, especiallyfor the Infocom05and Infocom06datasets, while the mobility based routing of the thesis hasvery low the delivery overhead, which is6%,8%and9%of Bubble Rap routing.
Keywords/Search Tags:Opportunistic network, opportunistic routing, Sociality, mobility
PDF Full Text Request
Related items