{"id":"W4239615557","doi":"10.4018/9781605662503.ch006","title":"Local Algorithms for Topology Control in Ad-Hoc Networks","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","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); Wireless ad hoc network; Topology control; Routing (electronic design automation); Topology (electrical circuits); Control (management); Enhanced Data Rates for GSM Evolution; Graph traversal; Distributed computing; Subject (documents); Computer network; Theoretical computer science; Algorithm; Mathematics; Graph; Combinatorics; World Wide Web; 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.001262892,0.001337519,0.001423354,0.001074683,0.0008263395,0.002743005,0.003105474,0.001054953,0.009285236],"category_scores_gemma":[0.002664098,0.0005833344,0.0006577179,0.002813647,0.001537086,0.004520874,0.001974536,0.002532741,0.004691679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001142096,"about_ca_system_score_gemma":0.0006444883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005599107,"about_ca_topic_score_gemma":0.0008585828,"domain_scores_codex":[0.998776,0.0003352745,0.00006084167,0.0002185085,0.0005423359,0.00006696337],"domain_scores_gemma":[0.9987815,0.0006769507,0.00005447022,0.0003125351,0.000133972,0.00004070762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004532815,0.00008675729,0.0001932838,0.001262424,0.00007477021,0.0001012235,0.0003398257,0.08226714,0.002248082,0.3467726,0.03080948,0.5357992],"study_design_scores_gemma":[0.00008231029,0.0001352207,0.0002111291,0.0003583466,0.00006410765,0.0004270558,0.0002014583,0.3545521,0.003423604,0.4334748,0.2070197,0.00005014048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00107793,0.01370579,0.9686927,0.000351655,0.0002582842,0.00009011837,0.0000670239,0.00113086,0.01462569],"genre_scores_gemma":[0.1125607,0.04015493,0.8037099,0.0005717927,0.00107333,0.0009366794,0.0007496412,0.0008749963,0.03936797],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009285236,"threshold_uncertainty_score":0.03106225,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02257086033933519,"score_gpt":0.250358859341501,"score_spread":0.2277879990021658,"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."}}