287 research outputs found
Simulation based comparison of routing protocols in wireless multihop adhoc networks
Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and Quality of Service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile ad hoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV Performance
Intelligent black hole detection in mobile AdHoc networks
Security is a critical and challenging issue in MANET due to its open-nature characteristics such as: mobility, wireless communications, self-organizing and dynamic topology. MANETs are commonly the target of black hole attacks. These are launched by malicious nodes that join the network to sabotage and drain it of its resources. Black hole nodes intercept exchanged data packets and simply drop them. The black hole node uses vulnerabilities in the routing protocol of MANETS to declare itself as the closest relay node to any destination. This work proposed two detection protocols based on the collected dataset, namely: the BDD-AODV and Hybrid protocols. Both protocols were built on top of the original AODV. The BDD-AODV protocol depends on the features collected for the prevention and detection of black hole attack techniques. On the other hand, the Hybrid protocol is a combination of both the MI-AODV and the proposed BDD-AODV protocols. Extensive simulation experiments were conducted to evaluate the performance of the proposed algorithms. Simulation results show that the proposed protocols improved the detection and prevention of black hole nodes, and hence, the network achieved a higher packet delivery ratio, lower dropped packets ratio, and lower overhead. However, this improvement led to a slight increase in the end-to-end delay
An Overview of Query-Broadcasting Techniques in Ad Hoc Networks
This chapter presents query-broadcasting techniques used to minimize expenses of the route discovery in ad hoc networks. A broad variety of such techniques have been proposed that improved the effectiveness and efficiency in various aspects of route discovery considering time and energy. Time-to-live based broadcast is the most common controlled flooding scheme widely used in routing protocols. One category of such techniques leveraged the routing history, while other category used broadcast repealing strategy to cancel the query-broadcast after successful route discovery
Rough set based QoS enabled multipath source routing in MANET
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multi-layer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure
Self-organizing Network Optimization via Placement of Additional Nodes
Das Hauptforschungsgebiet des Graduiertenkollegs "International Graduate
School on Mobile Communication" (GS Mobicom) der Technischen Universität
Ilmenau ist die Kommunikation in Katastrophenszenarien. Wegen eines
Desasters oder einer Katastrophe können die terrestrischen Elementen der
Infrastruktur eines Kommunikationsnetzwerks beschädigt oder komplett
zerstört werden. Dennoch spielen verfügbare Kommunikationsnetze eine sehr
wichtige Rolle während der Rettungsmaßnahmen, besonders für die
Koordinierung der Rettungstruppen und fĂĽr die Kommunikation zwischen ihren
Mitgliedern. Ein solcher Service kann durch ein mobiles Ad-Hoc-Netzwerk
(MANET) zur VerfĂĽgung gestellt werden. Ein typisches Problem der MANETs
ist Netzwerkpartitionierung, welche zur Isolation von verschiedenen
Knotengruppen führt. Eine mögliche Lösung dieses Problems ist die
Positionierung von zusätzlichen Knoten, welche die Verbindung zwischen den
isolierten Partitionen wiederherstellen können. Hauptziele dieser Arbeit
sind die Recherche und die Entwicklung von Algorithmen und Methoden zur
Positionierung der zusätzlichen Knoten. Der Fokus der Recherche liegt auf
Untersuchung der verteilten Algorithmen zur Bestimmung der Positionen fĂĽr
die zusätzlichen Knoten. Die verteilten Algorithmen benutzen nur die
Information, welche in einer lokalen Umgebung eines Knotens verfĂĽgbar ist,
und dadurch entsteht ein selbstorganisierendes System. Jedoch wird das
gesamte Netzwerk hier vor allem innerhalb eines ganz speziellen Szenarios -
Katastrophenszenario - betrachtet. In einer solchen Situation kann die
Information ĂĽber die Topologie des zu reparierenden Netzwerks im Voraus
erfasst werden und soll, natĂĽrlich, fĂĽr die Wiederherstellung mitbenutzt
werden. Dank der eventuell verfügbaren zusätzlichen Information können
die Positionen für die zusätzlichen Knoten genauer ermittelt werden. Die
Arbeit umfasst eine Beschreibung, Implementierungsdetails und eine
Evaluierung eines selbstorganisierendes Systems, welche die
Netzwerkwiederherstellung in beiden Szenarien ermöglicht.The main research area of the International Graduate School on Mobile
Communication (GS Mobicom) at Ilmenau University of Technology is
communication in disaster scenarios. Due to a disaster or an accident, the
network infrastructure can be damaged or even completely destroyed.
However, available communication networks play a vital role during the
rescue activities especially for the coordination of the rescue teams and
for the communication between their members. Such a communication service
can be provided by a Mobile Ad-Hoc Network (MANET). One of the typical
problems of a MANET is network partitioning, when separate groups of nodes
become isolated from each other. One possible solution for this problem is
the placement of additional nodes in order to reconstruct the communication
links between isolated network partitions. The primary goal of this work is
the research and development of algorithms and methods for the placement of
additional nodes. The focus of this research lies on the investigation of
distributed algorithms for the placement of additional nodes, which use
only the information from the nodes’ local environment and thus form a
self-organizing system. However, during the usage specifics of the system
in a disaster scenario, global information about the topology of the
network to be recovered can be known or collected in advance. In this case,
it is of course reasonable to use this information in order to calculate
the placement positions more precisely. The work provides the description,
the implementation details and the evaluation of a self-organizing system
which is able to recover from network partitioning in both situations
Predicting and Recovering Link Failure Localization Using Competitive Swarm Optimization for DSR Protocol in MANET
Portable impromptu organization is a self-putting together, major construction-less, independent remote versatile hub that exists without even a trace of a determined base station or government association. MANET requires no extraordinary foundation as the organization is unique. Multicasting is an urgent issue in correspondence organizations. Multicast is one of the effective methods in MANET. In multicasting, information parcels from one hub are communicated to a bunch of recipient hubs all at once, at a similar time. In this research work, Failure Node Detection and Efficient Node Localization in a MANET situation are proposed. Localization in MANET is a main area that attracts significant research interest. Localization is a method to determine the nodes’ location in the communication network. A novel routing algorithm, which is used for Predicting and Recovering Link Failure Localization using a Genetic Algorithm with Competitive Swarm Optimization (PRLFL-GACSO) Algorithm is proposed in this study to calculate and recover link failure in MANET. The process of link failure detection is accomplished using mathematical modelling of the genetic algorithm and the routing is attained using the Competitive Swarm optimization technique. The result proposed MANET method makes use of the CSO algorithm, which facilitates a well-organized packet transfer from the source node to the destination node and enhances DSR routing performance. Based on node movement, link value, and endwise delay, the optimal route is found. The main benefit of the PRLFL-GACSO Algorithm is it achieves multiple optimal solutions over global information. Further, premature convergence is avoided using Competitive Swarm Optimization (CSO). The suggested work is measured based on the Ns simulator. The presentation metrix are PDR, endwise delay, power consumption, hit ratio, etc. The presentation of the proposed method is almost 4% and 5% greater than the present TEA-MDRP, RSTA-AOMDV, and RMQS-ua methods. After, the suggested method attains greater performance for detecting and recovering link failure. In future work, the hybrid multiway routing protocols are presented to provide link failure and route breakages and liability tolerance at the time of node failure, and it also increases the worth of service aspects, respectively
Recommended from our members
Research Findings on Wormhole Attack Detection in Mobile Ad Hoc Networks
The Internet is moving from the traditional desktop network paradigm to a ubiquitous paradigm where a multitude of small computing devices such as computer chips and smart sensors are involved in daily activities and routines. This means that a rapidly growing amount of devices are connected to the Internet. At the same time, infrastructure-less and self-configuring systems like Mobile Ad hoc Networks (MANET) are gaining popularity since they provide a possibility for mobile devices to share information with each other without being dependent on a core infrastructure. Routing security in MANETs is, however, a significant challenge to wide scale adoption. One of the most severe security threats to MANET routing is the wormhole attack due to its ability to disrupt a significant proportion of network traffic, while simultaneously being difficult to detect. This paper provides an overview of recent research findings on wormhole attack detection in MANETs collected from a joint research project with Arcada University of Applied Sciences in Finland and The Open University, UK
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
Topology Control, Routing Protocols and Performance Evaluation for Mobile Wireless Ad Hoc Networks
A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MANETs. In this dissertation, we will propose four algorithms that address different aspects of routing problems in MANETs. Firstly, in position based routing protocols to design a scalable location management scheme is inherently difficult. Enhanced Scalable Location management Service (EnSLS) is proposed to improve the scalability of existing location management services, and a mathematical model is proposed to compare the performance of the classical location service, GLS, and our protocol, EnSLS. The analytical model shows that EnSLS has better scalability compared with that of GLS. Secondly, virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is an NP-hard problem. In the dissertation, we develop two new pure localized protocols for calculating the CDS. One emphasizes forming a small size initial near-optimal CDS via marking process, and the other uses an iterative synchronized method to avoid illegal simultaneously removal of dominating nodes. Our new protocols largely reduce the number of nodes in CDS compared with existing methods. We show the efficiency of our approach through both theoretical analysis and simulation experiments. Finally, using multiple redundant paths for routing is a promising solution. However, selecting an optimal path set is an NP hard problem. We propose the Genetic Fuzzy Multi-path Routing Protocol (GFMRP), which is a multi-path routing protocol based on fuzzy set theory and evolutionary computing
- …