{"id":"https://openalex.org/W2004387739","doi":"https://doi.org/10.1109/icc.2014.6883349","title":"Optimal scheduling with pairwise coding under heterogeneous delay constraints","display_name":"Optimal scheduling with pairwise coding under heterogeneous delay constraints","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2004387739","doi":"https://doi.org/10.1109/icc.2014.6883349","mag":"2004387739"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2014.6883349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2014.6883349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communications (ICC)","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/A5067128746","display_name":"Yafei Mao","orcid":"https://orcid.org/0000-0002-9648-4278"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yafei Mao","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, CHINA","State Key Lab. for Novel Software Tech., Nanjing Univ., Nanjing, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, CHINA","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"State Key Lab. for Novel Software Tech., Nanjing Univ., Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058480659","display_name":"Chao Dong","orcid":"https://orcid.org/0000-0002-0183-0087"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]},{"id":"https://openalex.org/I4210163363","display_name":"PLA Army Engineering University","ror":"https://ror.org/05mgp8x93","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210163363"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chao Dong","raw_affiliation_strings":["College of Communications Engineering, P.L.A University of Science and Technology, Nanjing, CHINA","Coll. of Commun. Eng., P.L.A Univ. of Sci. & Technol., Nanjing, China"],"affiliations":[{"raw_affiliation_string":"College of Communications Engineering, P.L.A University of Science and Technology, Nanjing, CHINA","institution_ids":["https://openalex.org/I36399199","https://openalex.org/I4210163363"]},{"raw_affiliation_string":"Coll. of Commun. Eng., P.L.A Univ. of Sci. & Technol., Nanjing, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003181030","display_name":"Haipeng Dai","orcid":"https://orcid.org/0000-0003-0545-8187"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haipeng Dai","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, CHINA","State Key Lab. for Novel Software Tech., Nanjing Univ., Nanjing, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, CHINA","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"State Key Lab. for Novel Software Tech., Nanjing Univ., Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011796495","display_name":"Xiaojun Zhu","orcid":"https://orcid.org/0000-0003-0931-2927"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaojun Zhu","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, CHINA","State Key Lab. for Novel Software Tech., Nanjing Univ., Nanjing, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, CHINA","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"State Key Lab. for Novel Software Tech., Nanjing Univ., Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100428808","display_name":"Guihai Chen","orcid":"https://orcid.org/0000-0002-6934-1685"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guihai Chen","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, CHINA","State Key Lab. for Novel Software Tech., Nanjing Univ., Nanjing, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, CHINA","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"State Key Lab. for Novel Software Tech., Nanjing Univ., Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5067128746"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":0.3448,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63901792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"45","issue":null,"first_page":"385","last_page":"390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9865000247955322,"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"}},{"id":"https://openalex.org/T11158","display_name":"Wireless Networks and Protocols","score":0.9714000225067139,"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/pairwise-comparison","display_name":"Pairwise comparison","score":0.7152760028839111},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6761497855186462},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6114639639854431},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.603227436542511},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5987425446510315},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5786111950874329},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5577558875083923},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5063198804855347},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5026431083679199},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.47798746824264526},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4596201479434967},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4179023802280426},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.4151188135147095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34555739164352417},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.32842618227005005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22623860836029053},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07889536023139954}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7152760028839111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6761497855186462},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6114639639854431},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.603227436542511},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5987425446510315},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5786111950874329},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5577558875083923},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5063198804855347},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5026431083679199},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.47798746824264526},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4596201479434967},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4179023802280426},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.4151188135147095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34555739164352417},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.32842618227005005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22623860836029053},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07889536023139954},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2014.6883349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2014.6883349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communications (ICC)","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/W1540870591","https://openalex.org/W1967092943","https://openalex.org/W1977545325","https://openalex.org/W2022969942","https://openalex.org/W2023041362","https://openalex.org/W2053110769","https://openalex.org/W2055148782","https://openalex.org/W2061766499","https://openalex.org/W2085886957","https://openalex.org/W2101395606","https://openalex.org/W2107687147","https://openalex.org/W2117775677","https://openalex.org/W2148078110","https://openalex.org/W2149863032","https://openalex.org/W2154594768","https://openalex.org/W2164807169","https://openalex.org/W2168131851","https://openalex.org/W2171472361","https://openalex.org/W6632444477","https://openalex.org/W6642236470","https://openalex.org/W6656193501"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2487162673"],"abstract_inverted_index":{"Network":[0],"coding":[1,22],"has":[2],"the":[3,25,39,47,52,71,76,84,92,102,120,131],"potential":[4],"to":[5,9,23,37,64,116,119,129],"provide":[6],"powerful":[7],"support":[8],"transmit":[10],"real-time":[11],"traffic":[12],"in":[13,79],"wireless":[14],"network.":[15],"In":[16],"this":[17],"paper,":[18],"we":[19,100],"utilize":[20],"pairwise":[21],"schedule":[24],"flows":[26],"which":[27],"have":[28],"heterogeneous":[29],"delay":[30,48],"constraints":[31,73],"and":[32,60,74,95],"weights.":[33],"Our":[34],"goal":[35],"is":[36,87,114],"maximize":[38],"weighted":[40],"sum":[41],"of":[42,133],"scheduled":[43],"packets":[44],"that":[45,83],"satisfy":[46],"constraints.":[49],"We":[50],"formulate":[51],"problem":[53],"as":[54],"an":[55],"integer":[56,122],"linear":[57,123],"programming":[58,124],"problem,":[59],"propose":[61,101],"two":[62,137],"algorithms":[63],"solve":[65],"it.":[66],"The":[67,112],"first":[68,93],"algorithm":[69,94,104],"drops":[70],"integral":[72],"rounds":[75],"fractional":[77],"solutions":[78],"such":[80],"a":[81,107],"way":[82],"rounded":[85],"solution":[86],"also":[88],"optimal.":[89],"Inspired":[90],"by":[91],"for":[96],"better":[97],"running":[98],"time,":[99],"second":[103],"based":[105],"on":[106],"minimum":[108],"cost":[109],"flow":[110],"formulation.":[111,125],"formulation":[113],"proved":[115],"be":[117],"equivalent":[118],"original":[121],"Simulations":[126],"are":[127],"conducted":[128],"show":[130],"effectiveness":[132],"our":[134],"approach":[135],"over":[136],"greedy":[138],"algorithms.":[139]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}