Dissertations / Theses: 'Mobile ad hoc network'

1

Biswas, Kamanashis, and Md Liakat Ali. "Security Threats in Mobile Ad Hoc Network." Thesis, Blekinge Tekniska Högskola, Avdelningen för för interaktion och systemdesign, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5926.

Full text

Abstract:

Mobile Ad Hoc Network (MANET) is a collection of communication devices or nodes that wish to communicate without any fixed infrastructure and pre-determined organization of available links. The nodes in MANET themselves are responsible for dynamically discovering other nodes to communicate. Although the ongoing trend is to adopt ad hoc networks for commercial uses due to their certain unique properties, the main challenge is the vulnerability to security attacks. A number of challenges like open peer-to-peer network architecture, stringent resource constraints, shared wireless medium, dynamic network topology etc. are posed in MANET. As MANET is quickly spreading for the property of its capability in forming temporary network without the aid of any established infrastructure or centralized administration, security challenges has become a primary concern to provide secure communication. In this thesis, we identify the existent security threats an ad hoc network faces, the security services required to be achieved and the countermeasures for attacks in each layer. To accomplish our goal, we have done literature survey in gathering information related to various types of attacks and solutions, as well as we have made comparative study to address the threats in different layers. Finally, we have identified the challenges and proposed solutions to overcome them. In our study, we have found that necessity of secure routing protocol is still a burning question. There is no general algorithm that suits well against the most commonly known attacks such as wormhole, rushing attack etc. In conclusion, we focus on the findings and future works which may be interesting for the researchers like robust key management, trust based systems, data security in different layer etc. However, in short, we can say that the complete security solution requires the prevention, detection and reaction mechanisms applied in MANET.

APA, Harvard, Vancouver, ISO, and other styles

2

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

3

Yap, Jung Houn. "Locating services in hybrid ad hoc cellular network." Thesis, University of Surrey, 2003. http://epubs.surrey.ac.uk/623/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Stieglitz, Stefan, Christoph Fuchß, and Christoph Lattemann. "Mobile learning by using ad hoc messaging network." Universität Potsdam, 2007. http://opus.kobv.de/ubp/volltexte/2008/1997/.

Full text

Abstract:

The requirements of modern e-learning techniques change. Aspects such as community interaction, flexibility, pervasive learning and increasing mobility in communication habits become more important. To meet thesechallenges e-learning platforms must provide support on mobile learning. Most approaches try to adopt centralized and static elearning mechanisms to mobile devices. However, often technically it is not possible for all kinds of devices to be connected to a central server. Therefore we introduce an application of a mobile e-learning network which operates totally decentralized with the help of an underlying ad hoc network architecture. Furthermore the concept of ad hoc messaging network (AMNET) is used as basis system architecture for our approach to implement a platform for pervasive mobile elearning.

APA, Harvard, Vancouver, ISO, and other styles

5

Stieglitz, Stefan, Christoph Fuchß, Oliver Hillmann, and Christoph Lattemann. "Mobile learning by using ad hoc messaging network." Universität Potsdam, 2007. http://opus.kobv.de/ubp/volltexte/2008/1996/.

Full text

Abstract:

The requirements of modern e-learning techniques change. Aspects such as community interaction, flexibility, pervasive learning and increasing mobility in communication habits become more important. To meet these challenges e-learning platforms must provide support on mobile learning. Most approaches try to adopt centralised and static e-learning mechanisms to mobile devices. However, often technically it is not possible for all kinds of devices to be connected to a central server. Therefore we introduce an application of a mobile e-learning network which operates totally decentralised with the help of an underlying ad hoc network architecture. Furthermore the concept of ad hoc messaging network (AMNET) is used as basis system architecture for our approach to implement a platform for pervasive mobile e-learning.

APA, Harvard, Vancouver, ISO, and other styles

6

Hasan, Mohammad Shahidul. "Application of control over Mobile Ad-hoc Network." Thesis, Staffordshire University, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.522137.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Yan. "Mobile ad hoc network simulation : analysis and enhancements." Thesis, Heriot-Watt University, 2008. http://hdl.handle.net/10399/2161.

Full text

Abstract:

A Mobile Ad-Hoc Network (MANET) is a network consisting of mobile nodes communicating wirelessly. No infrastructure is required, so the nodes have to organise themselves into a network and establish routes in a distributed using distributed self organising algorithms. Routing protocols designed for wired networks are usually unsuitable for MANETs. Simulation has been the main tool for evaluating routing protocols, but differences in assumptions have made it difficult to compare results from different research groups. A characterisation ofMANETs based on quantifying the dynamic aspects of network topology is proposed and shown to be important for analysing performance. The popular random waypoint model (RWP) for node mobility is investigated. When the dynamic measures we propose are simulated, it is found that a very long warm-up period is required. Many published results are based on much shorter simulation experiments, causing us to doubt their validity. To overcome the long initial transient, we analyse the steady state distribution of node location when the RWP is used. A new network topology generation mechanism, the network reorganization model (NR), allows the creation of networks with the same dynamic characteristics as the RWP in a more controllable manner. A classification framework for routing protocols is proposed, based on the functions that a protocol must or may perform. Using this Functional Element Based Framework (FE~F), a large number of proposed and existing protocols from the literature are classified, giving clear insight into the relationships between different protocols.

APA, Harvard, Vancouver, ISO, and other styles

8

Liu, Kejun. "Detecting Routing Misbehavior In Mobile Ad Hoc Network." ScholarWorks@UNO, 2006. http://scholarworks.uno.edu/td/1046.

Full text

Abstract:

Routing misbehavior in MANETs (Mobile Ad Hoc Networks) is studied in this thesis. In general, routing protocols for MANETs are designed based on the assumption that all par- ticipating nodes are fully cooperative. However, due to the open structure and scarcely available battery-based energy, node misbehaviors may exist. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. Therefore, we propose the 2ACK scheme that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction of the routing path. In order to reduce additional routing overhead, only a fraction of the received data packets are acknowledged in the 2ACK scheme. Analytical and simulation results are presented to evaluate the performance of the proposed scheme.

APA, Harvard, Vancouver, ISO, and other styles

9

Puff, Chad J. "Network management system for tactical mobile ad hoc network segments." Thesis, Monterey, California. Naval Postgraduate School, 2011. http://hdl.handle.net/10945/5462.

Full text

Abstract:

Approved for public release; distribution is unlimited.
Mobile Ad Hoc Networking (MANET) technologies are highly desirable in tactical environments because they are able to communicate with neighboring devices over one or more hops in order to extend connectivity to areas where a fixed infrastructure is not available or is not possible. There are many factors which can influence the performance and reliability of a MANET. Communications links within the MANET are continuously fluctuating due to device location, power, or environmental factors. Devices within the MANET can enter the network and then disappear due to the devices losing connectivity because of their physical location relative to other nodes within the network. A network management system (NMS) that can provide for MANET administration in both simulation-based and real-time operational environments provides additional value for this network. The objectives for this network management system is to allow users to predict, monitor, and control network behavior, this specifically includes viewing and remotely managing variables such as node status, node location, attached equipment, channel selection, frequencies, error rates, and network utilization.

APA, Harvard, Vancouver, ISO, and other styles

10

Holland, Gavin Douglas. "Adaptive protocols for mobile ad hoc networks." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1445.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

11

Huang, E. "Rethinking mobile ad hoc networks." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.604708.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

12

Gudapati, Supriya. "Securing mobile ad hoc networks." Thesis, California State University, Long Beach, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1604882.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

13

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 text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

14

Cao, Guangtong. "Distributed services for mobile ad hoc networks." Texas A&M University, 2005. http://hdl.handle.net/1969.1/2541.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

15

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

APA, Harvard, Vancouver, ISO, and other styles

16

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

APA, Harvard, Vancouver, ISO, and other styles

17

Rogers, Paul Edward. "On robustness in high load mobile ad hoc networks." Diss., Online access via UMI:, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

18

INAGAKI, Yasuyoshi, Katsuhiko TOYAMA, and Nobuo KAWAGUCHI. "MAGNET: ad hoc network system based on mobile agents." Elsevier, 2000. http://hdl.handle.net/2237/15448.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Almajnooni, Saad M. "Mobile ad hoc network (MANET) for inter-vehicle communications." Thesis, University of Newcastle Upon Tyne, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.443104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Al-Turaihi, Firas Sabah Salih. "Performance improvement for mobile ad hoc cognitive packets network." Thesis, Brunel University, 2018. http://bura.brunel.ac.uk/handle/2438/17123.

Full text

Abstract:

In this thesis, focusing on the quality of service (QoS) improvement using per-packet power control algorithm in Ad Hoc Cognitive Packet Networks (AHCPN). A power control mechanism creates as a network-assisted function of ad hoc cognitive packet-based routing and aims at reducing both energy consumption in nodes and QoS requirements. The suggested models facilitate transmission power adjustments while also taking into account the effects on network performance. The thesis concentrate on three main contributions. Firstly, a power control algorithm, namely the adaptive Distributed Power management algorithm (DISPOW) was adopted. Performance of DISPOW was compared to existing mechanisms and the results showed 27, 13, 9, and 40 percent improvements in terms of Delay, Throughput, Packet Loss, and Energy Consumption respectively. Secondly, the DISPOW algorithm was enhanced, namely a Link Expiration Time Aware Distributed Power management algorithm (LETPOW). This approach periodically checks connectivity, transmission power, interference level, routing overhead and Node Mobility in AHCPN. The results show that LETPOW algorithm improves the performance of system. Results show further improvement from DISPOW by 30,25,30,42 percent in terms of delay, packet loss ratio , path lengths and energy consumption respectively. Finally,Hybrid Power Control Algorithm (HLPCA) has presented is a combination of Link Expiration Time Aware Distributed Power management algorithm (LETPOW) and Load Power Control Algorithm (LOADPOW); deal with cross-layer power control applied for transmitting information across the various intermediate layers. LOADPOW emphasis on the concept of transmission Power, Received Signal Strength Indication (RSSI), and the suitable distance between the receiver and the sender. The proposed algorithm outperforms DISPOW and LETPOW by 31,15,35,34,44 percent in terms of Delay, Throughput, Packet Loss,path length and Energy Consumption respectively. From this work, it can be concluded that optimized power control algorithm applied to Ad-hoc cognitive packet network results in significant improvement in terms of energy consumption and QoS.

APA, Harvard, Vancouver, ISO, and other styles

21

Liu, Chao. "Efficient Publish/Subscribe System over Mobile Ad-Hoc Network." Thesis, North Dakota State University, 2012. https://hdl.handle.net/10365/26485.

Full text

Abstract:

Information dissemination is an important issue for mobile ad-hoc communities. This issue is very challenging due to the dynamic and fragile nature of the mobile ad-hoc networks, in which participants have limited computing resources and battery, intermittent network connections, and mobile tasks. To address the aforementioned issue, this thesis proposes an efficient semantics-based publish/subscribe strategy. In our proposed publish/subscribe system, distributed mobile participants are organized into clusters based on their location proximity. A compact semantics-based indexing scheme is provided to guide information flow. Intra- and inter- cluster routings are proposed to assist efficient propagation of event notifications. A comprehensive set of simulation experiments prove the effectiveness of the proposed scheme.

APA, Harvard, Vancouver, ISO, and other styles

22

Lin, Tao. "Mobile Ad-hoc Network Routing Protocols: Methodologies and Applications." Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/11127.

Full text

Abstract:

A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peerto- peer routing instead of static network infrastructure to provide network connectivity. MANETs have applications in rapidly deployed and dynamic military and civilian systems. The network topology in a MANET usually changes with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing protocols may not be suitable for MANETs. For example, some assumptions used by these protocols are not valid in MANETs or some protocols cannot efficiently handle topology changes. Researchers are designing new MANET routing protocols and comparing and improving existing MANET routing protocols before any routing protocols are standardized using simulations. However, the simulation results from different research groups are not consistent with each other. This is because of a lack of consistency in MANET routing protocol models and application environments, including networking and user traffic profiles. Therefore, the simulation scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is difficult for one to choose a proper routing protocol for a given MANET application. According to the aforementioned issues, my Ph.D. research focuses on MANET routing protocols. Specifically, my contributions include the characterization of differ- ent routing protocols using a novel systematic relay node set (RNS) framework, design of a new routing protocol for MANETs, a study of node mobility, including a quantitative study of link lifetime in a MANET and an adaptive interval scheme based on a novel neighbor stability criterion, improvements of a widely-used network simulator and corresponding protocol implementations, design and development of a novel emulation test bed, evaluation of MANET routing protocols through simulations, verification of our routing protocol using emulation, and development of guidelines for one to choose proper MANET routing protocols for particular MANET applications. Our study shows that reactive protocols do not always have low control overhead, as people tend to think. The control overhead for reactive protocols is more sensitive to the traffic load, in terms of the number of traffic flows, and mobility, in terms of link connectivity change rates, than other protocols. Therefore, reactive protocols may only be suitable for MANETs with small number of traffic loads and small link connectivity change rates. We also demonstrated that it is feasible to maintain full network topology in a MANET with low control overhead. This dissertation summarizes all the aforementioned methodologies and corresponding applications we developed concerning MANET routing protocols.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

23

Shao, Wenjian. "Quality of service support in mobile Ad Hoc networks." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37042154.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Shao, Wenjian, and 邵文簡. "Quality of service support in mobile Ad Hoc networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B37042154.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

26

Panaousis, Emmanouil A. "Security for mobile ad-hoc networks." Thesis, Kingston University, 2012. http://eprints.kingston.ac.uk/23989/.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

27

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

APA, Harvard, Vancouver, ISO, and other styles

28

Kim, Kyoung Min Sun Min-Te. "Multi initiator connected dominating set construction for mobile ad hoc networks." Auburn, Ala, 2008. http://hdl.handle.net/10415/1549.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Huang, Yi-an. "Intrusion Detection and Response Systems for Mobile Ad Hoc Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14053.

Full text

Abstract:

A mobile ad hoc network (MANET) consists of a group of autonomous mobile nodes with no infrastructure support. In this research, we develop a distributed intrusion detection and response system for MANET, and we believe it presents a second line of defense that cannot be replaced by prevention schemes. We based our detection framework on the study of attack taxonomy. We then propose a set of detection methods suitable of detecting different attack categories. Our approaches are based on protocol specification analysis with categorical and statistical measures. Node-based approaches may be too restrictive in scenarios where attack patterns cannot be observed by any isolated node. Therefore, we have developed cooperative detection approaches for a more effective detection model. One approach is to form IDS clusters by grouping nearby nodes, and information can be exchanged within clusters. The cluster-based scheme is more efficient in terms of power consumption and resource utilization, it is also proved resilient against common security compromises without changing the decentralized assumption. We further address two response techniques, traceback and filtering. Existing traceback systems are not suitable for MANET because they rely on incompatible assumptions such as trustworthy routers and static route topology. Our solution, instead, adapts to dynamic topology with no infrastructure requirement. Our solution is also resilient in the face of arbitrary number of collaborative adversaries. We also develop smart filtering schemes to maximize the dropping rate of attack packets while minimizing the dropping rate of normal packets with real-time guarantee. To validate our research, we present case study using both ns-2 simulation and MobiEmu emulation platform with three ad hoc routing protocols: AODV, DSR and OLSR. We implemented various representative attacks based on the attack taxonomy. Our experiments show very promising results using node-based and cluster-based approaches.

APA, Harvard, Vancouver, ISO, and other styles

30

CHENG, YI. "Security Mechanisms for Mobile Ad Hoc and Wireless Sensor Networks." University of Cincinnati / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1212076752.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

GOYAL, DEVENDRA. "DELAYING OR AVOIDING PARTITIONING IN MOBILE AD HOC NETWORKS USING NETWORK SURVIVABILITY CONCEPTS." University of Cincinnati / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1025619948.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Massin, Raphaël. "On the clustering of mobile ad hoc networks." Electronic Thesis or Diss., Paris, ENST, 2016. https://pastel.hal.science/tel-03689508.

Full text

Abstract:

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és
This 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

APA, Harvard, Vancouver, ISO, and other styles

33

Nikolaev, Ruslan. "A New QoS Routing Protocol for Mobile Ad-hoc Network." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1796121001&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bakht, Humayun. "Investigation of mechanisms for routing in mobile ad-hoc network." Thesis, Liverpool John Moores University, 2006. http://researchonline.ljmu.ac.uk/5840/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Stepanov, Illya. "Integrating realistic mobility models in mobile ad hoc network simulation." [S.l. : s.n.], 2002. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10252217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Malladi, Srikanth. "Arena exploration with an ad hoc network of mobile robots." Cincinnati, Ohio : University of Cincinnati, 2002. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=ucin1028855350.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Alam, Mohammad Rafiqul. "Detecting wormhole and Byzantine attacks in mobile ad hoc networks." Thesis, Curtin University, 2011. http://hdl.handle.net/20.500.11937/1701.

Full text

Abstract:

The recent advancements in the wireless technology and their wide-spread utilization have made tremendous enhancements in productivity in the corporate and industrial sectors. However, these recent progresses have also introduced new security vulnerabilities. Since the wireless shared medium is completely exposed to outsiders, it is susceptible to attacks that could target any of the OSI layers in the network stack. For example, jamming of the physical layer, disruption of the medium access control (MAC) layer coordination packets, attacks against the routing infrastructure, targeted attacks on the transport protocol, or even attacks intended to disrupt specific applications. Unfortunately, the effects of applying the security techniques used in wired networks, such as access control and authentication, to wireless and mobile networks have been unsatisfactory due the unique features of such networks. As a result, achieving security goals for mobile ad hoc networks (MANET) has gained significant attention in recent years. Many critical applications of MANET, such as emergency rescue operations, military tactical communication, and business operations like mining and oil drilling platforms, require a friendly and cooperative environment.The aim of this study is to design detection mechanisms for traditional wormhole and Byzantine wormhole attacks by using the topological comparison and round trip time (RTT) measurements. The first step for detecting traditional wormhole attack is that an initiator of the detection process populates its one-hop neighbor list, and also calculates the average round trip time (RTTavg). Meanwhile, a list of suspected neighbors is generated on the basis of RTTavg and RTT. Then, topological information is exchanged between the initiator and all the suspected neighbors to detect the presence of a wormhole link.In this thesis, we also focus on detecting Byzantine wormhole attack in MANET. In the case of detecting such attacks, the initiator creates its one hop neighbor list and calculates the average RTTavg. The initiator also generates a suspected list of its three hop neighbors. In the next phase, the initiator exchanges topological information with all the one hop neighbors to detect the presence of any Byzantine wormhole tunnel. One of the major concerns for the topological comparison based approach is to give the initially suspected nodes a second chance to prove their reliability by exchanging topological information.We have implemented the detection algorithms in ad hoc on demand distance vector (AODV) and optimized link state routing (OLSR) routing protocols. Then, performance evaluation of the proposed detection mechanisms is conducted. We also compared our proposed detection methods with some of the existing detection methods by simulation. The results show that our schemes can achieve better detection performance.

APA, Harvard, Vancouver, ISO, and other styles

38

Yu, Xuan Hamilton John A. "A defense system on DDOS attacks in mobile ad hoc networks." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2006%20Fall/Dissertations/YU_XUAN_49.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Manousakis, Kyriakos. "Network and domain autoconfiguration a unified framework for large mobile ad hoc networks /." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/3103.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2005.
Thesis research directed by: Electrical Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

40

Merugu, Shashidhar. "Network Design and Routing in Peer-to-Peer and Mobile Ad Hoc Networks." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7219.

Full text

Abstract:

Peer-to-peer networks and mobile ad hoc networks are emerging distributed networks that share several similarities. Fundamental among these similarities is the decentralized role of each participating node to route messages on behalf of other nodes, and thereby, collectively realizing communication between any pair of nodes. Messages are routed on a topology graph that is determined by the peer relationship between nodes. Although routing is fairly straightforward when the topology graph is static, dynamic variations in the peer relationship that often occur in peer-to-peer and mobile ad hoc networks present challenges to routing. In this thesis, we examine the interplay between routing messages and network topology design in two classes of these networks -- unstructured peer-to-peer networks and sparsely-connected mobile ad hoc networks. In unstructured peer-to-peer networks, we add structure to overlay topologies to support file sharing. Specifically, we investigate the advantages of designing overlay topologies with small-world properties to improve (a) search protocol performance and (b) network utilization. We show, using simulation, that "small-world-like" overlay topologies where every node has many close neighbors and few random neighbors exhibit high chances of locating files close to the source of file search query. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. In the context of sparsely-connected mobile ad hoc networks where nodes provide connectivity via mobility, we present a protocol for routing in space and time where the message forwarding decision involves not only where to forward (space), but also when to forward (time). We introduce space-time routing tables and develop methods to compute these routing tables for those instances of ad hoc networks where node mobility is predictable over either a finite horizon or indefinitely due to periodicity in node motion. Furthermore, when the node mobility is unpredictable, we investigate several forwarding heuristics to address the scarcity in transmission opportunities in these sparsely-connected ad hoc networks. In particular, we present the advantages of fragmenting messages and augmenting them with erasure codes to improve the end-to-end message delivery performance.

APA, Harvard, Vancouver, ISO, and other styles

41

SUN, YIN. "Prediction of Mobile Ad hoc Networks Topology by Location History." University of Cincinnati / OhioLINK, 2000. http://rave.ohiolink.edu/etdc/view?acc_num=ucin973698926.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Zhao, Xiaogeng. "An adaptive approach for optimized opportunistic routing over Delay Tolerant Mobile Ad hoc Networks." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1004822.

Full text

Abstract:

This thesis presents a framework for investigating opportunistic routing in Delay Tolerant Mobile Ad hoc Networks (DTMANETs), and introduces the concept of an Opportunistic Confidence Index (OCI). The OCI enables multiple opportunistic routing protocols to be applied as an adaptive group to improve DTMANET routing reliability, performance, and efficiency. The DTMANET is a recently acknowledged networkarchitecture, which is designed to address the challenging and marginal environments created by adaptive, mobile, and unreliable network node presence. Because of its ad hoc and autonomic nature, routing in a DTMANET is a very challenging problem. The design of routing protocols in such environments, which ensure a high percentage delivery rate (reliability), achieve a reasonable delivery time (performance), and at the same time maintain an acceptable communication overhead (efficiency), is of fundamental consequence to the usefulness of DTMANETs. In recent years, a number of investigations into DTMANET routing have been conducted, resulting in the emergence of a class of routing known as opportunistic routing protocols. Current research into opportunistic routing has exposed opportunities for positive impacts on DTMANET routing. To date, most investigations have concentrated upon one or other of the quality metrics of reliability, performance, or efficiency, while some approaches have pursued a balance of these metrics through assumptions of a high level of global knowledge and/or uniform mobile device behaviours. No prior research that we are aware of has studied the connection between multiple opportunistic elements and their influences upon one another, and none has demonstrated the possibility of modelling and using multiple different opportunistic elements as an adaptive group to aid the routing process in a DTMANET. This thesis investigates OCI opportunities and their viability through the design of an extensible simulation environment, which makes use of methods and techniques such as abstract modelling, opportunistic element simplification and isolation, random attribute generation and assignment, localized knowledge sharing, automated scenario generation, intelligent weight assignment and/or opportunistic element permutation. These methods and techniques are incorporated at both data acquisition and analysis phases. Our results show a significant improvement in all three metric categories. In one of the most applicable scenarios tested, OCI yielded a 31.05% message delivery increase (reliability improvement), 22.18% message delivery time reduction (performance improvement), and 73.64% routing depth decrement (efficiency improvement). We are able to conclude that the OCI approach is feasible across a range of scenarios, and that the use of multiple opportunistic elements to aid decision-making processes in DTMANET environments has value.

APA, Harvard, Vancouver, ISO, and other styles

43

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

APA, Harvard, Vancouver, ISO, and other styles

44

Sun, Bo. "Intrusion detection in mobile ad hoc networks." Diss., Texas A&M University, 2003. http://hdl.handle.net/1969.1/2215.

Full text

Abstract:

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 ﬁt 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 proﬁle 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 reﬂect 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 ﬁrst 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 uniﬁed metric for local MANET IDSs to adaptively select normal proﬁles . Different mobility models are utilized to evaluate the performance of the adaptive mechanisms.

APA, Harvard, Vancouver, ISO, and other styles

45

Elkadiki, Hisham Idris A. "Fault detection in mobile ad-hoc networks." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27584.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

46

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

APA, Harvard, Vancouver, ISO, and other styles

47

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

APA, Harvard, Vancouver, ISO, and other styles

48

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

APA, Harvard, Vancouver, ISO, and other styles

49

Park, Sung Jin. "Performance improvement in mobile ad-hoc networks." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45903.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

50

Gonçalves, Gonçalo Filipe Loureiro de Campos. "Mobile Ad Hoc Network Naming System." Master's thesis, 2017. https://repositorio-aberto.up.pt/handle/10216/110600.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Mobile ad hoc network'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles