{"id":"W2505876309","doi":"10.4018/978-1-60566-250-3.ch006","title":"Local Algorithms for Topology Control in Ad-Hoc Networks","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Computer science; Vertex (graph theory); Topology control; Topology (electrical circuits); Wireless ad hoc network; Routing (electronic design automation); Control (management); Enhanced Data Rates for GSM Evolution; Distributed computing; Computer network; Algorithm; Theoretical computer science; Mathematics; Combinatorics; Graph; Artificial intelligence; 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.001328296,0.001411319,0.001502055,0.001034678,0.0008053703,0.002862319,0.00344686,0.001147866,0.008929891],"category_scores_gemma":[0.00289073,0.0005805616,0.0006472897,0.002900514,0.001606652,0.004564876,0.002054286,0.002511773,0.004653407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110893,"about_ca_system_score_gemma":0.000606653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004604988,"about_ca_topic_score_gemma":0.000664715,"domain_scores_codex":[0.9987543,0.0003553333,0.000069758,0.0002359032,0.0005187597,0.00006597761],"domain_scores_gemma":[0.9985038,0.0008367447,0.00006820434,0.000379207,0.0001618831,0.00005016513],"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.00004678663,0.0000819081,0.0001953787,0.001313197,0.0000657104,0.00009974305,0.0003058827,0.07420935,0.002145178,0.3762331,0.02542907,0.5198746],"study_design_scores_gemma":[0.00009312062,0.0001497117,0.0001994139,0.0003774602,0.00006905349,0.0004511775,0.0001774456,0.354851,0.003748283,0.4431981,0.1966327,0.00005239628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008976102,0.01017068,0.9754759,0.0002980532,0.0002391677,0.00007185261,0.00005013978,0.0009312143,0.01186542],"genre_scores_gemma":[0.1053856,0.03164123,0.8259643,0.0005595176,0.001185566,0.0009008168,0.0006234633,0.0007735236,0.03296603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008929891,"threshold_uncertainty_score":0.02987343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01211880094676964,"score_gpt":0.2449187842773671,"score_spread":0.2327999833305974,"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."}}