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

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 Netwo...

Full description

Saved in:
Bibliographic Details
Main Author: Abdalla Hassan, Gharib
Format: Thesis
Language:English
Published: 2013
Subjects:
Online Access:http://ir.unimas.my/id/eprint/10129/1/Abdalla%20Hassan%20Gharib%20ft.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-unimas-ir.10129
record_format uketd_dc
spelling my-unimas-ir.101292023-03-28T01:46:51Z Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network 2013 Abdalla Hassan, Gharib T Technology (General) 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. Universiti Malaysia Sarawak, (UNIMAS) 2013 Thesis http://ir.unimas.my/id/eprint/10129/ http://ir.unimas.my/id/eprint/10129/1/Abdalla%20Hassan%20Gharib%20ft.pdf text en validuser masters Universiti Malaysia Sarawak, UNIMAS Faculty of Computer Science and Information Technology.
institution Universiti Malaysia Sarawak
collection UNIMAS Institutional Repository
language English
topic T Technology (General)
spellingShingle T Technology (General)
Abdalla Hassan, Gharib
Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network
description 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.
format Thesis
qualification_level Master's degree
author Abdalla Hassan, Gharib
author_facet Abdalla Hassan, Gharib
author_sort Abdalla Hassan, Gharib
title Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network
title_short Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network
title_full Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network
title_fullStr Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network
title_full_unstemmed Neighbour selection protocol for information dissemination through P2P interactions in opportunistic network
title_sort neighbour selection protocol for information dissemination through p2p interactions in opportunistic network
granting_institution Universiti Malaysia Sarawak, UNIMAS
granting_department Faculty of Computer Science and Information Technology.
publishDate 2013
url http://ir.unimas.my/id/eprint/10129/1/Abdalla%20Hassan%20Gharib%20ft.pdf
_version_ 1783728011731795968