Wireless networks consist of a number of nodes which communicate with each other over a wireless channel. Some wireless networks have a wired backbone with only the last hop being wireless, like cellular voice and data networks and mobile IP. In others, all links are wireless. One example of such networks is multihop radio networks or ad hoc networks. Such networks consist of a group of nodes which communicate with each other over a wireless channel without any centralized control. This ability of ad hoc networks to form “networks on the fly” is expected to play a crucial role in situations such as disaster recovery efforts after an earthquake or fire, gathering information in a battlefield or simply forming a short-lived network among people attending a business meeting. Before this century, the importance or the reason that people have great concern in these ad hoc networks was that they don’t need any infrastructure. However, these ad hoc networks are refocused in this century because of the superior capacity. The multihopping increases the network capacity significantly in comparison with that in the case of traditional siglehopping. A major reason for adopting such multihop is in capacity enhancement, which may completely pay off its increased complexity.
In this thesis, we will propose some scheduling algorithms extending the results of traditional singlehop cellular networks to multihop cellular networks which is compromised type of the traditional cellular network and ad hoc network. We are to show the capacity gain of multihop networks by proposing algorithms which produce schedules overwhelming the optimal one of singlehop networks. The purpose of this work is to investigate the efficient scheduling of NRT packets in the uplink of cellular networks. Unlike the other works in this field, we assume that the system allows the so-called multihop transmission. For example, the system would take advantages, in terms of total average throughput from having a...