Dissertations / Theses: 'MANET(Mobile Adhoc Network)'

1

Bulut, Gulsah. "Service Discovery Oriented Clustering For Mobile And Adhoc Networks." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/2/12611889/index.pdf.

Full text

Abstract:

Adhoc networks do not depend on any fixed infrastructure. The most outstanding features of adhoc networks are non-centralized structure and dynamic topology change due to high mobility. Since mentioned dynamics of mobile adhoc networks complicate reaching the resources in the network, service discovery is significantly an important part of constructing stand-alone and self-configurable mobile adhoc networks. The heterogeneity of the devices and limited resources such as battery are also load up more difficulty to service discovery. Due to the volatile nature of the adhoc networks, service discovery algorithms proposed for mobile and adhoc networks suffer from some problems. Scalability becomes a problem when the service discovery is based on flooding messages over the network. Furthermore, the high traffic which occurs due to the message exchange between network nodes makes the communication almost impossible. Partitioning a network into sub-networks is an efficient way of handling scalability problem. In this thesis, a mobility based service discovery algorithm for clustered MANET is presented. The algorithm has two main parts. First one is for partitioning the MANET into sub-networks, named &ldquo clustering&rdquo . Second part is composed of an efficient discovery of services on overall network. Clustering algorithm used in this study is enhanced version of DMAC (Distributed Mobility Adaptive Clustering, which is one of the golden algorithms of the wireless network clustering area). To be fast and flexible in service discovery layer, a simple and fastresponding algorithm is implemented. Integration of two algorithms enables devices to be mobile in the network

APA, Harvard, Vancouver, ISO, and other styles

2

Kumar, Kavitha. "Intrusion Detection in Mobile Adhoc Networks." Connect to full text in OhioLINK ETD Center, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=toledo1260232844.

Full text

Abstract:

Thesis (M.S.)--University of Toledo, 2009. Typescript. "Submitted to the Graduate Faculty as partial fulfillment of the requirements for the Master of Science Degree in Engineering." "A thesis entitled"--at head of title. Bibliography: leaves 80-84.

APA, Harvard, Vancouver, ISO, and other styles

3

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

4

Raška, Martin. "Mobile IP v sítích MANET." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218096.

Full text

Abstract:

This thesis discuss about the problem with mobility of stations in IP networks, concretely protocol Mobile IP and about the problems with this protocol in MANET networks, with the scope on Motorola MESH. First part is about design integration of protocol Mobile IP in this networks with usage Tropos 5210 MetroMesh routers and Cisco components (router, switch) to design and configure wireless MESH network, than connect this network with Cisco components and try to implement Mobile IP into this network. Second part is about design and configure wireless network from Cisco Wireless Access Points and about succesfully implementation of Mobile IP protocol into this network. In the last part is some tests of the function and quality of this topology.

APA, Harvard, Vancouver, ISO, and other styles

5

Alghamdi, Raid Abdullah. "Movement Generator For Mobile Network Simulation." Thesis, Fredericton: University of New Brunswick, 2012. http://hdl.handle.net/1882/44597.

Full text

Abstract:

The simulation of mobile networks relies on a reliable movement generation. Random movement patterns are frequently used in simulators. In this report, the performance of the popular setdest movement generator, which is built into the ns2 open source simulator, is investigated using two statistical tests: quadrat count test and the variance to mean ratio (VMR) test. The results show a non-uniform distribution of nodes during the simulation with a bias towards placing the nodes in the center of the simulated area. We propose and implement a di erent method for random movement generation in the ns2 simulator and show that our movement generator improves the randomness of the node distribution during the simulation. The new generator was successfully tested with the ns2 simulator.

APA, Harvard, Vancouver, ISO, and other styles

6

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

7

Saeed, Nagham. "Intelligent MANET optimisation system." Thesis, Brunel University, 2011. http://bura.brunel.ac.uk/handle/2438/5674.

Full text

Abstract:

In the literature, various Mobile Ad hoc NETwork (MANET) routing protocols proposed. Each performs the best under specific context conditions, for example under high mobility or less volatile topologies. In existing MANET, the degradation in the routing protocol performance is always associated with changes in the network context. To date, no MANET routing protocol is able to produce optimal performance under all possible conditions. The core aim of this thesis is to solve the routing problem in mobile Ad hoc networks by introducing an optimum system that is in charge of the selection of the running routing protocol at all times, the system proposed in this thesis aims to address the degradation mentioned above. This optimisation system is a novel approach that can cope with the network performance’s degradation problem by switching to other routing protocol. The optimisation system proposed for MANET in this thesis adaptively selects the best routing protocol using an Artificial Intelligence mechanism according to the network context. In this thesis, MANET modelling helps in understanding the network performance through different contexts, as well as the models’ support to the optimisation system. Therefore, one of the main contributions of this thesis is the utilisation and comparison of various modelling techniques to create representative MANET performance models. Moreover, the proposed system uses an optimisation method to select the optimal communication routing protocol for the network context. Therefore, to build the proposed system, different optimisation techniques were utilised and compared to identify the best optimisation technique for the MANET intelligent system, which is also an important contribution of this thesis. The parameters selected to describe the network context were the network size and average mobility. The proposed system then functions by varying the routing mechanism with the time to keep the network performance at the best level. The selected protocol has been shown to produce a combination of: higher throughput, lower delay, fewer retransmission attempts, less data drop, and lower load, and was thus chosen on this basis. Validation test results indicate that the identified protocol can achieve both a better network performance quality than other routing protocols and a minimum cost function of 4.4%. The Ad hoc On Demand Distance Vector (AODV) protocol comes in second with a cost minimisation function of 27.5%, and the Optimised Link State Routing (OLSR) algorithm comes in third with a cost minimisation function of 29.8%. Finally, The Dynamic Source Routing (DSR) algorithm comes in last with a cost minimisation function of 38.3%.

APA, Harvard, Vancouver, ISO, and other styles

8

Christman, Michael Edward. "Extensions for Multicast in Mobile Ad-hoc Networks (XMMAN): The Reduction of Data Overhead in Wireless Multicast Trees." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/34525.

Full text

Abstract:

Mobile Ad hoc Network (MANET) routing protocols are designed to provide connectivity between wireless mobile nodes that do not have access to high-speed backbone networks. While many unicast MANET protocols have been explored, research involving multicast protocols has been limited. Existing multicast algorithms attempt to reduce routing overhead, but few, if any, attempt to reduce data overhead. The broadcast nature of wireless communication creates a unique environment in which overlaps in coverage are common. When designed properly, a multicast algorithm can take advantage of these overlaps and reduce data overhead. Unlike a unicast route, in which there is one path between a sender and receiver, a multicast tree can have multiple branches between the sender and its multiple receivers. Some of these paths can be combined to reduce redundant data rebroadcasts. The extensions presented in this thesis are a combination of existing and original routing techniques that were designed to reduce data rebroadcasts by aggregating multicast data flows. One such optimization takes advantage of the multipoint relay (MPR) nodes used by the Optimized Link State Routing (OLSR) unicast protocol. These nodes are used in unicast routing to reduce network broadcast, but can be used to help create efficient multicast data flows. Additionally, by listening to routing messages meant for other nodes, a host can learn a bit about its network and may be able to make routing changes that improve the multicast tree. This protocol was implemented as a software router in Linux. It should be emphasized that this is a real implementation and not a simulation. Experiments showed that the number of data packets in the network could be reduced by as much as 19 percent. These improvements were accomplished while using only a small amount of routing overhead. Master of Science

APA, Harvard, Vancouver, ISO, and other styles

9

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

10

Mondal, Sharup Barua &amp Ratan Chandra. "Impact of Node Mobility on the Voice Quality in Mobile Ad-hoc Network (MANET)." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4156.

Full text

Abstract:

Enormous developing electronic technology has brought telecommunication to the sky inspiring popularity. Wireless Network (WN) technology will be emerging so far human. Presently users give the impression loving be connected all the time (everywhere) to the network or Internet through diverse access system, e.g., Universal Mobile Telecommunications System, Mobile Ad-hoc Network (MANET) [9] and Worldwide Interoperability for Microwave Access [30]. In telecommunication; MANET is considered as self-configured unlike nodes creating infrastructure-less network connected by means of WN, as nodes can exchange data packets without a central control [18]. Choosing beyond line of sight (BLOS) communication, MANET can be an intelligent selection, which is flexible for using and cost saving. However, to maintain quality of service (QoS), more or less challenges still have to be resolved [18]. Multimedia as well as VoIP (Voice over Internet Protocol) gaining more popularity as the internet world favored by the huge use of WN (access technologies) [20]. To maintain persistent services in different MANET situation unlike routing protocols (RP) are employed. In this thesis known (MANET) routing protocols OLSR (Optimized Link State Routing) [20], DSR (Dynamic Source Routing) [30] and TORA (Temporally Ordered Routing Algorithm) [14] have been considered for voice traffic as they maintaining dissimilar characteristics in the dissimilar situations as WN factors (like; bandwidth, signal strength, network traffic or load, network size) influencing the voice quality [9]. This thesis work focusing on the impact of node mobility influencing voice quality in unlike RPs in MANET. To decide the best suit RP in the MANET, the OPNET (Optimized Network Engineering Tool) Simulator 16.0 has been brought into play. OLSR is proposed to be best fitting RP for MANETs running VoIP appliance. Enorma utveckla elektroniska tekniken har fört telekommunikation till himlen inspirerande popularitet. Trådlöst nätverk (WN) teknik kommer att utvecklas så långt mänsklig. För närvarande användare ger intryck kärleksfulla vara ansluten hela tiden (överallt) till nätverket eller Internet via olika system för tillträde, till exempel, Universal Mobile Telecommunications System, Mobil Ad-hoc-nätverk (Manet) [9] och Worldwide Interoperability för Microwave Access-[30 ]. I telekommunikation, är Manet betraktas som själv-konfigurerade skillnad noder skapa infrastruktur mindre nätverk som är anslutet via WN, som noder kan utbyta datapaket utan central styrning [18]. Välja bortom synfältet (Blos) kommunikation, kan Manet vara ett intelligent val, som är flexibel för att använda och kostnadsbesparande. Men för att upprätthålla service (QoS), mer eller mindre problem återstår att lösas [18]. Multimedia samt VoIP (Voice over Internet Protocol) allt mer populärt eftersom internet världen gynnas av den enorma användningen av WN (accesstekniker) [20]. För att behålla ihållande tjänster i olika Manet situationen skillnad routing protokoll (RP) är anställda. I denna kända avhandling (Manet) routingprotokoll OLSR (Optimerad Routing Link State) [20], DSR (Dynamic Source Routing) [30] och Tora (Tidsmässigt ordnad routing algoritm) har [14] ansetts för taltrafik som de upprätthålla olika egenskaper i olika situationer som WN faktorer (som, bandbredd, signalstyrka, nätverkstrafik eller last, nätverkets storlek) Att påverka ljudkvaliteten [9]. Detta examensarbete fokuserar på effekterna av nod rörlighet påverka röstkvalitet i motsats till RPS i Manet. För att avgöra det bäst passar RP i Manet, den OPNET (Optimerad Network Engineering Tool) Simulator 16,0 har kommit in i bilden. OLSR föreslås bli bäst passar RP för MANETs köra VoIP-apparaten. Bergvägen 18 5tr 196 31 Kungsängen Sweden Mob: 0046(0)737106987

APA, Harvard, Vancouver, ISO, and other styles

11

Håkansson, Martin. "An evaluation of reputation spreading in mobile ad-hoc networks." Thesis, University of Skövde, School of Humanities and Informatics, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-864.

Full text

Abstract:

The use of mobile ad-hoc networks (MANETs) is growing. The issue of security in MANETs is not trivial, since such networks have no fixed infrastructure and therefor centralised security is not applicable. MANETs are also more sensitive to attacks due to their wireless communication channels and their spontaneous nature.All kind of cooperation requires a sense of trust. The opinion about trust in other entities can be used as a mean to dynamically allow for secure cooperation in MANETs, as soft security. And also to counter some of the inherited security problems of MANETs.To use opinions as a security paradigm in MANETs the opinions about other nodes has to be spread as reputation about a node. This reputation spreading can be done through spreading of opinions or the spreading of evidences about a nodes behaviour.In this work evidence and reputation spreading are compared to each other. This comparison shows that they are quite similar from a security point of view but that they differ in scalability.

APA, Harvard, Vancouver, ISO, and other styles

12

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

13

Driesslein, Jonathan Clarke. "Scalable mobile ad hoc network (MANET) to enhance situational awareness in distributed small unit operations." Thesis, Monterey, California: Naval Postgraduate School, 2015. http://hdl.handle.net/10945/45843.

Full text

Abstract:

Approved for public release; distribution is unlimited Platforms throughout the military and other government agencies (such as FEEMA and police departments) have become more networked; the last link in each network chain, however, has always been the individuals themselves. This structure requires a network that can process large amounts of data in order to provide the individuals with succinct and actionable information. Information, such as individual positions, weapons orientation, and friendly positions, serve to greatly enhance the situational awareness and improve the likelihood of mission success. The goal of this research is to use networking to improve the infantry’s situational awareness. The Robotic Operating System (ROS) is the foundation of a prototype network investigated in this thesis. It enables rapid prototyping of components and functionality through an open-source library with multi-language and multi-platform support. The network was constructed with software and hardware modules consisting of wearable sensors and various computational platforms. Future development will include linking the network to autonomous units and other assets with simplified controls. The deliverable is a mobile ad-hoc network (MANET) with hardware designed to be operational for infantry squads and software designed to deliver contextual situational awareness to all of its members. The data distribution is handled through a brokered publish and subscribe network implemented via ROS.

APA, Harvard, Vancouver, ISO, and other styles

14

Babalola, Olusola. "OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET." International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604404.

Full text

Abstract:

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada As part of Morgan’s iNET development, the Mixed Cellular and Mobile Ad hoc Network (MCMN) architecture has been 1proposed to provide coverage to over-the horizon test articles. Nodes in MCMN are assigned to one of three possible modes- Ad hoc, Cellular or Gateway. We present architecture for the proposed MCMN and some performance analysis to characterize the network. The problem of organizing nodes in this mixed network with optimal configuration is significant. This configuration gives nodes ability to know the best mode to operate and communicate with other nodes. Node organization is critical to the performance of the mixed network and to improve communication. The configuration of nodes required to optimally organize nodes in MCMN is demonstrated. The problem of evaluating configuration parameters for nodes in a mixed network is a nonlinear and complex one. This is due to the various components like the number of nodes, geographical location, signal strength, mobility, connectivity and others that are involved. Clustering techniques and algorithms have been used in literature to partition networks into clusters to support routing and network management. A clustering technique is employed to dynamically partition the aggregate network into Cluster Cells (CCs). A gateway node is selected for each CC which relays traffic from the cellular to the Ad hoc and vice versa. A trade-off analysis of the cellular boundary is presented using the maximum of the minimum data rate in the network. Numerical analysis and experiments are provided to show that the coverage can be extended to test articles in over-the-horizon region. It is also shown that, when the network is well organized, performance is improved.

APA, Harvard, Vancouver, ISO, and other styles

15

Zabin, Mahe, and Roja Rani Mannam. "Comparative Performance Analysis of MANET Routing Protocols in Internet Based Mobile Ad-hoc Networks." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-19876.

Full text

Abstract:

In crucial times, such as natural disasters like Earthquakes, Floods, military attack, rescue and emergency operations, etc., it is not possible to maintain an infrastructure. In these situations, wireless Mobile Ad-Hoc networks can be an alternative to wired networks. In our thesis, due to the importance of MANET (Mobile Ad-hoc Network) applications, we do research on MANET and its subtype IMANET (Internet based Mobile Ad-hoc Network). In MANETs, finding an optimum path among nodes is not a simple issue due to the random mobility of nodes and topology changes frequently. Simple routing algorithms like Shortest Path, Dijksta‟s and Link State fail to find route in such dynamic scenarios. A number of ad-hoc protocols (Proactive, Reactive, Hybrid and Position based) have been developed for MANETs. In this thesis, we have designed an IMANET in OPNET 14.5 and tested the performance of three different routing protocols namely OLSR (Optimum Link State Routing), TORA (Temporarily Ordered Routing Algorithm) and AODV (Ad-hoc On-demand Distance Vector) in different scenarios by varying the number of nodes and the size of the area. The experimental results demonstrate that among the three protocols, none of the routing protocol can ensure good quality HTTP and voice communication in all our considered scenarios.

APA, Harvard, Vancouver, ISO, and other styles

16

Peters, Gavin M. "Time Division Duplex (TDD) Multi-User Multiple-Input, Multiple-Output (MU-MIMO) Mobile Ad-Hoc Network(MANET)." University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1563525886227608.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Luo, Heng. "Best effort QoS support routing in mobile ad hoc networks." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/6255.

Full text

Abstract:

In the past decades, mobile traffic generated by devices such as smartphones, iphones, laptops and mobile gateways has been growing rapidly. While traditional direct connection techniques evolve to provide better access to the Internet, a new type of wireless network, mobile ad hoc network (MANET), has emerged. A MANET differs from a direct connection network in the way that it is multi-hopping and self-organizing and thus able to operate without the help of prefixed infrastructures. However, challenges such dynamic topology, unreliable wireless links and resource constraints impede the wide applications of MANETs. Routing in a MANET is complex because it has to react efficiently to unfavourable conditions and support traditional IP services. In addition, Quality of Service (QoS) provision is required to support the rapid growth of video in mobile traffic. As a consequence, tremendous efforts have been devoted to the design of QoS routing in MANETs, leading to the emergence of a number of QoS support techniques. However, the application independent nature of QoS routing protocols results in the absence of a one-for-all solution for MANETs. Meanwhile, the relative importance of QoS metrics in real applications is not considered in many studies. A Best Effort QoS support (BEQoS) routing model which evaluates and ranks alternative routing protocols by considering the relative importance of multiple QoS metrics is proposed in this thesis. BEQoS has two algorithms, SAW-AHP and FPP for different scenarios. The former is suitable for cases where uncertainty factors such as standard deviation can be neglected while the latter considers uncertainty of the problems. SAW-AHP is a combination of Simple Additive Weighting and Analytic Hierarchical Process in which the decision maker or network operator is firstly required to assign his/her preference of metrics with a specific number according to given rules. The comparison matrices are composed accordingly, based on which the synthetic weights for alternatives are gained. The one with the highest weight is the optimal protocol among all alternatives. The reliability and efficiency of SAW-AHP are validated through simulations. An integrated architecture, using evaluation results of SAW-AHP is proposed which incorporates the ad hoc technology into the existing WLAN and therefore provides a solution for the last mile access problems. The protocol selection induced cost and gains are also discussed. The thesis concludes by describing the potential application area of the proposed method. Fuzzy SAW-AHP is extended to accommodate the vagueness of the decision maker and complexity of problems such as standard deviation in simulations. The fuzzy triangular numbers are used to substitute the crisp numbers in comparison matrices in traditional AHP. Fuzzy Preference Programming (FPP) is employed to obtain the crisp synthetic weight for alternatives based on which they are ranked. The reliability and efficiency of SAW-FPP are demonstrated by simulations.

APA, Harvard, Vancouver, ISO, and other styles

18

Ferdous, Raihana. "Node-based Trust Management Framework for Mobile Ad hoc Networks." Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365451.1.

Full text

Abstract:

A mobile ad-hoc network(MANET) is a collection of wireless mobile nodes. These nodes are self-organized to create a temporally connection between them without any pre-defined network infrastructure. Nodes communicate each other via direct shared wireless radio links. Each mobile node has limited transmission range. Co- operative nodes, willing to communicate with other nodes out of their transmission range, employ a multi-hop strategy. Therefore, each node simultaneously acts as a router and as a host. Nodes can also join and leave the network at any time. These nodes usually have limited battery life. Nodes are capable of saving their battery power by switching off. They can be switched on when they need to communicate again. Due to their dynamic topology, MANETs are very useful. However this dynamic nature can cause nodes to be compromised easily. Therefore, in this setting, trust is considered to be a key concept in securing MANET environment. But the notion of trust is not granted, as it is measured by observation with time. Besides, mobility of nodes between clusters of MANETs, poses a significant challenge to recommender systems. The ‘new-node‘ problem is difficult to tackle, since without previous preferences of a node, it is not possible to find similar ratings to build a recommender-based profile. Therefore this research presents a rationale and design for much richer dynamic trust management than it is possible today. Thesis (PhD Doctorate) Doctor of Philosophy (PhD) School of Information and Communication Technology Science, Environment, Engineering and Technology Full Text

APA, Harvard, Vancouver, ISO, and other styles

19

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

20

Sneha, Sweta. "Patient Monitoring via Mobile Ad Hoc Network: Power Management, Reliability, and Delays." Digital Archive @ GSU, 2008. http://digitalarchive.gsu.edu/cis_diss/19.

Full text

Abstract:

ABSTRACT PATIENT MONITORING VIA MOBILE AD HOC NETWORK - MAXIMIZING RELIABILITY WHILE MINIMIZING POWER USAGE AND DELAYS BY SWETA SNEHA May 22nd, 2008 Committee Chair: Dr. Upkar Varshney Major Department: Computer Information Systems Comprehensive monitoring of patients based on wireless and mobile technologies has been proposed for early detection of anomalies, provision of prompt medical attention, and corresponding reduction in healthcare expenses associated with unnecessary hospitalizations and treatment. However the quality and reliability of patient monitoring applications have not been satisfactory, primarily due to their sole dependence on infrastructure-oriented wireless networks such as wide-area cellular networks and wireless LANs with unpredictable and spotty coverage. The current research is exploratory in nature and seeks to investigate the feasibility of leveraging mobile ad hoc network for extending the coverage of infrastructure oriented networks when the coverage from the latter is limited/non-existent. Although exciting, there are several challenges associated with leveraging mobile ad hoc network in the context of patient monitoring. The current research focuses on power management of the low-powered monitoring devices with the goal to maximize reliability and minimize delays. The PRD protocols leveraging variable-rate transmit power and the PM-PRD scheme are designed to achieve the aforementioned objective. The PRD protocols manage power transmitted by the source and intermediate routing devices in end to end signal transmission with the obejective to maximize end to end reliability. The PM-PRD scheme operationalizes an appropriate PRD protocol in end to end signal transmission for diverse patient monitoring scenarios with the objective to maximize reliability, optimize power usage, and minimize delays in end to end signal transmission. Analytical modeling technique is utilized for modeling diverse monitoring scenarios in terms of the independent variables and assessing the performance of the research artifacts in terms of the dependent variables. The evaluation criterion of the research artifacts is maximization of reliability and minimization of power usage and delays for diverse monitoring scenarios. The performance evaluation of the PRD protocols is based on maximization of end to end reliability in signal transmission. The utility of the PM-PRD scheme is associated with operationalizing an appropriate protocol for a given monitoring scenario. Appropriateness of a protocol for a given scenario is based on the performance of the PRD protocols with respect to the dependent variables (i.e., end to end reliability, end to end power usage, and end to end delays). Hence the performance evaluation of the PRD protocols in terms of the dependent variables is utilized to (a) discover the best protocol and (b) validate the accuracy and utility of the PM-PRD scheme in allocating the best protocol for diverse monitoring scenarios. The results validate the effectiveness of the research artifacts in maximizing reliability while minimizing power usage and delays in end to end signal transmission via a multi-hop mobile ad hoc network. Consequently the research establishes the feasibility of multi-hop mobile ad hoc network in supplementing the spotty network coverage of infrastructure oriented networks thereby enhancing the quality and dependability of the process of signal transmission associated with patient monitoring applications.

APA, Harvard, Vancouver, ISO, and other styles

21

Vajsar, Pavel. "Směrovací protokol pro sítě MANET zohledňující požadavky na kvalitu služeb." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-233650.

Full text

Abstract:

The web and mobile web traffic is growing rapidly due to service accessibility in densely populated areas and massive usage of smart hand held devices (smartphones, pads and Internet dongles). This is a challenge for mobile operators and service providers, because it forces systematically increasing network throughput capacity and in parallel to keep this investment on profitable basis. On the other side, the user satisfaction with mobile broadband service should be considered as well, in order to balance the user expectations and mobile operator investments. Our work provides extensive QoE study for different conditions in sense of mobile web service, web content, network conditions and end user device. Finally, the obtained results create basis for more dimensional overview of mobile web QoE and allow to recognize quality and saturation thresholds based on network parameters. Further, obtained data provide base for design three prediction models for prediction of MOS (one for notebook, one for mobile device) and acceptability.

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

INAGAKI, Yasuyoshi, Katsuhiko KAJI, Nobuo KAWAGUCHI, 康善稲垣, 克彦梶 та 信夫河口. "Appliance Bonding : 情報家電間連携の動的な指示手法". 一般社団法人情報処理学会, 2002. http://hdl.handle.net/2237/15399.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Thurston, Michael J. "A pragmatic view of MANET performance evaluation and design of a prototype MAC level routing algorithm." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0108103-122903.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Njilla, Laurent L. Y. "Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory." FIU Digital Commons, 2015. http://digitalcommons.fiu.edu/etd/2284.

Full text

Abstract:

This dissertation presents novel approaches to modeling and analyzing security and resource allocation in mobile ad hoc networks (MANETs). The research involves the design, implementation and simulation of different models resulting in resource sharing and security’s strengthening of the network among mobile devices. Because of the mobility, the network topology may change quickly and unpredictably over time. Moreover, data-information sent from a source to a designated destination node, which is not nearby, has to route its information with the need of intermediary mobile nodes. However, not all intermediary nodes in the network are willing to participate in data-packet transfer of other nodes. The unwillingness to participate in data forwarding is because a node is built on limited resources such as energy-power and data. Due to their limited resource, nodes may not want to participate in the overall network objectives by forwarding data-packets of others in fear of depleting their energy power. To enforce cooperation among autonomous nodes, we design, implement and simulate new incentive mechanisms that used game theoretic concepts to analyze and model the strategic interactions among rationale nodes with conflicting interests. Since there is no central authority and the network is decentralized, to address the concerns of mobility of selfish nodes in MANETs, a model of security and trust relationship was designed and implemented to improve the impact of investment into trust mechanisms. A series of simulations was carried out that showed the strengthening of security in a network with selfish and malicious nodes. Our research involves bargaining for resources in a highly dynamic ad-hoc network. The design of a new arbitration mechanism for MANETs utilizes the Dirichlet distribution for fairness in allocating resources. Then, we investigated the problem of collusion nodes in mobile ad-hoc networks with an arbitrator. We model the collusion by having a group of nodes disrupting the bargaining process by not cooperating with the arbitrator. Finally, we investigated the resource allocation for a system between agility and recovery using the concept of Markov decision process. Simulation results showed that the proposed solutions may be helpful to decision-makers when allocating resources between separated teams.

APA, Harvard, Vancouver, ISO, and other styles

26

Rivera, Brian. "Using Terrain and Location Information to Improve Routing in Ad Hoc Networks." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/14476.

Full text

Abstract:

In recent years, mobile computing has become an integral part of society. As the cost of laptops and wireless networking hardware has declined, society has become increasingly connected. High speed wireless internet access is increasingly becoming part of our daily lives. As a result of this dependence on instant access to information, there is a growing need to create wireless networks without having access to a fixed networking infrastructure. Instead of relying in fixed infrastructure, these mobile nodes can be joined to create an ad hoc network to facilitate information sharing. The ad hoc nature of these networks requires different protocols than traditional networks. This research is motivated by the observation that radio communications are greatly affected by the physical environment. In hilly or urban environments, the performance of a wireless network is much lower than in large open areas. However, MANET protocols typically consider the physical environment only when it causes a change in connectivity. We examine whether the network can estimate the physical environment and predict its impact on the network, rather than waiting to react to the physical environment. This research demonstrates the feasibility of using terrain and location information to improve routing in mobile ad hoc networks through the development of a distributed routing algorithm that uses location and digital terrain information to efficiently deliver packets in a mobile ad hoc network. Through a comprehensive set of simulations, we show that the new algorithm performs better than current MANET protocols in terms of standard metrics: delay, throughput, packet loss, and efficiency.

APA, Harvard, Vancouver, ISO, and other styles

27

Silva, Anderson Aparecido Alves da. "Uma arquitetura para agrupamento de controles de segurança em ambientes de tecnologia da informação baseada em barganhas cooperativas irrestritas." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/3/3142/tde-21032017-154023/.

Full text

Abstract:

Controles de segurança, também chamados de mecanismos de proteção, voltados para previsão e detecção de eventos indesejados são cada vez mais empregados em ambientes de Tecnologia da Informação (TI). O pouco entendimento sobre as características dos eventos indesejados que agem nos sistemas e a baixa compatibilidade existente entre os diversos mecanismos de proteção são problemas que se destacam neste tipo de cenário. Diferentes configurações dificultam a combinação dos resultados destes mecanismos e raramente dois ou mais controles de segurança se complementam. Por esse motivo, o agrupamento entre mecanismos de detecção e de previsão não é trivialmente resolvido. Neste trabalho é proposta uma arquitetura, denominada de Arquitetura Estratégica de Agrupamento - Strategic Grouping Architecture (SGA) - para agrupamento de controles de segurança voltados para detecção e/ou previsão, que tem como base a busca de um equilíbrio entre as configurações e os resultados individuais de cada mecanismo de proteção envolvido. Para alcançar este equilíbrio a arquitetura proposta divide a análise dos eventos (legítimos e maliciosos) que passam pelos controles de segurança em dois níveis de abstração: o técnico, onde são coletadas as configurações e os resultados dos controles de segurança; e o estratégico, onde os dados obtidos no nível técnico são analisados por meio de barganhas cooperativas irrestritas - Unrestricted Cooperative Bargains (UCB), conceito proveniente da Teoria dos Jogos, que busca a otimização e equilíbrio entre resultados. Justamente por ser realizada em um nível de abstração diferente, a análise gerada pelo SGA identifica a influência que cada configuração exerce nos resultados agrupados. Para explorar a capacidade da arquitetura proposta, dois experimentos, bastante diferentes, que envolvem a ação de eventos indesejados em ambientes de TI são conduzidos. Os resultados obtidos mostram a viabilidade do agrupamento de controles de segurança de detecção e previsão e a possibilidade do uso do SGA em outros ambientes, que não estejam necessariamente ligados à segurança de TI. Baseada na literatura científica a validação do SGA consiste de uma transformação prévia na categoria dos jogos estratégicos usados - cooperativos para não-cooperativos - e na busca de situações como o Equilíbrio de Nash (EN) e o ótimo de Pareto, que indicam os melhores resultados de um jogo. Security controls, also called protection mechanisms, focused on forecasting and detection of unwanted events are increasingly employed in Information Technology (IT) environments. The little understanding about the characteristics of unwanted events which act on the systems and the low rate of compatibility among several protection mechanisms are both problems that arise in that scenario. Different settings make difficult combining the results of these mechanisms and two or more controls rarely complement each other. Due to that, grouping mechanisms of detection and forecasting is not a trivial matter. In this work a framework called Strategic Grouping Architecture (SGA) is proposed to grouping security controls focused on detection and/or forecasting. SGA is based on the search for equilibrium between the settings and the individual results of each protection mechanism involved. In order to reach this equilibrium the proposed framework divide the analysis of events (legitimates and malicious) which go through the security controls in two abstract levels: the technical level, where the settings and the results of security controls are collected; and the strategic level, where the data obtained in the technical level are analyzed through Unrestricted Cooperative Bargains (UCB), concept from Game Theory that seeks to optimize and balance the results. Precisely because it is performed on a different level of abstraction, the analysis generated by the SGA identifies the influence that each setting has on the clustered results. In order to exploit the capability of the proposed architecture, two experiments, quite different, involving the action of unwanted events in IT environments, are conducted. The obtained findings show the feasibility of grouping detection and forecasting security controls and the possibility of using the SGA in other environments that are not necessarily related to IT security. Based on scientific literature SGA validation consists of a previous transformation in the category of strategy games used - cooperative to non-cooperative - and the search for situations such as the Nash Equilibrium (NE) and the Pareto optimal, indicating the best results a game.

APA, Harvard, Vancouver, ISO, and other styles

28

Almotiri, Sultan H. "Design and Evaluation of Security Mechanism for Routing in MANETs. Elliptic Curve Diffie-Hellman cryptography mechanism to secure Dynamic Source Routing protocol (DSR) in Mobile Ad Hoc Network (MANET)." Thesis, University of Bradford, 2013. http://hdl.handle.net/10454/5718.

Full text

Abstract:

Ensuring trustworthiness through mobile nodes is a serious issue. Indeed, securing the routing protocols in Mobile Ad Hoc Network (MANET) is of paramount importance. A key exchange cryptography technique is one such protocol. Trust relationship between mobile nodes is essential. Without it, security will be further threatened. The absence of infrastructure and a dynamic topology changing reduce the performance of security and trust in mobile networks. Current proposed security solutions cannot cope with eavesdroppers and misbehaving mobile nodes. Practically, designing a key exchange cryptography system is very challenging. Some key exchanges have been proposed which cause decrease in power, memory and bandwidth and increase in computational processing for each mobile node in the network consequently leading to a high overhead. Some of the trust models have been investigated to calculate the level of trust based on recommendations or reputations. These might be the cause of internal malicious attacks. Our contribution is to provide trustworthy communications among the mobile nodes in the network in order to discourage untrustworthy mobile nodes from participating in the network to gain services. As a result, we have presented an Elliptic Curve Diffie-Hellman key exchange and trust framework mechanism for securing the communication between mobile nodes. Since our proposed model uses a small key and less calculation, it leads to a reduction in memory and bandwidth without compromising on security level. Another advantage of the trust framework model is to detect and eliminate any kind of distrust route that contain any malicious node or suspects its behavior.

APA, Harvard, Vancouver, ISO, and other styles

29

Abdelhafez, Mohamed. "Modeling and Simulations of Worms and Mitigation Techniques." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19840.

Full text

Abstract:

Internet worm attacks have become increasingly more frequent and have had a major impact on the economy, making the detection and prevention of these attacks a top security concern. Several countermeasures have been proposed and evaluated in recent literature. However, the eect of these proposed defensive mechanisms on legitimate competing traffic has not been analyzed. The first contribution of this thesis is a comparative analysis of the effectiveness of several of these proposed mechanisms, including a measure of their effect on normal web browsing activities. In addition, we introduce a new defensive approach that can easily be implemented on existing hosts, and which significantly reduces the rate of spread of worms using TCP connections to perform the infiltration. Our approach has no measurable effect on legitimate traffic. The second contribution is presenting a variant of the flash worm that we term Compact Flash or CFlash that is capable of spreading even faster than its predecessor. We perform a comparative study between the flash worm and the CFlash worm using a full-detail packet-level simulator, and the results show the increase in propagation rate of the new worm given the same set of parameters. The third contribution is the study of the behavior of TCP based worms in MANETs. We develop an analytical model for the worm spread of TCP worms in the MANETs environment that accounts for payloadsize, bandwidthsharing, radio range, nodal density and several other parameters specific for MANET topologies. We also present numerical solutions for the model and verify the results using packetlevel simulations. The results show that the analytical model developed here matches the results of the packetlevel simulation in most cases.

APA, Harvard, Vancouver, ISO, and other styles

30

Sahin, Serdar. "Advanced receivers for distributed cooperation in mobile ad hoc networks." Thesis, Toulouse, INPT, 2019. http://www.theses.fr/2019INPT0089.

Full text

Abstract:

Les réseaux ad hoc mobiles (MANETs) sont des systèmes de communication sans fil rapidement déployables et qui fonctionnent avec une coordination minimale, ceci afin d'éviter les pertes d'efficacité spectrale induites par la signalisation. Les stratégies de transmissions coopératives présentent un intérêt pour les MANETs, mais la nature distribuée de tels protocoles peut augmenter le niveau d'interférence avec un impact autant plus sévère que l'on cherche à pousser les limites des efficacités énergétique et spectrale. L'impact de l'interférence doit alors être réduit par l'utilisation d'algorithmes de traitement du signal au niveau de la couche PHY, avec une complexité calculatoire raisonnable. Des avancées récentes sur les techniques de conception de récepteurs numériques itératifs proposent d'exploiter l'inférence bayésienne approximée et des techniques de passage de message associés afin d'améliorer le potentiel des turbo-détecteurs plus classiques. Entre autres, la propagation d'espérance (EP) est une technique flexible, qui offre des compromis attractifs de complexité et de performance dans des situations où la propagation de croyance conventionnel est limité par sa complexité calculatoire. Par ailleurs, grâce à des techniques émergentes de l'apprentissage profond, de telles structures itératives peuvent être projetés vers des réseaux de détection profonds, où l'apprentissage des hyper-paramètres algorithmiques améliore davantage les performances. Dans cette thèse nous proposons des égaliseurs à retour de décision à réponse impulsionnelle finie basée sur la propagation d'espérance (EP) qui apportent des améliorations significatives, en particulier pour des applications à haute efficacité spectrale vis à vis des turbo-détecteurs conventionnels, tout en ayant l'avantage d'être asymptotiquement prédictibles. Nous proposons un cadre générique pour la conception de récepteurs dans le domaine fréquentiel, afin d'obtenir des architectures de détection avec une faible complexité calculatoire. Cette approche est analysée théoriquement et numériquement, avec un accent mis sur l'égalisation des canaux sélectifs en fréquence, et avec des extensions pour de la détection dans des canaux qui varient dans le temps ou pour des systèmes multi-antennes. Nous explorons aussi la conception de détecteurs multi-utilisateurs, ainsi que l'impact de l'estimation du canal, afin de comprendre le potentiel et le limite de cette approche. Pour finir, nous proposons une méthode de prédiction performance à taille finie, afin de réaliser une abstraction de lien pour l'égaliseur domaine fréquentiel à base d'EP. L'impact d'un modélisation plus fine de la couche PHY est évalué dans le contexte de la diffusion coopérative pour des MANETs tactiques, grâce à un simulateur flexible de couche MAC Mobile ad hoc networks (MANETs) are rapidly deployable wireless communications systems, operating with minimal coordination in order to avoid spectral efficiency losses caused by overhead. Cooperative transmission schemes are attractive for MANETs, but the distributed nature of such protocols comes with an increased level of interference, whose impact is further amplified by the need to push the limits of energy and spectral efficiency. Hence, the impact of interference has to be mitigated through with the use PHY layer signal processing algorithms with reasonable computational complexity. Recent advances in iterative digital receiver design techniques exploit approximate Bayesian inference and derivative message passing techniques to improve the capabilities of well-established turbo detectors. In particular, expectation propagation (EP) is a flexible technique which offers attractive complexity-performance trade-offs in situations where conventional belief propagation is limited by computational complexity. Moreover, thanks to emerging techniques in deep learning, such iterative structures are cast into deep detection networks, where learning the algorithmic hyper-parameters further improves receiver performance. In this thesis, EP-based finite-impulse response decision feedback equalizers are designed, and they achieve significant improvements, especially in high spectral efficiency applications, over more conventional turbo-equalization techniques, while having the advantage of being asymptotically predictable. A framework for designing frequency-domain EP-based receivers is proposed, in order to obtain detection architectures with low computational complexity. This framework is theoretically and numerically analysed with a focus on channel equalization, and then it is also extended to handle detection for time-varying channels and multiple-antenna systems. The design of multiple-user detectors and the impact of channel estimation are also explored to understand the capabilities and limits of this framework. Finally, a finite-length performance prediction method is presented for carrying out link abstraction for the EP-based frequency domain equalizer. The impact of accurate physical layer modelling is evaluated in the context of cooperative broadcasting in tactical MANETs, thanks to a flexible MAC-level simulator

APA, Harvard, Vancouver, ISO, and other styles

31

Lundgren, Henrik. "Implementation and Experimental Evaluation of Wireless Ad hoc Routing Protocols." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4806.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Christmann, Hans Claus. "Self-configuring ad-hoc networks for unmanned aerial systems." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22626.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Aslam, Baber. "Networking and security solutions for VANET initial deployment stage." Doctoral diss., University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5109.

Full text

Abstract:

Vehicular ad hoc network (VANET) is a special case of mobile networks, where vehicles equipped with computing/communicating devices (called "smart vehicles") are the mobile wireless nodes. However, the movement pattern of these mobile wireless nodes is no more random, as in case of mobile networks, rather it is restricted to roads and streets. Vehicular networks have hybrid architecture; it is a combination of both infrastructure and infrastructure-less architectures. The direct vehicle to vehicle (V2V) communication is infrastructure-less or ad hoc in nature. Here the vehicles traveling within communication range of each other form an ad hoc network. On the other hand, the vehicle to infrastructure (V2I) communication has infrastructure architecture where vehicles connect to access points deployed along roads. These access points are known as road side units (RSUs) and vehicles communicate with other vehicles/wired nodes through these RSUs. To provide various services to vehicles, RSUs are generally connected to each other and to the Internet. The direct RSU to RSU communication is also referred as I2I communication. The success of VANET depends on the existence of pervasive roadside infrastructure and sufficient number of smart vehicles. Most VANET applications and services are based on either one or both of these requirements. A fully matured VANET will have pervasive roadside network and enough vehicle density to enable VANET applications. However, the initial deployment stage of VANET will be characterized by the lack of pervasive roadside infrastructure and low market penetration of smart vehicles. It will be economically infeasible to initially install a pervasive and fully networked roadside infrastructure, which could result in the failure of applications and services that depend on V2I or I2I communications. Further, low market penetration means there are insufficient number of smart vehicles to enable V2V communication, which could result in failure of services and applications that depend on V2V communications. Non-availability of pervasive connectivity to certification authorities and dynamic locations of each vehicle will make it difficult and expensive to implement security solutions that are based on some central certificate management authority. Non-availability of pervasive connectivity will also affect the backend connectivity of vehicles to the Internet or the rest of the world. Due to economic considerations, the installation of roadside infrastructure will take a long time and will be incremental thus resulting in a heterogeneous infrastructure with non-consistent capabilities. Similarly, smart vehicles will also have varying degree of capabilities. This will result in failure of applications and services that have very strict requirements on V2I or V2V communications. We have proposed several solutions to overcome the challenges described above that will be faced during the initial deployment stage of VANET. Specifically, we have proposed: 1) a VANET architecture that can provide services with limited number of heterogeneous roadside units and smart vehicles with varying capabilities, 2) a backend connectivity solution that provides connectivity between the Internet and smart vehicles without requiring pervasive roadside infrastructure or large number of smart vehicles, 3) a security architecture that does not depend on pervasive roadside infrastructure or a fully connected V2V network and fulfills all the security requirements, and 4) optimization solutions for placement of a limited number of RSUs within a given area to provide best possible service to smart vehicles. The optimal placement solutions cover both urban areas and highways environments. ID: 031001553; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Adviser: .; Title from PDF title page (viewed August 23, 2013).; Thesis (Ph.D.)--University of Central Florida, 2012.; Includes bibliographical references. Ph.D. Doctorate Computer Science Engineering and Computer Science Computer Science

APA, Harvard, Vancouver, ISO, and other styles

34

Aldabbas, Hamza. "Securing data dissemination in vehicular ad hoc networks." Thesis, De Montfort University, 2012. http://hdl.handle.net/2086/7987.

Full text

Abstract:

Vehicular ad hoc networks (VANETs) are a subclass of mobile ad hoc networks (MANETs) in which the mobile nodes are vehicles; these vehicles are autonomous systems connected by wireless communication on a peer-to-peer basis. They are self-organized, self-configured and self-controlled infrastructure-less networks. This kind of network has the advantage of being able to be set-up and deployed anywhere and anytime because it has no infrastructure set-up and no central administration. Distributing information between these vehicles over long ranges in such networks, however, is a very challenging task, since sharing information always has a risk attached to it especially when the information is confidential. The disclosure of such information to anyone else other than the intended parties could be extremely damaging, particularly in military applications where controlling the dissemination of messages is essential. This thesis therefore provides a review of the issue of security in VANET and MANET; it also surveys existing solutions for dissemination control. It highlights a particular area not adequately addressed until now: controlling information flow in VANETs. This thesis contributes a policy-based framework to control the dissemination of messages communicated between nodes in order to ensure that message remains confidential not only during transmission, but also after it has been communicated to another peer, and to keep the message contents private to an originator-defined subset of nodes in the VANET. This thesis presents a novel framework to control data dissemination in vehicle ad hoc networks in which policies are attached to messages as they are sent between peers. This is done by automatically attaching policies along with messages to specify how the information can be used by the receiver, so as to prevent disclosure of the messages other than consistent with the requirements of the originator. These requirements are represented as a set of policy rules that explicitly instructs recipients how the information contained in messages can be disseminated to other nodes in order to avoid unintended disclosure. This thesis describes the data dissemination policy language used in this work; and further describes the policy rules in order to be a suitable and understandable language for the framework to ensure the confidentiality requirement of the originator. This thesis also contributes a policy conflict resolution that allows the originator to be asked for up-to-date policies and preferences. The framework was evaluated using the Network Simulator (NS-2) to provide and check whether the privacy and confidentiality of the originators’ messages were met. A policy-based agent protocol and a new packet structure were implemented in this work to manage and enforce the policies attached to packets at every node in the VANET. Some case studies are presented in this thesis to show how data dissemination can be controlled based on the policy of the originator. The results of these case studies show the feasibility of our research to control the data dissemination between nodes in VANETs. NS-2 is also used to test the performance of the proposed policy-based agent protocol and demonstrate its effectiveness using various network performance metrics (average delay and overhead).

APA, Harvard, Vancouver, ISO, and other styles

35

Patra, Tapas Kumar. "Content Dissemination in Mobile Ad Hoc Networks." Thesis, 2016. http://etd.iisc.ac.in/handle/2005/3761.

Full text

Abstract:

In this thesis, we are concerned with content dissemination in mobile ad hoc networks. The scope of content dissemination is limited by network capacity, and sometimes the price to be paid for securing faster delivery. In the first part of the thesis, we address the issue of finding the maximum throughput that a mobile ad-hoc network can support. We have assumed that there is no price involved, and all nodes work as a team. The problem of determining the capacity region has long been known to be NP-hard even for stationary nodes. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale, resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the proposed heuristic is simple to implement and is not overly sensitive to the threshold value. We find empirical conditions for our heuristic to be near-optimal. Also, network scenarios when our heuristic does not perform very well are analyzed. We provide extensive numerical analysis and simulation results for different parameter settings of our model. Interestingly, we observe that in low density network the average throughput can first decrease with mobility, and then increase. This motivates us to study a mobile ad-hoc network when it is sparse and in a generalized environment, such as when movement of nodes is in a two-dimension plane. Due to sparseness, there are frequent disruptions in the connections and there may not be any end-to-end connection for delivery. The mobility of nodes may be used for carrying the forwarded message to the destination. This network is also known as a delay tolerant network. In the rest part of the thesis, we consider the relay nodes to be members of a group that charges a price for assisting in message transportation. First, we solve the problem of how to select first relay node when only one relay node can be chosen from a given number of groups. Next, we solve two problems, namely price-constrained delay minimization, and delay-constrained price optimization.

APA, Harvard, Vancouver, ISO, and other styles

36

Patra, Tapas Kumar. "Content Dissemination in Mobile Ad Hoc Networks." Thesis, 2016. http://etd.iisc.ernet.in/2005/3761.

Full text

Abstract:

In this thesis, we are concerned with content dissemination in mobile ad hoc networks. The scope of content dissemination is limited by network capacity, and sometimes the price to be paid for securing faster delivery. In the first part of the thesis, we address the issue of finding the maximum throughput that a mobile ad-hoc network can support. We have assumed that there is no price involved, and all nodes work as a team. The problem of determining the capacity region has long been known to be NP-hard even for stationary nodes. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale, resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the proposed heuristic is simple to implement and is not overly sensitive to the threshold value. We find empirical conditions for our heuristic to be near-optimal. Also, network scenarios when our heuristic does not perform very well are analyzed. We provide extensive numerical analysis and simulation results for different parameter settings of our model. Interestingly, we observe that in low density network the average throughput can first decrease with mobility, and then increase. This motivates us to study a mobile ad-hoc network when it is sparse and in a generalized environment, such as when movement of nodes is in a two-dimension plane. Due to sparseness, there are frequent disruptions in the connections and there may not be any end-to-end connection for delivery. The mobility of nodes may be used for carrying the forwarded message to the destination. This network is also known as a delay tolerant network. In the rest part of the thesis, we consider the relay nodes to be members of a group that charges a price for assisting in message transportation. First, we solve the problem of how to select first relay node when only one relay node can be chosen from a given number of groups. Next, we solve two problems, namely price-constrained delay minimization, and delay-constrained price optimization.

APA, Harvard, Vancouver, ISO, and other styles

37

Bhati, Bhawani Shanker. "Design of Privacy Protection Schemes for Mobile Adhoc Networks using Rough Set Theory." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5264.

Full text

Abstract:

MANET is a self-con guring, decentralized and infrastructure-less mobile wireless network, where autonomous mobile nodes (such as laptops, smartphones, sensors, etc.) communicate over the wireless channels. Thus, MANETs are suitable for supporting decentralized and mo- bile applications in the areas, like healthcare, military, commercial, education and many others. However, MANETs consist of limited transmission range, limited device capabilities, unreliable wireless links, dynamic changes in network topology, lack of security, etc., which introduce sev- eral vulnerabilities that must be dealt with to achieve the success of MANETs. A vulnerability is a weakness, that is exploited by the attackers to introduce privacy breaches during route es- tablishment and data transfer stages. In route establishment stage, the nodes have to disclose some of the routing information such as their identity, location, etc., which can be obtained by an attacker at the malicious intermediate nodes, thus resulting in privacy breach. Due to wireless nature of links between the mobile nodes, the attackers can identify the communicating nodes just by overhearing and tracing the transmitted data packets from sender to receiver, thus breaching privacy during the data transfer stage. Thus, lack of strong privacy preserving solutions may lead to highly unacceptable results, such as real-time tracking of location move- ments, the disclosure of sensitive data, etc. In this thesis, we propose solutions to preserve location privacy and data privacy in MANETs, which are paramount to ensure acceptance of MANET applications. We have applied Rough Set Theory (RST) concepts, as it is efficiently used for classi cation of nodes, and generating privacy policies with minimum overheads by eliminating redundant information. First, we design and develop, a Location Privacy Preservation (LPP) protocol which estab- lishes an untraceable route between communicating nodes while preserving location privacy. The sender initiates the establishment of a route to a receiver through trusted nodes, where RST de nes the trust attributes such as resource availability, node reliability and node history of 1-hop neighbor nodes. The trust value (or trustworthiness) of a node is determined based on their trust attribute values. The route between sender and receiver nodes is established through trusted nodes only, and these trusted nodes act as the temporary sender for their next hop, till the receiver is reached. To ensures that the route is established with designated trusted node, and to check for any suspected situation, challenge-response messages are exchanged at each hop. The proposed LPP protocol is evaluated through simulation and also compared with earlier works. We discuss the performance analysis of the LPP protocol. We provide a formal veri cation model to shows the validity of the LPP protocol using ProVerif tool (an automatic formal protocol veri cation tool), which is utilized to formalize the functions of LPP protocol using ProVerif's calculus. The data transmitted may contain sensitive information, and undesired disclosure of in- formation can lead to the launching of various attacks, thus breaching the data privacy. For this, we have proposed a Data Privacy Preservation (DPP) scheme based on data anonymity approach, where RST concepts are applied to determine the level of data anonymity during the data transfer. Data packets are enclosed within capsules that can be opened only by the designated nodes, thus preventing the undesired leakage of the data. On the suspected situa- tions, challenge-response messages are exchanged to check data privacy violations by next hop trusted node. The route between sender and receiver is changed dynamically at each hop. The proposed DPP scheme is evaluated through simulation, and compared with some of the earlier works. The performance analysis of DPP scheme is discussed. Also, DPP scheme is tested by considering different case studies in a MANET deployed for the stock market application. Due to the development in the technology and realistic result expectation of the user, it is required to develop more practical privacy preserving solutions by collecting the context information. In this connection, we have extended the LPP protocol to a Context based Loca- tion Privacy Maintenance (CLPM) scheme, which takes context information related to nodes en route to maintain location privacy during the data transfer. RST concepts are applied to determine the privacy maintenance level of next hop trusted node, and then based on the pri- vacy maintenance level, failure to preserve location privacy are identi fied. The challenge and response messages are exchanged at each hop to ensure that trusted node maintains location privacy. If location privacy violation is detected, then the route is locally repaired. Otherwise, if there is no location privacy violation, then data is transferred through the same trusted node. The performance of CLPM scheme is evaluated through simulation, and compared with the earlier works. The performance analysis of CLPM scheme is carried out. Healthcare is currently, one of the most attractive application areas in the Internet of Things (IoT), which includes many benefi ts such as real-time patient monitoring, elderly care, and much more. However, privacy in IoT healthcare remains the most challenging obstacle, which requires dynamic privacy protection solutions for preserving the privacy of patients, doctors, etc. Thus, proposed privacy preserving protocol and schemes are applied to preserve location privacy and data privacy in the IoT healthcare application. Then, some of the healthcare transactions are illustrated to test the working of proposed privacy preserving protocol and schemes. In summary, in this work, we have designed: 1) a location privacy preservation protocol which establishes an untraceable route between sender and receiver, and preserves location pri- vacy; 2) a data privacy preservation scheme based on data anonymity approach, where concepts of RST are applied to hide the sensitive data during data transfer; 3) a context based location privacy maintenance scheme, which takes context information of nodes en route to maintain location privacy; and 4) an IoT healthcare application is considered to test the designed pro- tocol and schemes for preserving location privacy and data privacy. Simulations are performed in different MANET environments to test the proposed protocol and schemes. The simulation and analytical results obtained show the importance of the approaches and the efficiency of the proposed protocol and schemes, which could be implemented in the existing applications. Based on obtained solutions, the system can be applied to any network by adapting the nature of communications and security challenges of that network.

APA, Harvard, Vancouver, ISO, and other styles

38

Channappagoudar, Mallikarjun B. "An Efficient Network Management System using Agents for MANETs." Thesis, 2017. http://etd.iisc.ac.in/handle/2005/3690.

Full text

Abstract:

Network management plays a vital role to keep a network and its application work e ciently. The network management in MANETs is a crucial and the challenging task, as these networks are characterized by dynamic environment and the scarcity of resources. There are various existing approaches for network management in MANETs. The Ad hoc Network Management Protocol (ANMP) has been one of the rst e orts and introduced an SNMP-based solution for MANETs. An alternative SNMP-based solu-tion is proposed by GUERRILLA Management Architecture (GMA). Due to self-organizing characteristic feature of MANETs, the management task has to be distributed. Policy-based network management relatively o ers this feature, by executing and applying policies pre-viously de ned by network manager. Otherwise, the complexity of realization and control becomes di cult Most of the works address the current status of the MANET to take the network man-agement decisions. Currently, MANETs addresses the dynamic and intelligent decisions by considering the present situation and all related history information of nodes into consid-eration. In this connection we have proposed a network management system using agents (NMSA) for MANETs, resolving major issues like, node monitoring, location management, resource management and QoS management. Solutions to these issues are discussed as inde-pendent protocols, and are nally combined into a single network management system, i.e., NMSA. Agents are autonomous, problem-solving computational entities capable of performing e ective operation in dynamic environments. Agents have cooperation, intelligence, and mobility characteristics as advantages. The agent platforms provide the di erent services to agents, like execution, mobility, communication, security, tracking, persistence and directory etc. The platform execution environment allows the agents to run, and mobility service allows them to travel among the di erent execution environments. The entire management task will be delegated to agents, which then executes the management logic in a distributed and autonomous fashion. In our work we used the static and mobile agents to nd some solutions to the management issues in a MANET. We have proposed a node monitoring protocol for MANETs, which uses both static agent (SA) and mobile agents (MA), to monitor the nodes status in the network. It monitors the gradational energy loss, bu er, bandwidth, and the mobility of nodes running with low to high load of mobile applications. Protocol assumes the MANET is divided into zones and sectors. The functioning of the protocol is divided into two segments, The NMP main segment, which runs at the chosen resource rich node (RRN) at the center of a MANET, makes use of SA which resides at same RRN, and the NMP subsegment which runs in the migrated MAs at the other nodes. Initially SA creates MAs and dispatches one MA to each zone, in order to monitor health conditions and mobility of nodes of the network. MAs carrying NMP subsegment migrates into the sector of a respective zone, and monitors the resources such as bandwidth, bu er, energy level and mobility of nodes. After collecting the nodes information and before moving to next sector they transfer collected information to SA respectively. SA in turn coordinates with other modules to analyze the nodes status information. We have validated the protocol by performing the conformance testing of the proposed node monitoring protocol (NMP) for MANETs. We used SDL to obtain MSCs, that repre-sents the scenario descriptions by sequence diagrams, which in turn generate test cases and test sequences. Then TTCN-3 is used to execute the test cases with respect to generated test sequences to know the conformance of protocol against the given speci cation. We have proposed a location management protocol for locating the nodes of a MANET, to maintain uninterrupted high-quality service for distributed applications by intelligently anticipating the change of location of its nodes by chosen neighborhood nodes. The LMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to predict the nodes with abrupt movement, and does the replacement with the chosen nodes nearby which have less mobility. We have proposed a resource management protocol for MANETs, The protocol makes use of SA and MA for fair allocation of resources among the nodes of a MANET. The RMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to allocate the resources among the nodes running di erent applications based on priority. The protocol does the distribution and parallelism of message propagation (mobile agent with information) in an e cient way in order to minimize the number of message passing with reduction in usage of network resources and improving the scalability of the network. We have proposed a QoS management protocol for MANETs, The QMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to allocate the resources among the nodes running di erent applications based on priority over QoS. Later, to reallocate the resources among the priority applications based on negotiation and renegotiation for varying QoS requirements. The performance testing of the protocol is carried out using TTCN-3. The generated test cases for the de ned QoS requirements are executed with TTCN-3, for testing of the associated QoS parameters, which leads to performance testing of proposed QoS management protocol for MANETs. We have combined the developed independent protocols for node monitoring, location management, resource management, and QoS management, into one single network management system called Network Management System using Agents (NMSA) for MANETs and tested in di erent environments. We have implemented NMSA on Java Agent development environment (JADE) Platform. Our developed network management system is a distributed system. It is basically divided into two parts, the Network Management Main Segment and other is Network Management Subsegment. A resource rich node (RRN) which is chosen at the center of a MANET where the Main segment of NMSA is located, and it controls the management activities. The other mobile nodes in the network will run MA which has the subsegments of NMSA. The network management system, i.e., the developed NMSA, has Network manage-ment main (NMSA main), Zones and sector segregation scheme, NMP, LMP, RMP, QMP main segments at the RRN along with SA deployed. The migrated MA at mobile node has subsegments of NMP, LMP, RMP, and QMP respectively. NMSA uses two databases, namely, Zones and sectors database and Node history database. Implementation of the proposed work is carried out in a con ned environment with, JDK and JADE installed on network nodes. The launched platform will have AMS and DF automatically generated along with MTP for exchange of message over the channel. Since only one JVM, which is installed, will executes on many hosts in order to provide the containers for agents on those hosts. It is the environment which o ered, for execution of agents. Many agents can be executed in parallel. The main container, is the one which has AMS and DF, and RMI registry are part of JADE environment which o ers complete run time environment for execution of agents. The distribution of the platform on many containers of nodes is shown in Fig. 1. The NMSA is based on Linux platform which provides distributed environment, and the container of JADE could run on various platforms. JAVA is the language used for code development. A middle layer, i.e., JDBC (java database connection) with SQL provides connectivity to the database and the application. The results of experiments suggest that the proposed protocols are e ective and will bring, dynamism and adaptiveness to the applied system and also reduction in terms network overhead (less bandwidth consumption) and response time.

APA, Harvard, Vancouver, ISO, and other styles

39

Channappagoudar, Mallikarjun B. "An Efficient Network Management System using Agents for MANETs." Thesis, 2017. http://etd.iisc.ernet.in/2005/3690.

Full text

Abstract:

Network management plays a vital role to keep a network and its application work e ciently. The network management in MANETs is a crucial and the challenging task, as these networks are characterized by dynamic environment and the scarcity of resources. There are various existing approaches for network management in MANETs. The Ad hoc Network Management Protocol (ANMP) has been one of the rst e orts and introduced an SNMP-based solution for MANETs. An alternative SNMP-based solu-tion is proposed by GUERRILLA Management Architecture (GMA). Due to self-organizing characteristic feature of MANETs, the management task has to be distributed. Policy-based network management relatively o ers this feature, by executing and applying policies pre-viously de ned by network manager. Otherwise, the complexity of realization and control becomes di cult Most of the works address the current status of the MANET to take the network man-agement decisions. Currently, MANETs addresses the dynamic and intelligent decisions by considering the present situation and all related history information of nodes into consid-eration. In this connection we have proposed a network management system using agents (NMSA) for MANETs, resolving major issues like, node monitoring, location management, resource management and QoS management. Solutions to these issues are discussed as inde-pendent protocols, and are nally combined into a single network management system, i.e., NMSA. Agents are autonomous, problem-solving computational entities capable of performing e ective operation in dynamic environments. Agents have cooperation, intelligence, and mobility characteristics as advantages. The agent platforms provide the di erent services to agents, like execution, mobility, communication, security, tracking, persistence and directory etc. The platform execution environment allows the agents to run, and mobility service allows them to travel among the di erent execution environments. The entire management task will be delegated to agents, which then executes the management logic in a distributed and autonomous fashion. In our work we used the static and mobile agents to nd some solutions to the management issues in a MANET. We have proposed a node monitoring protocol for MANETs, which uses both static agent (SA) and mobile agents (MA), to monitor the nodes status in the network. It monitors the gradational energy loss, bu er, bandwidth, and the mobility of nodes running with low to high load of mobile applications. Protocol assumes the MANET is divided into zones and sectors. The functioning of the protocol is divided into two segments, The NMP main segment, which runs at the chosen resource rich node (RRN) at the center of a MANET, makes use of SA which resides at same RRN, and the NMP subsegment which runs in the migrated MAs at the other nodes. Initially SA creates MAs and dispatches one MA to each zone, in order to monitor health conditions and mobility of nodes of the network. MAs carrying NMP subsegment migrates into the sector of a respective zone, and monitors the resources such as bandwidth, bu er, energy level and mobility of nodes. After collecting the nodes information and before moving to next sector they transfer collected information to SA respectively. SA in turn coordinates with other modules to analyze the nodes status information. We have validated the protocol by performing the conformance testing of the proposed node monitoring protocol (NMP) for MANETs. We used SDL to obtain MSCs, that repre-sents the scenario descriptions by sequence diagrams, which in turn generate test cases and test sequences. Then TTCN-3 is used to execute the test cases with respect to generated test sequences to know the conformance of protocol against the given speci cation. We have proposed a location management protocol for locating the nodes of a MANET, to maintain uninterrupted high-quality service for distributed applications by intelligently anticipating the change of location of its nodes by chosen neighborhood nodes. The LMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to predict the nodes with abrupt movement, and does the replacement with the chosen nodes nearby which have less mobility. We have proposed a resource management protocol for MANETs, The protocol makes use of SA and MA for fair allocation of resources among the nodes of a MANET. The RMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to allocate the resources among the nodes running di erent applications based on priority. The protocol does the distribution and parallelism of message propagation (mobile agent with information) in an e cient way in order to minimize the number of message passing with reduction in usage of network resources and improving the scalability of the network. We have proposed a QoS management protocol for MANETs, The QMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to allocate the resources among the nodes running di erent applications based on priority over QoS. Later, to reallocate the resources among the priority applications based on negotiation and renegotiation for varying QoS requirements. The performance testing of the protocol is carried out using TTCN-3. The generated test cases for the de ned QoS requirements are executed with TTCN-3, for testing of the associated QoS parameters, which leads to performance testing of proposed QoS management protocol for MANETs. We have combined the developed independent protocols for node monitoring, location management, resource management, and QoS management, into one single network management system called Network Management System using Agents (NMSA) for MANETs and tested in di erent environments. We have implemented NMSA on Java Agent development environment (JADE) Platform. Our developed network management system is a distributed system. It is basically divided into two parts, the Network Management Main Segment and other is Network Management Subsegment. A resource rich node (RRN) which is chosen at the center of a MANET where the Main segment of NMSA is located, and it controls the management activities. The other mobile nodes in the network will run MA which has the subsegments of NMSA. The network management system, i.e., the developed NMSA, has Network manage-ment main (NMSA main), Zones and sector segregation scheme, NMP, LMP, RMP, QMP main segments at the RRN along with SA deployed. The migrated MA at mobile node has subsegments of NMP, LMP, RMP, and QMP respectively. NMSA uses two databases, namely, Zones and sectors database and Node history database. Implementation of the proposed work is carried out in a con ned environment with, JDK and JADE installed on network nodes. The launched platform will have AMS and DF automatically generated along with MTP for exchange of message over the channel. Since only one JVM, which is installed, will executes on many hosts in order to provide the containers for agents on those hosts. It is the environment which o ered, for execution of agents. Many agents can be executed in parallel. The main container, is the one which has AMS and DF, and RMI registry are part of JADE environment which o ers complete run time environment for execution of agents. The distribution of the platform on many containers of nodes is shown in Fig. 1. The NMSA is based on Linux platform which provides distributed environment, and the container of JADE could run on various platforms. JAVA is the language used for code development. A middle layer, i.e., JDBC (java database connection) with SQL provides connectivity to the database and the application. The results of experiments suggest that the proposed protocols are e ective and will bring, dynamism and adaptiveness to the applied system and also reduction in terms network overhead (less bandwidth consumption) and response time.

APA, Harvard, Vancouver, ISO, and other styles

40

Choudhary, Aashish. "Modiﬁed Adhoc on Demand Routing Protocol in Mobile Ad hoc Network". Thesis, 2013. http://ethesis.nitrkl.ac.in/5352/1/211CS1068.pdf.

Full text

Abstract:

In Ad hoc network there no any central infrastructure but it allows mobile devices to establish communication path.Since there is no central infrastructure and mobile devices are moving randomly ,gives rise to various kinds of problems, such as security and routing. here we are consider problem of routing. Routing is one of the key issues in MANET because of highly dynamic and distributed nature of nodes. Especially energy efficient routing is most important because all the nodes are battery powered. Failure of one node may affect the entire network. If a node runs out of energy the probability of network partition- ing will be increased. Since every mobile node has limited power supply, energy depletion is become one of the main threats to the lifetime of the ad hoc network. So routing in MANET should be in such a way that it will use the remaining battery power in an efficient way to increase the life time of the network. In this thesis, we have proposedModified Adhoc on Demand Routing (MAODV) which will efficiently utilize the battery power of the mobile nodes in such a way that the network will get more lifetime. Multiple paths are used to send data and load balancing approach is used to avoid over utilized nodes. Load balancing is done by selecting a route which contains energy rich nodes.

APA, Harvard, Vancouver, ISO, and other styles

41

Godara, Ashokeshwer. "Energy Efficient Routing in Clustered Mobile Ad Hoc Network (MANET)." Thesis, 2015. http://ethesis.nitrkl.ac.in/7425/1/2015_Energy_Godara.pdf.

Full text

Abstract:

Mobile ad-hoc network (MANET) comprises of indistinguishable nodes that moves freely and communicate wirelessly. Mobile ad hoc network (MANET) is system without any kind of fixed base where the correspondence abilities of the system are constrained because of battery power of the nodes. Since all nodes can move arbitrarily and there is no fixed base , it causes different sorts of issues, for example, energy efficient routing.Conventional protocols like proactive (DSDV etc.) and reactive (AODV etc.) routing protocols are not suited for such type of networks it is essential to introduce another protocol to work in MANET. MANETs are becoming popular now because of simple deployment and it’s cheapness. Clustering is a proven efficient solution to save the battery power of certain nodes in a network. Nodes in a network are progressively sorted out into subgroups called clusters. In the process of clustering, there exists a cluster head (CH) in every cluster which works similar to a base station in the cellular architecture. Lowest id and highest connectivity algorithms are proposed for forming cluster and for cluster head selection in network and ESAR is proposed as energy efficient routing in flat structure for routing. ESAR consider minimum available battery power of a node in the ith path, and actual distance between the source and the destination in the ith path, Distance(i)and on the basis of these values routing path is selected . This proposed algorithem selects path the best path for packet transmission till any node in the path exhausts battery power beyond a threshold value. The process is repeated till all the paths from the same source to destination are exhausted with their battery power.If there are n nodes in network and m (m<n) are selected as cluster head & energy associated with each node is E(i) then those m cluster heads will send data to base station and other cluster member will send data to cluster heads In clustered MANET factors DE(i) is decresed as CH sends data and network is in distibuted manner. Here it will choose path in network based on Energy efficiency and distance factor between cluster heads.

APA, Harvard, Vancouver, ISO, and other styles

42

ARORA, JATIN. "ENERGY PRESERVING ADHOC ON-DEMAND DISTANCE VECTOR." Thesis, 2014. http://dspace.dtu.ac.in:8080/jspui/handle/repository/15460.

Full text

Abstract:

Wireless devices use has been increased drastically in the last decade. To provide communication between the node which are mobile in nature and using wireless network some protocols were developed to provide faster transmission between the nodes in the network. But most of them lack in conserving the energy of the nodes to maximize the network lifetime. Energy is the main constraint in a wireless network. Each network device is running on the battery which is always limited source of energy. Hence the routing protocol should take energy of nodes as a valuable metric to perform routing which results in maximum network lifetime. Several protocols were already developed for routing in Mobile Adhoc Network (MANET) in this dissertation we enhance the Adhoc On-Demand Distance Vector (AODV) and Distance Sequenced Distance Vector (DSDV) which is widely used for routing in MANET’s. This dissertation improves AODV, DSDV protocol to optimize the routing which preserves energy to increase the network lifetime.

APA, Harvard, Vancouver, ISO, and other styles

43

Kim, Sang-Chul. "Message complexity analysis of mobile ad hoc network (MANET) address autoconfiguration protocols." 2005. http://digital.library.okstate.edu/etd/umi-okstate-1544.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Aina, Folayo. "Performance analysis of a developed admission control model in mobile ad-hoc network (MANET)." Thesis, 2020. https://arro.anglia.ac.uk/id/eprint/706797/3/Aina_2020.pdf.

Full text

Abstract:

As wireless mobile network becomes widespread, the demand for user applications is higher and the services provided by the wired application is expected to be available in the wireless medium. Therefore, the users of these applications will expect the same Quality of Service (QoS) as obtained in wired network. Providing a reliable QoS in wireless medium, especially MANET, is quite challenging and remains an ongoing research trend. The key issue of MANET is its inability to accurately predict the needed resources, to avoid interference with an ongoing traffic flow. An essential solution to the issues posed by MANET is the introduction of an admission control component for a guaranteed QoS. Admission control helps to control the usage of resources when an additional service is requested. For an admission decision to be made for a new flow, the expected bandwidth consumption must be correctly predicted prior to admission not-withstanding the fact that wireless medium is shared, and nodes contends among themselves to access the medium. Some recent solutions considered the MAC layer back-off impact due to collision as well as the non-synchronization of the sender and receiver during the available bandwidth estimation process. This thesis therefore has three (3) objectives. Firstly, it investigates the various techniques for estimating bandwidth in MANET that gives better accuracy. Secondly, this thesis develops an efficient bandwidth estimation and admission control mechanism that limits the frequent bandwidth usage for achieving lesser network overhead during the retrieval of neighbouring bandwidth. Finally, this thesis investigates the key metrics necessary to be considered to ensure a guaranteed control of admission within the network. The novelty of this thesis is the proposed resource allocation and admission control in MANET (RAACM) solution which is an admission control scheme that estimates the available bandwidth needed within a network using a robust and accurate resource estimation technique. Furthermore, the various factors that must be considered for an effective estimation were highlighted and simulations were carried out using Riverbed 17.5. Results obtained from the simulation, studies and compared the throughput impact of a network that has no admission control implementation with our proposed RAACM protocol. RAACM throughput result shows accuracy in its result with less data drop. The throughput result obtained from RAACM was thereafter compared with other state-of-the art admission control protocol. RAACM’s admission control throughput analysis performance with respect to the HCF is high when compared with closely related research work. RAACM’s delay and data dropped analysis was also studied and comparison was made with the state-of-the art admission control protocols, RAACM however, provides efficiency and accuracy in its result. In conclusion, by giving a close attention to the channel idle time estimation between a sender and a receiver for available bandwidth estimation through analysing it with respect to overlapping and non-overlapping period as well as dependant node distribution, network accuracy and efficiency have been realised in this thesis.

APA, Harvard, Vancouver, ISO, and other styles

45

Pereira, Jose Santos Martins. "Implementation of a Mobile Ad Hoc Network Communication Protocol for Human-Robot Search and Rescue Teams." Master's thesis, 2013. http://hdl.handle.net/10316/35602.

Full text

Abstract:

Dissertação de Mestrado em Engenharia Informática apresentada à Faculdade de Ciências e Tecnologia da Universidade de Coimbra. Mobile devices have become ubiquitous in recent years. Advances in computing and communication capacityhave greatly widened theirscope of application.Ranging frommilitary scenarios, to environmental monitoring, vehicular networks or search and rescue operations, the ability to deploy a dynamic communication platform on demandis not far from becoming commonplace.The thesis proposes the CHOPIN routing protocolfor mobile ad-‐hoc networks (MANET). The implementation is inspired by OLSR and was developed in response to the requirements of Human and robotic cooperation in search and rescue scenarios(Project CHOPIN). Current operational guidelines follow a centralized approach, where a Command Center (CC) coordinates activities on the field.Cooperative mapping (group communication), hazardous materials detection, victim localization and landmarks(communication towards the CC)are possible contributions from robotic agents, effectively reducing risk to human lives and allowing for distributed operation.Tests where performed for comparison between the proposed protocoland OLSR, with positive results.Through the use of a flooding optimization technique, MultiPointRelaying (MPR), OLSR operation results in less control overhead. On the other hand, CHOPIN maintains lesser state information,resulting in a lower memory footprint.In regard to some relevant metrics like convergence time,latency and throughput, the protocols behave onpar, with CHOPIN slightly on the lead A utilização de equipamentos móveis generalizou-‐se nos últimos anos. Os avanços nas capacidades de computação e comunicação aumentaram enormemente o espectro de aplicação destes dispositivos, que têm hoje os mais variados domínios de aplicação. Desde cenários militares, sempre uma força motriz de avanços científicos, passando por monitorização ambiental ou redes de viaturas, até cenários de emergência, a capacidade de constituir uma rede de forma dinâmica é cada vez mais uma exigência para a realização de trabalho de forma distribuída. O presente trabalho propõe o protocolo de encaminhamento CHOPIN para redes móveis ad-‐hoc (MANET), uma implementação inspirada pelo protocolo OLSR e desenvolvido para dar resposta aos requisitos de cenários de cooperação de equipas humanas e de robôs em situações de emergência (Projecto CHOPIN). Neste contexto, protocolos actuais funcionam de forma centralizada, onde um Centro de Comando Operacional (CCO) coordena as operações no terreno. Actividades de mapeamento do cenário (comunicação de grupo), detecção de materiais perigosos, identificação de vítimas e pontos de interesse (comunicação para o CCO) são contributos possíveis dos agentes robóticos, reduzindo o perigo para os agentes humanos e adicionando uma vertente distribuída que pode ser extremamente útil na capacidade de resposta. Foram realizados testes em que foi comparado o protocolo desenvolvido com o OLSR, sendo os resultados positivos. Uma vez que o OLSR inclui uma técnica de optimização de difusão de mensagens, o MultiPoint Relaying (MPR), ausente para já do CHOPIN, aquele necessita de enviar menos mensagens. Em contrapartida, o CHOPIN armazena muito menos estado da rede, sendo extremamente leve relativamente às exigências de memória. No que diz respeito às métricas de desempenho mais importantes, como a velocidade de convergência da rede, latência e throughput, os protocolos apresentam resultados semelhantes, com ligeira vantagem para o CHOPIN.

APA, Harvard, Vancouver, ISO, and other styles

46

Memarmoshrefi, Parisa. "A Bio-Inspired Autonomous Authentication Mechanism in Mobile Ad Hoc Networks." Doctoral thesis, 2012. http://hdl.handle.net/11858/00-1735-0000-000D-F078-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Sai, Keerthi T. Divya. "Designing Solutions to Counter the Attacks in Mobile Ad hoc Networks." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5315.

Full text

Abstract:

The open medium, dynamic topology and distributed operation in Mobile Ad hoc Networks (MANET) leads to high risks. Many solutions are proposed to protect a MANET from attacks, ranging from attack identification to prevention. Although these solutions reduce and avoid the attacks in a MANET, sometimes they identify many false attacks as real ones which may cause huge loss of resources. For example, a sudden route breakdown can cause delay in packet delivery; differentiating such a delay from the delay caused by an attacker is difficult. Further, an intelligent attacker could also cause false negative alarms in the network by manipulating the ADS. The attacker could avoid detection by an ADS by delaying the packets in small incre- ments which lead to large increments in delay over time. Such an attack could be detected by using a strong bound on the threshold of delay parameter. But, this could cause false positive alarms as discussed in the above example. Such false alarms occur more often when an attack is complex and has multiple features. In this thesis we propose solutions to mitigate such false alarms and improve the attack detection probability. In thesis we made an attempt to design a system which identifies and con firms the attacks, to protect the MANET from false attacks and loss of resources due to false alarms. The system designed, enhances the attack detection rate by confirming the occurrence of the attack through analysis of the current attack scenario and the past history of attacks. First, we designed and developed, a Wormhole Attack Confirmation (WAC) System using Honeypots to mitigate false alarms in a MANET and protect its resources during a wormhole attack. We embark on the study by building an attack tree of the wormhole attack. The attack tree is built by identifying all the network conditions which could trigger the wormhole attack. These conditions are called as symptoms of wormhole attack and are analyzed by the honeypot. The Honeypot is centrally located and confirms the wormhole attack in a three step process. It makes an assessment of the current scenario using the attack tree of the wormhole attack, and compares it with the similar scenarios in the past with inputs from Attack History Database (AHD) to provide a verdict on the scenario. For preserving the security of a Mobile Ad hoc Network, we need to determine the origin of the attack, that is, trace the location of the attacker. Determining the physical location of the attacker helps in con nement of the attacker and attack. However, traditional attacker trace- back schemes fail to perform in a MANET which leads to huge degradation of its performance. Hence, we propose a Wormhole Attacker Tracing system to trace the location of a wormhole attacker in a MANET. The system runs on the Honeypot and collects the information about the attack from the victim's neighbors using bloom filters. Honeypot extracts the informa- tion from the bloom filter, and the information about the past attacks from Attack History Database (AHD), to trace the location of the wormhole attacker. The zone of the attacker is determined by the honeypot using the concept of Dominating sets. Further, the exact location of the attacker within the zone is determined by interacting with the attacker and identifying the dominant congested link. To demonstrate the WAC system functioning, we have considered the real time applications like email services. We have simulated the WAC system exclusively with email dumping by the attacker under various network load conditions. The system accurately identifies fake attacks and location of the attacker. We extended the technique for the black-hole attacks in a MANET. The Black-hole Attack Confirmation (BAC) system uses honeypot to intelligently identify and confirm the black-hole attack. Honeypot identifies the actions of a black-hole attacker in the current attack scenario with the help of the Black-hole attack Tree (BAT). BAT is an exhaustive sketch of all possible ways a black-hole attack can launched on a MANET. Further, honeypot analyzes the history of attacks from Attack History Database (AHD),to con firm the black-hole attack. Together with the BAT and AHD, the honeypot adapts itself to the current attack scenario, and efficiently confi rms the black-hole attack in a MANET. To preserve the security of a MANET we designed a Black-hole Attacker Tracing system to locate and quarantine the black-hole attacker. The system works in two phases. In phase one, the Honeypot determines the zone of the black-hole attacker. To identify the zone of the black- hole attacker, the honeypot maintains an open connection with the attacker, while collecting the information about the attacker. The current information is enhanced with the knowledge available in the attack history database. Honeypots analyze the actions of the attacker using Dominating sets. The physical location of the black-hole attacker within the zone is determined by identifying the dominant un-reliable node. Later we integrated both systems: WAC and BAC and deployed in MANET where IoT- Health care is a major application. Health care is one of the rapidly developing system in the context of IoT. The value held by the health care attracts a large number of attackers. These systems inherit the vulnerabilities of its underlying access networks like MANET which hinder its deployment. We have applied our systems to counter the attacks on an IoT-Health care network based on a MANET. The purpose of the experiment is to mitigate multiple attacks in an IoT-Health care network. In summary: (1) We designed a Wormhole Attack Con firmation (WAC) system using Hon- eypot through which we make an attempt to confi rm the attack by analyzing a wormhole attack holistically using a attack tree; (2) We designed a Wormhole Attacker Location Tracing Scheme to trace the location of a wormhole attacker by exploiting the properties of the wormhole attack using the dominating sets; (3) We evaluated the performance of WAC system with real time application of email service in a MANET; (4) We designed a system to protect the MANET from the black-hole attack through the Black-hole Attack Confirmation (BAC) system using Honeypot and the Black-hole Attack Tree (BAT); (5) We then designed a Black-hole Attacker Tracing system using Honeypot, where the system first identifying the zone of the attacker followed by identifying the attacker within the zone by collecting the information about the attack from neighbors of victim, and extracting the information about similar attacks from history; (6) We have applied the attack confirmation systems to an IoT-Health care network to identify and confirm multiple attacks in IoT-Health care network. We have simulated the designed system in several IoT-Health care environments, of varying sizes of nodes and applications. On several occasions the results have demonstrated that the proposed system is efficient in confirming multiple attacks, thereby saving the resources and minimizing the path reestablishment. Thus the systems presented in this thesis are capable of avoiding attacks in a practical network and also save important resources of the network.

APA, Harvard, Vancouver, ISO, and other styles

48

Miskeen, Guzlan M. A., Demetres D. Kouvatsos, and Zadeh Esmaeil Habib. "An Exposition of Performance-Security Trade-offs in RANETs Based on Quantitative Network Models." 2013. http://hdl.handle.net/10454/9692.

Full text

Abstract:

No Security mechanisms, such as encryption and authentication protocols, require extra computing resources and therefore, have an adverse effect upon the performance of robotic mobile wireless ad hoc networks (RANETs). Thus, an optimal performance and security trade-off should be one of the main aspects that should be taken into consideration during the design, development, tuning and upgrading of such networks. In this context, an exposition is initially undertaken on the applicability of Petri nets (PNs) and queueing networks (QNs) in conjunction with their generalisations and hybrid integrations as robust quantitative modelling tools for the performance analysis of discrete flow systems, such as computer systems, communication networks and manufacturing systems. To overcome some of the inherent limitations of these models, a novel hybrid modelling framework is explored for the quantitative evaluation of RANETs, where each robotic node is represented by an abstract open hybrid G-GSPN_QN model with head-of-line priorities, subject to combined performance and security metrics (CPSMs). The proposed model focuses on security processing and state-based control and it is based on an open generalised stochastic PN (GSPN) with a gated multi-class 'On-Off' traffic and mobility model. Moreover, it employs a power consumption model and is linked in tandem with an arbitrary QN consisting of finite capacity channel queues with blocking for 'intra' robot component-to-component communication and 'inter' robot-to-robot transmission. Conclusions and future research directions are included.

APA, Harvard, Vancouver, ISO, and other styles

49

Biswas, Jayanta. "Toward Providing Secure Multicast Service For Mobile Entertainment Applications Over Wireless Networks." Thesis, 2005. https://etd.iisc.ac.in/handle/2005/1402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Biswas, Jayanta. "Toward Providing Secure Multicast Service For Mobile Entertainment Applications Over Wireless Networks." Thesis, 2005. http://etd.iisc.ernet.in/handle/2005/1402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'MANET(Mobile Adhoc Network)'

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