The week's pick
Random Articles
Reseach Article
Node Cooperation Strategy on Security Aided and Group Encounter Prophet Routing Protocol of an Opportunistic Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 163 - Number 8 |
| Year of Publication: 2017 |
| Authors: H. J. Abubakar, A. M. S. Tekanyi, S. M. Sani |
10.5120/ijca2017913681
|
H. J. Abubakar, A. M. S. Tekanyi, S. M. Sani . Node Cooperation Strategy on Security Aided and Group Encounter Prophet Routing Protocol of an Opportunistic Network. International Journal of Computer Applications. 163, 8 ( Apr 2017), 34-38. DOI=10.5120/ijca2017913681
Abstract
There are scenarios in wireless networks where a fully connected path between nodes for communication through a network 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. Node cooperation technique was developed and incorporated into the security aided and groups encounter PRoPHET routing protocol with cooperative behavior modelled for three nodes as shown in the cooperative behavior equation. This is in order to improve its security to ensure availability and to resist malicious dropping in OpptNets where a node may refuse to act as a relay and only settle for sending and receiving its own data or information, thus, causing considerable delay degradation in the network. Results demonstrated that, the node cooperation improved the security aided and group encounter PRoPHET routing protocol as it improved the delivery probability by 25.7%, reduced the latency by 13.10%, improved the hop count by 62.9%, and improved the buffer time by 55.5% at the end of the simulation time when compared with the delivery probability, latency, hop count and buffer time of the security aided and group encounter PRoPHET routing protocol without node cooperation.
References
- Papaj, J., Dobos, L. u., & Cizmár, A. (2012). Opportunistic Networks and Security. Journal of Electrical and Electronics Engineering, 5(1), 163.
- Huang, C.-M., Lan, K.-c., & Tsai, C.-Z. (2008). A survey of opportunistic networks. Paper presented at the Advanced Information Networking and Applications-Workshops, 2008. AINAW 2008. 22nd International Conference on Advanced Information Networking. 1672-1677
- Guo, M.-H., Liaw, H.-T., Chiu, M.-Y., & Tsai, L.-P. (2015). Authenticating with privacy protection in opportunistic networks. Paper presented at the Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE), 2015 11th International Conference on. 375-380
- Wu, Y., Zhao, Y., Riguidel, M., Wang, G., & Yi, P. (2015). Security and trust management in opportunistic networks: a survey. Security and Communication Networks, 8(9), 1812-1827.
- Basu, S., Bhattacharjee, S., Roy, S., & Bandyopadhyay, S. (2015). SAGE-PRoPHET: A Security Aided and Group Encounter based PRoPHET Routing Protocol for Dissemination of Post Disaster Situational Data. Paper presented at the Proceedings of the 2015 International Conference on Distributed Computing and Networking. 10-20
- Luo, H., Kravets, R., & Abdelzaher, T. (2006). The-day-after networks: A first-response edge-network architecture for disaster relief. NSF NeTS FIND Initiative, http://www. nets-find. net/Funded/DayAfterNet. php.
- Vinck, P. (2013). World disasters report: Focus on technology and the future of humanitarian action: International Federation of Red Cross and Red Crescent Societies.
- Mehrotra, S., Butts, C., Kalashnikov, D., Venkatasubramanian, N., Rao, R. R., Chockalingam, G., . . .Huyck, C. (2004). Project RESCUE: challenges in responding to the unexpected. Paper presented at the Electronic Imaging 2004. 179-192
- Grasic, S., Davies, E., Lindgren, A., & Doria, A. (2011). The evolution of a DTN routing protocol-PRoPHETv2. Paper presented at the Proceedings of the 6th ACM workshop on Challenged networks. 27-30
- Verma, A., & Srivastava, D. (2012). Integrated routing protocol for opportunistic networks. arXiv preprint arXiv:1204.1658.
- Ciobanu, R. I., Dobre, C., Cristea, V., Pop, F., & Xhafa, F. (2015). SPRINT-SELF: Social-Based Routing and Selfish Node Detection in Opportunistic Networks. Mobile Information Systems, 2015.
- Gupta, S., Dhurandher, S. K., Woungang, I., Kumar, A., & Obaidat, M. S. (2013). Trust-based Security Protocol against blackhole attacks in opportunistic networks. Paper presented at the WiMob. 724-729
- Chen, R., Bao, F., Chang, M., & Cho, J.-H. (2014). Dynamic trust management for delay tolerant networks and its application to secure routing. IEEE Transactions on Parallel and Distributed Systems, 25(5), 1200-1210.
- Lindgren, A., Doria, A., & Schelén, O. (2003b). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE mobile computing and communications review, 7(3), 19-20.
- Lindgren, A., Doria, A., & Schelén, O. (2003a). Poster: Probabilistic routing in intermittently connected networks. Paper presented at the Proceedings of The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003). 90-100
- Pelusi, L., Passarella, A., & Conti, M. (2006b). Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Communications Magazine, IEEE, 44(11), 134-141.
Index Terms
Keywords