Dissertations / Theses on the topic 'Mobile ad hoc networks'
To see the other types of publications on this topic, follow the link: Mobile ad hoc networks.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Mobile ad hoc networks.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Huang, E. "Rethinking mobile ad hoc networks." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.604708.
Full textAbstract:
This thesis explores the physical layer feasibility, performance and limitations of MANETs through simulation and evaluation of a novel application scenario. The results of the work are intended to help researchers understand how and where MANETs can be used in the future, as well as to better understand physical layer considerations and methods of improving the physical layer performance of large scale, highly mobile MANETs. The thesis also investigates the effect and feasibility of using fixed relay or dispatch points that act as intermediate relays or source/sinks for messages. The results show the relative benefits of using relays vs. dispatch points, as well as the differences owing to the position, configuration and number of fixed points. We are then able to deduce the optimum configuration and type of fixed nodes to use to achieve the best results under various circumstances. Given the limited unlicensed spectrum available and the potentially high number of nodes in a bounded area, it is likely that interference will become a significant limiting factor for performance. The thesis explores this and other related issues to discover the significance of their effects and the necessary bounds for reasonable performance. We also explore the use of various techniques to mitigate these effects. The thesis concludes by investigating the issue of cooperation incentives. Without sufficient nodes cooperating to provide relaying functions, a MANET cannot function properly. Consequently various proposals have been made which provide incentives for individual users of a MANET to cooperate with each other. We examine the drawbacks of currently proposed incentive systems and propose a new solution.
2
Gudapati, Supriya. "Securing mobile ad hoc networks." Thesis, California State University, Long Beach, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1604882.
Full textAbstract:
Wireless sensor networks has been growing rapidly over the past few decades. Due to their flexibility, wireless sensor networks have been in practice in many areas. Unlike other network architectures, Mobile Ad hoc networks (MANETs) have no central architecture; every node is free to work both as a transmitter and receiver and it depends on neighboring nodes to send relay messages. Due to their advantages, MANETs are used in many different applications like health care and military. However the wide distribution of MANETs makes it vulnerable to malicious attacks. Hence it is necessary to design a secure system for MANETs. In this report, we implement a secure system named Enhanced Adaptive Acknowledgement especially for MANETs. To ensure higher security and reduce the network overhead and delay, we use a different approach called hybrid cryptography in our proposed scheme. Enhanced Adaptive Acknowledgment detects higher malicious attackers without greatly disturbing the network performances. In the simulation we compare the differences within the Enhanced Adaptive Acknowledgment (EAACK) before and after introducing the Hybrid cryptography approach.
3
Kobosko, Kristoffer, and Henrik Wallentin. "Mobile Groups in Ad-hoc Networks." Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-108036.
Full textAbstract:
Most current research on Mobile Ad-hoc NETworks (MANETs) concerns one ad-hocnetwork at a time. A common topic is how to handle the merging of new nodesappearing in range of an existing MANET into a new, larger network. CurrentMANET implementations do not define the handling of policies for controllingmembership or routing messages, neither do they support policy-based inter-MANETrouting.
In this thesis, we present an implementation of Mobile Group Protocol (MGP) whichenhances the reactive routing protocol AODV with an administrative framework inwhich Mobile Ad-hoc NETwork (MANET) policies are defined. Such policies are usedto control membership and signaling in a MANET. We define new roles for theMANET members such as nodes, leaders and gateways. We discuss the messageexchange taking place during forming of Mobile Groups (MGs) and study the theparticular implementation by simulating a group of simple MGP scenarios usingNetwork Simulator 2 (NS-2).
We conclude our work by discussing the using of MGP as a base for an inter-MANETrouting protocol providing policy-based routing in MANETs.
4
Panaousis, Emmanouil A. "Security for mobile ad-hoc networks." Thesis, Kingston University, 2012. http://eprints.kingston.ac.uk/23989/.
Full textAbstract:
Ad-hoc networks are crucial enablers of next generation communications. Such networks can be formed and reconfigured dynamically and they can be mobile, standalone or inter-networked with other networks. Mobile Ad-hoc NETworks (MANETs) are established by group of autonomous nodes that communicate with each other by establishing a multihop radio network and maintain connectivity in an infrastructureless manner. Security of the connections between devices and networks is crucial. Current MANET routing protocols inherently trust all participants being cooperative by nature and they depend on neighbouring nodes to route packets to a destination. Such a model allows malicious nods to potentially harm MANET communications links or reveal confidential data by launching different kind of attacks. The main objective of this thesis is to investigate and propose security mechanisms for MANET communications mainly emphasising on emergency scenarios where first responders' devices communicate by establishing a decentralised wireless network. To this end, we have proposed security mechanisms for innovtive routing and peer-to-peer overlay mechanisms for emergency MANETs proposed supplementarily to the findings of this thesis. Such security mechanisms guarntee confidentiality and integrity of the emergency MANET communications. We have also proposed novel ways of improving availability in MANETs in presence of intrusion detection systems by increasing the nodes' lifetime based on a novel game theoretic routing protocol for MANETs. We have thoroughly evaluated the performance of all the proposed mechanisms using a network simulator. The main objective of undertaking these evaluations was to guarantee that security introduces affordable overhead thereby respecting the Quality-of-Service of MANET communication links.
5
Mosko, Marc Elliott. "Routing in mobile ad hoc networks /." Diss., Digital Dissertations Database. Restricted to UC campuses, 2004. http://uclibs.org/PID/11984.
Full text
6
Dengiz, Orhan Smith Alice E. "Maximizing connectivity and performance in mobile ad hoc networks using mobile agents." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Fall%20Dissertations/Dengiz_Orhan_22.pdf.
Full text
7
Ge, Renwei. "Information security in mobile ad hoc networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 1.57 Mb., 158 p, 2006. http://wwwlib.umi.com/dissertations/fullcit?3220810.
Full text
8
Sun, Bo. "Intrusion detection in mobile ad hoc networks." Diss., Texas A&M University, 2003. http://hdl.handle.net/1969.1/2215.
Full textAbstract:
Most existent protocols, applications and services for Mobile Ad Hoc NET-works (MANETs) assume a cooperative and friendly network environment and do not accommodate security. Therefore, Intrusion Detection Systems (IDSs), serving as the second line of defense for information systems, are indispensable for MANETs with high security requirements. Central to the research described in this dissertation is the proposed two-level nonoverlapping Zone-Based Intrusion Detection System (ZBIDS) which fit the unique requirement of MANETs. First, in the low-level of ZBIDS, I propose an intrusion detection agent model and present a Markov Chain based anomaly detection algorithm. Local and trusted communication activities such as routing table related features are periodically selected and formatted with minimum errors from raw data. A Markov Chain based normal profile is then constructed to capture the temporal dependency among network activities and accommodate the dynamic nature of raw data. A local detection model aggregating abnormal behaviors is constructed to reflect recent subject activities in order to achieve low false positive ratio and high detection ratio. A set of criteria to tune parameters is developed and the performance trade-off is discussed. Second, I present a nonoverlapping Zone-based framework to manage locally generated alerts from a wider area. An alert data model conformed to the Intrusion Detection Message Exchange Format (IDMEF) is presented to suit the needs of MANETs. Furthermore, an aggregation algorithm utilizing attribute similarity from alert messages is proposed to integrate security related information from a wider area. In this way, the gateway nodes of ZBIDS can reduce false positive ratio, improve detection ratio, and present more diagnostic information about the attack. Third, MANET IDSs need to consider mobility impact and adjust their behavior dynamically. I first demonstrate that nodes?? moving speed, a commonly used parameter in tuning IDS performance, is not an effective metric for the performance measurement of MANET IDSs. A new feature -link change rate -is then proposed as a unified metric for local MANET IDSs to adaptively select normal profiles . Different mobility models are utilized to evaluate the performance of the adaptive mechanisms.
9
Holland, Gavin Douglas. "Adaptive protocols for mobile ad hoc networks." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1445.
Full textAbstract:
Recent advances in low-power technologies have resulted in the proliferation of
inexpensive handheld mobile computing devices. Soon, just like the Internet empow-
ered a whole new world of applications for personal computers, the development and
deployment of robust ubiquitous wireless networks will enable many new and exciting
futuristic applications. Certain to be an important part of this future is a class of
networks known as "mobile ad hoc networks." Mobile ad hoc networks (or simply
"ad hoc networks") are local-area networks formed "on the spot" between collocated
wireless devices. These devices self-organize by sharing information with their neigh-
bors to establish communication pathways whenever and wherever they are. For ad
hoc networks to succeed, however, new protocols must be developed that are capable
of adapting to their dynamic nature.
In this dissertation, we present a number of adaptive protocols that are designed
for this purpose. We investigate new link layer mechanisms that dynamically monitor
and adapt to changes in link quality, including a protocol that uses common control
messages to form a tight feedback control loop for adaptation of the link data rate
to best match the channel conditions perceived by the receiver. We also investigate
routing protocols that adapt route selection according to network characteristics. In
particular, we present two on-demand routing protocols that are designed to take
advantage of the presence of multirate links. We then investigate the performance of
TCP, showing how communication outages caused by link failures and routing delays
can be very detrimental to its performance. In response, we present a solution to this
problem that uses explicit feedback messages from the link layer about link failures to
adapt TCP's behavior. Finally, we show how link failures in heterogeneous networks
containing links with widely varying bandwidth and delay can cause repeated "modal"
changes in capacity that TCP is slow to detect. We then present a modifed version
of TCP that is capable of more rapidly detecting and adapting to these changes.
10
Cao, Guangtong. "Distributed services for mobile ad hoc networks." Texas A&M University, 2005. http://hdl.handle.net/1969.1/2541.
Full textAbstract:
A mobile ad hoc network consists of certain nodes that communicate only
through wireless medium and can move arbitrarily. The key feature of a mobile ad
hoc network is the mobility of the nodes. Because of the mobility, communication
links form and disappear as nodes come into and go out of each other's communica-
tion range. Mobile ad hoc networks are particularly useful in situations like disaster
recovery and search, military operations, etc. Research on mobile ad hoc networks
has drawn a huge amount of attention recently. The main challenges for mobile ad
hoc networks are the sparse resources and frequent mobility. Most of the research
work has been focused on the MAC and routing layer. In this work, we focus on
distributed services for mobile ad hoc networks. These services will provide some
fundamental functions in developing various applications for mobile ad hoc networks.
In particular, we focus on the clock synchronization, connected dominating set, and
k-mutual exclusion problems in mobile ad hoc networks.
11
Elkadiki, Hisham Idris A. "Fault detection in mobile ad-hoc networks." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27584.
Full textAbstract:
In this thesis, we consider the problem of self-diagnosis of mobile ad-hoc networks (MANETs) using the comparison approach. In this approach, a MANET consists of a collection of n independent heterogeneous mobile hosts interconnected via wireless links, and it is assumed that at most sigma of these mobile hosts are faulty. In order to diagnose the state of the MANET, tasks are assigned to pairs of mobiles and the outcomes are compared. The agreements and disagreements among mobiles are the basis for identifying the faulty ones.
The comparison approach is viewed as one of the most practical diagnosis approaches. We have developed two distributed self-diagnosing protocols (DSDPs) for MANETs the first (Dynamic-DSDP) is more energy efficient, since its communication complexity is lower, while the second (Adaptive-DSDP) has a lower diagnosis latency and is more appropriate for MANETs that have more dynamic topologies. Correctness and complexity proofs are provided. Using the ns-2 simulator, we implemented the two protocols, which provided us with further insight into their effectiveness and illustrated the effect the number of faults had on their efficiency.
12
Zhao, Liang. "Topology control for mobile ad hoc networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 162 p, 2007. http://proquest.umi.com/pqdweb?did=1362541141&sid=26&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
13
Indrayan, Gunjan. "Address autoconfiguration in mobile ad hoc networks." Diss., Connect to online resource, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1435235.
Full text
14
Zhang, Yikun. "Aisle routing for mobile ad hoc networks." Diss., Connect to online resource, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1439451.
Full text
15
Park, Sung Jin. "Performance improvement in mobile ad-hoc networks." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45903.
Full textAbstract:
The objective of this research is to enhance the network performance under realistic mobile ad-hoc networks environments without modification of the standard. Overview of this research is summarized as follows:
First, a packet-fragmentation technique to improve network throughput under the worst channel
conditions is proposed. While the conventional packet-fragmentation technique research focuses only on random-bit errors, the proposed technique employs both random bit errors and hidden-node collisions. The analytical models based on Markov-chain model shows that the optimal fragmentation technique can effectively reduce the number of retransmissions caused by both collisions from hidden nodes and corrupted packets by random bit errors, and eventually improving throughput in noisy VANETs channels.
As a second contribution, a dynamic service-channel allocation (DSCA) scheme is proposed to maximize the network throughput by dynamically assigning different service channels to the users. The theoretical analysis in this thesis will consider wireless access in the vehicular environment (WAVE) protocol, which is the main characteristic of the vehicular ad-hoc networks standard (the IEEE 802.11p).
To summarize, the main contribution of this research is that two schemes will improve the network throughput significantly without modification of the standard. Therefore, there is no implementation issue to deploy the proposed schemes in real devices.
16
Wongsaardsakul, Thirapon. "P2P SIP over mobile ad hoc networks." Phd thesis, Institut National des Télécommunications, 2010. http://tel.archives-ouvertes.fr/tel-00712171.
Full textAbstract:
This work presents a novel Peer to Peer (P2P) framework for Session Initiation Protocol (SIP) on Mobile Ad Hoc Network (MANET). SIP is a client-server model of computing which can introduce a single point of failure problem. P2P SIP addresses this problem by using a distributed implementation based on a P2P paradigm. However, both the traditional SIP and P2P SIP architectures are not suitable for MANETs because they are initially designed for infrastructured networks whose most nodes are static. We focus on distributed P2P resource lookup mechanisms for SIP which can tolerate failures resulting from the node mobility. Our target application is SIP-based multimedia communication in a rapidly deployable disaster emergency network. To achieve our goal, we provide four contributions as follows. The first contribution is a novel P2P lookup architecture based on a concept of P2P overlay network called a Structured Mesh Overlay Network (SMON). This overlay network enables P2P applications to perform fast resource lookups in the MANET environment. SMON utilizes a cross layer design based on the Distributed Hashing Table (DHT) and has direct access to OLSR routing information. Its cross layer design allows optimizing the overlay network performance during the change of network topology. The second contribution is a distributed SIP architecture on MANET providing SIP user location discovery in a P2P manner which tolerates single-point and multiple-point of failures. Our approach extends the traditional SIP user location discovery by utilizing DHT in SMON to distribute SIP object identifiers over SMON. It offers a constant time on SIP user discovery which results in a fast call setup time between two MANET users. From simulation and experiment results, we find that SIPMON provides the lowest call setup delay when compared to the existing broadcast-based approaches. The third contribution is an extended SIPMON supporting several participating MANETs connected to Internet. This extension (SIPMON+) provides seamless mobility support allowing a SIP user to roam from an ad hoc network to an infrastructured network such as Internet without interrupting an ongoing session. We propose a novel OLSR Overlay Network (OON), a single overlay network containing MANET nodes and some nodes on the Internet. These nodes can communicate using the same OLSR routing protocol. Therefore, SIPMON can be automatically extended without modifying SIPMON internal operations. Through our test-bed experiments, we prove that SIPMON+ has better performance in terms of call setup delay and handoff delay than MANET for Network Mobility (MANEMO). The fourth contribution is a proof-of-concept and a prototype of P2P multimedia communication based on SIPMON+ for post disaster recovery missions. We evaluate our prototype and MANEMO-based approaches through experimentation in real disaster situations (Vehicle to Infrastructure scenarios). We found that our prototype outperforms MANEMO-based approaches in terms of call setup delay, packet loss, and deployment time.
17
Davis, Carlton R. "Security protocols for mobile ad hoc networks." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=102970.
Full textAbstract:
Mobile ad hoc networks (MANETs) are generating much interest both in academia and the telecommunication industries. The principal attractions of MANETs are related to the ease with which they can be deployed due to their infrastructure-less and decentralized nature. For example, unlike other wireless networks, MANETs do not require centralized infrastructures such as base stations, and they are arguably more robust due to their avoidance of single point of failures. Interestingly, the attributes that make MANETs attractive as a network paradigm are the same phenomena that compound the challenge of designing adequate security schemes for these innovative networks.One of the challenging security problems is the issue of certificate revocation in MANETs where there are no on-line access to trusted authorities. In wired network environments, when certificates are to be revoked, certificate authorities (CAs) add the information regarding the certificates in question to certificate revocation lists (CRLs) and post the CRLs on accessible repositories or distribute them to relevant entities. In purely ad hoc networks, there are typically no access to centralized repositories or trusted authorities; therefore the conventional method of certificate revocation is not applicable.
Another challenging MANET security problem is the issue of secure routing in the presence of selfish or adversarial entities which selectively drop packets they agreed to forward; and in so doing these selfish or adversarial entities can disrupt the network traffic and cause various communication problems.
In this thesis, we present two security protocols we developed for addressing the above-mentioned MANET security needs. The first protocol is a decentralized certificate revocation scheme which allows the nodes within a MANET to have full control over the process of certificate revocation. The scheme is fully contained and it does not rely on any input from centralized or external entities such as trusted CAs. The second protocol is a secure MANET routing scheme we named Robust Source Routing (RSR). In addition to providing data origin authentication services and integrity checks, RSR is able to mitigate against intelligent, colluding malicious agents which selectively drop or modify packets they are required to forward.
18
Jiang, Ning. "COLLABORATION ENFORCEMENT IN MOBILE AD HOC NETWORKS." Doctoral diss., University of Central Florida, 2006. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2718.
Full textAbstract:
Mobile Ad hoc NETworks (MANETs) have attracted great research interest in recent years. Among many issues, lack of motivation for participating nodes to collaborate forms a major obstacle to the adoption of MANETs. Many contemporary collaboration enforcement techniques employ reputation mechanisms for nodes to avoid and penalize malicious participants. Reputation information is propagated among participants and updated based on complicated trust relationships to thwart false accusation of benign nodes. The aforementioned strategy suffers from low scalability and is likely to be exploited by adversaries. To address these problems, we first propose a finite state model. With this technique, no reputation information is propagated in the network and malicious nodes cannot cause false penalty to benign hosts. Misbehaving node detection is performed on-demand; and malicious node punishment and avoidance are accomplished by only maintaining reputation information within neighboring nodes. This scheme, however, requires that each node equip with a tamper-proof hardware. In the second technique, no such restriction applies. Participating nodes classify their one-hop neighbors through direct observation and misbehaving nodes are penalized within their localities. Data packets are dynamically rerouted to circumvent selfish nodes. In both schemes, overall network performance is greatly enhanced. Our approach significantly simplifies the collaboration enforcement process, incurs low overhead, and is robust against various malicious behaviors. Simulation results based on different system configurations indicate that the proposed technique can significantly improve network performance with very low communication cost.Ph.D.
School of Computer Science
Engineering and Computer Science
Computer Science
19
Alaoui, Nabih. "Cooperative Communications In Mobile Ad hoc NETworks." Limoges, 2013. http://aurore.unilim.fr/theses/nxfile/default/16707b62-af2a-425b-b97b-ee0f900ae15d/blobholder:0/2013LIMO4035.pdf.
Full textAbstract:
L’étude réalisée dans ce mémoire porte sur la communication et la transmission des données dans le contexte des réseaux de capteurs. Pour améliorer la fiabilité de transmission, des relais sont insérés entre les capteurs et la destination afin de pouvoir corriger les erreurs de transmissions en utilisant des codes LDPC. L’architecture est donc optimisée grâce aux codes en blocs mais aussi à l’aide des protocoles de détection d’erreurs et aussi à l’aide de la combinaison de la correction et de la détection d’erreurs. Les systèmes d’antennes multiples forment également une option très intéressante pour l’amélioration des performances. L’efficacité énergétique est étudiée dans les différents protocoles et solutions proposés. Une optimisation conjointe du codage de canal et du codage de réseau physique est également effectuéeThe work done in this study focuses on communication and data transmission in the context of sensor networks. To improve the reliability of transmission, relays are inserted between the sensors and the destination in order to correct errors in transmissions using LDPC codes. The architecture is optimized thanks to the block codes but also to the error detection protocols and the use of a combination of the error correction and detection. Another interesting way to improve performances is to use multiple antenna systems. Energy efficiency is evaluated in the protocols studied and the solutions proposed. Besides, a joint optimization of channel coding and physical network coding is proposed in this paper
20
Magistretti, Eugenio <1978>. "Dynamic services in mobile ad hoc networks." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/399/1/EugenioMagistrettiPhDThesis.pdf.
Full textAbstract:
The increasing diffusion of wireless-enabled portable devices is pushing toward the design of novel service scenarios, promoting temporary and opportunistic interactions in infrastructure-less environments. Mobile Ad Hoc Networks (MANET) are the general model of these higly dynamic networks that can be specialized, depending on application cases, in more specific and refined models such as Vehicular Ad Hoc Networks and Wireless Sensor Networks. Two interesting deployment cases are of increasing relevance: resource diffusion among users equipped with portable devices, such as laptops, smart phones or PDAs in crowded areas (termed dense MANET) and dissemination/indexing of monitoring information collected in Vehicular Sensor Networks. The extreme dynamicity of these scenarios calls for novel distributed protocols and services facilitating application development. To this aim we have designed middleware solutions supporting these
challenging tasks. REDMAN manages, retrieves, and disseminates replicas of software resources in dense MANET; it implements novel lightweight protocols to maintain a desired replication degree despite participants mobility, and efficiently perform resource retrieval. REDMAN exploits the high-density assumption to achieve scalability and limited network overhead. Sensed data gathering and distributed indexing in Vehicular Networks raise similar
issues: we propose a specific middleware support, called MobEyes, exploiting node mobility to opportunistically diffuse data summaries among neighbor vehicles. MobEyes
creates a low-cost opportunistic distributed index to query the distributed storage and to determine the location of needed information. Extensive validation and testing of REDMAN and MobEyes prove the effectiveness of our original solutions in limiting communication overhead while maintaining the required accuracy of replication degree and indexing completeness, and demonstrates the feasibility of the middleware approach.
21
Magistretti, Eugenio <1978>. "Dynamic services in mobile ad hoc networks." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/399/.
Full textAbstract:
The increasing diffusion of wireless-enabled portable devices is pushing toward the design of novel service scenarios, promoting temporary and opportunistic interactions in infrastructure-less environments. Mobile Ad Hoc Networks (MANET) are the general model of these higly dynamic networks that can be specialized, depending on application cases, in more specific and refined models such as Vehicular Ad Hoc Networks and Wireless Sensor Networks. Two interesting deployment cases are of increasing relevance: resource diffusion among users equipped with portable devices, such as laptops, smart phones or PDAs in crowded areas (termed dense MANET) and dissemination/indexing of monitoring information collected in Vehicular Sensor Networks. The extreme dynamicity of these scenarios calls for novel distributed protocols and services facilitating application development. To this aim we have designed middleware solutions supporting these
challenging tasks. REDMAN manages, retrieves, and disseminates replicas of software resources in dense MANET; it implements novel lightweight protocols to maintain a desired replication degree despite participants mobility, and efficiently perform resource retrieval. REDMAN exploits the high-density assumption to achieve scalability and limited network overhead. Sensed data gathering and distributed indexing in Vehicular Networks raise similar
issues: we propose a specific middleware support, called MobEyes, exploiting node mobility to opportunistically diffuse data summaries among neighbor vehicles. MobEyes
creates a low-cost opportunistic distributed index to query the distributed storage and to determine the location of needed information. Extensive validation and testing of REDMAN and MobEyes prove the effectiveness of our original solutions in limiting communication overhead while maintaining the required accuracy of replication degree and indexing completeness, and demonstrates the feasibility of the middleware approach.
22
Al-Bayatti, Ali Hilal. "Security management for mobile ad hoc network of networks (MANoN)." Thesis, De Montfort University, 2009. http://hdl.handle.net/2086/2417.
Full textAbstract:
Mobile Ad hoc Network of Networks (MANoN) are a group of large autonomous wireless nodes communicating on a peer-to-peer basis in a heterogeneous environment with no pre-defined infrastructure. In fact, each node by itself is an ad hoc network with its own management. MANoNs are evolvable systems, which mean each ad hoc network has the ability to perform separately under its own policies and management without affecting the main system; therefore, new ad hoc networks can emerge and disconnect from the MANoN without conflicting with the policies of other networks. The unique characteristics of MANoN makes such networks highly vulnerable to security attacks compared with wired networks or even normal mobile ad hoc networks. This thesis presents a novel security-management system based upon the Recommendation ITU-T M.3400, which is used to evaluate, report on the behaviour of our MANoN and then support complex services our system might need to accomplish. Our security management will concentrate on three essential components: Security Administration, Prevention and Detection and Containment and Recovery. In any system, providing one of those components is a problem; consequently, dealing with an infrastructure-less MANoN will be a dilemma, yet we approached each set group of these essentials independently, providing unusual solutions for each one of them but concentrating mainly on the prevention and detection category. The contributions of this research are threefold. First, we defined MANoN Security Architecture based upon the ITU-T Recommendations: X.800 and X.805. This security architecture provides a comprehensive, end-to-end security solution for MANoN that could be applied to every wireless network that satisfies a similar scenario, using such networks in order to predict, detect and correct security vulnerabilities. The security architecture identifies the security requirements needed, their objectives and the means by which they could be applied to every part of the MANoN, taking into consideration the different security attacks it could face. Second, realising the prevention component by implementing some of the security requirements identified in the Security Architecture, such as authentication, authorisation, availability, data confidentiality, data integrity and non-repudiation has been proposed by means of defining a novel Security Access Control Mechanism based on Threshold Cryptography Digital Certificates in MANoN. Network Simulator (NS-2) is a real network environment simulator, which is used to test the performance of the proposed security mechanism and demonstrate its effectiveness. Our ACM-MANoN results provide a fully distributed security protocol that provides a high level of secure, available, scalable, flexible and efficient management services for MANoN. The third contribution is realising the detection component, which is represented by providing a Behavioural Detection Mechanism based on nodes behavioural observation engaged with policies. This behaviour mechanism will be used to detect malicious nodes acting to bring the system down. This approach has been validated using an attacks case study in an unknown military environment to cope with misbehaving nodes.
23
Rogers, Paul Edward. "On robustness in high load mobile ad hoc networks." Diss., Online access via UMI:, 2005.
Find full text
24
Massin, Raphaël. "On the clustering of mobile ad hoc networks." Electronic Thesis or Diss., Paris, ENST, 2016. https://pastel.hal.science/tel-03689508.
Full textAbstract:
Cette thèse traite de la clustérisation des réseaux ad hoc mobiles. Ce mécanisme consiste à rassembler les noeuds du réseau en grappes appelés clusters, dans le but d'introduire de la hiérarchie dans le réseau, et ainsi de permettre son passage à l'échelle. L'objectif principal est de concevoir de nouveaux algorithmes distribués de clustérisation, adaptés aux réseaux non structurés, où tous les noeuds sont des pairs, ainsi qu'aux réseaux structurés, où il existe déjà une structure hiérarchique intrinsèque. Dans le but de permettre une allocation des ressources radio à l'intérieur des clusters plus efficace qu'entre les clusters, les algorithmes proposés forment des clusters qui satisfont certaines contraintes de topologie : la connectivité, une taille et un diamètre maximaux. Afin d'évaluer les performances de ces nouvelles solutions, comparativement à celles de la littérature, et de manière indépendante des mécanismes d'accès au canal radio employés, la première partie de la thèse introduit des fonctions de coût de réseau, qui incorporent le profil de trafic utilisateur ainsi que les coûts de communication intra-cluster. Ensuite, un algorithme distribué adapté aux réseaux structurés est proposé, et ses performances comparées par simulation à plusieurs autres solutions de la littérature. Une caractéristique originale de cet algorithme est qu'il ne fait pas appel à la notion de chef de cluster. Dans la dernière partie, grâce à la théorie des jeux de coalition nous revisitons l'algorithme précédemment proposé pour les réseaux structurés. Ce cadre théorique permet de formaliser le problème de la clustérisation dans un contexte plus général, et conduit à la définition d'un algorithme générique, applicable à tous types de réseaux, ainsi qu'à une meilleure connaissance théorique de ses propriétésThis thesis is about clustering of mobile ad hoc networks, which consists in building some sets of nodes, called clusters, in order to introduce hierarchy in the network and thus improve its scalability. The main goal is to design new distributed clustering algorithms suited to i) unstructured networks, where all the nodes are equal, and suited to ii) structured networks that have an inherent hierarchical structure, and in which the nodes are gathered in operational groups. In order to allow the implementation of a radio resource allocation process that is more efficient within clusters than between clusters, the proposed algorithms form clusters satisfying specific topology constraints: connectivity, maximum size and diameter. In the first part of the thesis, to compare these new solutions to the ones from the literature, independently to the medium access scheme, we introduce network cost functions which take into account the user traffic profil and the intra-cluster and inter-cluster communication costs. Then, we propose a distributed clustering algorithm suited to structured networks, and compare its performance to several clustering schemes from the literature. A salient feature of this algorithm is that it does not need to resort to the notion of cluster-head. In the last part, thanks to the coalition game theory we revisit this algorithm. This theoretical framework allows us to formalize the clustering problem in a more general context. This leads us to defining a generic algorithm suitable to any kind of ad hoc network, and enables us to acquire a better knowledge of its properties
25
Ho, Yao Hua. "Connectionless approach--a localized scheme to mobile ad hoc networks." Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002742.
Full text
26
Gavini, Sireesh. "Detecting packet-dropping faults in mobile ad-hoc networks." Online access for everyone, 2004. http://www.dissertations.wsu.edu/Thesis/Fall2004/s%5Fgavini%5F121404.pdf.
Full text
27
Shankaran, Rajan, University of Western Sydney, of Science Technology and Environment College, and School of Computing and Information Technology. "Security issues in mobile IP and mobile ad hoc networks." THESIS_CSTE_CIT_Shankaran_R.xml, 2004. http://handle.uws.edu.au:8081/1959.7/585.
Full textAbstract:
The need for information anywhere and at any time has been the driving force for the increasing growth in mobile networks and devices. The field of mobile computing is the merger of advances in computing and communications with the aim of providing seamless and ubiquitous computing environment for mobile users. Whereas notebook computers and personal digital assistants (PDAs) are self-contained, networked computing constitutes a new paradigm of computing that is revolutionizing the way computers are used. Mobile networking greatly enhances the utility of carrying a computing device. It provides mobile users with versatile communication to other people and expedient notification of important events, yet with much more flexibility than cellular telephones and pagers. It also permits continuous access to services and resources of the traditional land-based wired networks. This combination of networking and mobility will engender new applications and services, such as collaborative software to support impromptu meetings, electronic bulletin boards that adapt to the contents according to the participants present, self adjusting lighting and heating, and navigation software to guide users in unfamiliar places and tours. To support mobility in the Internet, the Internet Protocol (IP) has been extended to support mobility. Also at the same time, there is also a growing trend for these IP based networks to operate in an infrastructureless environment called mobile ad-hoc networks. However, the proliferation of such mobile networks depends on a multitude of factors, with trustworthiness being one of the primary challenges to be met. The objective of this dissertation is to address the issues involved in the design of security services for Mobile IP and ad-hoc networks. Extensions to IP based networks (both wired and infrastructureless networks) to facilitate mobility have not been designed keeping security in mind. However adequate security features are basic requirements for the continued functioning of mobile networks. Clearly the problem is so broad that there is no way to devise a general solution We aim to address most of these wide- ranging problems and in the process initiate a practical approach to the development of an integrated security infrastructure for mobile networks. The intention is to seamlessly integrate these security services and mechanisms at the IP level within the mobile IP and ad-hoc networks. The provision of security services at the higher and lower layers and their interoperability with our proposed framework is outside the scope of this thesisDoctor of Philosophy (PhD)
28
Farkas, Károly. "Supporting distributed services in Mobile Ad hoc Networks /." Aachen : Shaker Verlag, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=16987.
Full text
29
Stüdi, Patrick. "Quality of service for mobile ad hoc networks." Zürich : ETH, Eidgenössische Technische Hochschule Zürich, 2003. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=108.
Full text
30
Moseng, Tor Kjetil. "A QoS Architecture for Mobile Ad Hoc Networks." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-5761.
Full textAbstract:
A Mobile Ad Hoc Network (MANET) is a shared wireless network without any infrastructure, consisting of mobile nodes connected by wireless links. The nodes are free to move and organize themselves arbitrarily. The nodes in the network are therefore depending on each other in order to communicate over multiple hops. Due to the physical characteristics of wireless networks, the channel is time-varying, which makes it hard to both predict and sustain a bit rate level. The nodes’ mobility causes topology changes, and further load and capacity variations. Traditional usage areas are battlefield and disaster areas, while new areas like extended network coverage and gaming are emerging. Quality of Service (QoS) is needed in every network in order to differentiate traffic with different performance requirements, e.g. voice and e-mail applications. Providing QoS in wireless environments with varying conditions is complex, and hard guarantees can not be given. Consequently, the aim is to give differentiated treatment to traffic with different performance requirements. In addition, we can not study the MANET without considering fixed networks. Communication with fixed networks is important, for example by accessing the Internet. In this thesis the Differentiated Services (DiffServ) architecture is applied and adapted to MANETs. Using the same QoS architecture will ease the transition between the wireless and wired domain. But the special characteristics of wireless networks require modifications to the original DiffServ architecture. In investigations there was found restrictions on the number of classes to use, and this number was dependent on the type of traffic in the network. A QoS architecture based on the DiffServ framework is proposed, with an admission control based on the concept of shadow classes, and Explicit Congestion Notification (ECN) to avoid congestion. New flows are tested in a shadow class before getting admission to the network and its designated class. The shadow class has the same scheduling properties as the designated class, but is differentiated by a higher drop probability in the buffers. Both the admission control and ECN are thus build on the same principle by controlling the load from probabilistic functions in the buffers, and are studied to find their individual and combined effects. In wireless environments the probability of a packet loss increases with the number of hops, which gives services an unpredictable performance for users. A predictable service, independent of number of hops, is provided by scheduling based on the path information; the packets are differentiated based on the number of hops made or left to make, increasing the predictability at the cost of performance.
31
Rmayti, Mohammad. "Misbehaviors detection schemes in mobile ad hoc networks." Thesis, Troyes, 2016. http://www.theses.fr/2016TROY0029/document.
Full textAbstract:
Avec l’évolution des besoins d’utilisateurs, plusieurs technologies de réseaux sans fil ont été développées. Parmi ces technologies, nous trouvons les réseaux mobiles ad hoc (MANETs) qui ont été conçus pour assurer la communication dans le cas où le déploiement d’une infrastructure réseaux est coûteux ou inapproprié. Dans ces réseaux, le routage est une fonction primordiale où chaque entité mobile joue le rôle d’un routeur et participe activement dans le routage. Cependant, les protocoles de routage ad hoc tel qu’ils sont conçus manquent de contrôle de sécurité. Sur un chemin emprunté, un nœud malveillant peut violemment perturber le routage en bloquant le trafic. Dans cette thèse, nous proposons une solution de détection des nœuds malveillants dans un réseau MANET basée sur l’analyse comportementale à travers les filtres bayésiens et les chaînes de Markov. L’idée de notre solution est d’évaluer le comportement d’un nœud en fonction de ses échanges avec ses voisins d’une manière complètement décentralisée. Par ailleurs, un modèle stochastique est utilisé afin de prédire la nature de comportement d’un nœud et vérifier sa fiabilité avant d’emprunter un chemin. Notre solution a été validée via de nombreuses simulations sur le simulateur NS-2. Les résultats montrent que la solution proposée permet de détecter avec précision les nœuds malveillants et d’améliorer la qualité de services de réseaux MANETsWith the evolution of user requirements, many network technologies have been developed. Among these technologies, we find mobile ad hoc networks (MANETs) that were designed to ensure communication in situations where the deployment of a network infrastructure is expensive or inappropriate. In this type of networks, routing is an important function where each mobile entity acts as a router and actively participates in routing services. However, routing protocols are not designed with security in mind and often are very vulnerable to node misbehavior. A malicious node included in a route between communicating nodes may severely disrupt the routing services and block the network traffic. In this thesis, we propose a solution for detecting malicious nodes in MANETs through a behavior-based analysis and using Bayesian filters and Markov chains. The core idea of our solution is to evaluate the behavior of a node based on its interaction with its neighbors using a completely decentralized scheme. Moreover, a stochastic model is used to predict the nature of behavior of a node and verify its reliability prior to selecting a path. Our solution has been validated through extensive simulations using the NS-2 simulator. The results show that the proposed solution ensures an accurate detection of malicious nodes and improve the quality of routing services in MANETs
32
Rajagopalan, Sundaram. "Swarm intelligence methods for mobile ad hoc networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 189 p, 2007. http://proquest.umi.com/pqdweb?did=1257807601&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
33
Dong, Ying. "Providing security services for mobile ad hoc networks." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/HKUTO/record/B3955711X.
Full text
34
Khanna, Varun. "Intelligent load balancing in mobile ad hoc networks." Thesis, Wichita State University, 2010. http://hdl.handle.net/10057/3729.
Full textAbstract:
On demand ad hoc routing protocols such as AODV and DSR do not look for new routes unless there is a change in the network topology. In scenarios where same intermediate node is used for longer time, this behavior may cause the traffic concentration on few intermediate nodes resulting in large latency and depletion of battery power at the nodes. To overcome this problem, a load balancing algorithm is proposed in this thesis. Each node forwards its residual energy information to all its neighbor nodes using reserved fields in the hello packets. Each node calculates a desirability metric, for each of its neighbor, based on the neighbor‟s energy information and the available bandwidth towards it. The choice of a particular route depends upon the desirability metric of the next hop. The proposed scheme is independent of the underlying routing protocol however the routing protocol should be able to save multiple routes to a destination and be able to put and retrieve the energy information to and from the hello messages.Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science.
35
Güichal, Guillermo Edgardo. "Service location architectures for mobile ad-hoc networks." Thesis, Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/14728.
Full text
36
Masrub, Abdullah Ashur. "Cognitive MAC protocols for mobile ad-hoc networks." Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7621.
Full textAbstract:
The term of Cognitive Radio (CR) used to indicate that spectrum radio could be accessed dynamically and opportunistically by unlicensed users. In CR Networks, Interference between nodes, hidden terminal problem, and spectrum sensing errors are big issues to be widely discussed in the research field nowadays. To improve the performance of such kind of networks, this thesis proposes Cognitive Medium Access Control (MAC) protocols for Mobile Ad-Hoc Networks (MANETs). From the concept of CR, this thesis has been able to develop a cognitive MAC framework in which a cognitive process consisting of cognitive elements is considered, which can make efficient decisions to optimise the CR network. In this context, three different scenarios to maximize the secondary user's throughput have been proposed. We found that the throughput improvement depends on the transition probabilities. However, considering the past information state of the spectrum can dramatically increases the secondary user's throughput by up to 40%. Moreover, by increasing the number of channels, the throughput of the network can be improved about 25%. Furthermore, to study the impact of Physical (PHY) Layer errors on cognitive MAC layer in MANETs, in this thesis, a Sensing Error-Aware MAC protocols for MANETs has been proposed. The developed model has been able to improve the MAC layer performance under the challenge of sensing errors. In this context, the proposed model examined two sensing error probabilities: the false alarm probability and the missed detection probability. The simulation results have shown that both probabilities could be adapted to maintain the false alarm probability at certain values to achieve good results. Finally, in this thesis, a cooperative sensing scheme with interference mitigation for Cognitive Wireless Mesh Networks (CogMesh) has been proposed. Moreover, a prioritybased traffic scenario to analyze the problem of packet delay and a novel technique for dynamic channel allocation in CogMesh is presented. Considering each channel in the system as a sub-server, the average delay of the users' packets is reduced and the cooperative sensing scenario dramatically increases the network throughput 50% more as the number of arrival rate is increased.
37
Hashmi, Sarosh. "Sybil Resistant Authentication in Mobile Ad-Hoc Networks." Thesis, University of Manchester, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.532227.
Full text
38
Rosenschon, Matthias. "Internet gateway discovery for mobile ad hoc networks." Thesis, City University London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.514500.
Full text
39
Liarokapis, Dimitrios. "Adaptive broadcast schemes in mobile ad hoc networks." Thesis, Glasgow Caledonian University, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.601623.
Full textAbstract:
The broadcast operation is perhaps one of the most fundamental services utilized frequently by other communication mechanisms in MANETs. It is the key element for exchanging control packets to support some services such as those provided by management and routing protocols. The dynamic nature of such network topologies and also the limited resources available, introduce a wide range of challenges when trying to design and implement a broadcast scheme that would function adequately in MANETs. Simple Flooding (FL) is a basic approach to broadcasting without global information; in which a broadcast packet is forwarded exactly once by every node in the network. in FL, the broadcast packet is guaranteed to be received by every node in the network given that there is no packet loss caused by collision and also there is no high-speed movement of nodes during the broadcast process. However, due to the broadcast nature of this environment, redundant transmissions in FL may cause the broadcast storm problem, in which redundant packets cause contention and collisions. Over the past years many studies have been conducted to develop broadcast mechanisms to alleviate the effects of FL. The focus of the early works was on the schemes where the mobile nodes make the rebroadcast decision based on fixed and preconfigured thresholds. The most common thresholds relate to the distance between sender and receiver (Distance Based scheme - DB), the number of duplicate packets received (Counter Based scheme - CB), and a fixed probability for rebroadcast (Probability Based scheme - PB). Despite the fact that these schemes have been shown to considerably improve the overall performance of the network, they have been found to depend highly on the combination of threshold selected, traffic load and level of population. The degree of dependency is such that in certain network topologies FL performs better than these schemes.
40
Dong, Ying, and 董穎. "Providing security services for mobile ad hoc networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B3955711X.
Full text
41
Papanastasiou, Stylianos. "Investigating TCP performance in mobile ad hoc networks." Thesis, University of Glasgow, 2006. http://theses.gla.ac.uk/3068/.
Full textAbstract:
Mobile ad hoc networks (MANETs) have become increasingly important in view of their promise of ubiquitous connectivity beyond traditional fixed infrastructure networks. Such networks, consisting of potentially highly mobile nodes, have provided new challenges by introducing special consideration stemming from the unique characteristics of the wireless medium and the dynamic nature of the network topology. The TCP protocol, which has been widely deployed on a multitude of internetworks including the Internet, is naturally viewed as the de facto reliable transport protocol for use in MANETs. However, assumptions made at TCP’s inception reflected characteristics of the prevalent wired infrastructure of networks at the time and could subsequently lead to sub-optimal performance when used in wireless ad hoc environments. The basic presupposition underlying TCP congestion control is that packet losses are predominantly an indication of congestion in the network. The detrimental effect of such an assumption on TCP’s performance in MANET environments has been a long-standing research problem. Hence, previous work has focused on addressing the ambiguity behind the cause of packet loss as perceived by TCP by proposing changes at various levels across the network protocol stack, such as at the MAC mechanism of the transceiver or via coupling with the routing protocol at the network layer. The main challenge addressed by the current work is to propose new methods to ameliorate the illness-effects of TCP’s misinterpretation of the causes of packet loss in MANETs. An assumed restriction on any proposed modifications is that resulting performance increases should be achievable by introducing limited changes confined to the transport layer. Such a restriction aids incremental adoption and ease of deployment by requiring minimal implementation effort. Further, the issue of packet loss ambiguity, from a transport layer perspective, has, by definition, to be dealt with in an end-to-end fashion. As such, a proposed solution may involve implementation at the sender, the receiver or both to address TCP shortcomings. Some attempts at describing TCP behaviour in MANETs have been previously reported in the literature. However, a thorough enquiry into the performance of those TCP agents popular in terms of research and adoption has been lacking. Specifically, very little work has been performed on an exhaustive analysis of TCP variants across different MANET routing protocols and under various mobility conditions. The first part of the dissertation addresses this shortcoming through extensive simulation evaluation in order to ascertain the relative performance merits of each TCP variant in terms of achieved goodput over dynamic topologies. Careful examination reveals sub-par performance of TCP Reno, the largely equivalent performance of NewReno and SACK, whilst the effectiveness of a proactive TCP variant (Vegas) is explicitly stated and justified for the first time in a dynamic MANET environment. Examination of the literature reveals that in addition to losses caused by route breakages, the hidden terminal effect contributes significantly to non-congestion induced packet losses in MANETs, which in turn has noticeably negative impact on TCP goodput. By adapting the conservative slow start mechanism of TCP Vegas into a form suitable for reactive TCP agents, like Reno, NewReno and SACK, the second part of the dissertation proposes a new Reno-based congestion avoidance mechanism which increases TCP goodput considerably across long paths by mitigating the negative effects of hidden terminals and alleviating some of the ambiguity of non-congestion related packet loss in MANETs. The proposed changes maintain intact the end-to-end semantics of TCP and are solely applicable to the sender. The new mechanism is further contrasted with an existing transport layer-focused solution and is shown to perform significantly better in a range of dynamic scenarios. As solution from an end-to-end perspective may be applicable to either or both communicating ends, the idea of implementing receiver-side alterations is also explored. Previous work has been primarily concerned with reducing receiver-generated cumulative ACK responses by “bundling” them into as few packets as possible thereby reducing misinterpretations of packet loss due to hidden terminals. However, a thorough evaluation of such receiver-side solutions reveals limitations in common evaluation practices and the solutions themselves. In an effort to address this shortcoming, the third part of this research work first specifies a tighter problem domain, identifying the circumstances under which the problem may be tackled by an end-to-end solution. Subsequent original analysis reveals that by taking into account optimisations possible in wireless communications, namely the partial or complete omission of the RTS/CTS handshake, noticeable improvements in TCP goodput are achievable especially over long paths. This novel modification is activated in a variety of topologies and is assessed using new metrics to more accurately gauge its effectiveness in a wireless multihop environment.
42
Kingsbury, Ryan W. "Mobile ad hoc networks for oceanic aircraft communications." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54224.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2009.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 71-72).
Research into mobile ad hoc networks (MANET's) has exploded in recent years. MANET's are a type of wireless network in which independently mobile nodes are capable of self-forming and maintaining a connected network, even in the face of topology changes. Surprisingly, there has been minimal work in applying these techniques to a problem that thousands of people face each day: lack of connectivity during transoceanic air travel. This work investigates the technical feasibility of using MANET techniques to provide connectivity from aircraft to land-based communication infrastructure. In pursuit of this goal, a simulation has been developed which incorporates a wide range of system issues including aircraft mobility, communication link performance, and optimal network allocation. At the center of this simulation lies an aircraft mobility model which fuses airline schedule data with probabilistic flight delay and cancellation events. An SNR-based link capacity model is used to predict feasible communication rates between aircraft and ground stations. Finally, an optimal max-min fair allocation algorithm is used to assess the capacity of this network. Our results show that system connectivity percentages in excess of 90% are achievable. Furthermore, the network allocation results indicate that megabit class data rates can be supplied to the majority of users. We conclude this thesis by presenting some design trade-offs that are likely to be of interest to those implementing the system.
by Ryan W. Kingsbury.
S.M.
43
Boulkaibet, Ilyes. "Modelling collaborative motion in mobile ad hoc networks." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/5155.
Full textAbstract:
Thesis (MSc (Mathematical Sciences)--University of Stellenbosch, 2010.ENGLISH ABSTRACT: In this thesis, a pricing mechanism to stimulate cooperation between nodes in ad hoc networks is explored. The model incorporates incentives for users to act as transit nodes and carry the traffic between other nodes on multi-hop paths, and to be rewarded with their own ability to send traffic. The thesis investigates the consequences of this pricing model by means of simulation of a network and illustrates the way in which network resources are allocated to users according to their geographical position. Moreover, since modelling node movements is an important aspect in ad hoc network simulation, a collective mobility model, the adaptive mobility model, is used to maximise the area coverage of the nodes.
AFRIKAANSE OPSOMMING: In hierdie tesis word ’n koste meganisme gebruik om samewerking te stimuleer tussen nodusse in ad hoc netwerke. Die model inkorporeer trekpleisters deur gebruikers te beloon om verkeer te stuur deur op te tree as transito nodusse, en verkeer tussen nodusse op multi-skakel paaie te dra. Die tesis ondersoek die ge- volge van die koste model deur die simulering van ’n netwerk, en demonstreer die manier waarop die netwerk hulpbronne geallokeer word aan gebruikers gebaseer op hulle geografiese posisie. Siende dat die modellering van nodus bewegings ’n belangrike aspek is in ad hoc netwerk simulasie, word ’n kollek- tiewe mobiliteits model sowel as ’n veranderlike mobiliteits model gebruik om die dekkings areas van die nodusse te maksimeer.
44
Klos, Lawrence. "Reliable Multicast in Mobile Ad Hoc Wireless Networks." ScholarWorks@UNO, 2009. http://scholarworks.uno.edu/td/1101.
Full textAbstract:
A mobile wireless ad hoc network (MANET) consists of a group of mobile nodes communicating wirelessly with no fixed infrastructure. Each node acts as source or receiver, and all play a role in path discovery and packet routing. MANETs are growing in popularity due to multiple usage models, ease of deployment and recent advances in hardware with which to implement them. MANETs are a natural environment for multicasting, or group communication, where one source transmits data packets through the network to multiple receivers. Proposed applications for MANET group communication ranges from personal network apps, impromptu small scale business meetings and gatherings, to conference, academic or sports complex presentations for large crowds reflect the wide range of conditions such a protocol must handle. Other applications such as covert military operations, search and rescue, disaster recovery and emergency response operations reflect the "mission critical" nature of many ad hoc applications. Reliable data delivery is important for all categories, but vital for this last one. It is a feature that a MANET group communication protocol must provide. Routing protocols for MANETs are challenged with establishing and maintaining data routes through the network in the face of mobility, bandwidth constraints and power limitations. Multicast communication presents additional challenges to protocols. In this dissertation we study reliability in multicast MANET routing protocols. Several on-demand multicast protocols are discussed and their performance compared. Then a new reliability protocol, R-ODMRP is presented that runs on top of ODMRP, a well documented "best effort" protocol with high reliability. This protocol is evaluated against ODMRP in a standard network simulator, ns-2. Next, reliable multicast MANET protocols are discussed and compared. We then present a second new protocol, Reyes, also a reliable on-demand multicast communication protocol. Reyes is implemented in the ns-2 simulator and compared against the current standards for reliability, flooding and ODMRP. R-ODMRP is used as a comparison point as well. Performance results are comprehensively described for latency, bandwidth and reliable data delivery. The simulations show Reyes to greatly outperform the other protocols in terms of reliability, while also outperforming R-ODMRP in terms of latency and bandwidth overhead.
45
Hähner, Jörg. "Consistent data replication in mobile ad hoc networks." [S.l. : s.n.], 2007. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-29798.
Full text
46
Transier, Matthias. "Position-based multicast for mobile ad-hoc networks." [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:180-madoc-20209.
Full text
47
Abdelshafy, Abdallah Mohamed Ahmed. "Securing routing protocols in mobile ad hoc networks." Thesis, Heriot-Watt University, 2016. http://hdl.handle.net/10399/3206.
Full textAbstract:
A Mobile Ad Hoc Network (MANET) is more prone to security threats than other wired and wireless networks because of the distributed nature of the network. Conventional MANET routing protocols assume that all nodes cooperate without maliciously disrupting the operation of the protocol and do not provide defence against attackers. Blackhole and flooding attacks have a dramatic negative impact while grayhole and selfish attacks have a little negative impact on the performance of MANET routing protocols. Malicious nodes or misbehaviour actions detection in the network is an important task to maintain the proper routing protocol operation. Current solutions cannot guarantee the true classification of nodes because the cooperative nature of the MANETs which leads to false exclusions of innocent nodes and/or good classification of malicious nodes. The thesis introduces a new concept of Self- Protocol Trustiness (SPT) to discover malicious nodes with a very high trustiness ratio of a node classification. Designing and implementing new mechanisms that can resist flooding and blackhole attacks which have high negative impacts on the performance of these reactive protocols is the main objective of the thesis. The design of these mechanisms is based on SPT concept to ensure the high trustiness ratio of node classification. In addition, they neither incorporate the use of cryptographic algorithms nor depend on routing packet formats which make these solutions robust and reliable, and simplify their implementations in different MANET reactive protocols. Anti-Flooding (AF) mechanism is designed to resist flooding attacks which relies on locally applied timers and thresholds to classify nodes as malicious. Although AF mechanism succeeded in discovering malicious nodes within a small time, it has a number of thresholds that enable attacker to subvert the algorithm and cannot guarantee that the excluded nodes are genuine malicious nodes which was the motivation to develop this algorithm. On the other hand, Flooding Attack Resisting Mechanism (FARM) is designed to close the security gaps and overcome the drawbacks of AF mechanism. It succeeded in detecting and excluding more than 80% of flooding nodes within the simulation time with a very high trustiness ratio. Anti-Blackhole (AB) mechanism is designed to resist blackhole attacks and relies on a single threshold. The algorithm guarantees 100% exclusion of blackhole nodes and does not exclude any innocent node that may forward a reply packet. Although AB mechanism succeeded in discovering malicious nodes within a small time, the only suggested threshold enables an attacker to subvert the algorithm which was the motivation to develop it. On the other hand, Blackhole Resisting Mechanism (BRM) has the main advantages of AB mechanism while it is designed to close the security gaps and overcome the drawbacks of AB mechanism. It succeeded in detecting and excluding the vast majority of blackhole nodes within the simulation time.
48
Zhang, Jun. "Power control in wireless ad hoc networks /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?CSED%202007%20ZHANG.
Full text
49
Fang, Zuyuan. "Bandwidth allocation in wireless AD HOC networks /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20FANG.
Full textAbstract:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004.Includes bibliographical references (leaves 112-119). Also available in electronic version. Access restricted to campus users.
50
Westin, Ola. "TCP Performance in Wireless Mobile Multi-hop Ad Hoc Networks." Thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-93070.
Full textAbstract:
There are many issues that limit the performance of wireless mobile multi-hop ad hoc networks (MANETs). One of them is that TCP is not well adapted to networks where routes can change or disappear often. In this paper the behaviour of a standard TCP implementation is studied in situations typical for MANETs and compared to the behaviour of a partial implementation of a ATCP, a TCP modification that is intended to increase performance in MANETs. Simulations with simple scenarios show that TCP easily creates a full network load which causes send failures and decreased throughput performance. In some cases the partial ATCP implementation increases throughput but more often it causes an increased amount of duplicate retransmissions. In these scenarios it is unlikely that even a complete ATCP implementation would increase throughput performance. A few modifications to ATCP and TCP are analysed. Especially a limit of the congestion window size shows a large throughput increase. The results are inconclusive, the simulations are too simple to show if the results are applicable in more complex scenarios. It is not clear if ATCP actually is useful in a MANET.Många faktorer begränsar prestandan i trådlösa mobila multi-hopp ad hoc-nätverk (MANET:er). En av dem är att TCP inte är anpassat till nätverk där rutter ofta kan förändras eller försvinna. I den här rapporten studeras hur en vanlig TCP-implementation uppför sig i typiska MANET-situationer. Detta beteende jämförs mot en partiell implementation av ATCP, en TCPmodifiering som är tänkt att öka prestanda i MANET:er. Simuleringar med enkla scenarier visar att TCP lätt genererar en full nätverkslast vilket orsakar misslyckade sändningar och en minskad genomströmningsprestanda. I vissa fall ökar den partiella ATCP-implementationen genomströmningen, men oftare ger den en ökad mängd onödiga omsändningar. I dessa scenarier är det inte troligt att ens en komplett ATCP-implementation skulle öka genomströmningsprestanda. Några mindre förändringar av ATCP och TCP analyseras. Särskilt ger en begränsning av stockningsfönstret en stor ökning av genomströmningen. Resultaten är ofullständiga. Simuleringarna är för enkla för att kunna visa om om resultaten är tillämpliga i mer komplexa scenarier. Det är inte klarlagt ifall ATCP verkligen är användbart i ett MANET.