Show simple item record

dc.contributor.authorBarua, Rupa
dc.contributor.authorShadman, Shauvik
dc.contributor.authorChakrabarty, Amitabha
dc.identifier.citationBarua, 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.7860162en_US
dc.descriptionThis article was published in the IEEE Xplore [© 2016 IEEE] and the definite version is available at : The Journal's website is at:
dc.description.abstractTransferring 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.en_US
dc.publisher© 2016 IEEEen_US
dc.subjectDelay tolerant networken_US
dc.subjectHuman mobilityen_US
dc.subjectPacket forwardingen_US
dc.titlePNGP : a social relationship based routing algorithm for pocket switched networken_US
dc.typeConference paperen_US
dc.contributor.departmentDepartment of Computer Science and Engineering, BRAC University

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record