{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0003208054,0.0006689002,0.000957611,0.0002241405,0.00009079917,0.00009941989,0.002880239,0.001328384,0.000009370518],"category_scores_gemma":[0.00003250334,0.0006812014,0.0002791044,0.00007293371,0.0003391133,0.00008563363,0.0009330077,0.0006336959,0.0001119646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004677217,"about_ca_system_score_gemma":0.0002066469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000541157,"about_ca_topic_score_gemma":0.0006761845,"domain_scores_codex":[0.9967138,0.0000308542,0.0006580954,0.001197297,0.0003210372,0.001078898],"domain_scores_gemma":[0.9977633,0.000150539,0.0002612266,0.001429141,0.0001758135,0.0002199245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005098661,0.000008763934,0.000004358399,0.000006724464,0.00004965692,0.0001065718,0.00002525803,0.0001777629,4.409898e-7,0.7115678,0.006320252,0.2816815],"study_design_scores_gemma":[0.001078671,0.0005911351,0.00002521148,0.0001303211,0.00003384825,0.00007771089,0.000004894566,0.015756,0.000008889581,0.7717142,0.2098013,0.0007779143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000003299016,0.001808613,0.6792557,0.0004643718,0.001237093,0.000907962,0.00005464728,0.0006426869,0.3156257],"genre_scores_gemma":[0.4528461,0.0002233913,0.3489042,0.02365165,0.002172889,0.001903159,0.00003331584,0.0005005814,0.1697648],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4528427,"threshold_uncertainty_score":0.9999681,"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."}}