Internet connection method for mobile ad hoc wireless networks

In recent years, wireless networks with Internet services have become more and more popular. Technologies which integrate Internet and wireless networks have extended traditional Internet applications into a more flexible and dynamic environment. This research work investigates the technology that supports the connection between a Mobile Ad Hoc Wireless Network (MANET) and the Internet, which enables the current wireless Internet technologies to provide a ubiquitous wireless life style. With detailed analysis of the existing wireless Internet technologies and MANETs regarding their features and applications, the demand and lack of research work for an application to provide Internet connection to MANET is indicated. The primary difficulty for MANET and Internet connection is that the dynamic features of MANET do not suit the traditional connection methods used in infrastructure wireless networks. This thesis introduces new concept of the 'Gateway Awareness' (GAW) to the wireless devices in the MANET. GAW is a new routing protocol designed by the author of this thesis, at the University of Warwick. Based on GAW, an inclusive definition for the connection method, which supports the Internet connection and keeps the independency of routing in MANET, is addressed. Unlike other research work, this method supports the MANET and Internet communication in both directions. Furthermore, it explores possible ways of using the Internet as an extension for wireless communications. The GAW routing method is developed from destination sequenced distance vector (DSDV) routing protocol. However, it defines a layer of wireless nodes (known as GAWNs) with exclusive functions for the Internet connection task. The layer of GAWNs brings a new set of route update and route selection method. Simulations show that the GAW routing method provides quality Internet connection performance in different scenarios compared with other methods. In particular, the connection is completed with minimum effect on the independent MANET while the routing efficiency and accuracy is guaranteed

A study of TCP performance in wired-cum-ad hoc environments

Master'sMASTER OF ENGINEERIN

Design and optimization of QoS-based medium access control protocols for next-generation wireless LANs

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In recent years, there have been tremendous advances in wireless & mobile communications, including wireless radio techniques, networking protocols, and mobile devices. It is expected that different broadband wireless access technologies, e.g., WiFi (IEEE 802.11) and WiMAX (IEEE 802.16) will coexist in the future. In the meantime, multimedia applications have experienced an explosive growth with increasing user demands. Nowadays, people expect to receive high-speed video, audio, voice and web services even when being mobile. The key question that needs to be answered, then, is how do we ensure that users always have the "best" network performance with the "lowest" costs in such complicated situations? The latest IEEE 802.11n standards attains rates of more than 100 Mbps by introducing innovative enhancements at the PHY and MAC layer, e.g. MIMO and Frame Aggregation, respectively. However, in this thesis we demonstrate that frame aggregation's performance adheres due to the EDCA scheduler's priority mechanism and consequently resulting in the network's poor overall performance. Short waiting times for high priority flows into the aggregation queue resolves to poor channel utilization. A Delayed Channel Access algorithm was designed to intentionally postpone the channel access procedure so that the number of packets in a formed frame can be increased and so will the network's overall performance. However, in some cases, the DCA algorithm has a negative impact on the applications that utilize the TCP protocol, especially the when small TCP window sizes are engaged. So, the TCP process starts to refrain from sending data due to delayed acknowledgements and the overall throughput drops. In this thesis, we address the above issues by firstly demonstrating the potential performance benefits of frame aggregation over the next generation wireless networks. The efficiency and behaviour of frame aggregation within a single queue, are mathematically analysed with the aid of a M=G[a;b]=1=K model. Results show that a trade-off choice has to be taken into account over minimizing the waiting time or maximizing utilization. We also point out that there isn't an optimum batch collection rule which can be assumed as generally valid but individual cases have to be considered separately. Secondly, we demonstrate through extensive simulations that by introducing a method, the DCA algorithm, which dynamically determines and adapts batch collections based upon the traffic's characteristics, QoS requirements and server's maximum capacity, also improves e ciency. Thirdly, it is important to understand the behaviour of the TCP ows over the WLAN and the influence that DCA has over the degrading performance of the TCP protocol. We investigate the cause of the problem and provide the foundations of designing and implementing possible solutions. Fourthly, we introduce two innovative proposals, one amendment and one extension to the original DCA algorithm, called Adaptive DCA and Selective DCA, respectively. Both solutions have been implemented in OPNET and extensive simulation runs over a wide set of scenarios show their effectiveness over the network's overall performance, each in its own way.This study was supported by the Engineering and Physical Sciences Research Council (EPSRC)

On the performance of probabilistic flooding in wireless mobile ad hoc networks

Broadcasting in MANET’s has traditionally been based on flooding, but this can induce broadcast storms that severely degrade network performance due to redundant retransmission, collision and contention. Probabilistic flooding, where a node rebroadcasts a newly arrived one-to-all packet with some probability, p, was an early suggestion to reduce the broadcast storm problem. The first part of this thesis investigates the effects on the performance of probabilistic flooding of a number of important MANET parameters, including node speed, traffic load and node density. It transpires that these parameters have a critical impact both on reachability and on the number of so-called “saved rebroadcast packets” achieved. For instance, across a range of rebroadcast probability values, as network density increases from 25 to 100 nodes, reachability achieved by probabilistic flooding increases from 85% to 100%. Moreover, as node speed increases from 2 to 20 m/sec, reachability increases from 90% to 100%. The second part of this thesis proposes two new probabilistic algorithms that dynamically adjust the rebroadcasting probability contingent on node distribution using only one-hop neighbourhood information, without requiring any assistance of distance measurements or location-determination devices. The performance of the new algorithm is assessed and compared to blind flooding as well as the fixed probabilistic approach. It is demonstrated that the new algorithms have superior performance characteristics in terms of both reachability and saved rebroadcasts. For instance, the suggested algorithms can improve saved rebroadcasts by up to 70% and 47% compared to blind and fixed probabilistic flooding, respectively, even under conditions of high node mobility and high network density without degrading reachability. The final part of the thesis assesses the impact of probabilistic flooding on the performance of routing protocols in MANETs. Our performance results indicate that using our new probabilistic flooding algorithms during route discovery enables AODV to achieve a higher delivery ratio of data packets while keeping a lower routing overhead compared to using blind and fixed probabilistic flooding. For instance, the packet delivery ratio using our algorithm is improved by up to 19% and 12% compared to using blind and fixed probabilistic flooding, respectively. This performance advantage is achieved with a routing overhead that is lower by up to 28% and 19% than in fixed probabilistic and blind flooding, respectively

Revitalizing Multilateral Governance at the World Trade Organization Report of the High-Level Board of Experts on the Future of Global Trade Governance. Bertelsmann Policy Brief 2018

If international trade is not governed by rules, mere might dictates what is right. The World Trade Organization (WTO) serves as a place where trade policy issues are addressed, disputes arbitrated, legal frameworks derived and enforced. Through these functions, the WTO ensures that the rules of trade policy are inspired by fairness and reciprocity rather than national interest. It is more important than ever to vitalize the global public good that it rep-resents against various threats that have been undermining it. Therefore, the Global Economic Dynamics project of the Bertelsmann Stiftung has called into life a High-Level Board of Experts on the Future of Global Trade Governance. Composed of eminent experts and seasoned trade diplomats, it elaborated a series of feasible policy recommendations that will increase the effectiveness and sali-ence of the WTO. We hope that this Report provides helpful suggestions in a time marked by increasing trade disputes and protectionism and instead contributes to stronger multilateral institutions and fora.1 The Bertelsmann Stiftung owes a debt of gratitude to Prof Bernard Hoekman, the Chairman of the Expert Board and author of this report. His invaluable expertise and experience, guidance and ability to bridge controversial opinions have been crucial in defining the work of the Board. We would also like to express our sincere thanks to all our Board Members, who generously contributed their expertise, time and networks. Without their dedication, this Report would not have been possible. Finally, we would like to thank Robert Koopman and Aik Hoe Lim of the WTO for their support throughout the whole process and Christian Bluth of Bertelsmann Stiftung for managing this common endeavour

End-to-End Resilience Mechanisms for Network Transport Protocols

The universal reliance on and hence the need for resilience in network communications has been well established. Current transport protocols are designed to provide fixed mechanisms for error remediation (if any), using techniques such as ARQ, and offer little or no adaptability to underlying network conditions, or to different sets of application requirements. The ubiquitous TCP transport protocol makes too many assumptions about underlying layers to provide resilient end-to-end service in all network scenarios, especially those which include significant heterogeneity. Additionally the properties of reliability, performability, availability, dependability, and survivability are not explicitly addressed in the design, so there is no support for resilience. This dissertation presents considerations which must be taken in designing new resilience mechanisms for future transport protocols to meet service requirements in the face of various attacks and challenges. The primary mechanisms addressed include diverse end-to-end paths, and multi-mode operation for changing network conditions

Internet connection method for mobile ad hoc wireless networks

In recent years, wireless networks with Internet services have become more and more popular. Technologies which integrate Internet and wireless networks have extended traditional Internet applications into a more flexible and dynamic environment. This research work investigates the technology that supports the connection between a Mobile Ad Hoc Wireless Network (MANET) and the Internet, which enables the current wireless Internet technologies to provide a ubiquitous wireless life style. With detailed analysis of the existing wireless Internet technologies and MANETs regarding their features and applications, the demand and lack of research work for an application to provide Internet connection to MANET is indicated. The primary difficulty for MANET and Internet connection is that the dynamic features of MANET do not suit the traditional connection methods used in infrastructure wireless networks. This thesis introduces new concept of the 'Gateway Awareness' (GAW) to the wireless devices in the MANET. GAW is a new routing protocol designed by the author of this thesis, at the University of Warwick. Based on GAW, an inclusive definition for the connection method, which supports the Internet connection and keeps the independency of routing in MANET, is addressed. Unlike other research work, this method supports the MANET and Internet communication in both directions. Furthermore, it explores possible ways of using the Internet as an extension for wireless communications. The GAW routing method is developed from destination sequenced distance vector (DSDV) routing protocol. However, it defines a layer of wireless nodes (known as GAWNs) with exclusive functions for the Internet connection task. The layer of GAWNs brings a new set of route update and route selection method. Simulations show that the GAW routing method provides quality Internet connection performance in different scenarios compared with other methods. In particular, the connection is completed with minimum effect on the independent MANET while the routing efficiency and accuracy is guaranteed.EThOS - Electronic Theses Online ServiceUniversities UKUniversity of WarwickGBUnited Kingdo

Adaptive protocols for mobile ad hoc networks

Recent advances in low-power technologies have resulted in the proliferation of inexpensive handheld mobile computing devices. Soon, just like the Internet empow- ered a whole new world of applications for personal computers, the development and deployment of robust ubiquitous wireless networks will enable many new and exciting futuristic applications. Certain to be an important part of this future is a class of networks known as "mobile ad hoc networks." Mobile ad hoc networks (or simply "ad hoc networks") are local-area networks formed "on the spot" between collocated wireless devices. These devices self-organize by sharing information with their neigh- bors to establish communication pathways whenever and wherever they are. For ad hoc networks to succeed, however, new protocols must be developed that are capable of adapting to their dynamic nature. In this dissertation, we present a number of adaptive protocols that are designed for this purpose. We investigate new link layer mechanisms that dynamically monitor and adapt to changes in link quality, including a protocol that uses common control messages to form a tight feedback control loop for adaptation of the link data rate to best match the channel conditions perceived by the receiver. We also investigate routing protocols that adapt route selection according to network characteristics. In particular, we present two on-demand routing protocols that are designed to take advantage of the presence of multirate links. We then investigate the performance of TCP, showing how communication outages caused by link failures and routing delays can be very detrimental to its performance. In response, we present a solution to this problem that uses explicit feedback messages from the link layer about link failures to adapt TCP's behavior. Finally, we show how link failures in heterogeneous networks containing links with widely varying bandwidth and delay can cause repeated "modal" changes in capacity that TCP is slow to detect. We then present a modifed version of TCP that is capable of more rapidly detecting and adapting to these changes