{"id":"https://openalex.org/W2727919635","doi":"https://doi.org/10.4018/ijdst.2017070102","title":"Weight Trusted Routing Mechanism for Hierarchical Mesh Environments","display_name":"Weight Trusted Routing Mechanism for Hierarchical Mesh Environments","publication_year":2017,"publication_date":"2017-06-30","ids":{"openalex":"https://openalex.org/W2727919635","doi":"https://doi.org/10.4018/ijdst.2017070102","mag":"2727919635"},"language":"en","primary_location":{"id":"doi:10.4018/ijdst.2017070102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijdst.2017070102","pdf_url":null,"source":{"id":"https://openalex.org/S126154059","display_name":"International Journal of Distributed Systems and Technologies","issn_l":"1947-3532","issn":["1947-3532","1947-3540"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Distributed Systems and Technologies","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077775180","display_name":"Geetanjali Rathee","orcid":"https://orcid.org/0000-0002-4761-1912"},"institutions":[{"id":"https://openalex.org/I153954893","display_name":"Jaypee University of Information Technology","ror":"https://ror.org/00hshrf16","country_code":"IN","type":"education","lineage":["https://openalex.org/I153954893"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Geetanjali Rathee","raw_affiliation_strings":["Jaypee University of Information Technology, Department of Computer Science and Engineering, Waknaghat, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jaypee University of Information Technology, Department of Computer Science and Engineering, Waknaghat, India","institution_ids":["https://openalex.org/I153954893"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069998960","display_name":"Hemraj Saini","orcid":"https://orcid.org/0000-0003-2957-1491"},"institutions":[{"id":"https://openalex.org/I153954893","display_name":"Jaypee University of Information Technology","ror":"https://ror.org/00hshrf16","country_code":"IN","type":"education","lineage":["https://openalex.org/I153954893"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Hemraj Saini","raw_affiliation_strings":["Jaypee University of Information Technology, Department of Computer Science and Engineering, Waknaghat, India"],"raw_orcid":"https://orcid.org/0000-0003-2957-1491","affiliations":[{"raw_affiliation_string":"Jaypee University of Information Technology, Department of Computer Science and Engineering, Waknaghat, India","institution_ids":["https://openalex.org/I153954893"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077775180"],"corresponding_institution_ids":["https://openalex.org/I153954893"],"apc_list":null,"apc_paid":null,"fwci":0.2195,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57369404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"8","issue":"3","first_page":"25","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.843414843082428},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.637222409248352},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6160666346549988},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5564732551574707},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5323109030723572},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5156642198562622},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5136913657188416},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5038384795188904},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5010261535644531},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45937690138816833},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.43118277192115784},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4218318462371826},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.42059239745140076},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11146843433380127},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07680699229240417}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.843414843082428},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.637222409248352},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6160666346549988},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5564732551574707},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5323109030723572},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5156642198562622},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5136913657188416},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5038384795188904},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5010261535644531},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45937690138816833},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.43118277192115784},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4218318462371826},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.42059239745140076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11146843433380127},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07680699229240417},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijdst.2017070102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijdst.2017070102","pdf_url":null,"source":{"id":"https://openalex.org/S126154059","display_name":"International Journal of Distributed Systems and Technologies","issn_l":"1947-3532","issn":["1947-3532","1947-3540"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Distributed Systems and Technologies","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jdst00:v:8:y:2017:i:3:p:25-42","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJDST.2017070102","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W165026084","https://openalex.org/W1490507553","https://openalex.org/W1491242558","https://openalex.org/W1522834645","https://openalex.org/W1763676678","https://openalex.org/W1795263886","https://openalex.org/W1957752013","https://openalex.org/W1972524803","https://openalex.org/W2014822992","https://openalex.org/W2019559057","https://openalex.org/W2027888668","https://openalex.org/W2046980951","https://openalex.org/W2069666813","https://openalex.org/W2071446653","https://openalex.org/W2072608340","https://openalex.org/W2072993056","https://openalex.org/W2094965194","https://openalex.org/W2095507388","https://openalex.org/W2096657178","https://openalex.org/W2098140371","https://openalex.org/W2102258543","https://openalex.org/W2105292591","https://openalex.org/W2137660846","https://openalex.org/W2153755097","https://openalex.org/W2296268266","https://openalex.org/W2367148674","https://openalex.org/W2396762258","https://openalex.org/W2469694379","https://openalex.org/W2484636755","https://openalex.org/W3006839786"],"related_works":["https://openalex.org/W2108305519","https://openalex.org/W1971663816","https://openalex.org/W2555559350","https://openalex.org/W1997091564","https://openalex.org/W2138640781","https://openalex.org/W3035942111","https://openalex.org/W2351097701","https://openalex.org/W2001312276","https://openalex.org/W2152381136","https://openalex.org/W4241849776"],"abstract_inverted_index":{"In":[0,24],"this":[1],"paper,":[2],"we":[3,86],"have":[4,87,122],"proposed":[5,102,134,138],"a":[6,103],"technique":[7,139],"to":[8],"detect":[9],"and":[10,49,101,117,125,133],"eliminate":[11],"the":[12,57,74,89,127,137],"malicious/misbehaving":[13],"nodes":[14,64],"involved":[15,65],"during":[16,66],"routing":[17,29,60,148],"path":[18,28,96],"formation":[19,97],"in":[20,98],"hierarchical":[21],"mesh":[22],"environments.":[23],"this,":[25],"dijkstra's":[26],"shortest":[27],"algorithm":[30],"is":[31,140],"used":[32],"whose":[33],"weights":[34],"are":[35,70],"deliberated":[36],"using":[37,79],"certain":[38],"parameters":[39],"(i.e.":[40],"node":[41,78],"distance,":[42],"node's":[43],"previous":[44],"interactions,":[45],"packet":[46],"loss":[47],"percentage":[48],"trust":[50,75],"values":[51],"of":[52,76],"each":[53,77],"node)":[54],"for":[55,109,130],"providing":[56],"security":[58],"against":[59],"attacks.":[61,149],"The":[62],"malicious":[63],"route":[67,118],"discovery":[68,119],"process":[69],"eliminated":[71],"by":[72,94,142],"calculating":[73],"Social":[80],"Impact":[81],"Theory":[82],"Optimizer":[83],"(SITO).":[84],"Here,":[85],"discussed":[88],"network":[90,128],"performance":[91],"trade-off":[92],"caused":[93],"secure":[95],"conventional":[99,132],"methods":[100],"Weight":[104],"Trusted":[105],"Routing":[106],"(WTR)":[107],"mechanism":[108],"eliminating":[110],"these":[111],"issues":[112],"(packet-loss":[113],"ratio,":[114],"end-to-end":[115],"delay":[116],"delay).":[120],"We":[121],"numerically":[123],"simulated":[124],"compared":[126],"metrics":[129],"both":[131],"approaches.":[135],"Moreover,":[136],"validated":[141],"discussing":[143],"an":[144],"empirical":[145],"study":[146],"over":[147]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}