Rozprawy doktorskie na temat „Mobile wireless computing networks”
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Mobile wireless computing networks.
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Mobile wireless computing networks”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
1
Datla, Dinesh. "Wireless Distributed Computing in Cloud Computing Networks". Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/51729.
Pełny tekst źródłaStreszczenie:
The explosion in growth of smart wireless devices has increased the ubiquitous presence of computational resources and location-based data. This new reality of numerous wireless devices capable of collecting, sharing, and processing information, makes possible an avenue for new enhanced applications. Multiple radio nodes with diverse functionalities can form a wireless cloud computing network (WCCN) and collaborate on executing complex applications using wireless distributed computing (WDC). Such a dynamically composed virtual cloud environment can offer services and resources hosted by individual nodes for consumption by user applications. This dissertation proposes an architectural framework for WCCNs and presents the different phases of its development, namely, development of a mathematical system model of WCCNs, simulation analysis of the performance benefits offered by WCCNs, design of decision-making mechanisms in the architecture, and development of a prototype to validate the proposed architecture.
The dissertation presents a system model that captures power consumption, energy consumption, and latency experienced by computational and communication activities in a typical WCCN. In addition, it derives a stochastic model of the response time experienced by a user application when executed in a WCCN. Decision-making and resource allocation play a critical role in the proposed architecture. Two adaptive algorithms are presented, namely, a workload allocation algorithm and a task allocation - scheduling algorithm. The proposed algorithms are analyzed for power efficiency, energy efficiency, and improvement in the execution time of user applications that are achieved by workload distribution. Experimental results gathered from a software-defined radio network prototype of the proposed architecture validate the theoretical analysis and show that it is possible to achieve 80 % improvement in execution time with the help of just three nodes in the network.Ph. D.
2
Yang, Zhimin. "Opportunistic Computing in Wireless Networks". The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1267743144.
Pełny tekst źródła
3
Kang, Jong Hee. "Location-aware information access through wireless networks /". Thesis, Connect to this title online; UW restricted, 2006. http://hdl.handle.net/1773/6878.
Pełny tekst źródła
4
Li, Yue. "Edge computing-based access network selection for heterogeneous wireless networks". Thesis, Rennes 1, 2017. http://www.theses.fr/2017REN1S042/document.
Pełny tekst źródłaStreszczenie:
Au cours de ces dernières décennies, les réseaux de télécommunications mobiles ont évolué de la 1G à la 4G. La 4G permet la coexistence de différents réseaux d'accès. Ainsi, les utilisateurs ont la capacité de se connecter à un réseau hétérogène, constitué de plusieurs réseaux d'accès. Toutefois, la sélection du réseau approprié n'est pas une tâche facile pour les utilisateurs mobiles puisque les conditions de chaque réseau d'accès changent rapidement. Par ailleurs, en termes d'usage, le streaming vidéo devient le service principal de transfert de données sur les réseaux mobiles, ce qui amène les fournisseurs de contenu et les opérateurs de réseau à coopérer pour garantir la qualité de la diffusion. Dans ce contexte, la thèse propose la conception d'une approche novatrice pour la prise de décision optimale de sélection de réseau et une architecture améliorant les performances des services de streaming adaptatif dans un réseau hétérogène. En premier lieu, nous introduisons un modèle analytique décrivant la procédure de sélection de réseau en ne considérant déjà qu'une seule classe de trafic. Nous concevons ensuite une stratégie de sélection basée sur des fondements de la théorie du contrôle optimal linéaire. Des simulations sous MATLAB sont effectuées pour valider l'efficacité du mécanisme proposé. Sur ce même principe, nous étendons ce modèle avec un modèle analytique général décrivant les procédures de sélection de réseau dans des environnements de réseaux hétérogènes avec de multiples classes de trafic. Le modèle proposé est ensuite utilisé pour dériver un mécanisme adaptatif basé sur la théorie du contrôle, qui permet non seulement d'aider à piloter dynamiquement le trafic vers l'accès réseau le plus approprié mais aussi de bloquer dynamiquement le trafic résiduel lorsque le réseau est congestionné en ajustant les probabilités d'accès optimales. Nous discutons aussi les avantages d'une intégration transparente du mécanisme proposé avec l'ANDSF, solution fonctionnelle normalisée pour la sélection de réseau. Un prototype est également implémenté dans ns-3. En second lieu, nous nous concentrons sur l'amélioration des performances de DASH pour les utilisateurs mobiles dans un environnement de réseau d'accès 4G uniquement. Nous introduisons une nouvelle architecture basée sur l'utilisation de serveurs distribués en périphérie de réseau suivant le standard MEC. Le mécanisme d'adaptation proposé, fonctionnant en tant que service MEC, peut modifier les fichiers de manifeste en temps réel, en réponse à la congestion du réseau et à la demande dynamique de flux de streaming. Ces modifications conduisent ainsi les clients à sélectionner des représentations vidéo de débit / qualité plus appropriées. Nous avons développé une plateforme de test virtualisée pour l'expérimentation de notre proposition. Les résultats ainsi obtenus démontrent ses avantages en terme de QoE comparés aux approches d'adaptation traditionnelles, purement pilotées par les clients, car notre approche améliore non seulement le MOS mais aussi l'équité face à la congestion. Enfin, nous étendons l'architecture proposée basée sur MEC pour supporter le service de streaming adaptatif DASH dans un réseau hétérogène multi-accès afin de maximiser la QoE et l'équité des utilisateurs mobiles. Dans ce scénario, notre mécanisme doit aider les utilisateurs à sélectionner la qualité vidéo et le réseau et nous le formulons comme un problème d'optimisation. Ce problème d'optimisation peut être résolu par l'outil IBM CPLEX, mais cela prend du temps et ne peut être envisagé à grande échelle. Par conséquent, nous introduisons une heuristique pour aborder la solution optimale avec moins de complexité. Ensuite, nous mettons en œuvre une expérimentation sur notre plateforme de tests. Le résultat démontre que, par rapport à l'outil IBM CPLEX, notre algorithme permet d'obtenir des performances similaires sur la QoE globale et l'équité, avec un gain de temps significatifTelecommunication network has evolved from 1G to 4G in the past decades. One of the typical characteristics of the 4G network is the coexistence of heterogeneous radio access technologies, which offers end-users the capability to connect them and to switch between them with their mobile devices of the new generation. However, selecting the right network is not an easy task for mobile users since access network condition changes rapidly. Moreover, video streaming is becoming the major data service over the mobile network where content providers and network operators should cooperate to guarantee the quality of video delivery. In order to cope with this context, the thesis concerns the design of a novel approach for making an optimal network selection decision and architecture for improving the performance of adaptive streaming in the context of a heterogeneous network. Firstly, we introduce an analytical model (i.e. linear discrete-time system) to describe the network selection procedure considering one traffic class. Then, we consider the design of a selection strategy based on foundations from linear optimal control theory, with the objective to maximize network resource utilization while meeting the constraints of the supported services. Computer simulations with MATLAB are carried out to validate the efficiency of the proposed mechanism. Based on the same principal we extend this model with a general analytical model describing the network selection procedures in heterogeneous network environments with multiple traffic classes. The proposed model was, then, used to derive a scalable mechanism based on control theory, which allows not only to assist in steering dynamically the traffic to the most appropriate network access but also helps in blocking the residual traffic dynamically when the network is congested by adjusting dynamically the access probabilities. We discuss the advantages of a seamless integration with the ANDSF. A prototype is also implemented into ns-3. Simulation results sort out that the proposed scheme prevents the network congestion and demonstrates the effectiveness of the controller design, which can maximize the network resources allocation by converging the network workload to the targeted network occupancy. Thereafter, we focus on enhancing the performance of DASH in a mobile network environment for the users which has one access network. We introduce a novel architecture based on MEC. The proposed adaptation mechanism, running as an MEC service, can modify the manifest files in real time, responding to network congestion and dynamic demand, thus driving clients towards selecting more appropriate quality/bitrate video representations. We have developed a virtualized testbed to run the experiment with our proposed scheme. The simulation results demonstrate its QoE benefits compared to traditional, purely client-driven, bitrate adaptation approaches since our scheme notably improves both on the achieved MOS and on fairness in the face of congestion. Finally, we extend the proposed the MEC-based architecture to support the DASH service in a multi-access heterogeneous network in order to maximize the QoE and fairness of mobile users. In this scenario, our scheme should help users select both video quality and access network and we formulate it as an optimization problem. This optimization problem can be solved by IBM CPLEX tool. However, this tool is time-consuming and not scalable. Therefore, we introduce a heuristic algorithm to make a sub-optimal solution with less complexity. Then we implement a testbed to conduct the experiment and the result demonstrates that our proposed algorithm notably can achieve similar performance on overall achieved QoE and fairness with much more time-saving compared to the IBM CPLEX tool
5
Jayaram, Rajeev 1971. "Quality-of-Service Provisioning and Resource Reservation Mechanisms for Mobile Wireless Networks". Thesis, University of North Texas, 1998. https://digital.library.unt.edu/ark:/67531/metadc278542/.
Pełny tekst źródłaStreszczenie:
In this thesis, a framework for Quality of Service provisioning in next generation wireless access networks is proposed. The framework aims at providing a differentiated service treatment to real-time (delay-sensitive) and non-real-time (delay-tolerant) multimedia traffic flows at the link layer. Novel techniques such as bandwidth compaction, channel reservation, and channel degradation are proposed. Using these techniques, we develop a call admission control algorithm and a call control block as part of the
QoS framework. The performance of the framework is captured through analytical modeling and
simulation experiments. By analytical modeling, the average carried traffic and the worst case buffer requirements for real-time and non-real-time calls are estimated.
Simulation results show a 21% improvement in call admission probability of real-time calls, and a 17% improvement for non-real-time calls, when bandwidth compaction is employed. The channel reservation technique shows a 12% improvement in call admission probability in comparison with another proposed scheme in the literature.
6
Long, Men Wu Chwan-Hwa. "Roaming authentication and end-to-end authentication in wireless security". Auburn, Ala., 2005. http://repo.lib.auburn.edu/2005%20Summer/doctoral/LONG_MEN_56.pdf.
Pełny tekst źródła
7
Samii, Etienne. "Usability design for location based mobile services in wireless metropolitan networks". Hamburg Diplomica-Verl, 2006. http://d-nb.info/987370928/04.
Pełny tekst źródła
8
Mahmoud, Qusay H. "Evolution of network computing paradigms : applications of mobile agents in wired and wireless networks". Thesis, Middlesex University, 2002. http://eprints.mdx.ac.uk/10745/.
Pełny tekst źródłaStreszczenie:
The World Wide Web (or Web for short) is the largest client-server computing system commonly available, which is used through its widely accepted universal client (the Web browser) that uses a standard communication protocol known as the HyperText Transfer Protocol (HTTP) to display information described in the HyperText Markup Language (HTML). The current Web computing model allows the execution of server-side applications such as Servlets and client-side applications such as Applets. However, it offers limited support for another model of network computing where users would be able to use remote, and perhaps more powerful, machines for their computing needs. The client-server model enables anyone with a Web-enabled device ranging from desktop computers to cellular telephones, to retrieve information from the Web. In today's information society, however, users are overwhelmed by the information with which they are confronted on a daily basis. For subscribers of mobile wireless data services, this may present a problem. Wireless handheld devices, such as cellular telephones are connected via wireless networks that suffer from low bandwidth and have a greater tendency for network errors. In addition, wireless connections can be lost or degraded by mobility. Therefore, there a need for entities that act on behalf of users to simplify the tasks of discovering and managing network computing resources. It has been said that software agents are a solution in search of a problem. Mobile agents, however, are inherently distributed in nature, and therefore they represent a natural view of a distributed system. They provide an ideal mechanism for implementing complex systems, and they are well suited for applications that are communicationscentric such as Web-based network computing. Another attractive area of mobile agents is processing data over unreliable networks (such as wireless networks). In such an environment, the low reliability network can be used to transfer agents rather than a chunk. of data. The agent can travel to the nodes of the network, collect or process information without the risk of network disconnection, then return home. The publications of this doctorate by published works report on research undertaken in the area of distributed systems with emphasis on network computing paradigms, Web-based distributed computing, and the applications of mobile agents in Web-based distributed computing and wireless computing. The contributions of this collection of related papers can be summarized in four points. First, I have shown how to extend the Web to include computing resources; to illustrate the feasibility of my approach I have constructed a proof of concept implementation. Second, a mobile agent-based approach to Web-based distributed computing, that harness the power of the Web as a computing resource, has been proposed and a system has been prototyped. This, however, means that users will be able to use remote machines to execute their code, but this introduces a security risk. I need to make sure that malicious users cannot harm the remote system. For this, a security policy design pattern for mobile Java code has been developed. Third, a mediator-based approach to wireless client/server computing has been proposed and guidelines for implementing it have been published. This approach allows access to Internet services and distributed object systems from resource-constraint handheld wireless devices such as cellular telephones. Fourth and finally, a mobile agent-based approach to the Wireless Internet has been designed and implemented. In this approach, remote mobile agents can be accessed and used from wireless handheld devices. Handheld wireless devices will benefit greatly from this approach since it overcomes wireless network limitations such as low bandwidth and disconnection, and enhances the functionality of services by being able to operate without constant user input.
9
Sanadhya, Shruti. "Ultra-mobile computing: adapting network protocol and algorithms for smartphones and tablets". Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/52959.
Pełny tekst źródłaStreszczenie:
Smartphones and tablets have been growing in popularity. These ultra mobile devices bring in new challenges for efficient network operations because of their mobility, resource constraints and richness of features. There is thus an increasing need to adapt network protocols to these devices and the traffic demands on wireless service providers. This dissertation focuses on identifying design limitations in existing network protocols when operating in ultra mobile environments and developing algorithmic solutions for the same.
Our work comprises of three components. The first component identifies the shortcomings of TCP flow control algorithm when operating on resource constrained smartphones and tablets. We then propose an Adaptive Flow Control (AFC) algorithm for TCP that relies not just on the available buffer space but also on the application read-rate at the receiver.
The second component of this work looks at network deduplication for mobile devices. With traditional network deduplication (dedup), the dedup source uses only the portion of the cache at the dedup destination that it is aware of. We argue in this work that in a mobile environment, the dedup destination (say the mobile) could have accumulated a much larger cache than what the current dedup source is aware of. In this context, we propose Asymmetric caching, a solution which allows the dedup destination to selectively feedback appropriate portions of its cache to the dedup source with the intent of improving the redundancy elimination efficiency.
The third and final component focuses on leveraging network heterogeneity for prefetching on mobile devices. Our analysis of browser history of 24 iPhone users show that URLs do not repeat exactly. Users do show a lot of repetition in the domains they visit but not the particular URL. Additionally, mobile users access web content over diverse network technologies: WiFi and cellular (3G/4G). While data is unlimited over WiFi, users typically have monthly limits on data over the cellular network. In this context, we propose Precog, an
action-based prefetching solution to reduce cellular data footprint on smartphones and tablets.
10
Kanter, Theo. "Adaptive Personal Mobile Communication, Service Architecture and Protocols". Doctoral thesis, KTH, Microelectronics and Information Technology, IMIT, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3273.
Pełny tekst źródła
11
Liu, Huanjin. "Free roaming: A system for ubiquitous computing". CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3062.
Pełny tekst źródłaStreszczenie:
Based on the Umbilical Cord system, this project enriches the Ubiquitous Computing system with a Free Roaming system. This Free Roaming consists of a distributed authentication system, a data caching system and a communication system between them. It allows user to roam within this system and access his data everywhere. Together with the Umbilical Cord system, a Ubiquitous Computing system is functionally completed as a prototype, and is ready to be deployed into the Internet.
12
Hasir, Ibrahim. "The Effect of Mobility on Wireless Sensor Networks". Thesis, University of North Texas, 2014. https://digital.library.unt.edu/ark:/67531/metadc699868/.
Pełny tekst źródłaStreszczenie:
Wireless sensor networks (WSNs) have gained attention in recent years with the proliferation of the micro-electro-mechanical systems, which has led to the development of smart sensors. Smart sensors has brought WSNs under the spotlight and has created numerous different areas of research such as; energy consumption, convergence, network structures, deployment methods, time delay, and communication protocols. Convergence rates associated with information propagations of the networks will be questioned in this thesis. Mobility is an expensive process in terms of the associated energy costs. In a sensor network, mobility has significant overhead in terms of closing old connections and creating new connections as mobile sensor nodes move from one location to another. Despite these drawbacks, mobility helps a sensor network reach an agreement more quickly. Adding few mobile nodes to an otherwise static network will significantly improve the network’s ability to reach consensus. This paper shows the effect of the mobility on convergence rate of the wireless sensor networks, through Eigenvalue analysis, modeling and simulation.
13
Falcon, Martinez Rafael Jesus. "Towards Fault Reactiveness in Wireless Sensor Networks with Mobile Carrier Robots". Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/22685.
Pełny tekst źródłaStreszczenie:
Wireless sensor networks (WSN) increasingly permeate modern societies nowadays. But in spite of their plethora of successful applications, WSN are often unable to surmount many operational challenges that unexpectedly arise during their lifetime. Fortunately, robotic agents can now assist a WSN in various ways. This thesis illustrates how mobile robots which are able to carry a limited number of sensors can help the network react to sensor faults, either during or after its deployment in the monitoring region.
Two scenarios are envisioned. In the first one, carrier robots surround a point of interest
with multiple sensor layers (focused coverage formation). We put forward the first known algorithm
of its kind in literature. It is energy-efficient, fault-reactive and aware of the bounded
robot cargo capacity. The second one is that of replacing damaged sensing units with spare,
functional ones (coverage repair), which gives rise to the formulation of two novel combinatorial
optimization problems. Three nature-inspired metaheuristic approaches that run at a centralized location are proposed. They are able to find good-quality solutions in a short time. Two frameworks for the identification of the damaged nodes are considered. The first one leans upon diagnosable systems, i.e. existing distributed detection models in which individual units perform tests upon each other. Two swarm intelligence algorithms are designed to quickly and reliably spot faulty sensors in this context. The second one is an evolving risk management framework for WSNs that is entirely formulated in this thesis.
14
Hansen, Jarle. "An investigation of smartphone applications : exploring usability aspects related to wireless personal area networks, context-awareness, and remote information access". Thesis, Brunel University, 2012. http://bura.brunel.ac.uk/handle/2438/6518.
Pełny tekst źródłaStreszczenie:
In this thesis we look into usability in the context of smartphone applications. We selected three research areas to investigate, namely Wireless Personal Area Networks, Context-awareness, and Remote Information Access. These areas are investigated through a series of experiments, which focuses on important aspects of usability within software applications. Additionally, we mainly use smartphone devices in the experiments. In experiment 1, Multi-Platform Bluetooth Remote Control, we investigated Wireless Personal Area Networks. Specifically, we implemented a system consisting of two clients, which were created for Java ME and Windows Mobile, and integrated with a server application installed on a Bluetooth-enabled laptop. For experiments 2 and 3, Context-aware Meeting Room and PainDroid: an Android Application for Pain Management, we looked closely at the research area of Contextawareness. The Context-aware Meeting Room was created to automatically send meeting participants useful meeting notes during presentations. In experiment 3, we investigated the use of on-device sensors for the Android platform, providing an additional input mechanism for a pain management application, where the accelerometer and magnetometer were used. Finally, the last research area we investigated was Remote Information Access, where we conducted experiment 4, Customised Android Home Screen. We created a system that integrated both a cloud-based server application and a mobile client running on the Android platform. We used the cloud-computing platform to provide context management features, such as the ability to store the user configuration that was automatically pushed to the mobile devices.
15
Benchi, Abdulkader. "Middleware Systems for Opportunistic Computing in Challenged Wireless Networks". Thesis, Lorient, 2015. http://www.theses.fr/2015LORIS372/document.
Pełny tekst źródłaStreszczenie:
Les réseaux mobiles opportunistes (ou OppNets, pour Opportunistic Networks) constituent une solution séduisante pour compléter les réseaux fixes d’infrastructure, voire compenser leur absence dans des zones sinistrées ou défavorisées. Les recherches menées ces dernières années ont principalement visé à permettre les transmissions dans les OppNets, mais ceci ne peut être qu’un premier pas vers une réelle exploitation de tels environnements contraints. L’informatique opportuniste (Opportunistic Computing) dépasse le cadre des seules transmissions, et introduit un nouveau paradigme d’exécution de tâches collaboratives dans de tels environnements. Dans ce domaine qu’est l’informatique opportuniste, la conception, la mise en œuvre et le déploiement d’applications distribuées sont des objectifs majeurs. Une application pour OppNet doit pouvoir fonctionner et assurer un niveau de service satisfaisant, tout en supportant les diverses contraintes propres aux OppNets, telles qu’une connectivité fluctuante, un partitionnement chronique du réseau, de longs délais de transmissions, de fréquents échecs de transmission, et des équipements hétérogènes offrant des ressources limitées. La complexité et le coût du développement d’applications pour OppNets peuvent être réduits de manière significative en utilisant des modèles de programmation appropriés. De tels modèles peuvent être fournis par des systèmes intergiciels capables de supporter de manière transparente les contraintes évoquées plus haut. Le travail rapporté dans ce mémoire a porté sur l’étude des contraintes inhérentes aux OppNets, et sur la proposition de solutions appropriées. Parmi les modèles de programmation usuels, certains ont été identifiés comme pouvant être utilisés dans le cadre des OppNets. Sur la base de ces divers modèles de programmation, des systèmes intergiciels opportunistes ont été mis en oeuvre. Ces systèmes supportent respectivement le modèle de messagerie distribuée (sur la base de files d’attentes et de "topics"), le modèle du tuple-space, et la résolution de consensus. Des implémentations complètes ont été réalisées, et le code source est distribué sous licence GPL (GNU General Public License). Ces systèmes ont été évalués par le biais d’expérimentations menées en conditions réelles et par simulationOpportunistic networks (OppNets) constitute an appealing solution to complement fixed network infrastructures –or make up for the lack thereof– in challenged areas. Researches in the last few years have mostly addressed the problem of supporting networking in OppNets, yet this can only be a first step towards getting real benefit from these networks. Opportunistic computing goes beyond the concept of opportunistic networking, and provides a new paradigm to enable collaborative computing tasks in such environments. In the realm of opportunistic computing, properly designing, implementing and deploying distributed applications are important tasks. An OppNet-dedicated application must be able to operate and maintain an acceptable level of service while addressing the many problems that can occur in these networks, such as disconnections, partitioning, long transmission delays, transmission failures, resource constraints, frequent changes in topology, and heterogeneous devices. Much of the complexity and cost of building OppNet-dedicated applications can be alleviated by the use of high-level programming models. Such models can be supported by middleware systems capable of transparently addressing all the above-mentioned problems. The work reported in this dissertation focused on providing insight into the fundamental problems posed by OppNets, so as to analyze and solve the problems faced by application developers while dealing with these environments. The research focused on identifying well-known high-level programming models that can be satisfactorily implemented for OppNets, and that can prove useful for application developers. In order to demonstrate the feasibility of application development for OppNets, while assessing the benefits brought about by carefully designed middleware systems, a couple of such systems have been designed, implemented, and evaluated as part of this work. These middleware systems respectively support distributed messaging (through message queues and topics), the tuple-space model, and consensus solving in OppNets. They are supplemented with fully-functional implementations, that can be used in real settings, and that are all distributed under the terms of the GNU General Public License (GPL). Real-life experiments and simulations have been realized so as to evaluate the effectiveness and efficiency of these systems in real conditions
16
Lee, Young-Jun. "Routing and Efficient Evaluation Techniques for Multi-hop Mobile Wireless Networks". Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7455.
Pełny tekst źródłaStreszczenie:
In this dissertation, routing protocols, load-balancing protocols, and efficient evaluation techniques for multi-hop mobile wireless networks are explored.
With the advancements made in wireless communication and computer technologies, a new type of mobile wireless network, known as a mobile ad hoc network (MANET), has drawn constant attention. In recent years, several routing protocols for MANETs have been proposed. However, there still remains the need for mechanisms for better scalability support with respect to network size, traffic volume, and mobility. To address this issue, a new method for multi-hop routing in MANETs called Dynamic NIx-Vector Routing (DNVR) is proposed. DNVR has several distinct features compared to other existing on-demand routing protocols, which lead to more stable routes and better scalability.
Currently, ad hoc routing protocols lack load-balancing capabilities. Therefore they often fail to provide good service quality, especially in the presence of a large volume of network traffic since the network load concentrates on some nodes, resulting in a highly congested environment. To address this issue, a novel load-balancing technique for ad hoc on-demand routing protocols is proposed. The new method is simple but very effective in achieving load balance and congestion alleviation. In addition, it operates in a completely distributed fashion.
To evaluate and verify wireless network protocols effectively, especially to test their scalability properties, scalable and efficient network simulation methods are required. Usually simulation of such large-scale wireless networks needs a long execution time and requires a large amount of computing resources such as powerful CPUs and memory. Traditionally, to cope with this problem, parallel network simulation techniques with parallel computing capabilities have been considered. This dissertation explores a different type of method, which is efficient and can be achieved with a sequential simulation, as well as a parallel and distributed technique for large-scale mobile wireless networks.
17
Raad, Raad. "Neuro-fuzzy admission control in mobile communications systems". Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20061030.153500/index.html.
Pełny tekst źródła
18
Bani, Yassein Muneer O. "On the performance of probabilistic flooding in wireless mobile ad hoc networks". Thesis, Connect to e-thesis, 2006. http://theses.gla.ac.uk/720/.
Pełny tekst źródłaStreszczenie:
Thesis (Ph.D.) - University of Glasgow, 2006.Ph.D. thesis submitted to the Faculty of Information and Mathematical Sciences, University of Glasgow, 2006. Includes bibliographical references. Print version also available.
19
Gonzalez, Valenzuela Sergio. "A service-oriented approach to topology formation and resource discovery in wireless ad-hoc networks". Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/745.
Pełny tekst źródłaStreszczenie:
The past few years have witnessed a significant evolution in mobile computing and communications, in which new trends and applications have the traditional role of computer networks into that of distributed service providers. In this thesis we explore an alternative way to form wireless ad-hoc networks whose topologies can be customized as required by the users’ software applications. In particular, we investigate the applicability of mobile codes to networks created by devices equipped with Bluetooth technology. Computer simulations results suggest that our proposed approach can achieve this task effectively, while matching the level of efficiency seen in other salient proposals in this area.
This thesis also addresses the issue of service discovery in mobile ad-hoc networks. We propose the use of a directory whose network location varies in an attempt to reduce traffic overhead driven by users’ hosts looking for service information. We refer to this scheme as the Service Directory Placement Algorithm, or SDPA. We formulate the directory relocation problem as a Markov Decision Process that is solved by using Q-learning. Performance evaluations through computer simulations reveal bandwidth overhead reductions that range between 40% and 48% when compared with a basic broadcast flooding approach for networks comprising hosts moving at pedestrian speeds. We then extend our proposed approach and introduce a multi-directory service discovery system called the Service Directory Placement Protocol, or SDPP. Our findings reveal bandwidth overhead reductions typically ranging from 15% to 75% in networks comprising slow-moving hosts with restricted memory availability.
In the fourth and final part of this work, we present the design foundations and architecture of a middleware system that called WISEMAN – WIreless Sensors Employing Mobile Agents. We employ WISEMAN for dispatching and processing mobile programs in Wireless Sensor Networks (WSNs). Our proposed system enables the dynamic creation of semantic relationships between network nodes that cooperate to provide an aggregate service. We present discussions on the advantages of our proposed approach, and in particular, how WISEMAN facilitates the realization of service-oriented tasks in WSNs.
20
George, Glyco. "Bounded Dynamic Source Routing in Mobile Ad Hoc Networks". Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4264/.
Pełny tekst źródłaStreszczenie:
A mobile ad hoc network (MANET) is a collection of mobile platforms or nodes that come together to form a network capable of communicating with each other, without the help of a central controller. To avail the maximum potential of a MANET, it is of great importance to devise a routing scheme, which will optimize upon the performance of a MANET, given the high rate of random mobility of the nodes. In a MANET individual nodes perform the routing functions like route discovery, route maintenance and delivery of packets from one node to the other. Existing routing protocols flood the network with broadcasts of route discovery messages, while attempting to establish a route. This characteristic is instrumental in deteriorating the performance of a MANET, as resource overhead triggered by broadcasts is directly proportional to the size of the network. Bounded-dynamic source routing (B-DSR), is proposed to curb this multitude of superfluous broadcasts, thus enabling to reserve valuable resources like bandwidth and battery power. B-DSR establishes a bounded region in the network, only within which, transmissions of route discovery messages are processed and validated for establishing a route. All route discovery messages reaching outside of this bounded region are dropped, thus preventing the network from being flooded. In addition B-DSR also guarantees loop-free routing and is robust for a rapid recovery when routes in the network change.
21
Unal, Halim Unsem. "Implementation Of A Wireless Streaming System For Universal Multimedia Access". Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/4/1057652/index.pdf.
Pełny tekst źródłaStreszczenie:
This thesis describes a universal multimedia access system and its implementation
details. In the context of this thesis, universal multimedia access means accessing
multimedia content over ubiquitous computer networks, using different
computing platforms. The computer networks involve both wired and wireless
networks, and computing platforms involve wired PC&rsquos, mobile PC&rsquo
s and personal digital assistants (PDA). The system is built on client/server architecture. Video data is H.263 coded and carried over RTP. Java Media Framework is utilized and its capabilities are extended with special plug-ins when necessary.
22
Wohlers, Felix Ricklef Scriven. "Delay-tolerant data collection in sensor networks with mobile sinks". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:734533bd-04a2-47f3-9213-f326a5449029.
Pełny tekst źródłaStreszczenie:
Collecting data from sensor nodes to designated sinks is a common and challenging task in a wide variety of wireless sensor network (WSN) applications, ranging from animal monitoring to security surveillance. A number of approaches exploiting sink mobility have been proposed in recent years: some are proactive, in that sensor nodes push their read- ings to storage nodes from where they are collected by roaming mobile sinks, whereas others are reactive, in that mobile sinks pull readings from nearby sensor nodes as they traverse the sensor network. In this thesis, we point out that deciding which data collection approach is more energy-efficient depends on application characteristics, includ- ing the mobility patterns of sinks and the desired latency of collected data. We introduce novel adaptive data collection schemes that are able to automatically adjust to changing sink visiting patterns or data requirements, thereby significantly easing the deployment of a WSN. We illustrate cases where combining proactive and reactive modes of data collection is particularly beneficial. This motivates the design of TwinRoute, a novel hybrid algorithm that can flexibly mix the two col- lection modes at appropriate levels depending on the application sce- nario. Our extensive experimental evaluation, which uses synthetic and real-world sink traces, allows us to identify scenario characteristics that suit proactive, reactive or hybrid data collection schemes. It shows that TwinRoute outperforms the pure approaches in most scenarios, achiev- ing desirable tradeoffs between communication cost and timely delivery of sensor data.
23
Jun, Hyewon. "Power Management in Disruption Tolerant Networks". Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19879.
Pełny tekst źródłaStreszczenie:
Disruption Tolerant Networks (DTNs) are mobile wireless networks that are designed to work in highly-challenged environments where the density of nodes is insufficient to support direct end-to-end communication. Recent efforts in DTNs have shown that mobility provides a powerful means for delivering messages in such highly-challenging environments. Unfortunately, many mobility scenarios depend on untethered devices with limited energy supplies. Without careful management, depleted energy supplies will degrade network connectivity and counteract the robustness gained by mobility. A primary concern is the energy consumed by wireless communications because the wireless interface is one of the largest energy consumers in mobile devices whether they are actively communicating or just listening. However, mobile devices exhibit a tension between saving energy and providing connectivity through opportunistic encounters. In order to pass messages, the device must discover communication opportunities with other nodes. At the same time, energy can be conserved by ``sleeping,' i.e., turning off or disabling the wireless interfaces. However, if the wireless interface is asleep, the node cannot discover other nodes for communication. Thus, power management in DTNs must balance the discovery of other nodes while aggressively sleeping the radio during the remaining periods.
In this thesis, we first develop a power management framework for a single radio architecture that allows a node to save energy while discovering communication opportunities. The framework is tailored to the available knowledge about network connectivity over time. Further, the framework supports explicit trade-offs between energy savings and connectivity, so network operators can choose, for example, to conserve energy at the cost of reduced message delivery performance. We next examine the possibility of using a hierarchical radio architecture in which nodes are equipped with two complementary radios: a long-range, high-power radio and a short-range, low-power radio. In this architecture, energy can be conserved by using the low-power radio to discover communication opportunities with other nodes and waking the high-power radio to undertake the data transmission. However, the short range of the low-power radio may result in missing communication opportunities. Thus, we develop a generalized power management framework in which both radios support the discovery. In addition, we incorporate the knowledge of traffic load and network dynamics and devise approximation algorithms to control the sleep/wake-up cycling of the radios to provide maximum energy conservation while discovering enough communication opportunities to handle the expected traffic load. Finally, we investigate the Message Ferrying (MF) routing paradigm as a means to save energy while trading off data delivery delay. In MF, special nodes called ferries move around the deployment area to deliver messages for nodes. While this routing paradigm has been developed mainly to deliver messages in partitioned networks, here we explore its use in a connected MANET. The reliance on the movement of the ferries to deliver messages increases the delivery delay if a network is not partitioned. However, delegating message delivery to the ferries provides the opportunity for nodes to save energy by aggressively putting their radios to sleep when ferries are far away. To exploit this feature, we present a power management framework, in which nodes switch their power management modes based on the knowledge of ferry location.
24
Krishnakumar, Sita Srinivasaraghavan. "Intelligent actor mobility in wireless sensor and actor networks". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24735.
Pełny tekst źródłaStreszczenie:
Thesis (Ph.D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2008.Committee Chair: Abler, Randal T.; Committee Member: Copeland, John A.; Committee Member: Haas, Kevin; Committee Member: Moore II, Elliot; Committee Member: Owen III, Henry L.
25
Vassiliou, Vasos. "An integration framework and a signaling protocol for MPLS/DiffServ/HMIP radio access networks". Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/13732.
Pełny tekst źródła
26
Sun, Zhaohui, i n/a. "Improving Security in WLAN With the Use of Smart Antennas". Griffith University. School of Engineering, 2006. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070115.143811.
Pełny tekst źródłaStreszczenie:
Wireless communication systems are increasingly deployed by family, businesses, government and SOHO users because of the freedom wireless communications afford, simplicity of installation and ease of use. Along with its rapid development, the security problem in wireless communication network has attracted more and more attention. It has been estimated that the IEEE 80.211 standard is susceptible to attacks both on data content and user authentication, such as eavesdropping, spoofing and Denial of Service. These attacks are due to the standard's inherent flaws and space signal sharing caused by the omni-directional antenna it usually uses. In recent years, few studies have been undertaken which examine the use of the smart directional antenna to mitigate the security risks in mobile wireless computing networks. One of the major reasons is the antenna size, as portability is a key requirement. Due to the dielectric-material embedding and FDTD optimal design technology, a smart antenna with controllable directionality can now achieve an overall volume reduction of 80%. This has promise for application in the wireless security realm. This thesis provides a conventional background in wireless computing networks and security theory. In addition, security level definition, program in Matlab and corresponding experimental results are provided. To show the effectiveness of improving security in WLAN with the use of a smart directional antenna, this thesis proposes a model for predicting electromagnetic environments using a directional transmission antenna based on the Finite Element method. To validate the numerical results, a new experimental method (using Network Stumbler software) to measure the signal strength in different locations is introduced. Results from experiments using the two methods are consistent. The latter method gives the users the possibility of using a laptop (with an appropriate wireless card, software and roguing around) to detect the real-time signal strength in different locations instead of using expensive measure apparatus. Such an advantage can be valuable for the efficient implementation of indoor wireless networks for security purposes. Finally, it contributes a security solution using DE-ESMB and DE-ESPAR smart antennas in WLAN. Through these simulated and experimental results, one can conclude that the security performance in WLAN can be greatly improved by using smart directional antenna. There are five chapters in this thesis: Chapter 1 introduces the wireless communication network. Information about architecture, topology and popular wireless standards is presented in this chapter. Chapter 2 investigates the security problem in IEEE 802.11 Standards. Recent improvements in security, and their limitations, are also included. This problem is investigated by performing laboratory experiments, including a real attack on 802.11 Standards and packet capture experiments using AiroPeek NX software. Chapter 3 describes the useful parameters of smart directional antennas, and then presents the security level definition in WLAN. Simple software in Matlab to determine the security level according to the beamwidth of the adopted antenna is also introduced. Chapter 4 is the important part of this thesis. Simulation results of signal strength in different locations using FEMLAB are presented, which are consistent with the follow-up experimental results carried out in a typical office area. This chapter also describes the final security solution using the newly-designed DE-ESMB and DE-ESPAR directional antennas. Chapter 5 is a summary of the thesis. It presents the conclusions and suggests area of future research for improving the security level using smart antennas in WLAN.
27
Sun, Zhaohui. "Improving Security in WLAN With the Use of Smart Antennas". Thesis, Griffith University, 2006. http://hdl.handle.net/10072/366543.
Pełny tekst źródłaStreszczenie:
Wireless communication systems are increasingly deployed by family, businesses, government and SOHO users because of the freedom wireless communications afford, simplicity of installation and ease of use. Along with its rapid development, the security problem in wireless communication network has attracted more and more attention. It has been estimated that the IEEE 80.211 standard is susceptible to attacks both on data content and user authentication, such as eavesdropping, spoofing and Denial of Service. These attacks are due to the standard's inherent flaws and space signal sharing caused by the omni-directional antenna it usually uses. In recent years, few studies have been undertaken which examine the use of the smart directional antenna to mitigate the security risks in mobile wireless computing networks. One of the major reasons is the antenna size, as portability is a key requirement. Due to the dielectric-material embedding and FDTD optimal design technology, a smart antenna with controllable directionality can now achieve an overall volume reduction of 80%. This has promise for application in the wireless security realm. This thesis provides a conventional background in wireless computing networks and security theory. In addition, security level definition, program in Matlab™ and corresponding experimental results are provided. To show the effectiveness of improving security in WLAN with the use of a smart directional antenna, this thesis proposes a model for predicting electromagnetic environments using a directional transmission antenna based on the Finite Element method. To validate the numerical results, a new experimental method (using Network Stumbler software) to measure the signal strength in different locations is introduced. Results from experiments using the two methods are consistent. The latter method gives the users the possibility of using a laptop (with an appropriate wireless card, software and roguing around) to detect the real-time signal strength in different locations instead of using expensive measure apparatus. Such an advantage can be valuable for the efficient implementation of indoor wireless networks for security purposes. Finally, it contributes a security solution using DE-ESMB and DE-ESPAR smart antennas in WLAN. Through these simulated and experimental results, one can conclude that the security performance in WLAN can be greatly improved by using smart directional antenna. There are five chapters in this thesis: Chapter 1 introduces the wireless communication network. Information about architecture, topology and popular wireless standards is presented in this chapter. Chapter 2 investigates the security problem in IEEE 802.11 Standards. Recent improvements in security, and their limitations, are also included. This problem is investigated by performing laboratory experiments, including a real attack on 802.11 Standards and packet capture experiments using AiroPeek NX software. Chapter 3 describes the useful parameters of smart directional antennas, and then presents the security level definition in WLAN. Simple software in Matlab™ to determine the security level according to the beamwidth of the adopted antenna is also introduced. Chapter 4 is the important part of this thesis. Simulation results of signal strength in different locations using FEMLAB™ are presented, which are consistent with the follow-up experimental results carried out in a typical office area. This chapter also describes the final security solution using the newly-designed DE-ESMB and DE-ESPAR directional antennas. Chapter 5 is a summary of the thesis. It presents the conclusions and suggests area of future research for improving the security level using smart antennas in WLAN.Thesis (Masters)
Master of Philosophy (MPhil)
School of Engineering
Full Text
28
Tran-Thi-Thuy, Trang. "Secure data aggregation for wireless sensor network". Thesis, Norwegian University of Science and Technology, Department of Telematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10912.
Pełny tekst źródłaStreszczenie:
Like conventional networks, security is also a big concern in wireless sensor networks. However, security in this type of networks faces not only typical but also new challenges. Constrained devices, changing topology or susceptibility to unprecedented security threats such as node capture and node compromise has refrained developers from applying conventional security solutions into wireless sensor networks. Hence, developing security solutions for wireless sensor networks not only requires well security analysis but also offers a low power and processing consuming.In this thesis, we implemented security solution targeting IRIS sensor motes. In our implementation, a public key-based key exchange is used to establish shared secret keys between sensor nodes. These secret keys are used to provide authenticity, integrity and freshness for transmission data. Our implementation ensures the flexibility in integrating our solution with available TinyOS operating system. Additionally, the thesis work also focuses on evaluating the performance in wireless sensor networks both in memory and energy consuming.
29
Keshariya, Mayank. "Extended Policy-Based Management Framework to Provide Always Best Connected Services in Heterogeneous Mobile Environments". Thesis, University of Canterbury. Computer Science and Software Engineering, 2009. http://hdl.handle.net/10092/2549.
Pełny tekst źródłaStreszczenie:
The growth in the popularity of Internet services, increasing demands of mobile users together with a wide range of access technologies and mobile-networked devices, introduces the notion of integration and inter-working of heterogeneous access networks. Sometimes referred to as 4th generation (4G) networks, the overall objective of this research is to provide a managed Always Best Connected (ABC) service over underlying heterogeneous wireless and mobile platforms while maintaining negotiated security and Quality of Service in a scalable and modular environment. This research proposes a new model and its architecture for policy-based management (PBM) to provide a framework for the centralised management of networks based on business-level policies. This work extends existing IETF Policy-based Network Management (PBNM) model by introducing a new layered-approach which facilitates the negotiation of management services over interconnected heterogeneous mobile platforms, thus achieving an ABC scenario. The proposed layered-approach provides flexibility to the organisations so that they can choose favourable semantic and syntactic approaches and facilitates the separation of management policies from their implementation in a distributed and heterogeneous environment. The extended Policy Information Model and a new policy conflict detection technique are also introduced. Further, we have proposed and implemented a new model of a policy-managed mobile client and its architecture to support seamless handoff across multiple access networks. The proposed mobile client supports multi-domain authentication and security along with downloadable user profiles. We have also proposed and implemented a network selection algorithm and introduced a new Infrastructure parameter, which assists in selecting an optimum time and the best available access network to handoff. We present performance analysis to validate our architectural approach.
30
Tsao, Cheng-Lin. "Rapid application mobilization and delivery for smartphones". Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/49022.
Pełny tekst źródłaStreszczenie:
Smartphones form an emerging mobile computing platform that has hybrid characteristics borrowed from PC and feature phone environments. While maintaining great mobility and portability as feature phones, smartphones offers advanced computation capabilities and network connectivity. Although the smartphone platform can support PC-grade applications, the platform exhibits fundamentally different characteristics from the PC platform. Two important problems arise in the smartphone platform: how to mobilize applications and how to deliver them effectively. Traditional application mobilization involves significant cost in development and typically provides limited functionality of the PC version. Since the mobile applications rely on the embedded wireless interfaces of smartphones for network access, the application performance is impacted by the inferior characteristics of the wireless networks. Our first contribution is super-aggregation, a rapid application delivery protocol that in tandem uses the multiple interfaces intelligently to achieve a performance that is ``better than the sum of throughputs' achievable through each of the interfaces individually. The second contribution is MORPH, a remote computing protocol for heterogeneous devices that transforms the application views on the PC platform into smartphone-friendly views. MORPH virtualizes application views independent of the UI framework used into an abstract representation called virtual view. It allows transformation services to be easily programmed to realize a smartphone friendly view by manipulating the virtual view. The third contribution is the system design of super-aggregation and MORPH that achieve rapid application delivery and mobilization. Both solutions require only software modifications that can be easily deployed to smartphones.
31
Nguyen, Van Minh. "Wireless Link Quality Modelling and Mobility Management for Cellular Networks". Phd thesis, Telecom ParisTech, 2011. http://tel.archives-ouvertes.fr/tel-00702798.
Pełny tekst źródłaStreszczenie:
La qualité de communication dans un réseau sans fil est déterminée par la qualité du signal, et plus précisément par le rapport signal à interférence et bruit. Cela pousse chaque récepteur à se connecter à l'émetteur qui lui donne la meilleure qualité du signal. Nous utilisons la géométrie stochastique et la théorie des extrêmes pour obtenir la distribution de la meilleure qualité du signal, ainsi que celles de interférence et du maximum des puissances reçues. Nous mettons en évidence comment la singularité de la fonction d'affaiblissement modifie leurs comportements. Nous nous intéressons ensuite au comportement temporel des signaux radios en étudiant le franchissement de seuils par un processus stationnaire X (t). Nous démontrons que l'intervalle de temps que X (t) passe au-dessus d'un seuil γ → −∞ suit une distribution exponentielle, et obtenons 'egalement des r'esultats caract'erisant des franchissements par X (t) de plusieurs seuils adjacents. Ces r'esultats sont ensuite appliqu'es 'a la gestion de mobilit'e dans les r'eseaux cellulaires. Notre travail se concentre sur la fonction de 'handover measurement'. Nous identifions la meilleure cellule voisine lors d'un handover. Cette fonction joue un rôle central sur expérience perçue par l'utilisateur. Mais elle demande une coopération entre divers mécanismes de contrôle et reste une question difficile. Nous traitons ce problème en proposant des approches analytiques pour les réseaux émergents de types macro et pico cellulaires, ainsi qu'une approche d'auto- optimisation pour les listes de voisinage utilisées dans les réseaux cellulaires actuels.
32
Banh, Mai. "Quantification, characterisation and impact evaluation of mobile IPv6 hand off times". Australasian Digital Thesis Program, 2007. http://adt.lib.swin.edu.au/public/adt-VSWT20070608.094836/index.html.
Pełny tekst źródłaStreszczenie:
Thesis (MEng) - Swinburne University of Technology, Centre for Advanced Internet Architectures, 2005.[A thesis submitted in total fulfillment of the requirements of for the degree of ] Masters of Engineering by Research, Centre for Advanced Internet Architectures (CAIA), Faculty of Information and Communication Technologies, Swinburne University of Technology, 2005. Typescript. Bibliography p. 153-159.
33
Zhang, Huiqi. "Socioscope: Human Relationship and Behavior Analysis in Mobile Social Networks". Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc30533/.
Pełny tekst źródłaStreszczenie:
The widely used mobile phone, as well as its related technologies had opened opportunities for a complete change on how people interact and build relationship across geographic and time considerations. The convenience of instant communication by mobile phones that broke the barrier of space and time is evidently the key motivational point on why such technologies so important in people's life and daily activities. Mobile phones have become the most popular communication tools. Mobile phone technology is apparently changing our relationship to each other in our work and lives. The impact of new technologies on people's lives in social spaces gives us the chance to rethink the possibilities of technologies in social interaction. Accordingly, mobile phones are basically changing social relations in ways that are intricate to measure with any precision. In this dissertation I propose a socioscope model for social network, relationship and human behavior analysis based on mobile phone call detail records. Because of the diversities and complexities of human social behavior, one technique cannot detect different features of human social behaviors. Therefore I use multiple probability and statistical methods for quantifying social groups, relationships and communication patterns, for predicting social tie strengths and for detecting human behavior changes and unusual consumption events. I propose a new reciprocity index to measure the level of reciprocity between users and their communication partners. The experimental results show that this approach is effective. Among other applications, this work is useful for homeland security, detection of unwanted calls (e.g., spam), telecommunication presence, and marketing. In my future work I plan to analyze and study the social network dynamics and evolution.
34
Sakai, Kazuya. "Security and Privacy in Large-Scale RFID Systems". The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1386006971.
Pełny tekst źródła
35
Cheung, Kin Pong. "Performance evaluation of scheduling algorithms on Bluetooth piconet and scatternet network /". View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20CHEUNG.
Pełny tekst źródłaStreszczenie:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.Includes bibliographical references (leaves 63-66). Also available in electronic version. Access restricted to campus users.
36
Chung, W. Y. (Wan-Young). "Ubiquitous healthcare system based on a wireless sensor network". Doctoral thesis, University of Oulu, 2009. http://urn.fi/urn:isbn:9789514292903.
Pełny tekst źródłaStreszczenie:
Abstract
This dissertation aimed at developing a multi-modal sensing u-healthcare system (MSUS), which reflects the unique properties of a healthcare application in a wireless sensor network. Together with health parameters, such as ECG, SpO2 and blood pressure, the system also transfers context-aware data, including activity, position and tracking data, in a wireless sensor network environment at home or in a hospital.
Since packet loss may have fatal consequences for patients, health-related data are more critical than most other types of monitoring data. Thus, compared to environmental, agricultural or industrial monitoring, healthcare monitoring in a wireless environment imposes different requirements and priorities. These include heavy data traffic with wavelike parameters in wireless sensor network and fatal data loss due to the traffic. To ensure reliable data transfer in a wireless sensor network, this research placed special emphasis on the optimization of sampling rate, packet length and transmission rate, and on the traffic reduction method.
To improve the reliability and accuracy of diagnosis, the u-healthcare system also collects context-aware information on the user’s activity and location and provides real-time tracking.
Waveform health parameters, such as ECG, are normally sampled in the 100 to 400 Hz range according to the monitoring purpose. This type of waveform data may incur a heavy burden in wireless communication. To reduce wireless traffic between the sensor nodes and the gateway node, the system utilizes on-site ECG analysis implemented on the sensor nodes as well as query architecture. A 3D VRML viewer was also developed for the realistic monitoring of the user’s moving path and location.
Two communication methods, an 802.15.4-based wireless sensor network and a CDMA cellular network are used by sensors placed on the users’ bodies to gather medical data, which is then transmitted to a server PC at home or in the hospital, depending on whether the sensor is within or outside the range of the wireless sensor network.
37
Wu, Hao. "Analysis and Design of Vehicular Networks". Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7639.
Pełny tekst źródłaStreszczenie:
Advances in computing and wireless communication technologies have increased interest in smart vehicles, vehicles equipped with significant computing, communication and sensing capabilities to provide services to travelers. Smart vehicles can be exploited to improve driving safety and comfort as well as optimize surface transportation systems. Wireless communications among vehicles and between vehicles and roadside infrastructures represent an important class of vehicle communications.
One can envision creating an integrated radio network leveraging various wireless technologies that work together in a seamless fashion. Based on cost-performance tradeoffs, different network configurations may be appropriate for different environments. An understanding of the properties of different vehicular network architectures is absolutely necessary before services can be successfully deployed. Based on this understanding, efficient data services (e.g., data dissemination services) can be designed to accommodate application requirements.
This thesis examines several research topics concerning both the evaluation and design of vehicular networks.
We explore the properties of vehicle-to-vehicle (v2v) communications. We study the spatial propagation of information along the road using v2v communications. Our analysis identifies the vehicle traffic characteristics that significantly affect information propagation. We also evaluate the feasibility of propagating information along a highway.
Several design alternatives exist to build infrastructure-based vehicular networks. Their characteristics have been evaluated in a realistic vehicular environment. Based on these evaluations, we have developed some insights into the design of future broadband vehicular networks capable of adapting to varying vehicle traffic conditions.
Based on the above analysis, opportunistic forwarding that exploit vehicle mobility to overcome vehicular network partitioning appears to be a viable approach for data dissemination using v2v communications for applications that can tolerate some data loss and delay. We introduce a methodology to design enhanced opportunistic forwarding algorithms. Practical algorithms derived from this methodology have exhibited different performance/overhead tradeoffs.
An in-depth understanding of wireless communication performance in a vehicular environment is necessary to provide the groundwork for realizing reliable mobile communication services. We have conducted an extensive set of field experiments to uncover the performance of short-range communications between vehicles and between vehicles and roadside stations in a specific highway scenario.
38
Benin, Joseph Thomas. "Unified distribution of pseudonyms in hybrid ephemeral vehicular networks". Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45910.
Pełny tekst źródłaStreszczenie:
This research devises a unified method for the distribution of pseudonyms in hybrid ephemeral vehicular networks (VNs), which are often referred to as vehicular ad hoc networks (VANETs), for the purposes of refill, intra-regional, and inter-regional movement. This work addresses a significant impediment to the use of pseudonyms, which has been almost universally accepted (and is on the verge of being standardized by the Institute for Electrical and Electronic Engineers (IEEE) and the Society for Automotive Engineers (SAE) as the best means to balance attribution and privacy to maximize the value of infrastructure deployment and citizen acceptability (i.e. use). The results include a pseudonym distribution protocol that maximizes ease of use while not compromising the security or privacy pseudonyms afford. These results contribute to the solution, in a scalable, adaptive, and bandwidth efficient manner, one of the remaining impediments to the adoption of VANETs. The new method shows improved performance compared to a baseline pseudonym distribution method that does not take these factors into consideration.
39
Allam, Sean. "A model to measure the maturuty of smartphone security at software consultancies". Thesis, University of Fort Hare, 2009. http://hdl.handle.net/10353/281.
Pełny tekst źródłaStreszczenie:
Smartphones are proliferating into the workplace at an ever-increasing rate, similarly the threats that they pose is increasing. In an era of constant connectivity and availability, information is freed up of constraints of time and place. This research project delves into the risks introduced by smartphones, and through multiple cases studies, a maturity measurement model is formulated. The model is based on recommendations from two leading information security frameworks, the COBIT 4.1 framework and ISO27002 code of practice. Ultimately, a combination of smartphone specific risks are integrated with key control recommendations, in providing a set of key measurable security maturity components. The subjective opinions of case study respondents are considered a key component in achieving a solution. The solution addresses the concerns of not only policy makers, but also the employees subjected to the security policies. Nurturing security awareness into organisational culture through reinforcement and employee acceptance is highlighted in this research project. Software consultancies can use this model to mitigate risks, while harnessing the potential strategic advantages of mobile computing through smartphone devices. In addition, this research project identifies the critical components of a smartphone security solution. As a result, a model is provided for software consultancies due to the intense reliance on information within these types of organisations. The model can be effectively applied to any information intensive organisation.
40
Gikaru, Wilfred Githuka. "Mobility based routing overhead management in reconfigurable wireless ad hoc networks". Doctoral thesis, [S.l. : s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=97340423X.
Pełny tekst źródła
41
Li, Yingjie. "Information dissemination and routing in communication networks". Columbus, Ohio : Ohio State University, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1132767756.
Pełny tekst źródła
42
Oliveira, Filho Jorge Lima de 1979. "Uma arquitetura para gerência de mobilidade cognitiva em redes sem fio heterogêneas". [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275635.
Pełny tekst źródłaStreszczenie:
Orientador: Edmundo Roberto Mauro MadeiraTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-23T07:19:08Z (GMT). No. of bitstreams: 1 OliveiraFilho_JorgeLimade_D.pdf: 4901235 bytes, checksum: e6b9bb2a16e6d8b4b4cac7d26265847a (MD5) Previous issue date: 2013
Resumo: Atualmente há uma necessidade das pessoas estarem conectadas a todo o momento e em qualquer lugar utilizando seus MNs (Mobile Nodes) para realizarem suas tarefas. É desejável uma Internet disponível a todo instante. Porém, a integração das redes sem fio de tecnologias diferentes apresenta vários desafios, como por exemplo, manter a continuidade dos serviços que rodam no MN quando há uma troca de rede. Percebendo a demanda crescente por mobilidade e de uma necessidade de uma Internet ubíqua, o IEEE padronizou um conjunto de serviços e protocolos com o intuito de integrar as redes de diferentes tecnologias denominadas IEEE 802.21. Entretanto, não fazem parte do padrão alguns mecanismos necessários para suportar mobilidade nas redes heterogêneas, como por exemplo, o algoritmo de decisão para a escolha da rede e o mecanismo de gerência de handover. Além disso, a demanda por mobilidade exige um mecanismo de gerência diferenciado devido à heterogeneidade dos elementos e a dinâmica do ambiente das redes sem fio heterogêneas. Para lidar com esses desafios, este trabalho apresenta uma arquitetura de gerência de mobilidade cognitiva para redes sem fio heterogêneas. Essa arquitetura é baseada no IEEE 802.21 e é capaz de integrar diversas redes com tecnologias diferentes e de suportar mobilidade mantendo a continuidade dos serviços quando o MN troca de uma rede para outra. Foi desenvolvido para esta arquitetura um algoritmo cognitivo de decisão de handover que seleciona as redes baseado nas experiências prévias dos MNs. Esse algoritmo utiliza como métrica de decisão as perdas dos fluxos TCP configurados nos MNs. O módulo cognitivo embutido na arquitetura foi uma evolução do resultado de pesquisa da nossa proposta de um algoritmo cognitivo para reconfiguração dos parâmetros do IEEE 802.11, denominado CogMAC. O CogMAC é uma proposta descentralizada, ou seja, os MNs que o implementam não possuem uma visão total da rede, cada MN individualmente é capaz de monitorar o desempenho e reconfigurar os parâmetros da subcamada MAC para evitar degradação do desempenho devido a mudanças nas condições da rede. O CogMAC é avaliado através de simulações e de um testbed real e os resultados comparados confirmam sua eficácia. Já a arquitetura de gerência cognitiva é avaliada através de simulações, e os resultados são comparados com o algoritmo que prioriza a conexão das redes WiFi. Os resultados obtidos confirmam também o bom desempenho da arquitetura proposta
Abstract: The mobile nodes (MNs) have become popular nowadays, the rapid increase in the use of wireless technologies has changed the behavior of individuals and businesses in the way they communicate. Currently, there is a demand for people to be connected all time and everywhere by using their MNs to perform their tasks. It is desirable to have a ubiquitous Internet, available at any moment and everywhere. However, the integration of heterogeneous wireless networks introduces several challenges. One of the most challenging issues is service continuity during handovers. As a result of the high demand for mobility, IEEE has created a set of services and protocols in order to integrate heterogeneous networks, called IEEE 802.21. However, there are no mechanisms in the standard in order to support mobility in heterogeneous networks, such as decision algorithms and mechanisms to perform the handover. Moreover, the mobility demand requires a special management mechanism due to the elements' diversity and the dynamic environment of the heterogeneous wireless networks. In order to tackle these challenges, this work presents cognitive mobility management architecture for heterogeneous wireless networks. This architecture is based on the IEEE 802.21 and is able to integrate different networks with different technologies and supporting mobility while maintaining service continuity when the MN performs a handover. A handover decision algorithm was developed for this architecture to select networks based on the previous experiences of MNs. This algorithm uses as decision metric the TCP loss in the MNs. The cognitive module in the architecture is an evolution of research results of our proposed algorithm for reconfiguration of cognitive parameters of the IEEE 802.11, called CogMAC. The CogMAC is a completely distributed proposal capable to monitor the MAC layer performance and react to changes to avoid performance degradation. The CogMAC is evaluated by simulations and real testbed and the results are compared with the first-WiFi algorithm. This algorithm prioritizes the connection of WiFi networks. The results also confirm the good performance of the proposed architecture
Doutorado
Ciência da Computação
Doutor em Ciência da Computação
43
Iwasaki, Yohei, Nobuo Kawaguchi i Yasuyoshi Inagaki. "Azim : Direction-Based Service System for Both Indoors and Outdoors". IEICE, 2005. http://hdl.handle.net/2237/7820.
Pełny tekst źródła
44
Mahfoudh, Saoucene. "Energy efficiency in wireless ad hoc and sensor networks : routing, node activity scheduling and cross-layering". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00757251.
Pełny tekst źródłaStreszczenie:
In this thesis, we consider wireless ad hoc and sensor networks where energy matters. Indeed, sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. This energy can be very expensive, difficult or even impossible to renew. Energy efficient strategies are required in such networks to maximize network lifetime. We distinguish four categories of strategies: 1. Energy efficient routing, 2. Node activity scheduling, 3. Topology control by tuning node transmission power and 4. Reduction of the volume of information transferred. Our contribution deals with energy efficient routing and node activity scheduling. For energy efficient routing, the idea consists in reducing the energy spent in the transmission of a packet from its source to its destination, while avoiding nodes with low residual energy. The solution we propose, called EOLSR, is based on the link state OLSR routing protocol. We show by simulation that this solution outperforms the solution that selects routes minimizing the end-to-end energy consumption, as well as the solution that builds routes based on node residual energy. We then show how we can improve the benefit of energy efficient routing using cross layering. Informa- tion provided by the MAC layer improves the reactivity of the routing protocol and the robustness of routes. Moreover, taking into account the specificities of some applications like data gathering allows the routing protocol to reduce its overhead by maintaining routes only to the sink nodes. Concerning node activity scheduling, since the sleep state is the least power consuming state, our aim is to schedule node state between sleeping and active to minimize energy consumption while ensuring network and application functionalities. We propose a solution, called SERENA, based on node coloring. The idea is to assign a color to each node, while using a small number of colors and ensuring that two nodes with the same color can transmit without interfering. This color is mapped into a slot in which the node can transmit its messages. Consequently, each node is awake during its slot and the slots granted to its one-hop neighbors. It sleeps the remaining time. We show how this algorithm can adapt to different application requirements: broadcast, immediate acknowledgement of unicast transmissions... The impact of each additional requirement is evaluated by simulation. An originality of this work lies in taking into account real wireless propagation conditions. Color conflicts are then possible. A cross-layering approach with the MAC layer is used to solve these conflicts. We also show how cross-layering with the application layer can improve the coloring per- formance for data gathering applications. This work has been done for the ANR OCARI project whose aim is to design and implement a wireless sensor network for applications in harsh environments such as power plants and war- ships. The network layer including SERENA and EOLSR has been specified and is now under implementation.
45
Banh, Mai Thi Quynh, i n/a. "Quantification, characterisation and impact evaluation of mobile IPv6 hand off times". Swinburne University of Technology, 2005. http://adt.lib.swin.edu.au./public/adt-VSWT20070608.094836.
Pełny tekst źródłaStreszczenie:
There is a growing range of IP-based data and voice applications using mobile devices (e.g. 3rd ,
4th generation mobile phones and PDAs) and new access technologies (e.g. Bluetooth, 802.11,
GPRS, ADSL). This growth is driving a desire to support mobility at the IP level � in other
words, allowing an IP host to keep on communicating with other hosts while roaming between
different IP subnetworks.
Mobile IPv6 allows hosts to move their physical and topological attachment points around
an IPv6 network while retaining connectivity through a single, well-known Home Address.
Although Mobile IPv6 has been the subject of simulation studies, the real-world dynamic
behavior of Mobile IPv6 is only gradually being experimentally characterised and analysed.
This thesis reviews the use of Mobile IPv6 to support mobility between independent
802.11b-attached IPv6 subnets, and experimentally measures and critically evaluates how long
an end to end IP path is disrupted when a Mobile IPv6 node shifts from one subnetwork to
another (handoff time). The thesis describes the development of an experimental testbed
suitable for gathering real-world Mobile IPv6 handoff data using publicly available, standards compliant
implementations of Mobile IPv6. (An open-source Mobile IPv6 stack (the KAME
release under FreeBSD) was deployed).
The component of handoff time due to 802.11b link layer handoff is measured separately to
assess its impact on the overall Mobile IPv6 handoff time. Using Mobile IPv6 handoff results,
the likely performance impact of Mobile IPv6 handoff on a common webcam application and a
bulk TCP data transfer is also evaluated. The impact of handoff on these applications clearly
shows that a default Mobile IPv6 environment would be highly disruptive to real-time and
interactive applications during handoff events, even if the underlying link-layer handoff was
instantaneous.
46
Gomes, Diego Souza. "Acesso Móvel aos Serviços do Middleware InteGrade". Universidade Federal do Maranhão, 2009. http://tedebc.ufma.br:8080/jspui/handle/tede/425.
Pełny tekst źródłaStreszczenie:
Made available in DSpace on 2016-08-17T14:53:06Z (GMT). No. of bitstreams: 1
Diego_Souza_Gomes.pdf: 2086164 bytes, checksum: d2a9f245dd16522cb21c6fcb10bb8447 (MD5)
Previous issue date: 2009-12-07Mobile computing technologies and wireless networks have evolved very quickly. Nowadays, many of the portable devices have significant processing power, storage and communication capacity. At the same time, grid computing technology became an important tool for collaborative work among users and organizations enabling the sharing of computing resources and services through multiple administrative domains. Due to the popularity of mobile computing, users of handheld devices form an important and new segment of the computing grid, assuming both the role of consumers and providers of resources and services. The integration of these two categories of distributed systems aims to extend the capabilities of portable devices, enabling access to a infrastructure of shared resources, as well as provide faster and easier means for grid services users to access information produced by these systems at any time and place. This work describes the MInteGrade (Mobile InteGrade), a software infrastructure that provides access to the InteGrade grid middleware from mobile devices connected through IEEE 802.11 wireless networks in infrastructure mode, and Bluetooth networks in Ad hoc mode. Through this mechanism for access to a computational grid, mobile clients can request the execution of applications on the grid, monitor the execution of applications and view the computation results already completed. The MInteGrade was designed so as to consider the dynamics of wireless networks. Specifically, it supports disconnections of devices and dynamic changes of the Ad hoc network topology, aswell as content adaptation of the output of the grid computations.
Tecnologias de computação móvel e de redes sem fio têm evoluído muito rapidamente, de forma que muitos dos dispositivos portáteis possuem atualmente considerável capacidade de processamento, armazenamento e comunicação. Paralelo a isso, a tecnologia de grades computacionais se consolidou como um ferramental importante para o trabalho colaborativo entre usuários e organizações, através do compartilhamento de recursos e serviços computacionais entre múltiplos domínios administrativos. Devido a esta popularização da computação móvel, usuários de dispositivos portáteis formam um importante e novo segmento da computação em grade, assumindo tanto o papel de usuários como também de provedores de recursos e serviços. A integração dessas duas categorias de sistemas distribuídos, objetiva estender as capacidades dos dispositivos computacionais móveis através do acesso a uma infra-estrutura de recursos compartilhados, além de fornecer aos usuários de serviços de grade meios mais rápidos e fáceis de acesso as informações produzidas por estes sistemas em qualquer hora e lugar. Este trabalho descreve oMInteGrade (Mobile InteGrade), uma infra-estrutura de software para acesso aos serviços do middleware de grade InteGrade a partir de dispositivos móveis conectados através de redes sem fio IEEE 802.11 em modo infraestruturado e redes bluetooth em modo Ad hoc. Através deste mecanismo para acesso a uma grade de computadores, clientes móveis podem solicitar a execução de aplicações na grade, realizar o acompanhamento da execução das aplicações e visualizar o resultado de computações já concluídas. O MInteGrade foi projetado para levar em consideração o dinamismo das redes sem fio, provendo suporte a períodos de desconexão e variações na topologia das redes Ad hoc, bem como a adaptação de conteúdo dos resultados das computações realizadas pela grade.
47
Ergüt, Salih. "Context-aware computing for wireless networks". Diss., [La Jolla] : University of California, San Diego, 2010. http://wwwlib.umi.com/cr/ucsd/fullcit?p3402341.
Pełny tekst źródłaStreszczenie:
Thesis (Ph. D.)--University of California, San Diego, 2010.Title from first page of PDF file (viewed May 14, 2010). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references.
48
Meneguette, Rodolfo Ipolito 1984. "Uma arquitetura de gerência de mobilidade para redes veiculares". [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275504.
Pełny tekst źródłaStreszczenie:
Orientadores: Edmundo Roberto Mauro Madeira, Luiz Fernando BittencourtTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-24T15:34:12Z (GMT). No. of bitstreams: 1 Meneguette_RodolfoIpolito_D.pdf: 3843404 bytes, checksum: 77fcd1e3b13f66d77af6e7537e8105fc (MD5) Previous issue date: 2013
Resumo: Redes Ad Hoc Veiculares (VANETs) constituem uma subclasse das redes Ad Hoc móveis que provê uma conexão sem fio entre veículos bem como entre veículos e dispositivos de acostamento. Essas redes proveem aplicações que focam na segurança do condutor, em fornecer maior eficiência do tráfego dos veículos nas vias públicas e em trazer algum conforto e entretenimento para os passageiros ao longo de sua viagem. Algumas dessas aplicações precisam estar conectadas com a internet através de um ponto de acesso que encontra-se no acostamento, como uma torre celular ou uma torre WiFi. Essa conexão pode gerar uma sobrecarga de mensagens de controle e pode sofrer uma troca de ponto de acesso que impacta no desempenho da aplicação. Além da interface de conexão com o ponto de acesso, o veículo é equipado com várias outras interfaces de redes vinculadas a diferentes tecnologias, podendo tirar vantagens do uso simultâneo dessas diversas interfaces de rede, com isso, maximizando a vazão e diminuindo a latência. Entretanto, esse uso pode aumentar ainda mais a sobrecarga das mensagens de controle, tendo como consequencia o aumento do tempo de troca de um ponto de acesso a outro, afetando a vazão da rede e o seu desempenho. Para superar esses desafios e prover uma boa qualidade de serviço para a aplicação, ou seja, atender aos requisitos mínimos que as aplicações das redes veiculares necessitam, desenvolvemos e avaliamos uma arquitetura para o gerenciamento de mobilidade de fluxo baseado nas classes de aplicações das redes veiculares. A arquitetura tem como objetivo minimizar o tempo da troca de conexão do fluxo, diminuir a quantidade de perda de pacotes e diminuir o tempo de entrega das mensagens, a fim de cumprir com os requisitos mínimos das classes de aplicação veicular, bem como maximizar o desempenho das aplicações. A arquitetura foi implementada no Network Simulator versão 3 para análise do comportamento da arquitetura em diversos tipos de cenário de simulação. Além da análise da arquitetura, também foram analisados alguns dos seus módulos separadamente. O resultado dessas análises, tanto dos módulos como da arquitetura, mostrou que a arquitetura proposta apresentou um baixo tempo de entrega, com menor perda de pacotes e menor atraso
Abstract: Vehicular Ad Hoc Networks (VANETs) constitutes a subclass of mobile Ad Hoc Networks that provides a wireless connection between vehicles and between vehicles and roadside devices. These networks provide applications that focus on driver safety, traffic efficiency of vehicles on public roads, and in the comfort and entertainment to passengers throughout their journey. Some of these applications need to be connected to the Internet via an access point in the roadside, like a cell tower or WiFi tower. This connection can generate an overhead of control messages and could suffer a change of access point that can impact the performance of the application. Besides the interface connected to the access point, the vehicle is equipped with other network interfaces linked with different technologies, thus the vehicular application can take advantage of the simultaneous use of these various network interfaces, thereby maximizing throughput and reducing latency. However, this use can increase the overhead of control message, and the time of exchange of one access point to another, thus affecting the network throughput and consequently the performance of the application. To overcome these challenges and provide a good quality of service to the application, i.e., attend the minimum requirements that applications for vehicular networks need, we developed and evaluated an architecture for flow mobility management based on classes of applications of vehicular networks. The architecture aims to minimize the time of the exchange of the connection flow, decrease the amount of packet loss, and reduce the delivery time of messages in order to comply with the minimum requirements for vehicular application classes as well as to maximize the application performance. The architecture was implemented in Network Simulator version 3 to analyze the behavior of the architecture in various types of scenarios. Besides the analysis of the architecture, we also analyzed some of the modules of the architecture separately. The results of these analyses of both the architecture and its modules showed a low delivery time, lower packet loss and lower delay
Doutorado
Ciência da Computação
Doutor em Ciência da Computação
49
Haghnegahdar, Alireza. "Interference in wireless mobile networks". Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/46713.
Pełny tekst źródłaStreszczenie:
Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius (i.e., a power level) to each node such that the resulting communication graph is connected, while minimizing the maximum (respectively, average) interference. We consider the model introduced by von Rickenbach et al. (2005), in which each wireless node is represented by a point in Euclidean space on which is centered a transmis- sion range represented by a ball, and edges in the corresponding graph are symmetric. The problem is NP-complete in two or more dimensions (Buchin 2008) and no polynomial-time approximation algorithm is known. We show how to solve the problem efficiently in settings typical for wireless ad hoc networks. We show that if node positions are represented by a set P of n points selected uniformly and independently at random over a d-dimensional region, then the topology given by the closure of the Euclidean minimum spanning tree of P has O(log n) maximum interference, O(1) average inter- ference with high probability and O(1) expected average interference. This work is the first to examine average interference in random settings. We extend the first bound to a general class of communication graphs over a broad set of probability distributions. We present a local algorithm that constructs a graph from this class; this is the first local algorithm to provide an upper bound on expected maximum interference. To verify our results, we perform an empirical evaluation using synthetic as well as real world node placements.
50
Chen, Xuetao. "Resource Allocation for Wireless Distributed Computing Networks". Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/77054.
Pełny tekst źródłaStreszczenie:
Wireless distributed computing networks (WDCNs) will become the next frontier of the wireless industry as the performance of wireless platforms is being increased every year and wireless industries are looking for "killer" applications for increased channel capacity. However, WDCNs have several unique problems compared with currently well-investigated methods for wireless sensor networks and wired distributed computing. For example, it is difficult for WDCNs to be power/energy efficient considering the uncertainty and heterogeneity of the wireless environment. In addition, the service model has to take account of the interference-limited feature of wireless channels to reduce the service delay.
Our research proposes a two-phase model for WDCNs including the service provision phase and the service access phase according to different traffic patterns and performance requirements. For the service provision phase, we investigate the impact of communication channel conditions on the average execution time of the computing tasks within WDCNs. We then discuses how to increase the robustness and power efficiency for WDCNs subject to the impact of channel variance and spatial heterogeneity. A resource allocation solution for computation oriented WDCNs is then introduced in detail which mitigates the effects of channel variations with a stochastic programming solution.
Stochastic geometry and queue theory are combined to analyze the average performance of service response time and to design optimal access strategies during the service access phase. This access model provides a framework to analyze the service access performance and evaluate whether the channel heterogeneity should be considered. Based on this analysis, optimal strategies to access the service nodes can be determined in order to reduce the service response time. In addition, network initialization and synchronization are investigated in order to build a multiple channel WDCN in dynamic spectrum access (DSA) environments. Further, an efficient primary user detection method is proposed to reduce the channel vacation latency for WDCNs in DSA environments.
Finally, this dissertation presents the complete design and implementation of a WDCN on COgnitive Radio Network (CORNET). Based on SDR technologies, software dedicated to WDCNs is designed and implemented across the PHY layer, MAC layer, and application layer. System experiments are carried out to demonstrate the performance issues and solutions presented in this dissertation. Wireless distributed computing networks (WDCNs) will become the next frontier of the wireless industry as the performance of wireless platforms is being increased every year and wireless industries are looking for "killer" applications for increased channel capacity. However, WDCNs have several unique problems compared with currently well-investigated methods for wireless sensor networks and wired distributed computing. For example, it is difficult for WDCNs to be power/energy efficient considering the uncertainty and heterogeneity of the wireless environment. In addition, the service model has to take account of the interference-limited feature of wireless channels to reduce the service delay.
Our research proposes a two-phase model for WDCNs including the service provision phase and the service access phase according to different traffic patterns and performance requirements. For the service provision phase, we investigate the impact of communication channel conditions on the average execution time of the computing tasks within WDCNs. We then discuses how to increase the robustness and power efficiency for WDCNs subject to the impact of channel variance and spatial heterogeneity. A resource allocation solution for computation oriented WDCNs is then introduced in detail which mitigates the effects of channel variations with a stochastic programming solution.
Stochastic geometry and queue theory are combined to analyze the average performance of service response time and to design optimal access strategies during the service access phase. This access model provides a framework to analyze the service access performance and evaluate whether the channel heterogeneity should be considered. Based on this analysis, optimal strategies to access the service nodes can be determined in order to reduce the service response time. In addition, network initialization and synchronization are investigated in order to build a multiple channel WDCN in dynamic spectrum access (DSA) environments. Further, an efficient primary user detection method is proposed to reduce the channel vacation latency for WDCNs in DSA environments.
Finally, this dissertation presents the complete design and implementation of a WDCN on COgnitive Radio Network (CORNET). Based on SDR technologies, software dedicated to WDCNs is designed and implemented across the PHY layer, MAC layer, and application layer. System experiments are carried out to demonstrate the performance issues and solutions presented in this dissertation.Ph. D.