DEVELOPMENT OF AN IMPROVED SECURITY AIDED AND GROUP ENCOUNTER PROPHET ROUTING PROTOCOL OF AN OPPORTUNISTIC NETWORK

Simple item page
dc.contributor.authorABUBAKAR, Husseina Jibrin
dc.date.accessioned2017-11-20T08:03:34Z
dc.date.available2017-11-20T08:03:34Z
dc.date.issued2017-05
dc.descriptionA DISSERTATION SUBMITTED TO THE SCHOOL OF POSTGRADUATE STUDIES, AHMADU BELLO UNIVERSITY, ZARIA IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE AWARD OF A MASTER OF SCIENCE (M.Sc) DEGREE IN TELECOMMUNICATION ENGINEERING DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING FACULTY OF ENGINEERING AHMADU BELLO UNIVERSITY, ZARIA NIGERIAen_US
dc.description.abstractOne of the requirements for enabling two nodes to communicate through a network is the existence of a fully connected path between them. However, there are scenarios in wireless networks where this is not the case and yet nodes still need to communicate freely. Despite concerted efforts to resolve this problem of unconnected wireless nodes trying to relay crucial information, network users still experience significant communication challenges owing to failures or non-existence of critical infrastructural links between nodes and their security challenges. This research work is aimed at enhancing the security component of PRoPHET routing protocol by incorporating internodes cooperation. Simulation was carried out using the opportunistic network environment (ONE). This report presents the modeled opportunistic network using the security aided and group encounter forPRoPHET routing protocol. Node cooperation technique was developed and incorporated into the security aided and groups encounter PRoPHET routing protocol in order to improve its security. For the 20-node test scenario considered, the improved security aided and group encounter PRoPHET routing protocol outperformed the method proposed in the security aided and group encounter PRoPHET routing protocol of Basu et al., (2015) by 19.6%, 7.9%, 34.7% for delivery probability, hop count and buffer timeand for the benchmark Helsinki simulation area considered, it outperformed the method implemented in the work of Basu et al., (2015) by 25.7%, 62.9%, 55.5% with respect to delivery probability, hop count and buffer time respectively. Results showed that, node cooperation technique improved the security aided and groups encounter PRoPHET routing protocol because it increased the delivery probability, reduced the latency, reduced the hop count and increased the buffer time when tested on a 20-node test program and on the bench mark Helsinki simulation area at the end of the simulation time of 44000 seconds.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/9462
dc.language.isoenen_US
dc.subjectDEVELOPMENT,en_US
dc.subjectIMPROVED SECURITY AIDED,en_US
dc.subjectGROUP ENCOUNTER,en_US
dc.subjectPROPHET ROUTING PROTOCOL,en_US
dc.subjectOPPORTUNISTIC NETWORKen_US
dc.titleDEVELOPMENT OF AN IMPROVED SECURITY AIDED AND GROUP ENCOUNTER PROPHET ROUTING PROTOCOL OF AN OPPORTUNISTIC NETWORKen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
DEVELOPMENT OF AN IMPROVED SECURITY AIDED AND GROUP ENCOUNTER PROPHET ROUTING PROTOCOL OF AN OPPORTUNISTIC NETWORK.pdf
Size:
1.39 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
ENGINEERING