{"id":"W2024637881","doi":"10.1109/ispacs.2011.6146093","title":"Edge node based greedy routing algorithm (ENBGCR)for cooperative wireless ad hoc networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Cooperative diversity; Wireless Routing Protocol; Greedy algorithm; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Algorithm; Distributed computing; Fading; Routing protocol; Wireless; Channel (broadcasting); Routing (electronic design automation); Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006687625,0.0005767808,0.0004435412,0.0006319007,0.0005355076,0.0003533503,0.001076704,0.0006226746,0.0006194332],"category_scores_gemma":[0.001540288,0.0001703352,0.0002904927,0.0008035084,0.0004366816,0.0006925156,0.0006451145,0.0004047403,0.0002304817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004266983,"about_ca_system_score_gemma":0.0008469752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001873819,"about_ca_topic_score_gemma":0.002729724,"domain_scores_codex":[0.9995953,0.0001686498,0.00001924253,0.00004396761,0.0001314915,0.00004139465],"domain_scores_gemma":[0.9994783,0.0002725744,0.00007013019,0.00005601027,0.0001003213,0.00002270361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002071823,0.000107039,0.002031512,0.0002221929,0.0001174331,0.0002848035,0.0003483842,0.5796999,0.01620075,0.04724929,0.007102902,0.3464286],"study_design_scores_gemma":[0.00006518519,0.0002149138,0.0004498078,0.00002193695,0.00003801316,0.0003640936,0.00007321646,0.9713901,0.003521998,0.01589502,0.007936628,0.00002909821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01776784,0.0006850167,0.9791124,0.0001641657,0.00006423845,0.00009056361,0.00002684736,0.0003625237,0.001726421],"genre_scores_gemma":[0.2700154,0.0008148762,0.7262561,0.00021638,0.00004155894,0.0002961037,0.0001812981,0.00005453169,0.00212371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001873819,"threshold_uncertainty_score":0.003725767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06252300682788582,"score_gpt":0.2718406872057655,"score_spread":0.2093176803778797,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}