{"id":"W2134627619","doi":"10.1109/wcnc.2008.565","title":"A Novel Fair Incentive Protocol for Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Incentive; Computer network; Mobile ad hoc network; Computer science; Selfishness; Wireless ad hoc network; Node (physics); Optimized Link State Routing Protocol; Protocol (science); Network packet; Computer security; Routing protocol; Microeconomics; Wireless; Telecommunications; Economics; Engineering; Law","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.002408717,0.0006501612,0.0007686243,0.0008596056,0.001680049,0.0011773,0.001992993,0.001496938,0.00163473],"category_scores_gemma":[0.004512127,0.000283724,0.0006006437,0.0009434632,0.001237639,0.003513292,0.001882728,0.001674147,0.000415654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008469925,"about_ca_system_score_gemma":0.001976265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009093644,"about_ca_topic_score_gemma":0.0009528737,"domain_scores_codex":[0.9987183,0.0003386061,0.0001118372,0.0001947463,0.00049608,0.0001405492],"domain_scores_gemma":[0.9990267,0.0004386596,0.0001006764,0.0001200035,0.0002133414,0.0001007271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002788465,0.000208747,0.0005826494,0.0004054518,0.0000817066,0.001055137,0.0006681848,0.05333042,0.01991567,0.6861457,0.0156632,0.2216644],"study_design_scores_gemma":[0.0002702084,0.0004471492,0.0003308448,0.0001168701,0.0001168478,0.001659371,0.0001130407,0.5205375,0.008799073,0.3211911,0.1462539,0.0001640167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005062797,0.0008815383,0.9865002,0.0006128348,0.000665163,0.0003520936,0.00008037424,0.0002961255,0.005548904],"genre_scores_gemma":[0.3603818,0.001763769,0.6207994,0.0008133421,0.0007875855,0.00117996,0.0001935071,0.00007071679,0.01401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002408717,"threshold_uncertainty_score":0.01273865,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02825545921435674,"score_gpt":0.2825448835405545,"score_spread":0.2542894243261977,"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."}}