Welcome to the upgraded BRAC University Institutional Repository. We are currently organizing collections after a recent system upgrade. Homepage category counters may temporarily show lower numbers while syncing, but over 27,000 repository items remain safe and accessible. Please use the search bar to find theses, scholarly outputs, and institutional documents.

PNGP : a social relationship based routing algorithm for pocket switched network

Citation

Barua, R., Shadman, S., & Chakrabarty, A. (2017). PNGP : A social relationship based routing algorithm for pocket switched network. Paper presented at the 19th International Conference on Computer and Information Technology, ICCIT 2016, 25-30. 10.1109/ICCITECHN.2016.7860162

Abstract

Transferring messages or packets through a network using human mobility as a means, requires intelligent routing decisions. Throughout an opportunistic network, nodes travel with a few messages and searches for an opportunity to deliver the message. A good delivery rate of such messages in these sort of networks is a challenge which might require complex calculations and several intricate decision making processes. With a view to improve efficiency and to deliver a simpler way of routing, this paper will present a new routing algorithm called Popular Node Gateway Protocol(PNGP). This new algorithm is tested against 3 other algorithms using our own built simulator and proves to be better in terms of delivery ratio delay and transmission cost. Unlike other algorithms this algorithm provides a simpler way of routing thus making this faster and much more efficient.

Description

This article was published in the IEEE Xplore [© 2016 IEEE] and the definite version is available at : http://doi.org/10.1109/ICCITECHN.2016.7860162 The Journal's website is at: http://ieeexplore.ieee.org/document/7860162/

Type

Conference Paper