{"id":"https://openalex.org/W2562678972","doi":"https://doi.org/10.1504/ijahuc.2016.10001992","title":"Congestion Control and Fairness with Dynamic Priority for Ad hoc Networks","display_name":"Congestion Control and Fairness with Dynamic Priority for Ad hoc Networks","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2562678972","doi":"https://doi.org/10.1504/ijahuc.2016.10001992","mag":"2562678972"},"language":"en","primary_location":{"id":"doi:10.1504/ijahuc.2016.10001992","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijahuc.2016.10001992","pdf_url":null,"source":{"id":"https://openalex.org/S97070762","display_name":"International Journal of Ad Hoc and Ubiquitous Computing","issn_l":"1743-8225","issn":["1743-8225","1743-8233"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Ad Hoc and Ubiquitous Computing","raw_type":"journal-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/A5102863507","display_name":"Tapas Kumar Mishra","orcid":"https://orcid.org/0000-0002-9825-3828"},"institutions":[{"id":"https://openalex.org/I189109744","display_name":"Indian Institute of Technology Dhanbad","ror":"https://ror.org/013v3cc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I189109744"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tapas Mishra","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology (ISM), Dhanbad 826004, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology (ISM), Dhanbad 826004, India","institution_ids":["https://openalex.org/I189109744"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089777702","display_name":"Sachin Tripathi","orcid":"https://orcid.org/0000-0003-0222-8204"},"institutions":[{"id":"https://openalex.org/I189109744","display_name":"Indian Institute of Technology Dhanbad","ror":"https://ror.org/013v3cc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I189109744"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sachin Tripathi","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology (ISM), Dhanbad 826004, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology (ISM), Dhanbad 826004, India","institution_ids":["https://openalex.org/I189109744"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189109744"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17537631,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":"1","first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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/T10246","display_name":"Mobile Ad Hoc Networks","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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9986000061035156,"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.9984999895095825,"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.8782017230987549},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.6762675642967224},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.669599711894989},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6411213278770447},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.6407978534698486},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.6140407919883728},{"id":"https://openalex.org/keywords/flow-control","display_name":"Flow control (data)","score":0.5693404078483582},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5469756722450256},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5429894328117371},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5184521079063416},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.49939489364624023},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.479657918214798},{"id":"https://openalex.org/keywords/packet-loss","display_name":"Packet loss","score":0.4587749242782593},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.4422139823436737},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4132179021835327},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37904614210128784},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3365207612514496},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.1945652961730957},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.1801135540008545},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.16339650750160217},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16283556818962097},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10796013474464417},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.10314765572547913}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8782017230987549},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.6762675642967224},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.669599711894989},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6411213278770447},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.6407978534698486},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.6140407919883728},{"id":"https://openalex.org/C186766456","wikidata":"https://www.wikidata.org/wiki/Q612457","display_name":"Flow control (data)","level":2,"score":0.5693404078483582},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5469756722450256},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5429894328117371},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5184521079063416},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.49939489364624023},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.479657918214798},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.4587749242782593},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.4422139823436737},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4132179021835327},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37904614210128784},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3365207612514496},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.1945652961730957},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.1801135540008545},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.16339650750160217},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16283556818962097},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10796013474464417},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.10314765572547913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijahuc.2016.10001992","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijahuc.2016.10001992","pdf_url":null,"source":{"id":"https://openalex.org/S97070762","display_name":"International Journal of Ad Hoc and Ubiquitous Computing","issn_l":"1743-8225","issn":["1743-8225","1743-8233"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Ad Hoc and Ubiquitous Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2037055167","https://openalex.org/W2604560300","https://openalex.org/W2133311116","https://openalex.org/W1602037586","https://openalex.org/W2069990174","https://openalex.org/W2337893998","https://openalex.org/W2369535141","https://openalex.org/W2091447295","https://openalex.org/W2098767435","https://openalex.org/W2067749084"],"abstract_inverted_index":{"Recently,":[0],"the":[1,20,23,29,32,35,40,49,58,64,88,127],"network":[2],"structure":[3],"has":[4,11,115],"changed":[5],"rapidly":[6],"in":[7,28],"modern":[8],"applications":[9,44],"and":[10,86,104],"imposed":[12],"priority":[13,54,59,85],"for":[14,120],"heterogeneous":[15],"applications.":[16,122,137],"In":[17],"some":[18],"scenarios,":[19],"priorities":[21,89],"of":[22,31,42,90],"flows":[24,91],"need":[25],"to":[26,83,109,133],"change":[27],"middle":[30],"communication.":[33],"However,":[34],"major":[36],"problem":[37],"is":[38,107],"that":[39],"packets":[41],"different":[43,136],"are":[45],"not":[46,61],"served":[47],"at":[48],"destination":[50],"by":[51,143],"their":[52],"expected":[53],"ratio":[55],"even":[56],"if":[57],"does":[60],"change.":[62],"Considering":[63],"above":[65],"problem,":[66],"this":[67],"paper":[68],"presents":[69],"a":[70,95],"fair":[71],"packet":[72,145],"scheduling":[73],"policy":[74],"which":[75],"collects":[76],"information":[77],"from":[78],"each":[79],"individual":[80],"flow":[81],"according":[82],"its":[84],"auto-updates":[87],"when":[92],"required.":[93],"Moreover,":[94,138],"hybrid":[96],"congestion":[97],"control":[98,110],"technique":[99],"based":[100],"on":[101],"queue":[102],"occupancy":[103],"channel":[105],"utilisation":[106],"framed":[108],"congestion.":[111],"The":[112,123],"proposed":[113],"model":[114,128],"been":[116],"simulated":[117],"using":[118],"NS2":[119],"two":[121],"simulation":[124],"result":[125],"shows":[126],"performs":[129],"better":[130],"with":[131],"respect":[132],"fairness":[134],"among":[135],"it":[139],"achieves":[140],"improved":[141],"throughput":[142],"reducing":[144],"loss.":[146]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}