{"id":"https://openalex.org/W2581026897","doi":"https://doi.org/10.1109/iccs.2016.7833575","title":"A secure routing based on social trust in opportunistic networks","display_name":"A secure routing based on social trust in opportunistic networks","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2581026897","doi":"https://doi.org/10.1109/iccs.2016.7833575","mag":"2581026897"},"language":"en","primary_location":{"id":"doi:10.1109/iccs.2016.7833575","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccs.2016.7833575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Communication Systems (ICCS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100361142","display_name":"Li Li","orcid":"https://orcid.org/0000-0002-3414-5561"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Li","raw_affiliation_strings":["Key Laboratory of Network Oriented Intelligent Computation, Harbin Institute of Technology, Shenzhen, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Network Oriented Intelligent Computation, Harbin Institute of Technology, Shenzhen, P. R. China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100681423","display_name":"Xiaoxiong Zhong","orcid":"https://orcid.org/0000-0001-9307-6247"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I5343935","display_name":"Guilin University of Electronic Technology","ror":"https://ror.org/05arjae42","country_code":"CN","type":"education","lineage":["https://openalex.org/I5343935"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoxiong Zhong","raw_affiliation_strings":["Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, P. R. China","Key Laboratory of Network Oriented Intelligent Computation, Harbin Institute of Technology, Shenzhen, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, P. R. China","institution_ids":["https://openalex.org/I5343935"]},{"raw_affiliation_string":"Key Laboratory of Network Oriented Intelligent Computation, Harbin Institute of Technology, Shenzhen, P. R. China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052758633","display_name":"Yang Qin","orcid":"https://orcid.org/0000-0002-1981-1423"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yang Qin","raw_affiliation_strings":["Key Laboratory of Network Oriented Intelligent Computation, Harbin Institute of Technology, Shenzhen, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Network Oriented Intelligent Computation, Harbin Institute of Technology, Shenzhen, P. R. China","institution_ids":["https://openalex.org/I204983213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9936000108718872,"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/T11478","display_name":"Caching and Content Delivery","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7678413391113281},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7100645303726196},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6074569225311279},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5999889969825745},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5584137439727783},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5491384267807007},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5002326965332031},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.47306764125823975},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.419790118932724},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38944336771965027},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.35721951723098755},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.33571702241897583}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7678413391113281},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7100645303726196},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6074569225311279},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5999889969825745},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5584137439727783},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5491384267807007},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5002326965332031},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.47306764125823975},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.419790118932724},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38944336771965027},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.35721951723098755},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.33571702241897583},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccs.2016.7833575","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccs.2016.7833575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Communication Systems (ICCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1531011803","https://openalex.org/W1978139847","https://openalex.org/W1981995501","https://openalex.org/W1997434393","https://openalex.org/W2012927050","https://openalex.org/W2029461885","https://openalex.org/W2032094375","https://openalex.org/W2035560421","https://openalex.org/W2049122689","https://openalex.org/W2051315023","https://openalex.org/W2058604048","https://openalex.org/W2060727454","https://openalex.org/W2082674813","https://openalex.org/W2095068881","https://openalex.org/W2103357518","https://openalex.org/W2105831729","https://openalex.org/W2126601274","https://openalex.org/W2135712710","https://openalex.org/W2242555575","https://openalex.org/W2333590349","https://openalex.org/W6702396208"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W2944616377","https://openalex.org/W2102655743","https://openalex.org/W2607223747","https://openalex.org/W2082566976","https://openalex.org/W2251995179","https://openalex.org/W2793943525","https://openalex.org/W2619478018","https://openalex.org/W4214896794","https://openalex.org/W3134665879"],"abstract_inverted_index":{"Routing":[0],"plays":[1],"an":[2],"important":[3],"role":[4],"in":[5,12,25,40,55,93,121,131],"opportunistic":[6],"networks":[7],"(OPPNETs).":[8],"Many":[9],"routing":[10,54,79,88,97,126],"schemes":[11],"OPPNETs":[13,27],"assume":[14],"that":[15],"data":[16,94,102],"dissemination":[17,103],"is":[18],"not":[19,99],"attacked":[20],"by":[21,118],"misbehavior":[22],"nodes.":[23],"However,":[24],"practice,":[26],"may":[28],"be":[29],"susceptible":[30],"to":[31,37,67,143],"various":[32],"kinds":[33],"of":[34,133],"attacks":[35],"due":[36],"frequent":[38],"disruption":[39],"communication":[41],"links.":[42],"In":[43],"this":[44],"paper,":[45],"we":[46,73],"propose":[47,74],"a":[48,75],"social":[49,69],"trust":[50,77],"model":[51],"for":[52,85],"secure":[53,87,125],"OPPNETs,":[56],"which":[57],"exploits":[58],"the":[59,86,123],"contact":[60],"status,":[61],"forwarding":[62],"ability":[63],"and":[64,81,138],"common":[65],"attributes":[66],"evaluate":[68],"trust.":[70],"And":[71],"then,":[72],"novel":[76],"based":[78],"algorithm":[80,84],"buffer":[82],"management":[83],"strategy,":[89],"considering":[90],"network":[91],"coding":[92],"dissemination.":[95],"This":[96],"strategy":[98],"only":[100],"ensures":[101],"via":[104],"trusted":[105,115],"nodes":[106],"but":[107],"also":[108],"reduces":[109],"delivery":[110,134,136,139],"cost":[111,140],"while":[112],"traversing":[113],"through":[114],"paths.":[116],"Demonstrated":[117],"simulation":[119],"results":[120],"ONE,":[122],"proposed":[124],"can":[127],"achieve":[128],"better":[129],"performance":[130],"terms":[132],"ratio,":[135],"delay":[137],"as":[141],"compared":[142],"existing":[144],"solutions.":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}