{"id":"W2103752966","doi":"10.1109/wimob.2008.78","title":"Power-Efficient Clustering in Wireless Sensor Networks under Coverage Constraint","year":2008,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Wireless sensor network; Computer science; Heuristic; Integer programming; Energy consumption; Routing (electronic design automation); Cluster analysis; Greedy algorithm; Key distribution in wireless sensor networks; Constraint (computer-aided design); Topology (electrical circuits); Linear programming; Distributed computing; Computer network; Wireless network; Wireless; Algorithm; Mathematics; Engineering; 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.000899078,0.0005732463,0.0007941377,0.0005624171,0.000492686,0.0007105051,0.0008657393,0.0008313753,0.0007055179],"category_scores_gemma":[0.003233643,0.0004091895,0.000381738,0.00157412,0.0006864943,0.00145304,0.0006913504,0.0004895299,0.0001736022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008984765,"about_ca_system_score_gemma":0.0007777954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002341691,"about_ca_topic_score_gemma":0.001991277,"domain_scores_codex":[0.9992583,0.0003123446,0.00002866687,0.0001336513,0.0001770678,0.00008993292],"domain_scores_gemma":[0.9990861,0.0006047535,0.0001154824,0.00007973715,0.00007978621,0.00003398817],"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.00003811199,0.00002296352,0.0002382936,0.00008070741,0.00001827472,0.00004200171,0.00005619212,0.9596482,0.002499869,0.01569984,0.0007279131,0.02092774],"study_design_scores_gemma":[0.00001075184,0.00002736367,0.0001663188,0.000007375158,0.000007673874,0.00003021647,0.00002539526,0.9839146,0.001204436,0.01385149,0.0007486797,0.000005749116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0569207,0.0009928129,0.9372209,0.00044344,0.00002546521,0.00008583411,0.0000976891,0.0003237094,0.003889497],"genre_scores_gemma":[0.8320796,0.001159326,0.1631777,0.0001203105,0.00005849376,0.0002397007,0.0002112521,0.000145474,0.00280812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002341691,"threshold_uncertainty_score":0.00651896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01394772232818877,"score_gpt":0.2160827036261993,"score_spread":0.2021349812980105,"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."}}