{"id":"https://openalex.org/W2009292637","doi":"https://doi.org/10.1109/ncc.2015.7084862","title":"An efficient heuristics to realize near-optimal small-world networks","display_name":"An efficient heuristics to realize near-optimal small-world networks","publication_year":2015,"publication_date":"2015-02-01","ids":{"openalex":"https://openalex.org/W2009292637","doi":"https://doi.org/10.1109/ncc.2015.7084862","mag":"2009292637"},"language":"en","primary_location":{"id":"doi:10.1109/ncc.2015.7084862","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2015.7084862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Twenty First National Conference on Communications (NCC)","raw_type":"proceedings-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/A5061819205","display_name":"Abhishek Chakraborty","orcid":"https://orcid.org/0000-0003-1248-9280"},"institutions":[{"id":"https://openalex.org/I882761360","display_name":"Indian Institute of Space Science and Technology","ror":"https://ror.org/05k37ht14","country_code":"IN","type":"education","lineage":["https://openalex.org/I882761360"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Abhishek Chakraborty","raw_affiliation_strings":["Indian Institute of Space Science and Technology, Thiruvananthapuram, India","Indian Institute of Space Science and Technology, Thiruvananthapuram, India 695547#TAB#"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Space Science and Technology, Thiruvananthapuram, India","institution_ids":["https://openalex.org/I882761360"]},{"raw_affiliation_string":"Indian Institute of Space Science and Technology, Thiruvananthapuram, India 695547#TAB#","institution_ids":["https://openalex.org/I882761360"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053446403","display_name":"B. S. Manoj","orcid":"https://orcid.org/0000-0002-1233-1646"},"institutions":[{"id":"https://openalex.org/I882761360","display_name":"Indian Institute of Space Science and Technology","ror":"https://ror.org/05k37ht14","country_code":"IN","type":"education","lineage":["https://openalex.org/I882761360"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. S. Manoj","raw_affiliation_strings":["Indian Institute of Space Science and Technology, Thiruvananthapuram, India","Indian Institute of Space Science and Technology, Thiruvananthapuram, India 695547#TAB#"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Space Science and Technology, Thiruvananthapuram, India","institution_ids":["https://openalex.org/I882761360"]},{"raw_affiliation_string":"Indian Institute of Space Science and Technology, Thiruvananthapuram, India 695547#TAB#","institution_ids":["https://openalex.org/I882761360"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061819205"],"corresponding_institution_ids":["https://openalex.org/I882761360"],"apc_list":null,"apc_paid":null,"fwci":0.3328,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64803669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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.9973000288009644,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9962999820709229,"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/heuristics","display_name":"Heuristics","score":0.70469069480896},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.6593993902206421},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5983200073242188},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5785369873046875},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5576378107070923},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.553153395652771},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.532680332660675},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5245991945266724},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.520322322845459},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.508230447769165},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4582798182964325},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41761380434036255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41478288173675537},{"id":"https://openalex.org/keywords/small-world-network","display_name":"Small-world network","score":0.41294577717781067},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.40790724754333496},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.40669262409210205},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3810209631919861},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3781222105026245},{"id":"https://openalex.org/keywords/complex-network","display_name":"Complex network","score":0.36118388175964355},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3480035066604614},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.26643407344818115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11985424160957336},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11489146947860718},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08696401119232178}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.70469069480896},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.6593993902206421},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5983200073242188},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5785369873046875},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5576378107070923},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.553153395652771},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.532680332660675},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5245991945266724},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.520322322845459},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.508230447769165},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4582798182964325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41761380434036255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41478288173675537},{"id":"https://openalex.org/C183331307","wikidata":"https://www.wikidata.org/wiki/Q840026","display_name":"Small-world network","level":3,"score":0.41294577717781067},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.40790724754333496},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.40669262409210205},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3810209631919861},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3781222105026245},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.36118388175964355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3480035066604614},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.26643407344818115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11985424160957336},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11489146947860718},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08696401119232178},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ncc.2015.7084862","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2015.7084862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Twenty First National Conference on Communications (NCC)","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/W950821216","https://openalex.org/W1572272766","https://openalex.org/W1573579329","https://openalex.org/W2032480605","https://openalex.org/W2041519776","https://openalex.org/W2056944867","https://openalex.org/W2061901927","https://openalex.org/W2098526770","https://openalex.org/W2099306243","https://openalex.org/W2112090702","https://openalex.org/W2130204594","https://openalex.org/W2150649057","https://openalex.org/W2157672245","https://openalex.org/W2170766502","https://openalex.org/W2171255174","https://openalex.org/W2542672762","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W6634264458","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2088831353","https://openalex.org/W2060977742","https://openalex.org/W3101150051","https://openalex.org/W1580095423","https://openalex.org/W2964161656","https://openalex.org/W2312744140","https://openalex.org/W2005559450","https://openalex.org/W417855559","https://openalex.org/W2147318465","https://openalex.org/W2624362158"],"abstract_inverted_index":{"Small-world":[0],"characteristic":[1],"brings":[2],"down":[3],"average":[4,31,128,131],"path":[5,32,129],"length":[6,33],"of":[7,30,40,110],"a":[8,12,19,35,47,106],"network":[9,16,36,109,125],"by":[10],"adding":[11],"few":[13],"long-links":[14],"among":[15],"node-pairs.":[17],"In":[18,42],"real-world":[20],"deployment":[21],"scenario,":[22],"probabilistic":[23],"long-link":[24,98],"addition":[25,99],"cannot":[26],"guarantee":[27],"optimal":[28,85,139],"value":[29],"for":[34,60,84,96,101],"with":[37],"limited":[38],"number":[39],"long-links.":[41],"this":[43],"paper,":[44],"we":[45],"propose":[46],"generalized":[48],"heuristic,":[49],"Sequential":[50],"Deterministic":[51],"Long-link":[52],"Addition":[53],"(SDLA)":[54],"algorithm":[55,68,120],"to":[56,76],"incorporate":[57],"small-world":[58],"property":[59],"moderate":[61],"sized":[62],"string":[63,107],"topology":[64,108],"networks.":[65],"Our":[66,115],"proposed":[67],"has":[69],"O(k":[70,87],"\u00d7":[71,81,88,93],"N)":[72,83,95],"time":[73],"complexity":[74],"compared":[75],"O(N":[77],"<sup":[78,90],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[79,91],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2(k+2)</sup>":[80],"log":[82,94],"and":[86,134,140],"N":[89,112],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">4</sup>":[92],"near-optimal":[97,141],"strategies":[100],"k":[102],"long":[103],"links":[104],"when":[105],"size":[111],"is":[113],"concerned.":[114],"studies":[116],"show":[117],"that":[118],"SDLA":[119],"negligibly":[121],"deviates":[122],"in":[123],"various":[124],"properties":[126],"(e.g.,":[127],"length,":[130],"clustering":[132],"coefficient,":[133],"graph":[135],"centralities)":[136],"from":[137],"the":[138],"solutions.":[142]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}