{"id":"W2171555797","doi":"10.1002/dac.2989","title":"An energy‐efficient history‐based routing scheme for opportunistic networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Energy consumption; Computer network; Overhead (engineering); Routing protocol; Routing (electronic design automation); Network packet; Energy (signal processing); Efficient energy use; Bandwidth (computing); Electrical engineering; Mathematics; Statistics","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.0005582907,0.0003821685,0.0004432345,0.0007901163,0.000735847,0.0004816892,0.001527309,0.0004521174,0.001287942],"category_scores_gemma":[0.001409423,0.0002001325,0.000294655,0.0005233266,0.0003994771,0.001138366,0.001241171,0.0004187466,0.0002099888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005134022,"about_ca_system_score_gemma":0.0008092591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002533023,"about_ca_topic_score_gemma":0.00350783,"domain_scores_codex":[0.9997041,0.00006705987,0.0000234681,0.00005347336,0.0001058717,0.00004603115],"domain_scores_gemma":[0.9994164,0.0001994701,0.00008932917,0.0001259629,0.0001137629,0.00005511989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008346321,0.0002811791,0.004044315,0.00042249,0.0001475813,0.0008889045,0.000601151,0.3379263,0.05945435,0.08438591,0.01079522,0.500218],"study_design_scores_gemma":[0.00005406261,0.0002113948,0.001042531,0.00003212826,0.00005290472,0.0003572051,0.00009520851,0.9630519,0.009011274,0.01747119,0.008554678,0.00006544072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1228339,0.001615244,0.8619597,0.0006389106,0.0002803786,0.0002397968,0.0002352109,0.001371415,0.01082544],"genre_scores_gemma":[0.943289,0.0004057896,0.05221555,0.0001094255,0.00005894389,0.00009032906,0.0001950442,0.00003118689,0.003604785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002533023,"threshold_uncertainty_score":0.005036533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09001436105111163,"score_gpt":0.3074328118247264,"score_spread":0.2174184507736148,"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."}}