{"id":"https://openalex.org/W2005686751","doi":"https://doi.org/10.1109/lwc.2014.2357032","title":"Joint Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks With Multiple Flows","display_name":"Joint Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks With Multiple Flows","publication_year":2014,"publication_date":"2014-09-15","ids":{"openalex":"https://openalex.org/W2005686751","doi":"https://doi.org/10.1109/lwc.2014.2357032","mag":"2005686751"},"language":"en","primary_location":{"id":"doi:10.1109/lwc.2014.2357032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lwc.2014.2357032","pdf_url":null,"source":{"id":"https://openalex.org/S2500830676","display_name":"IEEE Wireless Communications Letters","issn_l":"2162-2337","issn":["2162-2337","2162-2345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications Letters","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/A5036616008","display_name":"Fatemeh Mansourkiaie","orcid":null},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Fatemeh Mansourkiaie","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Memorial University of Newfoundland, St. Johns, NF, Canada","Dept. of Electr. & Comput. Eng., Memorial Univ. of Newfoundland, St. John's, NL, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Memorial University of Newfoundland, St. Johns, NF, Canada","institution_ids":["https://openalex.org/I130438778"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Memorial Univ. of Newfoundland, St. John's, NL, Canada","institution_ids":["https://openalex.org/I130438778"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100842996","display_name":"Mohammed Hossam Ahmed","orcid":null},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohammed Hossam Ahmed","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Memorial University of Newfoundland, St. Johns, NF, Canada","Dept. of Electr. & Comput. Eng., Memorial Univ. of Newfoundland, St. John's, NL, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Memorial University of Newfoundland, St. Johns, NF, Canada","institution_ids":["https://openalex.org/I130438778"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Memorial Univ. of Newfoundland, St. John's, NL, Canada","institution_ids":["https://openalex.org/I130438778"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3187,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.94572353,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"1","first_page":"6","last_page":"9"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9994000196456909,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9987999796867371,"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.7368752956390381},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.6897843480110168},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5939986705780029},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5503659248352051},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47353240847587585},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.46716487407684326},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.46609652042388916},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4367210566997528},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4353521764278412},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.4253527522087097},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4195794463157654},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.41427692770957947},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3788542151451111},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36191824078559875},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11772790551185608},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10573816299438477}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7368752956390381},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.6897843480110168},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5939986705780029},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5503659248352051},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47353240847587585},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.46716487407684326},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.46609652042388916},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4367210566997528},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4353521764278412},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.4253527522087097},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4195794463157654},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.41427692770957947},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3788542151451111},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36191824078559875},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11772790551185608},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10573816299438477},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lwc.2014.2357032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lwc.2014.2357032","pdf_url":null,"source":{"id":"https://openalex.org/S2500830676","display_name":"IEEE Wireless Communications Letters","issn_l":"2162-2337","issn":["2162-2337","2162-2345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications Letters","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":9,"referenced_works":["https://openalex.org/W1519405745","https://openalex.org/W2041564253","https://openalex.org/W2045824559","https://openalex.org/W2105830044","https://openalex.org/W2152121970","https://openalex.org/W2168566523","https://openalex.org/W2168782512","https://openalex.org/W3159068915","https://openalex.org/W6675337769"],"related_works":["https://openalex.org/W2165141768","https://openalex.org/W2013019167","https://openalex.org/W4225995876","https://openalex.org/W2281771002","https://openalex.org/W2134468116","https://openalex.org/W206015150","https://openalex.org/W1665963305","https://openalex.org/W4313562922","https://openalex.org/W1977807074","https://openalex.org/W2005686751"],"abstract_inverted_index":{"In":[0],"this":[1],"letter,":[2],"a":[3,24],"cross-layer":[4],"cooperative":[5,30,40,46,76],"routing":[6,41,47,77],"algorithm":[7,27],"is":[8],"proposed":[9,39],"for":[10],"minimizing":[11],"the":[12,50,61,70],"collision":[13,25,45,55,71],"probability":[14,20,56,72],"subject":[15],"to":[16,57],"an":[17],"end-to-end":[18],"outage":[19],"constraint.":[21],"We":[22],"develop":[23],"minimization":[26],"by":[28],"combining":[29],"transmission,":[31],"optimal":[32],"power":[33],"allocation,":[34],"and":[35],"route":[36,51],"selection.":[37],"The":[38],"algorithm,":[42],"called":[43],"minimum":[44,54],"(MCCR),":[48],"selects":[49],"that":[52,65],"causes":[53],"other":[58],"nodes":[59],"in":[60],"network.":[62],"Results":[63],"show":[64],"MCCR":[66],"can":[67],"significantly":[68],"reduce":[69],"compared":[73],"with":[74],"existing":[75],"schemes.":[78]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}