{"id":"W2799292918","doi":"10.1109/tmc.2018.2831679","title":"Multipath Cooperative Routing with Efficient Acknowledgement for LEO Satellite Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":165,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer network; Computer science; Multipath routing; Dynamic Source Routing; Acknowledgement; Routing protocol; Distributed computing; Network packet; Linear network coding; Static routing; Retransmission; Multipath propagation; Channel (broadcasting)","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.0008941154,0.0004205514,0.000298293,0.0006172115,0.0005398052,0.0004876191,0.0007422458,0.0003898598,0.0005128187],"category_scores_gemma":[0.002445097,0.0002008725,0.0002488664,0.0007014615,0.0005544022,0.001070989,0.0007856367,0.0005014273,0.000110849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008903582,"about_ca_system_score_gemma":0.001175776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003175602,"about_ca_topic_score_gemma":0.004346381,"domain_scores_codex":[0.999539,0.0001319886,0.00002009426,0.00005132913,0.0001959777,0.00006149224],"domain_scores_gemma":[0.9988025,0.0005209023,0.0002161551,0.0001665151,0.0002549123,0.00003899073],"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.0001746729,0.00006810074,0.001518702,0.0002280323,0.00005589588,0.0003383301,0.000367407,0.7333055,0.04888187,0.05758123,0.002668513,0.1548118],"study_design_scores_gemma":[0.000009451618,0.0001056534,0.0002624777,0.00001115629,0.00002278501,0.000119441,0.00004878753,0.9812438,0.005929669,0.009453299,0.002770488,0.00002304977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07342722,0.001624153,0.9204314,0.0003908939,0.00006244244,0.00007104027,0.00003439308,0.0005932391,0.003365287],"genre_scores_gemma":[0.921277,0.0008532453,0.07594434,0.00006795713,0.00004524323,0.00009433438,0.00004483133,0.0000278614,0.001645016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003175602,"threshold_uncertainty_score":0.006460011,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02644118996341843,"score_gpt":0.2862196929497967,"score_spread":0.2597785029863782,"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."}}