{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T12:01:47Z","timestamp":1747224107333,"version":"3.40.5"},"reference-count":29,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7,1]]},"abstract":"<p>In this paper, we have proposed a technique to detect and eliminate the malicious\/misbehaving nodes involved during routing path formation in hierarchical mesh environments. In this, dijkstra's shortest path routing algorithm is used whose weights are deliberated using certain parameters (i.e. node distance, node's previous interactions, packet loss percentage and trust values of each node) for providing the security against routing attacks. The malicious nodes involved during route discovery process are eliminated by calculating the trust of each node using Social Impact Theory Optimizer (SITO). Here, we have discussed the network performance trade-off caused by secure path formation in conventional methods and proposed a Weight Trusted Routing (WTR) mechanism for eliminating these issues (packet-loss ratio, end-to-end delay and route discovery delay). We have numerically simulated and compared the network metrics for both conventional and proposed approaches. Moreover, the proposed technique is validated by discussing an empirical study over routing attacks.<\/p>","DOI":"10.4018\/ijdst.2017070102","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T11:23:34Z","timestamp":1498821814000},"page":"25-42","source":"Crossref","is-referenced-by-count":1,"title":["Weight Trusted Routing Mechanism for Hierarchical Mesh Environments"],"prefix":"10.4018","volume":"8","author":[{"given":"Geetanjali","family":"Rathee","sequence":"first","affiliation":[{"name":"Jaypee University of Information Technology, Department of Computer Science and Engineering, Waknaghat, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2957-1491","authenticated-orcid":true,"given":"Hemraj","family":"Saini","sequence":"additional","affiliation":[{"name":"Jaypee University of Information Technology, Department of Computer Science and Engineering, Waknaghat, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2432","reference":[{"key":"IJDST.2017070102-0","doi-asserted-by":"publisher","DOI":"10.3745\/JIPS.01.0003"},{"key":"IJDST.2017070102-1","unstructured":"Adjih, C., Clausen, T., Jacquet, P., Laouiti, A., Muhlethaler, P. & Raffo, D. (2003). Securing the OLSR protocol. Proceedings of Med-Hoc-Net (pp. 25-27)."},{"key":"IJDST.2017070102-2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2005.1509968"},{"issue":"4","key":"IJDST.2017070102-3","first-page":"509","article-title":"Rotational wireless video sensor networks with obstacle avoidance capability for improving disaster area coverage","volume":"11","author":"N.Bendimerad","year":"2015","journal-title":"Journal of Information Processing Systems"},{"issue":"2","key":"IJDST.2017070102-4","first-page":"1","article-title":"An Implementation of Adaptive Multipath Routing Algorithm for congestion control.","volume":"16","author":"N. K.Chaitanya","year":"2016","journal-title":"International Journal of Computer Science and Network Security"},{"key":"IJDST.2017070102-5","first-page":"698","article-title":"AODV routing protocol implementation design","author":"I. D.Chakeres","year":"2004","journal-title":"Proceedings of 24th International Conference on Distributed Computing Systems Workshops"},{"key":"IJDST.2017070102-6","doi-asserted-by":"publisher","DOI":"10.1109\/SUTC.2008.49"},{"key":"IJDST.2017070102-7","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3148"},{"key":"IJDST.2017070102-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2014.11.011"},{"key":"IJDST.2017070102-9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.07.005"},{"key":"IJDST.2017070102-10","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-009-9143-3"},{"key":"IJDST.2017070102-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36169-2"},{"key":"IJDST.2017070102-12","doi-asserted-by":"publisher","DOI":"10.1109\/WICT.2011.6141369"},{"key":"IJDST.2017070102-13","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2010.5421657"},{"key":"IJDST.2017070102-14","doi-asserted-by":"crossref","unstructured":"Li, C., Wang, Z., & Yang, C. (2010). SEAODV: A security enhanced aodv routing protocol for wireless mesh networks. In Transactions on computational science. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-17697-5_1"},{"key":"IJDST.2017070102-15","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2009.244"},{"key":"IJDST.2017070102-16","unstructured":"Martin, M., & Lhotska, L. (2007). Social impact theory based optimizer. In Advances in Artificial Life (pp. 635-644). Springer Berlin Heidelberg."},{"key":"IJDST.2017070102-17","unstructured":"Mir, S., Pirzada, A. A., & Portmann, M. (2008). HOVER: Hybrid on-demand distance vector routing for wireless mesh networks. In Proceedings of the thirty-first Australasian conference on Computer science (Vol. 74, pp. 63-71). Australian Computer Society."},{"key":"IJDST.2017070102-18","article-title":"Securely-entrusted multi-topology routing for community networks","author":"A.Neumann","year":"2016","journal-title":"Proceedings of 2016 12th Annual Conference on Wireless On-demand Network Systems and Services (WONS)"},{"key":"IJDST.2017070102-19","doi-asserted-by":"publisher","DOI":"10.1002\/sec.731"},{"key":"IJDST.2017070102-20","doi-asserted-by":"crossref","unstructured":"Perkins, C., Belding-Royer, E. & Das, S. (2003). Ad hoc on-demand distance vector (AODV) routing (No. RFC 3561).","DOI":"10.17487\/rfc3561"},{"key":"IJDST.2017070102-21","doi-asserted-by":"crossref","unstructured":"Saavedra Benitez, Y. I., & Ben-Othman, J. & Claude. J. P. (2014). Performance evaluation of security mechanisms in RAOLSR protocol for wireless mesh networks. In Proceedings on IEEE International Conference on Communications (ICC), Sydney, Australia (pp. 1808-1812).","DOI":"10.1109\/ICC.2014.6883585"},{"key":"IJDST.2017070102-22","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2014.6952779"},{"key":"IJDST.2017070102-23","doi-asserted-by":"crossref","unstructured":"Simaremare, H., Abouaissa, A., Sari, R. F. & Lorenz, P. (2013). Secure aodv routing protocol based on trust mechanism. In Wireless Networks and Security (pp. 81-105). Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-36169-2_3"},{"key":"IJDST.2017070102-24","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1090"},{"key":"IJDST.2017070102-25","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2015.183"},{"journal-title":"Dijkstra\u2019s shortest path routing algorithm in reconfigurable hardware. In Field-Programmable Logic and Applications","year":"2001","author":"M.Tommiska","key":"IJDST.2017070102-26"},{"key":"IJDST.2017070102-27","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.56"},{"key":"IJDST.2017070102-28","doi-asserted-by":"publisher","DOI":"10.1002\/sec.766"}],"container-title":["International Journal of Distributed Systems and Technologies"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=185630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T16:23:40Z","timestamp":1651854220000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJDST.2017070102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,7,1]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"URL":"https:\/\/doi.org\/10.4018\/ijdst.2017070102","relation":{},"ISSN":["1947-3532","1947-3540"],"issn-type":[{"type":"print","value":"1947-3532"},{"type":"electronic","value":"1947-3540"}],"subject":[],"published":{"date-parts":[[2017,7,1]]}}}