There are still many challenges in the field of VANETs that encouraged researchers to conduct further investigation in this field to meet these challenges. The issue pertaining to routing protocols such as delivering the warning messages to the vehicles facing Non-Line of Sight (NLOS) situations without causing the storm problem and channel contention, is regarded as a serious dilemma which is required to be tackled in VANET, especially in congested environments. This requires the designing of an efficient mechanism of routing protocol that can broadcast the warning messages from the emergency vehicles to the vehicles under NLOS, reducing the overhead and increasing the packet delivery ratio with a reduced time delay and channel utilisation. The main aim of this work is to develop the novel routing protocol for a high-density environment in VANET through utilisation of its high mobility features, aid of the sensors such as Global Positioning System (GPS) and Navigation System (NS). In this work, the cooperative approach has been used to develop the routing protocol called the Co-operative Volunteer Protocol (CVP), which uses volunteer vehicles to disseminate the warning message from the source to the target vehicle under NLOS issue; this also increases the packet delivery ratio, detection of NLOS and resolution of NLOS by delivering the warning message successfully to the vehicle under NLOS, thereby causing a direct impact on the reduction of collisions between vehicles in normal mode and emergency mode on the road near intersections or on highways. The cooperative approach adopted for warning message dissemination reduced the rebroadcast rate of messages, thereby decreasing significantly the storm issue and the channel contention. A novel architecture has been developed by utilising the concept of a Context-Aware System (CAS), which clarifies the OBU components and their interaction with each other in order to collect data and take the decisions based on the sensed circumstances. The proposed architecture has been divided into three main phases: sensing, processing and acting. The results obtained from the validation of the proposed CVP protocol using the simulator EstiNet under specific conditions and parameters showed that performance of the proposed protocol is better than that of the GRANT protocol with regard to several metrics such as packet delivery ratio, neighbourhood awareness, channel utilisation, overhead and latency. It is also successfully shown that the proposed CVP could detect the NLOS situation and solves it effectively and efficiently for both the intersection scenario in urban areas and the highway scenario.

With the proliferation of mobile devices and wireless connectivity technologies, mobile social communities offer novel opportunities for targeted marketing by service or product providers. Unfortunately, marketers are still unable to realize the full potential of these markets due to their inability to effectively target right audiences. This thesis presents a novel middleware for identifying spontaneous social communities (SSCs) of mobile users in ad hoc networks in order to facilitate marketers' advertisements. The contributions of the presented work are two fold; the first is a novel model for SSCs that captures their unique dynamic nature, in terms of community structure and interest in different \textit{hot-topics} over time. These time-varying interests are represented through an inferred \textit{community profile prototype} that reflects dominant characteristics of community members. This prototype is then employed to facilitate the identification of new potential members. The selected community prototypes are also used by marketers to identify the right communities for their services or products promotions. The second contribution of this paper is novel distributed techniques for efficient calculation of the community prototypes and identification of potential community links. In contrast to traditional models of detecting fixed and mobile social networks that rely on pre-existing friendships among its members to predict new ones, the proposed model focuses on measuring the degree of similarity between the new user's profile and the profiles of members of each community in order to predict new users' relationships in the community. The adopted model of SSCs can foster many existing and new socially-aware applications such as recommender systems for social events and tools for collaborative work. It is also an ideal target for business-oriented applications such as short-message-service (SMS) advertisement messages, podcasting news feeds in addition to location/context-aware services. The performance of the proposed work was evaluated using the NetLogo platform where obtained experimental results demonstrate the achieved high degree of stability in the resulting communities in addition to the effectiveness of the proposed middleware in terms of the reduction in the number of routing messages required for advertisements.

Over a period of time, it has been studied that a mobile “edge-cloud” formed by hand-held devices could be a productive resource entity for providing a service in the mobile cloud landscape. The ease of access to a pool of devices is much more arbitrary and based purely on the needs of the user. This pool can act as a provider of an infrastructure for various services that can be processed with volunteer node participation, where the node in the vicinity is itself a service provider. This representation of cloud formation to engender a constellation of devices in turn providing a service is the basis for the concept of Mobile Ad-hoc Cloud Computing. In this thesis, an architecture is designed for providing an Infrastructure as a service in Mobile Ad-hoc Cloud Computing. The performance evaluation reveals the gain in execution time while offloading to the mobile ad-hoc cloud. Further, this novel architecture enables discovering a dedicated pool of volunteer devices for computation. An optimized task scheduling algorithm is proposed that provides a coordinated resource allocation. However, failure to maintain the service between heterogeneous networks shows the inability of the present day networks to adapt to frequent changes in a network. Thus, owing to the heavy dependence on the centralized mobile network, the service related issues in a mobile ad-hoc cloud needs to be addressed. As a result, using the principles of Software Defined Networking (SDN), a disruption tolerant Mobile Ad-hoc Cloud framework is proposed. To evaluate this framework a comprehensive case study is provided in this work that shows a round trip time improvement using an SDN controller.

Spectrum efficiency and energy efficiency are two important attributes driving innovation in wireless communication. Efficient spectrum utilization and sharing with multiple access techniques and using under-utilized spectra by cognitive radios is the current focus due to the scarcity and cost of the available radio spectrum. Energy efficiency to increase operating time of portable handheld devices like smartphones that handle simultaneous voice/video streaming and web browsing and battery powered nodes in a sensor network where battery capacity determines the lifetime of the network is another area attracting researchers. The focus of this thesis is the spectral efficiency of multicarrier code division multiple access (CDMA) in wireless ad-hoc networks. Furthermore, energy efficiency to maximize lifetime of a network are also studied.In a multicarrier CDMA system inter-carrier interference (ICI) due to carrier frequency offset and multiple access interference (MAI) are two major factors that deteriorate the performance. Previous work in this area has been mostly focused on simulation results due to the complexity of the analysis due to the large number of random variables involved. Taking into account accurate statistical models for ICI and MAI that account for the correlation between adjacent subcarriers, this thesis presents new mathematical analysis for the spectral efficiency of multicarrier CDMA communication systems over a frequency selective Rayleigh fading environment. We analyze and compare three multicarrier CDMA schemes which are multicarrier CDMA, multicarrier direct-sequence CDMA and multitone CDMA. We also present simulation results to confirm the validity of our analysis. We also analyze the performance of three simple multiple access techniques or coexistence etiquettes in detail, which are simple to implement and do not require any central control. Accurate interference models are developed and are used to derive accurate expressions for packet error rates in the case of direct sequence CDMA and slotted packet transmission schemes. These results are then used to study the performance of the coexistence etiquettes and compare them with each other. Finally we present a new joint node selection and power allocation strategy that increases lifetime of an ad-hoc network where nodes cooperate to enable diversity in transmission.

M.Ing. / Mobile adhoc networks (MANETs) are multihop wireless topologies that have rapidly changing node structure and limited connectivity. Since MANETs are not deployed on a wide scale, the research community still depends on the simulators such as the network simulator (Ns2) to evaluate MANET protocols. The topic of how to accurately model an indoor environment in the MANET research community is explored in this dissertation. We take an empirical and simulative approach to model our mobility pattern. Our mobility model is based on activity patterns drawn from the transport science. A comparison with the random way point is made in order to understand the weighty discrepancy between the two models. Our contribution in this research is three fold: 1. We argue that mobility modelling should be based on activities other than stochastic process that have got no realistic backing; 2. We model our network using by putting up an algorithm and take an empirical approach to model the radio frequency propagation. To show the difference of the two mobility models, the behaviour of the signal strength on the two mobility models is drawn; and 3. Finally an implementation of our mobility pattern and RF measurements in ns2 is done.

The thesis deals with MANET networks and it focuses on the routing process. Most attention is paid to the routing protocols AODV and OLSR. These protocols are described in the detail. The aim of the thesis is to create a simulation model of MANET network in OPNET Modeler environment. In this model the AODV protocol is configured. In order to achieve improved characteristics of the network traffic the routing protocol parameters are optimized. Furthermore the process model of AODV protocol in this environment is studied and extended by a new type of message, which allows a transfer of current transmission speed of MANET station network interface. Current transmission rate of stations is retrieved from the statistics. Every station periodically sends a message to neighboring nodes. The node stores the information into the file when a new message arrives.

In this paper, we introduce an effective congestion control scheme for TCP over hybrid wireless/wired networks comprising a multihop wireless IEEE 802.11 network and the wired Internet. We propose an adaptive pacing scheme at the Internet gateway for wired-to-wireless TCP flows. Furthermore, we analyze the causes for the unfairness of oncoming TCP flows and propose a scheme to throttle aggressive wired-to-wireless TCP flows at the Internet gateway to achieve nearly optimal fairness. Thus, we denote the introduced congestion control scheme TCP with Gateway Adaptive Pacing (TCP-GAP). For wireless-to-wired flows, we propose an adaptive pacing scheme at the TCP sender. In contrast to previous work, TCP-GAP does not impose any control traffic overhead for achieving fairness among active TCP flows. Moreover, TCP-GAP can be incrementally deployed because it does not require any modifications of TCP in the wired part of the network and is fully TCP-compatible. Extensive simulations using ns-2 show that TCPGAP is highly responsive to varying traffic conditions, provides nearly optimal fairness in all scenarios and achieves up to 42% more goodput than TCP NewReno.

This paper introduces an effective congestion control pacing scheme for TCP over multihop wireless networks with Internet connectivity. The pacing scheme is implemented at the wireless TCP sender as well as at the Internet gateway, and reacts according to the direction of TCP flows running across the wireless network and the Internet. Moreover, we analyze the causes for the unfairness of oncoming TCP flows and propose a scheme to throttle aggressive wired-to-wireless TCP flows at the Internet gateway to achieve nearly optimal fairness. The proposed scheme, which we denote as TCP with Gateway Adaptive Pacing (TCP-GAP), does not impose any control traffic overhead for achieving fairness among active TCP flows and can be incrementally deployed since it does not require any modifications of TCP in the wired part of the network. In an extensive set of experiments using ns-2 we show that TCP-GAP is highly responsive to varying traffic conditions, provides nearly optimal fairness in all scenarios and achieves up to 42% more goodput for FTP-like traffic as well as up to 70% more goodput for HTTP-like traffic than TCP NewReno. We also investigate the sensitivity of the considered TCP variants to different bandwidths of the wired and wireless links with respect to both aggregate goodput and fairness.

Friginal López, J. (2013). An experimental methodology to evaluate the resilience of ad hoc routing protocols [Tesis doctoral]. Editorial Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/18483 / Palancia

In recent years, routing research concerning wired networks has focused on minimizing the maximum utilization of the links which is equivalent to reducing the number of bottlenecks while supporting the same traffic demands. This can be achieved using multipath routing with load balancing instead of single path routing using of routing optimizers. However, in the domain of ad hoc networks multipath routing has not been investigated in depth. We would like to develop an analogy between wired and wireless networks, but before that we need to identify the major differences between these two in the case of multipath routing. First, in order to increase the network throughput, the multiple paths have to be independent so they don't share the same bottlenecks. Then, due to radio propagation properties the link capacity is not constant. So using the maximum utilization metric for wireless networks is not suitable. Based on the research done in wired networks, which has shown that using multiple paths with load balancing policies between sourcedestination pairs can minimize the maximum utilization of the links, we investigate if this is applicable to ad hoc networks. This paper proposes a multipath routing algorithm with a load balancing policy. The results obtained from an indoor 802.11g network highlight two major points. The maximum throughput is not achieved with multipath routing, but with single path routing. However, the results on the delivery ratio are encouraging, indeed we observe a real improvement thanks to our multipath routing algorithm. / På senare år har routning forskningen angående trådnätverken focusen på att minska den maximala användingen av länkar vilket motsvarar än reducering av flaskhalsar medan man stöder samma trafikkrav. Det här kan åstadkommas genom att av multiväg routning med lasta balansering I stället för använder enkelvägrouting med routing optimizers. Emellertid har inom ad hoc nätverken multiväg routning har inte blivit undersökts på djupet. Vi skulle vilja utveckla en analogy emellan trådnätverk och trådlösnätverken.men främföre det behöver identifiera de store differenserna mellan dessa två vid multiväg routning. För det första måste de flerfaldiga vägarna vara oberoende för att öka nätverkens throughput så de inte delar samma flaskhalsar. Sedan är länkkapaciteten inte constant på grund av radiospridningsegenskaperna. Så den maximal användningsmetric för trådlös nätverken passar inte. Den här arbetetet föreslår en multiväg routning algoritm med lasta balanseringen. Resultaten få från en indoor 802.11g nätverk framhåller ger två store meningen. Den maximala throughput är inte åstadkoms med multiväg routing, men med enkelväg routning. Emellertid är resultaten på den leveransförhållande uppmuntrande; vi observera en verklig förbättring tack vare vår multiväg routning algoritmen.