{"id":"W2153797310","doi":"10.1109/jsac.2007.070110","title":"Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Bluetooth; Neighbor Discovery Protocol; Wireless ad hoc network; Mobile ad hoc network; Energy consumption; Computer network; Context (archaeology); Node (physics); Distributed computing; Algorithm; Wireless; Telecommunications; The Internet; Network packet","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.002416601,0.0006556585,0.0007348918,0.001178515,0.0007871227,0.0008699031,0.002868776,0.0007610212,0.0007894728],"category_scores_gemma":[0.01017969,0.000326089,0.0002777737,0.0009866534,0.0007799704,0.001740077,0.001003913,0.0007140937,0.0001905635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000678355,"about_ca_system_score_gemma":0.0007302904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001285373,"about_ca_topic_score_gemma":0.002103492,"domain_scores_codex":[0.998609,0.0003733367,0.0000942626,0.0001530652,0.0006636005,0.0001068266],"domain_scores_gemma":[0.994777,0.003454892,0.0005278662,0.0006111439,0.0005188774,0.0001102335],"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.0003951283,0.0003660009,0.003611533,0.00026306,0.0001269775,0.0001429406,0.0003691639,0.5980588,0.01151883,0.02676448,0.001820375,0.3565627],"study_design_scores_gemma":[0.00009089204,0.0001839393,0.0005943354,0.00001909748,0.00004023505,0.000227,0.00006793801,0.9853283,0.00361843,0.006970138,0.002827064,0.00003270201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0487846,0.001225799,0.9462374,0.0001534469,0.00008784158,0.0002104294,0.00003320471,0.0007550989,0.002512205],"genre_scores_gemma":[0.6328688,0.0006206344,0.3642945,0.0001210046,0.00006687359,0.0003193135,0.00009002155,0.00009530739,0.001523505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002868776,"threshold_uncertainty_score":0.01278031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05909783989474746,"score_gpt":0.3057080406750793,"score_spread":0.2466102007803318,"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."}}