{"id":"https://openalex.org/W2897627164","doi":"https://doi.org/10.1109/sera.2018.8477198","title":"A Method of Channel Capacity Optimization Based on Dynamically Adjusted Inertia Weight Acceleration Factor in Cognitive Sensing Network","display_name":"A Method of Channel Capacity Optimization Based on Dynamically Adjusted Inertia Weight Acceleration Factor in Cognitive Sensing Network","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2897627164","doi":"https://doi.org/10.1109/sera.2018.8477198","mag":"2897627164"},"language":"en","primary_location":{"id":"doi:10.1109/sera.2018.8477198","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sera.2018.8477198","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 16th International Conference on Software Engineering Research, Management and Applications (SERA)","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/A5101502141","display_name":"Yanjun Hu","orcid":"https://orcid.org/0000-0002-6319-176X"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanjun Hu","raw_affiliation_strings":["Anhui University, Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education, Hefei, China","Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education, Anhui University, Hefei, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Anhui University, Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education, Hefei, China","institution_ids":["https://openalex.org/I143868143"]},{"raw_affiliation_string":"Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education, Anhui University, Hefei, China","institution_ids":["https://openalex.org/I143868143"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014798508","display_name":"Dongdong Wei","orcid":null},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dongdong Wei","raw_affiliation_strings":["Anhui University, Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education, Hefei, China","Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education, Anhui University, Hefei, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Anhui University, Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education, Hefei, China","institution_ids":["https://openalex.org/I143868143"]},{"raw_affiliation_string":"Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education, Anhui University, Hefei, China","institution_ids":["https://openalex.org/I143868143"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I143868143"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"184","last_page":"188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9943000078201294,"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/T10851","display_name":"Optical Wireless Communication Technologies","score":0.984000027179718,"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/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.8071954250335693},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.6997465491294861},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6812353134155273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5731194615364075},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.5701864361763},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5685009956359863},{"id":"https://openalex.org/keywords/inertia","display_name":"Inertia","score":0.5319329500198364},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.5319153666496277},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5141034722328186},{"id":"https://openalex.org/keywords/imperialist-competitive-algorithm","display_name":"Imperialist competitive algorithm","score":0.4606606364250183},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4375704824924469},{"id":"https://openalex.org/keywords/derivative-free-optimization","display_name":"Derivative-free optimization","score":0.4162146747112274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24092251062393188}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.8071954250335693},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.6997465491294861},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6812353134155273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5731194615364075},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.5701864361763},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5685009956359863},{"id":"https://openalex.org/C110407247","wikidata":"https://www.wikidata.org/wiki/Q122508","display_name":"Inertia","level":2,"score":0.5319329500198364},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.5319153666496277},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5141034722328186},{"id":"https://openalex.org/C101219045","wikidata":"https://www.wikidata.org/wiki/Q10859646","display_name":"Imperialist competitive algorithm","level":4,"score":0.4606606364250183},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4375704824924469},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.4162146747112274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24092251062393188},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sera.2018.8477198","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sera.2018.8477198","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 16th International Conference on Software Engineering Research, Management and Applications (SERA)","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":8,"referenced_works":["https://openalex.org/W1131530539","https://openalex.org/W1995683365","https://openalex.org/W2151180628","https://openalex.org/W2152195021","https://openalex.org/W2321078907","https://openalex.org/W2382914255","https://openalex.org/W2756409840","https://openalex.org/W6682329517"],"related_works":["https://openalex.org/W2113650225","https://openalex.org/W2393398569","https://openalex.org/W2351868275","https://openalex.org/W2885991329","https://openalex.org/W4315650968","https://openalex.org/W2391889613","https://openalex.org/W2893292693","https://openalex.org/W2107369277","https://openalex.org/W2353640252","https://openalex.org/W2371869200"],"abstract_inverted_index":{"The":[0,14,111,162],"optimization":[1,12,130,148,154,171],"of":[2,44,73,114,117,136,155],"channel":[3,74,156,169],"capacity":[4,75,157,170,182],"in":[5,122,158],"cognitive":[6,159],"sensor":[7,160],"networks":[8],"is":[9,78,120,141,150],"a":[10,91,185],"complicated":[11],"problem.":[13],"traditional":[15,46],"gradient":[16,47],"search":[17,48,84,88],"method":[18],"based":[19,132],"on":[20,26,133],"the":[21,27,37,41,45,50,71,82,86,104,118,144,153,167,176,180],"analysis":[22],"has":[23],"more":[24],"restrictions":[25],"objective":[28],"function,":[29],"and":[30,33,56,62,125,143,183],"high":[31],"complexity,":[32],"can":[34,66,101,173],"not":[35,102],"determine":[36],"convergence.":[38],"Aiming":[39],"at":[40],"inherent":[42],"problems":[43],"algorithm,":[49],"particle":[51,93,128,146],"swarm":[52,94,129,147],"optimization(PSO)":[53],"with":[54,85,96],"simple":[55],"easy":[57],"to":[58,69,80,152],"implement,":[59],"distributed":[60],"computing":[61],"fast":[63],"convergence":[64,106,177],"speed":[65,174],"be":[67],"used":[68],"solve":[70,103],"problem":[72,107],"optimization.":[76],"It":[77],"difficult":[79],"balance":[81],"global":[83],"local":[87],"by":[89],"adopting":[90],"standard":[92],"algorithm":[95,98,119,131,149],"fixed":[97],"parameters,":[99],"which":[100],"premature":[105],"that":[108,166],"may":[109],"occur.":[110],"specific":[112],"meaning":[113],"each":[115],"parameter":[116],"analyzed":[121],"this":[123],"paper,":[124],"an":[126],"improved":[127,145,168],"dynamic":[134],"adjustment":[135],"inertia":[137],"weight":[138],"acceleration":[139],"factor(DWAPSO)":[140],"proposed,":[142],"applied":[151],"networks.":[161],"simulation":[163],"results":[164],"show":[165],"algorithm(DWAPSO-CA)":[172],"up":[175],"rate,":[178],"increase":[179],"system":[181],"get":[184],"lower":[186],"bit":[187],"error":[188],"rate.":[189]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}