{"id":"W2025856120","doi":"10.1016/j.procs.2012.06.126","title":"Multi-hop Interference-Aware Routing Protocol for Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Network packet; Scheduling (production processes); Routing protocol; Distributed computing; Cluster analysis; Signal-to-interference-plus-noise ratio; Interference (communication); Key distribution in wireless sensor networks; Wireless; Wireless network; Power (physics); Telecommunications; Channel (broadcasting)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00185087,0.0004190351,0.0003700323,0.0002056979,0.000674082,0.0008630486,0.003730112,0.0001376813,0.000006663458],"category_scores_gemma":[0.00008319283,0.0003682259,0.0001237986,0.001645692,0.0003761998,0.002927106,0.001915408,0.0003751667,0.00003862708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001725116,"about_ca_system_score_gemma":0.0003444613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006716233,"about_ca_topic_score_gemma":0.000004360843,"domain_scores_codex":[0.9956616,0.0000689459,0.0005833582,0.001208364,0.000628466,0.001849229],"domain_scores_gemma":[0.9971088,0.0003001792,0.0003397026,0.001053266,0.000605022,0.0005930013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009071497,0.001309421,0.03000871,0.0004682052,0.00005163783,0.00001570155,0.008464293,0.02437508,0.001745265,0.03185093,0.005150988,0.8964691],"study_design_scores_gemma":[0.0007949975,0.0001546421,0.001749277,0.0001465319,0.000003893286,0.00004875107,0.00001558397,0.9939917,0.001242316,0.00007673789,0.001281611,0.000493906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006272019,0.00001039641,0.9483242,0.0001465251,0.001662657,0.04861679,0.000001299836,0.000529849,0.00008108515],"genre_scores_gemma":[0.4222437,7.472609e-7,0.4872789,0.0005718103,0.001376012,0.08844957,0.000001272537,0.00002905164,0.00004885376],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9696167,"threshold_uncertainty_score":0.999877,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03963815977384598,"score_gpt":0.3038966078442703,"score_spread":0.2642584480704243,"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."}}