Show simple item record

dc.contributor.authorKhan, Sardar Kashif Ashraf
dc.date.accessioned2012-05-25T14:53:21Z
dc.date.available2012-05-25T14:53:21Z
dc.date.issued2012
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/2522
dc.descriptionPhDen_US
dc.description.abstractOpportunistic networking is a concept derived from the mobile ad hoc networking in which devices have no prior knowledge of routes to the intended destinations. Content dissemination in opportunistic networks thus is carried out in a store and forward fashion. Opportunistic routing poses distinct challenges compared to the traditional networks such as Internet and mobile ad hoc networks where nodes have prior knowledge of the routes to the intended destinations. Information dissemination in opportunistic networks requires dealing with intermittent connectivity, variable delays, short connection durations and dynamic topology. Addressing these challenges becomes a significant motivation for developing novel applications and protocols for information dissemination in opportunistic networks. This research looks at opportunistic networking, specifically at networks composed of mobile devices or, pocket switched networks. Mobile devices are now accepted as an integral part of society and are often equipped with Bluetooth capabilities that allow for opportunistic information sharing between devices. The ad hoc nature of opportunistic networks means nodes have no advance routing knowledge and this is key challenge. Human social relationships are based on certain patterns that can be exploited to make opportunistic routing decisions. Targeting nodes that evidence high popularity or high influence can enable more efficient content dissemination. Based on this observation, a novel impact based neighbourhood algorithm called Lobby Influence is presented. The algorithm is tested against two previously proposed algorithms and proves better in terms of message delivery and delay. Moreover, unlike other social based algorithms, which have a tendency to concentrate traffic through their identified routing nodes, the new algorithm provides a fairer load distribution, thus alleviating the tendency to saturate individual nodes.en_US
dc.language.isoenen_US
dc.publisherQueen Mary University of London
dc.titleSocial relationship based routing for delay tolerant Bluetooth-enabled PSN communicationsen_US
dc.typeThesisen_US
dc.rights.holderThe copyright of this thesis rests with the author and no quotation from it or information derived from it may be published without the prior written consent of the author


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Theses [4125]
    Theses Awarded by Queen Mary University of London

Show simple item record