{"id":"W2090817802","doi":"10.1155/2008/728415","title":"The Synchronized Peer‐to‐Peer Framework and Distributed Contention‐Free Medium Access for Multihop Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Sensors","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Queen's University; Canada Foundation for Innovation","keywords":"Computer network; Computer science; Network topology; Wireless sensor network; Peer-to-peer; Wireless; Routing (electronic design automation); Distributed computing; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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.001497692,0.0003586552,0.0006237276,0.0001883206,0.0009097731,0.0005364867,0.002233549,0.0002794275,0.000004075276],"category_scores_gemma":[0.002140292,0.0002517049,0.0002974297,0.0007417506,0.0003019487,0.0005359688,0.0005019157,0.0007608538,0.000003163631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001756952,"about_ca_system_score_gemma":0.0001399745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001708199,"about_ca_topic_score_gemma":0.00001707006,"domain_scores_codex":[0.9961971,0.0002404867,0.001013553,0.0004424842,0.001320639,0.0007857561],"domain_scores_gemma":[0.9927031,0.002677653,0.0008410504,0.0008563963,0.002439188,0.0004826159],"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.0004284562,0.0001414596,0.001954734,0.00002383418,0.0002987188,0.0003272146,0.000899987,0.9415702,0.0003310483,0.003419695,0.0462254,0.004379202],"study_design_scores_gemma":[0.003303274,0.000363776,0.008182343,0.0003105072,0.00008215236,0.00125803,0.000325546,0.9630157,0.0009259397,0.0005195456,0.02110433,0.0006087876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.315214,0.0003941106,0.6683004,0.01359338,0.002069925,0.0003275355,0.00001541584,0.00006627881,0.00001885872],"genre_scores_gemma":[0.9511107,0.0005391464,0.04587129,0.000528321,0.001139824,0.00001484631,0.000006490693,0.00004890076,0.000740438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6358967,"threshold_uncertainty_score":0.9999935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02345263004849276,"score_gpt":0.2735262949630753,"score_spread":0.2500736649145826,"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."}}