{"id":"https://openalex.org/W2078975391","doi":"https://doi.org/10.1109/vtcfall.2012.6399170","title":"A Novel Opportunistic Scheduling Algorithm in Coordinated Multi-Point Transmission Scenario","display_name":"A Novel Opportunistic Scheduling Algorithm in Coordinated Multi-Point Transmission Scenario","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W2078975391","doi":"https://doi.org/10.1109/vtcfall.2012.6399170","mag":"2078975391"},"language":"en","primary_location":{"id":"doi:10.1109/vtcfall.2012.6399170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtcfall.2012.6399170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Vehicular Technology Conference (VTC Fall)","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/A5012720408","display_name":"Hao Wang","orcid":"https://orcid.org/0000-0001-7961-7588"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Wang","raw_affiliation_strings":["National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101804801","display_name":"Zhihang Li","orcid":"https://orcid.org/0000-0002-4465-5645"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhihang Li","raw_affiliation_strings":["National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100622088","display_name":"Nan Liu","orcid":"https://orcid.org/0000-0003-4155-0685"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Nan Liu","raw_affiliation_strings":["National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021942394","display_name":"Zhiwen Pan","orcid":"https://orcid.org/0000-0002-7266-7264"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiwen Pan","raw_affiliation_strings":["National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072916702","display_name":"Xiaohu You","orcid":"https://orcid.org/0000-0002-0809-8511"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaohu You","raw_affiliation_strings":["National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"National Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":0.4123,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58157733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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.8323507308959961},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7887972593307495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5086294412612915},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5035633444786072},{"id":"https://openalex.org/keywords/orthogonality","display_name":"Orthogonality","score":0.4778192341327667},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4539165794849396},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43013450503349304},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4249987304210663},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40622350573539734},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24295717477798462},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08191627264022827}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8323507308959961},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7887972593307495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5086294412612915},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5035633444786072},{"id":"https://openalex.org/C17137986","wikidata":"https://www.wikidata.org/wiki/Q215067","display_name":"Orthogonality","level":2,"score":0.4778192341327667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4539165794849396},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43013450503349304},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4249987304210663},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40622350573539734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24295717477798462},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08191627264022827},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vtcfall.2012.6399170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtcfall.2012.6399170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Vehicular Technology Conference (VTC Fall)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1087470778","https://openalex.org/W1971386973","https://openalex.org/W2019486357","https://openalex.org/W2050967017","https://openalex.org/W2060826581","https://openalex.org/W2061914652","https://openalex.org/W2104335920","https://openalex.org/W2125915383","https://openalex.org/W2128192883","https://openalex.org/W2132485616","https://openalex.org/W2146981976","https://openalex.org/W2151444885","https://openalex.org/W2161872841","https://openalex.org/W2162636480","https://openalex.org/W2170969981","https://openalex.org/W2172085187","https://openalex.org/W2950092587","https://openalex.org/W3044215061","https://openalex.org/W4239651601","https://openalex.org/W6685120885"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W4312814274","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W2149245348"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5],"novel":[6],"opportunistic":[7],"scheduling":[8,16,140],"algorithm,":[9],"joint":[10],"useful":[11,29],"and":[12,40,45,64,97,113,134],"interference":[13,48,67,92],"channel":[14,30],"based":[15],"(JUICS),":[17],"in":[18,54,80],"coordinated":[19],"multi-point":[20],"(CoMP)":[21],"transmission":[22],"scenario.":[23],"Our":[24],"scheme":[25,116],"jointly":[26],"considers":[27],"the":[28,33,41,46,73,83,88,100,120,131],"condition":[31],"of":[32,72,82,87,99,103],"scheduled":[34,52,101],"user":[35],"from":[36],"its":[37],"serving":[38],"cell":[39],"orthogonality":[42],"between":[43],"that":[44,98],"corresponding":[47],"channels":[49],"to":[50,59,91,129,137],"concurrently":[51],"users":[53],"neighboring":[55],"CoMP":[56,105],"cells,":[57],"thus":[58,128],"exploit":[60],"multi-user":[61],"diversity":[62],"(MUD)":[63],"mitigate":[65],"inter-cell":[66],"(ICI)":[68],"simultaneously.":[69],"The":[70],"performance":[71,86],"proposed":[74],"algorithm":[75],"is":[76],"evaluated":[77],"through":[78],"simulation":[79],"terms":[81],"cumulative":[84],"distribution":[85],"received":[89,121],"signal":[90],"plus":[93],"noise":[94],"ratio":[95],"(SINR)":[96],"times":[102],"all":[104],"users.":[106],"Results":[107],"show":[108],"that,":[109],"with":[110,123],"limited":[111],"complexity":[112],"overhead,":[114],"our":[115],"can":[117],"significantly":[118],"enhance":[119],"SINR":[122],"relatively":[124],"better":[125],"fairness":[126],"guarantee,":[127],"achieve":[130],"largest":[132],"throughput":[133],"utility":[135],"comparing":[136],"several":[138],"well-known":[139],"algorithms.":[141]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}