{"id":"W2157576168","doi":"10.1109/conielecomp.2007.83","title":"Mobile Agent for Efficient Routing among Source Nodes in Wireless Sensor Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Wireless sensor network; Dijkstra's algorithm; Mobile agent; Computer network; Distributed computing; Data redundancy; Mobile wireless sensor network; Geographic routing; Redundancy (engineering); Dynamic Source Routing; Key distribution in wireless sensor networks; Routing protocol; Routing (electronic design automation); Wireless; Shortest path problem; Graph; Wireless network; Theoretical computer science; 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"],"consensus_categories":[],"category_scores_codex":[0.001609436,0.0003254413,0.0003565701,0.0002573369,0.0002320132,0.0001934609,0.0009381584,0.0002160751,0.000006468477],"category_scores_gemma":[0.00003779318,0.0003059382,0.0001673213,0.0009496984,0.0001011663,0.0001444775,0.000359362,0.0003015815,0.00001018664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001927673,"about_ca_system_score_gemma":0.00002721785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001358384,"about_ca_topic_score_gemma":0.000198468,"domain_scores_codex":[0.9967079,0.00008096991,0.0006814813,0.0008480391,0.0004069569,0.001274677],"domain_scores_gemma":[0.9980557,0.0006950268,0.0002029348,0.0007410124,0.000119581,0.0001857444],"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.00001586885,0.0001546232,0.005771491,0.000009673943,0.000009428345,0.00002374029,0.0005041861,0.9573908,0.000201091,0.006894606,0.0000971441,0.02892732],"study_design_scores_gemma":[0.0006235865,0.00007228391,0.003294884,0.00007532362,0.000004797281,0.000007954209,0.0002627279,0.9924566,0.002216264,0.000009166242,0.0005818147,0.0003945537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4125391,0.00006433203,0.5851637,0.00001888221,0.0004323545,0.0003913309,3.245024e-7,0.0002752308,0.001114784],"genre_scores_gemma":[0.9481396,0.00000966353,0.05027432,0.0002738748,0.0002196163,0.00005997721,0.000005069675,0.0000420493,0.0009758412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5356005,"threshold_uncertainty_score":0.9999393,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009943547167643839,"score_gpt":0.2345969274921971,"score_spread":0.2246533803245533,"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."}}