Mobile Ad-hoc Cloud offers users the capability to offload intensive tasks on a cloud composed of voluntary mobile devices. Due to the availability of these devices in the proximity, intensive tasks can be processed locally. In addition, the literature referred to in the text, distinguishes a specific class of application to be well addressed when processed at the user level. However, due to lack of commitment, mobility, and unpredictability of the mobile devices, providing a rich ad-hoc cloud service is challenging. Furthermore, the resource availability of these devices impacts the service offered to the requester. As a result, this thesis aims to address the challenges mentioned above. With the support of Multi-Access Edge Computing, a mobile ad-hoc Infrastructure as a Service composition framework is proposed. An ad-hoc application server is designed to operate over the MEC platform to compose and manage the mobile ad-hoc cloud. The server uses the information provided by the MEC services to compose volunteer resources for a given request. As well, a heuristic approach for a multi-dimensional bin packing technique is considered, while extending the Euclidean distance for sub-tasks selection. In addition, to address the lack of resource availability, an architecture for MAC using SDN is proposed. The logically centralized controller works with the application server to migrate requests seamlessly from one region to another. Inspired by the benefits of the MEC, a mobility mechanism is introduced to address the movement of the participants. Finally, based on the evaluation, it was observed that the proposed MAC framework not only provided better use of resources but also provided a consisted and scalable service.

Zhang Jialiang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 51-52). / Abstracts in English and Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation and Related Work --- p.1 / Chapter 1.2 --- Organization of the Thesis --- p.3 / Chapter Chapter 2 --- Interference Modeling for Directional Antennas --- p.5 / Chapter 2.1 --- Pair-wise Physical Link Interference Model of Generic Directional Antenna --- p.6 / Chapter 2.2 --- Potential Interference Region --- p.8 / Chapter 2.3 --- Antenna Pattern and Phased Array Antenna --- p.9 / Chapter Chapter 3 --- Null Width of Directional Antennas --- p.12 / Chapter 3.1 --- Concept of Null Width --- p.12 / Chapter 3.2 --- Effective Null Width and Interference --- p.14 / Chapter 3.2.1 --- Probability of Interference --- p.14 / Chapter 3.2.2 --- Scenario of Directional Transmission and Omni-directional Reception --- p.15 / Chapter 3.2.3 --- Scenario of Directional Transmission and Directional Reception --- p.17 / Chapter 3.3 --- Properties of General Effective Beam Width --- p.18 / Chapter 3.4 --- Numerical Scaling Law of Effective Beam Width of Some Particular Antenna Patterns --- p.23 / Chapter 3.5 --- Summary --- p.26 / Chapter Chapter 4 --- Scaling Law of Network Capacity of Wireless Random Networks with Directional Antennas --- p.27 / Chapter 4.1 --- Random Network Model and Network Capacity --- p.27 / Chapter 4.2 --- Node distribution and MAC Protocol --- p.29 / Chapter 4.3 --- Scenario of Directional Transmission and Omni-directional Reception --- p.30 / Chapter 4.3.1 --- Probability of Transmission to be Success and Per-Link (Transport) Throughput --- p.30 / Chapter 4.3.2 --- Scaling Law of Network Capacity --- p.32 / Chapter 4.3.3 --- Concluding Remark --- p.37 / Chapter 4.4 --- Scenario of Directional Transmission and Directional Reception --- p.38 / Chapter 4.4.1 --- Antenna Steering Protocol --- p.39 / Chapter 4.4.2 --- Probability of Transmission to be Success --- p.40 / Chapter 4.4.3 --- Scaling Law of Network Capacity --- p.41 / Chapter 4.4.4 --- Scaling Law of Phased Array Antennas --- p.42 / Chapter Chapter 5 --- Conclusion --- p.44 / Appendix A: Proof of equation (22) --- p.47 / Appendix B: Proof of equation (28) --- p.49 / Appendix C: Constraint on Region of Optimality for pt and r --- p.50 / References --- p.51

Lau Ka Ming. / Thesis submitted in: August 2005. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 69-72). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgements --- p.iii / Table of Contents --- p.iv / List of Figures --- p.vi / List of Tables --- p.viii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Wireless Ad Hoc Networks --- p.2 / Chapter 1.2.1 --- Wireless Sensor Network --- p.3 / Chapter 1.2.2 --- IEEE802.11 Ad Hoc Network --- p.3 / Chapter 1.2.3 --- Bluetooth Personal Area Network --- p.4 / Chapter 1.3 --- Power Saving in Wireless Ad Hoc Networks --- p.4 / Chapter 1.4 --- Contributions of the Thesis --- p.8 / Chapter 1.5 --- Outline of the Thesis --- p.9 / Chapter 2 --- Power Saving Mechanisms in Wireless Ad hoc Networks --- p.10 / Chapter 2.1 --- Recent Research Proposals --- p.10 / Chapter 2.1.1 --- Synchronous Power Saving Schemes --- p.11 / Chapter 2.1.2 --- Asynchronous Power Saving Schemes --- p.12 / Chapter 2.2 --- Existing Standards --- p.17 / Chapter 2.2.1 --- IEEE802.1l Ad Hoc Power Saving Mode --- p.17 / Chapter 2.2.2 --- Bluetooth Low Power Modes --- p.20 / Chapter 3 --- Analytical Framework for Designing Synchronous Wakeup Patterns --- p.22 / Chapter 3.1 --- System Model --- p.23 / Chapter 3.1.1 --- Vacation Model --- p.23 / Chapter 3.1.2 --- Optimal Wakeup Pattern --- p.25 / Chapter 3.2 --- Analytical analysis of different wakeup patterns --- p.27 / Chapter 3.2.1 --- Exhaustive Wakeup Pattern --- p.27 / Chapter 3.2.2 --- Gated Wakeup Pattern --- p.31 / Chapter 3.2.3 --- Gated Wakeup With Constant Cycle Time --- p.34 / Chapter 3.3 --- Discussion of results --- p.43 / Chapter 3.3.1 --- Performances impacts of various system parameters --- p.43 / Chapter 3.3.2 --- Performances comparison of different wakeup patterns --- p.47 / Chapter 3.4 --- Chapter Summary --- p.48 / Chapter 4 --- An improved IEEE802.1l Power Saving Mode --- p.49 / Chapter 4.1 --- Related Proposals --- p.50 / Chapter 4.2 --- Proposed Scheme --- p.52 / Chapter 4.2.1 --- Overview --- p.52 / Chapter 4.2.2 --- Beacon Sending Station --- p.53 / Chapter 4.2.3 --- Beacon Receiving Station --- p.55 / Chapter 4.2.4 --- Computing the Transmission Schedule --- p.55 / Chapter 4.2.5 --- Data Transmission Specifications --- p.56 / Chapter 4.2.6 --- Failure Conditions --- p.58 / Chapter 4.3 --- Performances Evaluation --- p.58 / Chapter 4.3.1 --- Simulation Model --- p.60 / Chapter 4.3.2 --- Simulation Results --- p.60 / Chapter 4.4 --- Chapter Summary --- p.64 / Chapter 5 --- Conclusion --- p.66

"The use of behavioral targeting practices provides ad networks with the opportunity to tailor ads to the individual characteristics of users. As privacy concerns over behavioral targeting have been growing lately, an increasing number of ad networks offer ad preferences managers (APMs) that show collected and/or inferred information about users. The focus of our study is to investigate the accuracy and completeness of the information contained in such APMs. On the basis of our experimental results, we propose a structured methodology for APM validation. We also assess how third parties render ads based on users’ browsing behavior. Our findings reveal cases in which even sensitive information is leaked as part of an HTTP header and is used to serve ads on multiple sites. The third parties examined in this study include an intent-focused data exchange (BlueKai) and a social network (Facebook) along with the ad networks owned by AOL, Google, and Yahoo!."

La croissance explosive des réseaux sans fil et l’augmentation du nombre de dispositifs sans fil ont soulevé de nombreuses difficultés techniques dans la planification et l’analyse de ces réseaux. Nous utilisons la modélisation continue, utile pour la phase initiale de déploiement et l’analyse à grande échelle des études régionales du réseau. Nous étudions le problème de routage dans les réseaux ad hoc, nous définissons deux principes d’optimisation du réseau: le problème de l’utilisateur et du système. Nous montrons que les conditions d’optimalité d’un problème d’optimisation construit d’une manière appropriée coïncide avec le principe de l’optimisation de l’utilisateur. Pour fonctions de coût différentes, nous résolvons le problème de routage pour les antennes directionnelles et omnidirectionnelles. Nous trouvons également une caractérisation des voies du coût minimum par l’utilisation extensive du Théorème de Green dans le cas d’antennes directionnelles. Dans de nombreux cas, la solution se caractérise par une équation aux dérivés partielles. Nous proposons l’analyse numérique par éléments finis qui donne les limites de la variation de la solution par rapport aux données. Lorsque nous permettons la mobilité des origines et destinations, on trouve la quantité optimale de relais actif. Dans les réseaux MIMO, nous montrons que, même lorsque la chaîne offre un nombre infini de degrés de liberté, la capacité est limitée par le rapport entre la taille du réseau d’antennes, la station de base, la position des mobiles et la longueur d’onde du signal. Nous constatons également l’association optimale mobile pour différentes politiques et distributions des utilisateurs. / The growing number of wireless devices and wireless systems present many challenges on the design and operation of these networks. We focus on massively dense ad hoc networks and cellular systems. We use the continuum modeling approach, useful for the initial phase of deployment and to analyze broad-scale regional studies of the network. We study the routing problem in massively dense ad hoc networks, and similar to the work of Nash, and Wardrop, we define two principles of network optimization: user- and system-optimization. We show that the optimality conditions of an appropriately constructed optimization problem coincides with the user-optimization principle. For different cost functions, we solve the routing problem for directional and omnidirectional antennas. We also find a characterization of the minimum cost paths by extensive use of Green’s theorem in directional antennas. In many cases, the solution is characterized by a partial differential equation. We propose its numerical analysis by finite elements method which gives bounds in the variation of the solution with respect to the data. When we allow mobility of the origin and destination nodes, we find the optimal quantity of active relay nodes. In Network MIMO systems and MIMO broadcast channels, we show that, even when the channel offers an infinite number of degrees of freedom, the capacity is limited by the ratio between the size of the antenna array at the base station and the mobile terminals position and the wavelength of the signal. We also find the optimal mobile association for the user- and system-optimization problem under different policies and distributions of the users.

The first, theoretical part is dedicated to a complete summary of the theory behind the banner advertising in general -- starting at the very beginning of internet advertising in the past, to today's latest forms of internet advertising campaigns. In this part you can also find an exact description of functionality of these models and their possible options. The following, practical part is focused on implementing the new model for buying and selling space for advertising on the web. This part of my Thesis includes analysis of functionality, advantages and disadvantages for the use of the new model and analysis of issues that occurred during its implementation. A questionnaire has been developed and used to analyze this. My Theses concludes with proposed recommendations and future development of the new model.

Bluetooth is a low cost and low power wireless technology for connecting portable and / or fixed Bluetooth enabled devices to form short-range wireless ad hoc personal area networks (PANs). As the Bluetooth specification does not specify a protocol to form ad hoc Bluetooth networks, a method for forming an efficient Bluetooth network under a practical networking scenario is still an open research problem. This thesis introduces an approach to implement an indoor ad hoc Bluetooth wireless network, Bluetooth information exchange network (BIEN). This network formation is based on Bluetooth and Java technologies. A set of Bluetooth enabled devices configured with the BIEN software application are able to spontaneously establish a dynamic multi-hop wireless network using Bluetooth technology without the need of formal network infrastructure, centralized administration, fixed routers or access points. In this study, the performance evaluation focuses on the relation between network capacity and topology by testing end-to-end performance in terms of throughput and the latency of communication links with various parameters, including the hop number between nodes and the number of slaves in piconets. The evaluation results show that the throughput reduces with the increased length of a path, and with an increase in the number of slaves in a piconet in the network. The latency also increases with path length, and with the number of slaves in a piconet in the different experimental BIENs, whether if there is traffic or not in the networks. Experimental results have further confirmed the necessity to minimize the number of bridge nodes in the Bluetooth networks due to their traffic bottleneck effect. This work is an attempt at implementation of a distributed multi-hop scatter net with an integrated routing protocol in the practical environments, while most of the literature focuses on covering the modelling of it. It intends to demonstrate how Bluetooth technology with Java technology can be used to design, develop and deploy ad hoc wireless networks with the commercial Bluetooth devices, and examine how well Bluetooth technology supports ad hoc multi-hop wireless network technology.

<p>The purpose of this research has been to study and find out if a diagnose AD/HD is of importance. Does a diagnostic significance matter for how to support and respond to children in school? Are diagnosed children with signs of AD/HD treated differently than children without diagnosis? My study is based on input from teachers, special educators, from two different schools and also one doctor and one parent.</p><p>I have interviewed teachers, special educators, one physician and one parent. I have been using qualitative interviews with tape recorders and emailed them with open questions. I have been using literature; see bibliography. And my own experiences with the meeting of these children have meant a lot to me when I typed. First of all, I have focused on what AD/HD is, the diagnosis, medication and treatment of AD/HD. After that I continued to analyze my questions to see what emerges from the interviews made. Are they treated the same, does the diagnose make a difference to how these children are treated? Or do they need special medication to see a difference or other methods.</p><p>The result is that the diagnosis does not mean so much to a child with AD/HD in today's schools. It may be a response to something that is different and there is often a relief to have that confirmed. That it reduces the guilt of parents, teachers and even the child.  What matters is how the child responds, and the support provided to the child. I can also see a difference in the children who taking medication, both positively and negatively.</p>

MANETs are known to be useful in situations where mobile nodes need to communicate and coordinate in dynamic environments with no access to fixed network infrastructure. However, connectivity problems can occur when sub-groups within a MANET move out of communication range from one another. The increasingly prolific use of UAVs in military and civilian contexts suggests that UAVs may be very useful for facilitating connectivity between otherwise disconnected mobile nodes. Network Centric Warfare (NCW) theory makes heavy use of MANETs, and UAVs also fit well into the NCW theory; this paper describes the work involved in integrating network enabled UAVs into a previously-developed simulation of ground troop mobility called UMOMM. Specifically, we created a simple decision model for constrained, constant-radius UAV movements, and developed a target-based method by which UAVs can distribute themselves in order to improve the connectivity of the ground members of the MANET. / Graduation date: 2012

Most existent protocols, applications and services for Mobile Ad Hoc NET-works (MANETs) assume a cooperative and friendly network environment and do not accommodate security. Therefore, Intrusion Detection Systems (IDSs), serving as the second line of defense for information systems, are indispensable for MANETs with high security requirements. Central to the research described in this dissertation is the proposed two-level nonoverlapping Zone-Based Intrusion Detection System (ZBIDS) which fit the unique requirement of MANETs. First, in the low-level of ZBIDS, I propose an intrusion detection agent model and present a Markov Chain based anomaly detection algorithm. Local and trusted communication activities such as routing table related features are periodically selected and formatted with minimum errors from raw data. A Markov Chain based normal profile is then constructed to capture the temporal dependency among network activities and accommodate the dynamic nature of raw data. A local detection model aggregating abnormal behaviors is constructed to reflect recent subject activities in order to achieve low false positive ratio and high detection ratio. A set of criteria to tune parameters is developed and the performance trade-off is discussed. Second, I present a nonoverlapping Zone-based framework to manage locally generated alerts from a wider area. An alert data model conformed to the Intrusion Detection Message Exchange Format (IDMEF) is presented to suit the needs of MANETs. Furthermore, an aggregation algorithm utilizing attribute similarity from alert messages is proposed to integrate security related information from a wider area. In this way, the gateway nodes of ZBIDS can reduce false positive ratio, improve detection ratio, and present more diagnostic information about the attack. Third, MANET IDSs need to consider mobility impact and adjust their behavior dynamically. I first demonstrate that nodes?? moving speed, a commonly used parameter in tuning IDS performance, is not an effective metric for the performance measurement of MANET IDSs. A new feature -link change rate -is then proposed as a unified metric for local MANET IDSs to adaptively select normal profiles . Different mobility models are utilized to evaluate the performance of the adaptive mechanisms.