{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81647"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81647","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Cooperative and Non-Cooperative Flow Control in Mobile Ad Hoc Networks","abstract":"\"Traditionally, flow control has been studied in a cooperative network environment. Such cooperative behavior is not a realistic assumption in a public MANET formed by a random group of strangers. Users in this network are likely to behave selfishly, by refusing to forward other users' packets. Under this non-cooperative environment, flow control and incentive engineering are two problems closely related to each other. To this end, we propose a joint flow control and incentive engineering scheme called iPass. iPass adopts the \"\"pay for service\"\" model of cooperation, and utilizes an auction mechanism at each router to fairly allocate bandwidth resources to the passing flows. At the same time, the auction markets give explicit rate signals to the end-hosts for flow control purpose. We show that iPass achieves several desirable system properties, such as truthful bidding of user's utility. Our simulation results also show that iPass is able to achieve the fairness and efficiency goals of flow control. Therefore, it provides an innovative and graceful solution for the flow control and incentive engineering problems in a non-cooperative MANET.\"","abstract_html":""Traditionally, flow control has been studied in a cooperative network environment. Such cooperative behavior is not a realistic assumption in a public MANET formed by a random group of strangers. Users in this network are likely to behave selfishly, by refusing to forward other users' packets. Under this non-cooperative environment, flow control and incentive engineering are two problems closely related to each other. To this end, we propose a joint flow control and incentive engineering scheme called iPass. iPass adopts the ""pay for service"" model of cooperation, and utilizes an auction mechanism at each router to fairly allocate bandwidth resources to the passing flows. At the same time, the auction markets give explicit rate signals to the end-hosts for flow control purpose. We show that iPass achieves several desirable system properties, such as truthful bidding of user's utility. Our simulation results also show that iPass is able to achieve the fairness and efficiency goals of flow control. Therefore, it provides an innovative and graceful solution for the flow control and incentive engineering problems in a non-cooperative MANET."","abstract_has_math":false,"creators":["Chen, Kai"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Nahrstedt, Klara"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:41Z","date_published":"2015-09-25T20:19:41Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3153264"],"render_values":[{"text":"(MiAaPQ)AAI3153264","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81647","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nahrstedt, Klara"]},{"key":"dc:creator","label":"Author","values":["Chen, Kai"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:41Z","10000-01-01","2004"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81647","(MiAaPQ)AAI3153264"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["\"Traditionally, flow control has been studied in a cooperative network environment. Such cooperative behavior is not a realistic assumption in a public MANET formed by a random group of strangers. Users in this network are likely to behave selfishly, by refusing to forward other users' packets. Under this non-cooperative environment, flow control and incentive engineering are two problems closely related to each other. To this end, we propose a joint flow control and incentive engineering scheme called iPass. iPass adopts the \"\"pay for service\"\" model of cooperation, and utilizes an auction mechanism at each router to fairly allocate bandwidth resources to the passing flows. At the same time, the auction markets give explicit rate signals to the end-hosts for flow control purpose. We show that iPass achieves several desirable system properties, such as truthful bidding of user's utility. Our simulation results also show that iPass is able to achieve the fairness and efficiency goals of flow control. Therefore, it provides an innovative and graceful solution for the flow control and incentive engineering problems in a non-cooperative MANET.\"","Made available in DSpace on 2015-09-25T20:19:41Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3153264.pdf: 7449862 bytes, checksum: b196a4d0793b4f3579fd29c48e2b4148 (MD5) Previous issue date: 2004","Embargo set by: Seth Robbins for item 82928 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","142 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004."]},{"key":"dc:title","label":"Title","values":["Cooperative and Non-Cooperative Flow Control in Mobile Ad Hoc Networks"]}]}],"canonical_facts":{"dc:contributor":["Nahrstedt, Klara"],"dc:creator":["Chen, Kai"],"dc:date":["2015-09-25T20:19:41Z","10000-01-01","2004"],"dc:description":["\"Traditionally, flow control has been studied in a cooperative network environment. Such cooperative behavior is not a realistic assumption in a public MANET formed by a random group of strangers. Users in this network are likely to behave selfishly, by refusing to forward other users' packets. Under this non-cooperative environment, flow control and incentive engineering are two problems closely related to each other. To this end, we propose a joint flow control and incentive engineering scheme called iPass. iPass adopts the \"\"pay for service\"\" model of cooperation, and utilizes an auction mechanism at each router to fairly allocate bandwidth resources to the passing flows. At the same time, the auction markets give explicit rate signals to the end-hosts for flow control purpose. We show that iPass achieves several desirable system properties, such as truthful bidding of user's utility. Our simulation results also show that iPass is able to achieve the fairness and efficiency goals of flow control. Therefore, it provides an innovative and graceful solution for the flow control and incentive engineering problems in a non-cooperative MANET.\"","Made available in DSpace on 2015-09-25T20:19:41Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3153264.pdf: 7449862 bytes, checksum: b196a4d0793b4f3579fd29c48e2b4148 (MD5) Previous issue date: 2004","Embargo set by: Seth Robbins for item 82928 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","142 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004."],"dc:identifier":["http://hdl.handle.net/2142/81647","(MiAaPQ)AAI3153264"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Cooperative and Non-Cooperative Flow Control in Mobile Ad Hoc Networks"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}