Mahmood Salehi
ABSTRACT
Next hop selection can be considered as the most important challenge regarding packet routing in wireless networks. Opportunistic Routing is a novel research topic which benefits from the broadcast nature of the wireless medium to route packets to their destination more reliably. Trust management protocols, on the other hand, are developed to assist in delivering data packets in presence of attacker nodes in the network. In this paper, a novel opportunistic routing protocol is proposed which selects next hop forwarder nodes not only according to the link delivery probability between nodes, but also based upon the trust level that nodes calculate for other nodes while communicating packets. Simulation results represent that the proposed method performs well in a hostile environment where malicious nodes prevent from forwarding received packets.
- S. Biswas and R. Morris. Opportunistic routing in multi-hop wireless networks. SIGCOMM Comput. Commun. Rev., 34(1):69--74, Jan. 2004. Google Scholar
Digital Library
- A. Boukerche and A. Darehshoorzadeh. Opportunistic routing in wireless networks: Models, algorithms and classifications. Computing Surveys (ACM) (Accepted to appear in volume 47, issue 2), 2014.Google Scholar
- A. Boukerche, Y. Ren, and R. W. N. Pazzi. An adaptive computational trust model for mobile ad hoc networks. In Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, IWCMC '09, pages 191--195, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- S. Buchegger and J.-Y. Le Boudec. Performance analysis of the confidant protocol. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, MobiHoc '02, pages 226--236, New York, NY, USA, 2002. ACM. Google ScholarDigital Library
- J.-H. Cho, A. Swami, and I.-R. Chen. A survey on trust management for mobile ad hoc networks. Communications Surveys Tutorials, IEEE, 13(4):562--583, Fourth 2011.Google ScholarCross Ref
- A. Darehshoorzadeh, M. Almulla, A. Boukerche, and S. Chaiwala. On the number of candidates in opportunistic routing for multi-hop wireless networks. In Proceedings of the 11th ACM International Symposium on Mobility Management and Wireless Access, MobiWac '13, pages 9--16, New York, NY, USA, 2013. ACM. Google ScholarDigital Library
- A. Darehshoorzadeh and L. Cerda-Alabern. Distance progress based opportunistic routing for wireless mesh networks. In Wireless Communications and Mobile Computing Conference (IWCMC), 2012 8th International, pages 179--184, Aug 2012.Google ScholarCross Ref
- H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Least-cost opportunistic routing. In Proceedings of 2007 Allerton Conference on Communication, Control, and Computing, volume 5, page 11, 2007.Google Scholar
- H. Fußler, J. Widmer, M. Kasemann, M. Mauve, and H. Hartenstein. Contention-based forwarding for mobile ad hoc networks. Ad Hoc Networks, 1(4):351 -- 369, 2003.Google ScholarCross Ref
- S. Ganeriwal, L. K. Balzano, and M. B. Srivastava. Reputation-based framework for high integrity sensor networks. ACM Trans. Sen. Netw., 4(3):15:1--15:37, June 2008. Google ScholarDigital Library
- T. Ghosh, N. Pissinou, and K. Makki. Towards designing a trusted routing solution in mobile ad hoc networks. Mob. Netw. Appl., 10(6):985--995, Dec. 2005. Google ScholarDigital Library
- Q. He, D. Wu, and P. Khosla. Sori: a secure and objective reputation-based incentive scheme for ad-hoc networks. In Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE, volume 2, pages 825--830 Vol.2, March 2004.Google Scholar
- C.-J. Hsu, H.-I. Liu, and W. K. Seah. Opportunistic routing - a review and the challenges ahead. Computer Networks, 55(15):3592 -- 3603, 2011. Google ScholarDigital Library
- P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot. Optimized link state routing protocol for ad hoc networks. In Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International, pages 62--68, 2001.Google ScholarCross Ref
- D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks. In T. Imielinski and H. Korth, editors, Mobile Computing, volume 353 of The Kluwer International Series in Engineering and Computer Science, pages 153--181. Springer US, 1996.Google Scholar
- F. Li and J. Wu. Mobility reduces uncertainty in manets. In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, pages 1946--1954, May 2007.Google ScholarDigital Library
- N. Li and S. K. Das. A trust-based framework for data forwarding in opportunistic networks. Ad Hoc Networks, 11(4):1497 -- 1509, 2013. 1. System and Theoretical Issues in Designing and Implementing Scalable and Sustainable Wireless Sensor Networks 2. Wireless Communications and Networking in Challenged Environments. Google ScholarDigital Library
- H. Liu, B. Zhang, H. Mouftah, X. Shen, and J. Ma. Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. Communications Magazine, IEEE, 47(12):103--109, Dec 2009. Google ScholarDigital Library
- S. Marti, T. J. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, MobiCom '00, pages 255--265, New York, NY, USA, 2000. ACM. Google ScholarDigital Library
- S. Mccanne, S. Floyd, and K. Fall. ns2 (network simulator 2). http://www-nrg.ee.lbl.gov/ns/.Google Scholar
- P. Michiardi and R. Molva. Core: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In B. Jerman-Blazic and T. Klobucar, editors, Advanced Communications and Multimedia Security, volume 100 of IFIP AT The International Federation for Information Processing, pages 107--121. Springer US, 2002. Google ScholarDigital Library
- C. Perkins and E. Royer. Ad-hoc on-demand distance vector routing. In Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA '99. Second IEEE Workshop on, pages 90--100, Feb 1999. Google ScholarDigital Library
- N. Pissinou, T. Ghosh, and K. Makki. Collaborative trust-based secure routing in multihop ad hoc networks. In N. Mitrou, K. Kontovasilis, G. Rouskas, I. Iliadis, and L. Merakos, editors, Networking 2004, volume 3042 of Lecture Notes in Computer Science, pages 1446--1451. Springer Berlin Heidelberg, 2004.Google Scholar
- E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu. Soar: Simple opportunistic adaptive routing protocol for wireless mesh networks. Mobile Computing, IEEE Transactions on, 8(12):1622--1635, Dec 2009. Google ScholarDigital Library
- G. Shafer. A mathematical theory of evidence, volume 1. Princeton university press Princeton, 1976.Google Scholar
- S. Yang, F. Zhong, C.-K. Yeo, B. S. Lee, and J. Boleng. Position based opportunistic routing for robust data delivery in manets. In Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE, pages 1--6, Nov 2009. Google ScholarDigital Library
- H. Yu, Z. Shen, C. Miao, C. Leung, and D. Niyato. A survey of trust and reputation management systems in wireless communications. Proceedings of the IEEE, 98(10):1755--1772, Oct 2010.Google ScholarCross Ref
- Z. Zhong, J. Wang, S. Nelakuditi, and G.-H. Lu. On selection of candidates for opportunistic any path forwarding. SIGMOBILE Mob. Comput. Commun. Rev., 10(4):1--2, Oct. 2006. Google ScholarDigital Library
Index Terms
- Trust-aware opportunistic routing protocol for wireless networks
Recommendations
Towards a novel trust-based opportunistic routing protocol for wireless networks
Opportunistic routing is a promising research area in the context of wireless network communications. Security and trustworthy of routing in this field, however, needs to be considerably researched . In this paper, a novel trust establishment algorithm ...
On the Effect of Black-hole Attack on Opportunistic Routing Protocols
PE-WASUN '15: Proceedings of the 12th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, & Ubiquitous NetworksBlack-hole is a well-known routing attack through which malicious nodes try to downgrade the communication performance of wireless networks. On the other hand, opportunistic routing protocols aim to increase the reliability of communications compared to ...
An Opportunistic Routing Protocol for Mobile Ad Hoc Networks Based on Stable Ideology
In mobile ad hoc networks (MANETs), traditional routing protocols send packets along pre-determined paths which are vulnerable in dealing with unreliable and unpredictable wireless medium. The main difference between the opportunistic routing and the ...
Comments