{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/43902"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/43902","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"MAC layer resource allocation algorithms for OFDM/TDMA wireless networks","abstract":"In wireless networks employing OFDMA/TDMA, orthogonal channels and timeslots are available resources that should be distributed between users fairly and in a collision-free manner. Furthermore, the available resources should be used efficiently. In this dissertation, the resource allocation mechanisms for wireless networks are studied based on frameworks developed from Graph Theory and Game Theory. Centralized and distributed resource location algorithms based on graph theory are introduced that assign both time-slots and channels to wireless transmission links in multihop networks. For finding the possible set of users that can transmit concurrently, a new conflict graph is investigated. Furthermore, a greedy algorithm for finding the maximum independent set of the introduced conflict graph is proposed. The distributed version of the resource allocation mechanism is a greedy algorithm that finds the local maximum independent set of the links. Finally it is shown that the distributed assignments converge to a stable and feasible set. Both mechanisms are fair and use the available resources efficiently. For distributed resource allocation mechanisms in a single hop environment, gametheoretic approaches are used. First, a policy that avoids collision in wireless networks is introduced. Based on this policy, a coordination mechanism that ensures conflict free and efficient allocation of resources is developed. The coordination mechanism considers the ratio of the overhead of the transmitted data to the useful transmitted data. The utilization functions for players (senders and receiver) are then defined. The outcome of the game under different scenarios for both cooperative and non-cooperative games are studied and the fairness and efficiency of the results are investigated. The results of the proposed algorithms are compared with existing 4G and 802.11n/ac network protocols","abstract_html":"In wireless networks employing OFDMA/TDMA, orthogonal channels and timeslots are available resources that should be distributed between users fairly and in a collision-free manner. Furthermore, the available resources should be used efficiently. In this dissertation, the resource allocation mechanisms for wireless networks are studied based on frameworks developed from Graph Theory and Game Theory. Centralized and distributed resource location algorithms based on graph theory are introduced that assign both time-slots and channels to wireless transmission links in multihop networks. For finding the possible set of users that can transmit concurrently, a new conflict graph is investigated. Furthermore, a greedy algorithm for finding the maximum independent set of the introduced conflict graph is proposed. The distributed version of the resource allocation mechanism is a greedy algorithm that finds the local maximum independent set of the links. Finally it is shown that the distributed assignments converge to a stable and feasible set. Both mechanisms are fair and use the available resources efficiently. For distributed resource allocation mechanisms in a single hop environment, gametheoretic approaches are used. First, a policy that avoids collision in wireless networks is introduced. Based on this policy, a coordination mechanism that ensures conflict free and efficient allocation of resources is developed. The coordination mechanism considers the ratio of the overhead of the transmitted data to the useful transmitted data. The utilization functions for players (senders and receiver) are then defined. The outcome of the game under different scenarios for both cooperative and non-cooperative games are studied and the fairness and efficiency of the results are investigated. The results of the proposed algorithms are compared with existing 4G and 802.11n/ac network protocols","abstract_has_math":false,"creators":["Ferdowsi, Vida"],"institution":"University of Missouri--Kansas City","degree_name":"Ph.D.","degree_level":"Doctoral","degree_discipline":"Telecommunications and Computer Networking (UMKC)","degree_department":null,"school":null,"contributors":[],"advisors":["Mitchell, Kenneth H. (Kenneth Harold), 1956-"],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-09-30","date_published":"2014-09-30","updated_at":"2026-07-24T05:16:20Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10355/43902","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Mitchell, Kenneth H. (Kenneth Harold), 1956-"]},{"key":"dc:creator","label":"Author","values":["Ferdowsi, Vida"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-09-30T11:19:56Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-09-30T11:19:56Z"]},{"key":"dc:date.issued","label":"Date","values":["2014-09-30"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Telecommunications and Computer Networking (UMKC)","Electrical and Computer Engineering (UMKC)"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Missouri--Kansas City"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10355/43902"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title from PDF of title page, viewed on July 16, 2015","Dissertation advisor: Kenneth Mitchell","Vita","Includes bibliographic references (pages 100-108)","Thesis (Ph.D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2014"]},{"key":"dc:description.abstract","label":"Abstract","values":["In wireless networks employing OFDMA/TDMA, orthogonal channels and timeslots are available resources that should be distributed between users fairly and in a collision-free manner. Furthermore, the available resources should be used efficiently. In this dissertation, the resource allocation mechanisms for wireless networks are studied based on frameworks developed from Graph Theory and Game Theory. Centralized and distributed resource location algorithms based on graph theory are introduced that assign both time-slots and channels to wireless transmission links in multihop networks. For finding the possible set of users that can transmit concurrently, a new conflict graph is investigated. Furthermore, a greedy algorithm for finding the maximum independent set of the introduced conflict graph is proposed. The distributed version of the resource allocation mechanism is a greedy algorithm that finds the local maximum independent set of the links. Finally it is shown that the distributed assignments converge to a stable and feasible set. Both mechanisms are fair and use the available resources efficiently. For distributed resource allocation mechanisms in a single hop environment, gametheoretic approaches are used. First, a policy that avoids collision in wireless networks is introduced. Based on this policy, a coordination mechanism that ensures conflict free and efficient allocation of resources is developed. The coordination mechanism considers the ratio of the overhead of the transmitted data to the useful transmitted data. The utilization functions for players (senders and receiver) are then defined. The outcome of the game under different scenarios for both cooperative and non-cooperative games are studied and the fairness and efficiency of the results are investigated. The results of the proposed algorithms are compared with existing 4G and 802.11n/ac network protocols"]},{"key":"dc:title","label":"Title","values":["MAC layer resource allocation algorithms for OFDM/TDMA wireless networks"]}]}],"canonical_facts":{"dc:contributor.advisor":["Mitchell, Kenneth H. (Kenneth Harold), 1956-"],"dc:creator":["Ferdowsi, Vida"],"dc:date.accessioned":["2014-09-30T11:19:56Z"],"dc:date.available":["2014-09-30T11:19:56Z"],"dc:date.issued":["2014-09-30"],"dc:description":["Title from PDF of title page, viewed on July 16, 2015","Dissertation advisor: Kenneth Mitchell","Vita","Includes bibliographic references (pages 100-108)","Thesis (Ph.D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2014"],"dc:description.abstract":["In wireless networks employing OFDMA/TDMA, orthogonal channels and timeslots are available resources that should be distributed between users fairly and in a collision-free manner. Furthermore, the available resources should be used efficiently. In this dissertation, the resource allocation mechanisms for wireless networks are studied based on frameworks developed from Graph Theory and Game Theory. Centralized and distributed resource location algorithms based on graph theory are introduced that assign both time-slots and channels to wireless transmission links in multihop networks. For finding the possible set of users that can transmit concurrently, a new conflict graph is investigated. Furthermore, a greedy algorithm for finding the maximum independent set of the introduced conflict graph is proposed. The distributed version of the resource allocation mechanism is a greedy algorithm that finds the local maximum independent set of the links. Finally it is shown that the distributed assignments converge to a stable and feasible set. Both mechanisms are fair and use the available resources efficiently. For distributed resource allocation mechanisms in a single hop environment, gametheoretic approaches are used. First, a policy that avoids collision in wireless networks is introduced. Based on this policy, a coordination mechanism that ensures conflict free and efficient allocation of resources is developed. The coordination mechanism considers the ratio of the overhead of the transmitted data to the useful transmitted data. The utilization functions for players (senders and receiver) are then defined. The outcome of the game under different scenarios for both cooperative and non-cooperative games are studied and the fairness and efficiency of the results are investigated. The results of the proposed algorithms are compared with existing 4G and 802.11n/ac network protocols"],"dc:identifier.uri":["https://hdl.handle.net/10355/43902"],"dc:title":["MAC layer resource allocation algorithms for OFDM/TDMA wireless networks"],"dc:type":["Thesis"],"thesis:degree_discipline":["Telecommunications and Computer Networking (UMKC)","Electrical and Computer Engineering (UMKC)"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Missouri--Kansas City"]},"updated_at":"2026-07-24T05:16:20Z"}