{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/24767"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/24767","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Cross-Layer Game Theoretic Mechanism for Tactical Mobile Networks","abstract":"In recent years, Software Defined and Cognitive Radios (SDRs and CRs) have become popular topics of research. Game theory has proven to be a useful set of tools for analyzing wireless networks, including Cognitive Networks (CNs). This thesis provides a game theoretic cross-layer mechanism that can be used to control SDRs and CRs. We have constructed an upper-layer Topology Control (TC) game, which decides which links each node uses. A TDMA algorithm which we have adapted is then run on these links. The links and the TDMA schedule are then passed to a lower-layer game, the Link Adaptation Game (LAG), where nodes adjust their transmit power and their link parameters, which in this case are modulation scheme and channel coding rate. It is shown that both the TC game and the LAG converge to a Nash Equilibrium (NE). It is also shown that the solution for the TC game approximates the topology that results from maximizing the utility function when appropriate link costs are used. Also seen is the increase in throughput provided by the LAG when compared to the results of Greedy Rate Packing (GRP).","abstract_html":"In recent years, Software Defined and Cognitive Radios (SDRs and CRs) have become popular topics of research. Game theory has proven to be a useful set of tools for analyzing wireless networks, including Cognitive Networks (CNs). This thesis provides a game theoretic cross-layer mechanism that can be used to control SDRs and CRs. We have constructed an upper-layer Topology Control (TC) game, which decides which links each node uses. A TDMA algorithm which we have adapted is then run on these links. The links and the TDMA schedule are then passed to a lower-layer game, the Link Adaptation Game (LAG), where nodes adjust their transmit power and their link parameters, which in this case are modulation scheme and channel coding rate. It is shown that both the TC game and the LAG converge to a Nash Equilibrium (NE). It is also shown that the solution for the TC game approximates the topology that results from maximizing the utility function when appropriate link costs are used. Also seen is the increase in throughput provided by the LAG when compared to the results of Greedy Rate Packing (GRP).","abstract_has_math":false,"creators":["Rogers, William James"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Electrical Engineering","degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":["MacKenzie, Allen B."],"committee_members":["Silva, Luiz A.","Reed, Jeffrey H."],"year":2013,"date_issued":"2013-12-19","date_published":"2013-12-19","updated_at":"2026-07-22T22:19:54Z","subjects":["Cognitive radio networks","Game Theory","Topology Control","Link Adaptation","Cross Layer"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["vt_gsexam:1691"],"render_values":[{"text":"vt_gsexam:1691","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/24767","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["MacKenzie, Allen B."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Silva, Luiz A.","Reed, Jeffrey H."]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Rogers, William James"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-12-20T09:00:29Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-12-20T09:00:29Z"]},{"key":"dc:date.issued","label":"Date","values":["2013-12-19"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Cognitive radio networks","Game Theory","Topology Control","Link Adaptation","Cross Layer"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["vt_gsexam:1691"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/24767"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In recent years, Software Defined and Cognitive Radios (SDRs and CRs) have become popular topics of research. Game theory has proven to be a useful set of tools for analyzing wireless networks, including Cognitive Networks (CNs). This thesis provides a game theoretic cross-layer mechanism that can be used to control SDRs and CRs. We have constructed an upper-layer Topology Control (TC) game, which decides which links each node uses. A TDMA algorithm which we have adapted is then run on these links. The links and the TDMA schedule are then passed to a lower-layer game, the Link Adaptation Game (LAG), where nodes adjust their transmit power and their link parameters, which in this case are modulation scheme and channel coding rate. It is shown that both the TC game and the LAG converge to a Nash Equilibrium (NE). It is also shown that the solution for the TC game approximates the topology that results from maximizing the utility function when appropriate link costs are used. Also seen is the increase in throughput provided by the LAG when compared to the results of Greedy Rate Packing (GRP)."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["ETD"]},{"key":"dc:title","label":"Title","values":["Cross-Layer Game Theoretic Mechanism for Tactical Mobile Networks"]}]}],"canonical_facts":{"dc:contributor.committeechair":["MacKenzie, Allen B."],"dc:contributor.committeemember":["Silva, Luiz A.","Reed, Jeffrey H."],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Rogers, William James"],"dc:date.accessioned":["2013-12-20T09:00:29Z"],"dc:date.available":["2013-12-20T09:00:29Z"],"dc:date.issued":["2013-12-19"],"dc:description.abstract":["In recent years, Software Defined and Cognitive Radios (SDRs and CRs) have become popular topics of research. Game theory has proven to be a useful set of tools for analyzing wireless networks, including Cognitive Networks (CNs). This thesis provides a game theoretic cross-layer mechanism that can be used to control SDRs and CRs. We have constructed an upper-layer Topology Control (TC) game, which decides which links each node uses. A TDMA algorithm which we have adapted is then run on these links. The links and the TDMA schedule are then passed to a lower-layer game, the Link Adaptation Game (LAG), where nodes adjust their transmit power and their link parameters, which in this case are modulation scheme and channel coding rate. It is shown that both the TC game and the LAG converge to a Nash Equilibrium (NE). It is also shown that the solution for the TC game approximates the topology that results from maximizing the utility function when appropriate link costs are used. Also seen is the increase in throughput provided by the LAG when compared to the results of Greedy Rate Packing (GRP)."],"dc:description.degree":["Master of Science"],"dc:format.medium":["ETD"],"dc:identifier.other":["vt_gsexam:1691"],"dc:identifier.uri":["http://hdl.handle.net/10919/24767"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Cognitive radio networks","Game Theory","Topology Control","Link Adaptation","Cross Layer"],"dc:title":["Cross-Layer Game Theoretic Mechanism for Tactical Mobile Networks"],"dc:type":["Thesis"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:54Z"}