Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network

Abdalla Hassan, Gharib (2013) Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network. Masters thesis, Universiti Malaysia Sarawak, UNIMAS.

[img] PDF (Please get the password from ACADEMIC REPOSITORY UNIT, ext: 082-583932/ 082-583914)
Neighbour Selection Protocol For Information Dissemination Through P2P Interactions In Opportunistic Network (fulltext).pdf
Restricted to Registered users only

Download (31MB)


he absence of network topology knowledge in Opportunistic Network makes information dissemination the most compelling research issue. Communication routes evolve when information is forwarded from source to destination during node interactions. The communications between nodes in Opportunistic Networks are supported through mobility of mobiJe nodes. The connections between mobile nodes are often disconnected. However, information can still be disseminated through the opportunistic connections which are computed dynamically Ideally, in Opportunistic Network when two nodes are in communication range, they should pair-wise identify each other. This process potentially facilitates the formulation of social relationship between those two nodes which later can be used to identify the best possible forwarder to deliver the information. However, formulation of the social relationship between neighbouring nodes and selection of the appropriate node to forward information in Opportunistic Network are not trivial processes. Flooding is the best technique to disseminate the information in Opportunistic Network, because it achieves high delivery ratios, minimize message latency and does not require any pre-existing network infrastructure. However flooding approach suffers from high message overhead due to forwarding the information to all nodes. . Considering the advantage of high delivery ratios of flooding, we proposed and designed the social based Neighbour Selection Protocol (NSP). The NSP uses Frequency in Range (FIR) and Frequency of Interaction (FOI) to assist the selection process. Each selected node in turn uses NSP to select a neighbouring node in order to disseminate information towards the destination. From the experimental results, we found that NSP can reduce the overhead and has delivery ratios close to flooding technique.

Item Type: Thesis (Masters)
Additional Information: Thesis (M.Sc.) -- Universiti Malaysia Sarawak, 2013.
Uncontrolled Keywords: Electric network analysis, Data processing, network topolgy, technology, unimas, university, universiti, Borneo, Malaysia, Sarawak, Kuching, Samarahan, ipta, education, Postgraduate, research, Universiti Malaysia Sarawak
Subjects: T Technology > T Technology (General)
Divisions: Academic Faculties, Institutes and Centres > Faculty of Computer Science and Information Technology
Depositing User: Karen Kornalius
Date Deposited: 08 Jan 2016 07:41
Last Modified: 21 May 2020 12:54

Actions (For repository members only: login required)

View Item View Item