With the progress of wireless radio technology and telecommunication, various wireless specifications and protocols form the unhandy heterogeneous network. The routing problems in heterogeneous network become popular researches nowadays. In this thesis, we integrate cellular (3G) network and Mobile Ad-Hoc Network (MANET) into a hybrid network. This hybrid network is called heterogeneous wireless network(HWN) with multi-cells architecture to overcome the weakness of cellular network and Ad-Hoc network. Based on HWN, we propose a routing algorithm with quality of service (QoS) supported for requirements in the original homogeneous cellular network and Ad-Hoc network. Simulation results show that HWN with the proposed algorithm has lower request block rate and shorter transmission time.

Energy is a critical resource in the design of wireless networks since wireless devices are usually powered by batteries. Battery capacity is finite and the progress of battery technology is very slow, with capacity expected to make little improvement in the near future. Under these conditions, many techniques for conserving power have been proposed to increase battery life. In this dissertation we consider two approaches to conserving the energy consumed by a wireless network interface. One technique is to use power saving mode, which allows a node to power off its wireless network interface (or enter a doze state) to reduce energy consumption. The other is to use a technique that suitably varies transmission power to reduce energy consumption. These two techniques are closely related to theMAC (Medium Access Control) layer. With respect to power saving mode, we study IEEE 802.11 PSM (Power Saving Mechanism) and propose a scheme that improves its energy efficiency. We also investigate the interaction between power saving mode and TCP (Transport Control Protocol). As a second approach to conserving energy, we investigate a simple power control protocol, called BASIC, which uses the maximum transmission power for RTS-CTS and the minimum necessary power for DATA-ACK. We identify the deficiency of BASIC, which increases collisions and degrades network throughput, and propose a power control protocol that addresses these problems and achieves energy savings. Since energy conservation is not an issue limited to one layer of the protocol stack, we study a cross layer design that combines power control at the MAC layer and power aware routing at the network layer. One poweraware routing metric is minimizing the aggregate transmission power on a path from source to destination. This metric has been used along with BASIC-like power control under the assumption that it can save energy, which we show to be false. Also, we show that the power aware routing metric leads to a lower throughput. We show that using the shortest number of hops in conjunction with BASIC-like power control conserves more energy than power aware routing with BASIC-like power control.

With increased popularity and pervasiveness, mobile networking had become a definite trend for future networks. Users strongly demand the retaining of the connectivity and the QoS (Quality of Service) of ongoing services while roaming across different points of attachment. Efficient handover schemes and service paradigms are essential to the above vision. We will contribute to the QoS provisioning in mobile wireless networks from two complementary perspectives: one is the improved handover schemes at the client end for shorter latency and less packet loss, and the other is the service migration at server end for improved QoS. There are time-consuming procedures involved in the handover process. Various research works had devoted to the acceleration of movement detection and registration. However, a time-consuming operation, duplicate address detection, was overlooked by most studies. A novel scheme featuring anycast / multicast technique is developed and presented in this dissertation. The proposed approach switches to anycast / multicast addressing during handover and switches back to normal unicast addressing after all required operations are completed. By switching to anycast / multicast addressing, a mobile node can continue the reception of packets from its corresponding node before its new care-of address is actually validated. As a result, transmission disruption can be effectively minimized. In addition, simple but effective buffer control schemes are designed to reduce possible packet loss and to prevent the out-of-order problem. Analytical study reveals that improved performance can be guaranteed, as reflected in the simulation results. The establishment of mobility-supported Internet protocols, such as IPv4 and IPv6, had made it possible that an ongoing service can be retained while a mobile node is roaming across different access domains. However, limited efforts had been paid to server sides if we consider the topological change due to node mobility. In the global network environment, the weighted network distance between a client and its server could change dramatically for reasons of topology change or node mobility. A new network service framework highlighting the concept of service migration is presented in this dissertation. The proposed framework take into account essential service quality factors, such as server loading, bandwidth, delay, and so on, and then dynamically migrates an ongoing service from a distant server to a new server with shorter ¡§weighted network distance¡¨ to the client. As a result, the individual service connection, as well as the global network environment, will benefit from the service migration, in terms of improved service quality and bandwidth utilization. This dissertation explains the general architecture of the proposed framework and focuses on the technical details of the core component - service migration module. Our experiences on the functional prototypes for service migration are also reported. The success of the prototyping system is an indication of the feasibility and effectiveness of the proposed scheme.

The research work presents an enhanced cross-layer routing solution for Wireless Mesh Networks (WMN) based on Received Signal Strength. WMN is an emerging technology with varied applications due to inherent advantages ranging from self-organisation to auto-con guration. Routing in WMN is fundamen- tally achieved by hop counts which have been proven to be de cient in terms of network performance. The realistic need to enhance the link quality metric to improve network performance has been a growing concern in recent times. The cross-Layer routing approach is one of the identi ed methods of improving routing process in Wireless technology. This work presents an RSSI-aware routing metric implemented on Optimized Link-State Routing (OLSR) for WMN. The embedded Received Signal Strength Information (RSSI) from the mesh nodes on the network is extracted, processed, transformed and incorporated into the routing process. This is to estimate efficiently the link quality for network path selections to improved network performance. The measured RSSI data is filtered by an Exponentially Weighted Moving Average (EWMA) filter. This novel routing metric method is called RSSI-aware ETT (rETT). The performance of rETT is then optimised and the results compared with the fundamental hop count metric and the link quality metric by Expected Transmission Counts (ETX). The results reveal some characteristics of RSSI samples and link conditions through the analysis of the statistical data. The divergence or variability of the samples is a function of interference and multi-path e effect on the link. The implementation results show that the routing metric with rETT is more intelligent at choosing better network paths for the packets than hop count and ETX estimations. rETT improvement on network throughput is more than double (120%) compared to hop counts and 21% improvement compared to ETX. Also, an improvement of 33% was achieved in network delay compared to hop counts and 28% better than ETX. This work brings another perspective into link-quality metric solutions for WMN by using RSSI to drive the metric of the wireless routing protocol. It was carried out on test-beds and the results obtained are more realistic and practical. The proposed metric has shown improvement in performance over the classical hop counts metric and ETX link quality metric.

The research reported in this thesis investigates the performance of the transport layer Stream Control Transfer Protocol (SCTP) for streaming video over CDMA2000 cellphone and data wireless networks. The main measure of performance was quality of the received video at a given buffer size, as cellphones have memory of limited capacity. The hypothesis was that SCTP would be able to improve the quality of streamed video over UDP under the same memory requirements. Our study involved two series of simulation experiments and measurements in a testbed on the Telecom NZ CDMA2000 network, to test the performance of video streaming under SCTP and under UDP. It was found that SCTP did not improve the quality in streamed video with up to 5 second buffers. While other scenarios that have been tested by other people with high packet loss or congestion have shown that SCTP can improve the quality, the CDMA2000 network does not suffer from the impairments that SCTP could neutralise, and because of that, in this scenario, the quality of video streaming under SCTP and UDP are similar. The complexity that SCTP adds does not correspond to an increase in quality.

The ever-increasing demand on content distribution and media streaming over the Internet has created the need for efficient methods of delivering information. One of the most promising approaches is based on multicasting. However, multicast solutions have to cope with several constraints as well as being able to perform in different environments such as wired, wireless, and ad hoc environments. Additionally, the scale and size of the Internet introduces another dimension of difficulty. Providing scalable multicast for mobile hosts in wireless environment and in mobile ad hoc networks (MANETs) is a challenging problem. In the past few years, several protocols have been proposed to efficient multicast solutions over the Internet, but these protocols did not give efficient solution for the scalability issue. In this thesis, scalable multicast protocols for wired, wireless and wireless ad hoc networks are proposed and evaluated. These protocols share the idea of building up a multicast tree gradually and recursively as join/leave of the multicast group members using a dynamic branching node-based tree (DBT) concept. The DBT uses a pair of branching node messages (BNMs). These messages traverse between a set of dynamically assigned branching node routers (BNRs) to build the multicast tree. In the proposed protocols only the branching node routers (BNRs) carry the state information about their next BNRs rather than the multicast group members, which gives a fixed size of control packet header size as the multicast group size increases, i.e. a good solution to the problem of scalability. Also the process of join/leave of multicast group members is carried out locally which gives low join/leave latency. The proposed protocols include: Scalable Recursive Multicast protocol (SReM) which is proposed using the DBT concepts mentioned above, Mobile Scalable Recursive Multicast protocol (MoSReM) which is an extension for SReM by taking into consideration the mobility feature in the end hosts and performing an efficient roaming process, and finally, a Scalable Ad hoc Recursive Multicast protocol (SARM) to achieve the mobility feature for all nodes and performing an efficient solution for link recovery because of node movement. By cost analysis and an extensive simulation, the proposed protocols show many positive features like fixed size control messages, being scalable, low end to end delay, high packet rate delivery and low normalized routing overhead. The thesis concludes by discussing the contributions of the proposed protocols on scalable multicast in the Internet society.

Multipath TCP (MPTCP) is a new modification of TCP protocol which enables a client to transfer data over multiple paths simultaneously under a single TCP connection, for improved throughput and fault resilience. However, MPTCP is susceptible to some major drawbacks when applied in a wireless network. We found several cases where, despite improving individual MPTCP clients throughput, MPTCP reduces the capacity of the overall wireless network due to the mac level fairness and contention-based access schemes. Additionally, even if the bandwidth improves, employing Multipath TCP (MPTCP) in wireless networks can be energy inecient due to additional energy consumption by multiple interfaces. This creates a dilemma between bandwidth improvement and energy efficiency. This thesis research aims to solve these important issues for MPTCP in the wireless environment. We analyzed the root cause of these drawbacks and identified instances where they can arise. Two novel schemes denoted MPWiFi and kMPTCP, are developed to solve the bandwidth degradation and energy efficiency issues respectively, while maintaining the promised benefitts of MPTCP. The MPWiFi assigns dierent priorities to the subflows and aggressively suppresses some of them based on some design logic. Similarly, kMPTCP adds an additional multipath subflow only if the bandwidth requirement can't be fulllled by single path and the new subflow meets the data rate and signal strength condition. Moreover, kMPTCP keeps additional subflows as long as the signal strength remains in good range and this subflow remain mandatory to provide the necessary bandwidth to the application. These two schemes have been implemented along with Linux Kernel MPTCP implementation. Extensive real-world deployment and NS3 simulation show that the proposed schemes can eectively alleviate the adverse impacts of the MPTCP based multipath access in Wireless networks.

abstract: A Fiber-Wireless (FiWi) network integrates a passive optical network (PON) with wireless mesh networks (WMNs) to provide high speed backhaul via the PON while offering the flexibility and mobility of a WMN. Generally, increasing the size of a WMN leads to higher wireless interference and longer packet delays. The partitioning of a large WMN into several smaller WMN clusters, whereby each cluster is served by an Optical Network Unit (ONU) of the PON, is examined. Existing WMN throughput-delay analysis techniques considering the mean load of the nodes at a given hop distance from a gateway (ONU) are unsuitable for the heterogeneous nodal traffic loads arising from clustering. A simple analytical queuing model that considers the individual node loads to accurately characterize the throughput-delay performance of a clustered FiWi network is introduced. The accuracy of the model is verified through extensive simulations. It is found that with sufficient PON bandwidth, clustering substantially improves the FiWi network throughput-delay performance by employing the model to examine the impact of the number of clusters on the network throughput-delay performance. Different traffic models and network designs are also studied to improve the FiWi network performance. / Dissertation/Thesis / Doctoral Dissertation Electrical Engineering 2015

The diploma thesis is focused on exploring the possibility of VoIP service in a wireless network of University of Economics, Prague. This thesis describes the basic principles of VoIP and related wireless technologies necessary for its quality and stable operation. Subsequently, different configurations of wireless network and end clients are tested and compared, including its impact on ordinary users, in a laboratory environment with idle and fully utilized frequency band. Finally, a roaming operation with the use of several advanced 802.11 standards is tested in the real environment of the Old building in Žižkov. In conclusion, the ideal settings for all telecommunication devices are recommended in order to maximize the quality of VoIP operation and to minimize the negative impact on ordinary users.

abstract: This dissertation studies the scheduling in two stochastic networks, a co-located wireless network and an outpatient healthcare network, both of which have a cyclic planning horizon and a deadline-related performance metric. For the co-located wireless network, a time-slotted system is considered. A cycle of planning horizon is called a frame, which consists of a fixed number of time slots. The size of the frame is determined by the upper-layer applications. Packets with deadlines arrive at the beginning of each frame and will be discarded if missing their deadlines, which are in the same frame. Each link of the network is associated with a quality of service constraint and an average transmit power constraint. For this system, a MaxWeight-type problem for which the solutions achieve the throughput optimality is formulated. Since the computational complexity of solving the MaxWeight-type problem with exhaustive search is exponential even for a single-link system, a greedy algorithm with complexity O(nlog(n)) is proposed, which is also throughput optimal. The outpatient healthcare network is modeled as a discrete-time queueing network, in which patients receive diagnosis and treatment planning that involves collaboration between multiple service stations. For each patient, only the root (first) appointment can be scheduled as the following appointments evolve stochastically. The cyclic planing horizon is a week. The root appointment is optimized to maximize the proportion of patients that can complete their care by a class-dependent deadline. In the optimization algorithm, the sojourn time of patients in the healthcare network is approximated with a doubly-stochastic phase-type distribution. To address the computational intractability, a mean-field model with convergence guarantees is proposed. A linear programming-based policy improvement framework is developed, which can approximately solve the original large-scale stochastic optimization in queueing networks of realistic sizes. / Dissertation/Thesis / Doctoral Dissertation Electrical Engineering 2020