{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/39100"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/39100","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"Group scheduling for public safety communications in cellular networks","abstract":"In today's world, use of wireless devices is on the rise. Hence, proper utilization of the available spectrum is very much needed. QOS requirements such as throughput and fairness are the key requirements of cellular networks. They provide a rich set of applications and social networking capabilities. But most of these features are not available to public safety organizations. These organizations need protected performance and reliability, which are currently only obtained using dedicated systems. This project gives a brief summary of the regulatory issues involved in this. It also addresses additional requirements of a network that, irrespective of the varying channel conditions and location, particular groups need to be provided assured or prioritized access. In this project, users in a cellular network are divided into a number of groups (public safety groups like police, fire and health). A new scheme, Priorities Beyond Fairness, is developed where groups in an emergency condition are given more bandwidth regardless of other groups' requirements. Group Scheduling is implemented in this project to achieve protected performance for different groups. Then schemes are developed to schedule between groups to achieve a tradeoff between throughput and fairness. Different scheduling schemes like Maximum Carrier to Interference ratio, Round Robin and Proportional Fairness are used between the groups and also within the groups. This mechanism is used to choose the best available group and user. This project proposes a new priority boosting technique called Protected Virtual Partitioning. This is used to give protected and guaranteed minimum performance to all the groups. In this, timeslots are allocated based on minimum required throughput and timeslots for each group. Several metrics are formulated for this. This scheme is both opportunistic and fair. It is opportunistic because at least some of the groups are provided with satisfied requirements and fair, where all groups are at their best even if not meeting their requirements. Results have been simulated to show the performance of each metric. Allocation of timeslots for each group in emergency conditions is also shown. This proves the scheme to be highly reliable and sensible.","abstract_html":"In today's world, use of wireless devices is on the rise. Hence, proper utilization of the available spectrum is very much needed. QOS requirements such as throughput and fairness are the key requirements of cellular networks. They provide a rich set of applications and social networking capabilities. But most of these features are not available to public safety organizations. These organizations need protected performance and reliability, which are currently only obtained using dedicated systems. This project gives a brief summary of the regulatory issues involved in this. It also addresses additional requirements of a network that, irrespective of the varying channel conditions and location, particular groups need to be provided assured or prioritized access. In this project, users in a cellular network are divided into a number of groups (public safety groups like police, fire and health). A new scheme, Priorities Beyond Fairness, is developed where groups in an emergency condition are given more bandwidth regardless of other groups' requirements. Group Scheduling is implemented in this project to achieve protected performance for different groups. Then schemes are developed to schedule between groups to achieve a tradeoff between throughput and fairness. Different scheduling schemes like Maximum Carrier to Interference ratio, Round Robin and Proportional Fairness are used between the groups and also within the groups. This mechanism is used to choose the best available group and user. This project proposes a new priority boosting technique called Protected Virtual Partitioning. This is used to give protected and guaranteed minimum performance to all the groups. In this, timeslots are allocated based on minimum required throughput and timeslots for each group. Several metrics are formulated for this. This scheme is both opportunistic and fair. It is opportunistic because at least some of the groups are provided with satisfied requirements and fair, where all groups are at their best even if not meeting their requirements. Results have been simulated to show the performance of each metric. Allocation of timeslots for each group in emergency conditions is also shown. This proves the scheme to be highly reliable and sensible.","abstract_has_math":false,"creators":["Gudibandi, Siva Naga Sindhu"],"institution":"University of Missouri--Kansas City","degree_name":"M.S.","degree_level":"Masters","degree_discipline":"Electrical Engineering (UMKC)","degree_department":null,"school":null,"contributors":[],"advisors":["Beard, Cory"],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013","date_published":"2013","updated_at":"2026-07-24T05:19:40Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10355/39100","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Beard, Cory"]},{"key":"dc:creator","label":"Author","values":["Gudibandi, Siva Naga Sindhu"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-10-21T21:27:56Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-10-21T21:27:56Z"]},{"key":"dc:date.issued","label":"Date","values":["2013"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering (UMKC)"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"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":["http://hdl.handle.net/10355/39100"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title from PDF of title page, viewed on October 22, 2013","Thesis advisor: Cory Beard","Vita","Includes bibliographic references (pages 45-46)","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2013"]},{"key":"dc:description.abstract","label":"Abstract","values":["In today's world, use of wireless devices is on the rise. Hence, proper utilization of the available spectrum is very much needed. QOS requirements such as throughput and fairness are the key requirements of cellular networks. They provide a rich set of applications and social networking capabilities. But most of these features are not available to public safety organizations. These organizations need protected performance and reliability, which are currently only obtained using dedicated systems. This project gives a brief summary of the regulatory issues involved in this. It also addresses additional requirements of a network that, irrespective of the varying channel conditions and location, particular groups need to be provided assured or prioritized access. In this project, users in a cellular network are divided into a number of groups (public safety groups like police, fire and health). A new scheme, Priorities Beyond Fairness, is developed where groups in an emergency condition are given more bandwidth regardless of other groups' requirements. Group Scheduling is implemented in this project to achieve protected performance for different groups. Then schemes are developed to schedule between groups to achieve a tradeoff between throughput and fairness. Different scheduling schemes like Maximum Carrier to Interference ratio, Round Robin and Proportional Fairness are used between the groups and also within the groups. This mechanism is used to choose the best available group and user. This project proposes a new priority boosting technique called Protected Virtual Partitioning. This is used to give protected and guaranteed minimum performance to all the groups. In this, timeslots are allocated based on minimum required throughput and timeslots for each group. Several metrics are formulated for this. This scheme is both opportunistic and fair. It is opportunistic because at least some of the groups are provided with satisfied requirements and fair, where all groups are at their best even if not meeting their requirements. Results have been simulated to show the performance of each metric. Allocation of timeslots for each group in emergency conditions is also shown. This proves the scheme to be highly reliable and sensible."]},{"key":"dc:title","label":"Title","values":["Group scheduling for public safety communications in cellular networks"]}]}],"canonical_facts":{"dc:contributor.advisor":["Beard, Cory"],"dc:creator":["Gudibandi, Siva Naga Sindhu"],"dc:date.accessioned":["2013-10-21T21:27:56Z"],"dc:date.available":["2013-10-21T21:27:56Z"],"dc:date.issued":["2013"],"dc:description":["Title from PDF of title page, viewed on October 22, 2013","Thesis advisor: Cory Beard","Vita","Includes bibliographic references (pages 45-46)","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2013"],"dc:description.abstract":["In today's world, use of wireless devices is on the rise. Hence, proper utilization of the available spectrum is very much needed. QOS requirements such as throughput and fairness are the key requirements of cellular networks. They provide a rich set of applications and social networking capabilities. But most of these features are not available to public safety organizations. These organizations need protected performance and reliability, which are currently only obtained using dedicated systems. This project gives a brief summary of the regulatory issues involved in this. It also addresses additional requirements of a network that, irrespective of the varying channel conditions and location, particular groups need to be provided assured or prioritized access. In this project, users in a cellular network are divided into a number of groups (public safety groups like police, fire and health). A new scheme, Priorities Beyond Fairness, is developed where groups in an emergency condition are given more bandwidth regardless of other groups' requirements. Group Scheduling is implemented in this project to achieve protected performance for different groups. Then schemes are developed to schedule between groups to achieve a tradeoff between throughput and fairness. Different scheduling schemes like Maximum Carrier to Interference ratio, Round Robin and Proportional Fairness are used between the groups and also within the groups. This mechanism is used to choose the best available group and user. This project proposes a new priority boosting technique called Protected Virtual Partitioning. This is used to give protected and guaranteed minimum performance to all the groups. In this, timeslots are allocated based on minimum required throughput and timeslots for each group. Several metrics are formulated for this. This scheme is both opportunistic and fair. It is opportunistic because at least some of the groups are provided with satisfied requirements and fair, where all groups are at their best even if not meeting their requirements. Results have been simulated to show the performance of each metric. Allocation of timeslots for each group in emergency conditions is also shown. This proves the scheme to be highly reliable and sensible."],"dc:identifier.uri":["http://hdl.handle.net/10355/39100"],"dc:title":["Group scheduling for public safety communications in cellular networks"],"dc:type":["Thesis"],"thesis:degree_discipline":["Electrical Engineering (UMKC)"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Missouri--Kansas City"]},"updated_at":"2026-07-24T05:19:40Z"}