{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005925236,0.0005145513,0.0004976902,0.0006413797,0.0006218994,0.0008867799,0.001002401,0.0008696367,0.001428342],"category_scores_gemma":[0.001478645,0.0002719445,0.0004211587,0.000718498,0.0006850404,0.001232649,0.0005837818,0.0006525099,0.0005651421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004027406,"about_ca_system_score_gemma":0.0006728125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009654881,"about_ca_topic_score_gemma":0.00159862,"domain_scores_codex":[0.9994848,0.0001999941,0.0000332686,0.0000599691,0.0001890071,0.00003299208],"domain_scores_gemma":[0.9995641,0.0002319045,0.00006410375,0.00004234317,0.00007739965,0.00002004542],"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.0002733055,0.000149609,0.001035399,0.0008523755,0.000125515,0.0009083291,0.0007098108,0.3950998,0.0395958,0.2958576,0.007166761,0.2582257],"study_design_scores_gemma":[0.0000641519,0.0002678181,0.0001798953,0.00006341491,0.00005716289,0.0004118579,0.00007784532,0.910349,0.009364706,0.03939294,0.0397336,0.00003762143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009345917,0.001434979,0.9838701,0.0002640199,0.0001084054,0.0001231467,0.00003439351,0.0006569221,0.004162205],"genre_scores_gemma":[0.3250121,0.002345904,0.6623362,0.0001784561,0.0001374641,0.0004735004,0.0001809215,0.0001141447,0.009221314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001428342,"threshold_uncertainty_score":0.004778266,"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."}}