The flexibility of Mobile Ad hoc networks (MANET) and its characteristics introduce new security risks. One possible attack is the Black Hole attack which received recent attention. In the Black Hole attack, a malicious node uses the routing protocol to declare itself as having the shortest path to the node whose packets it wants to intercept. It is needed to understand this risk with a view to extract preventive and corrective protections against it. We introduce an approach that could stop this attack from happening in such a network by using an algorithm which controls the communications between nodes and let each node becomes identified and authorized in a group of nodes. In this algorithm, stable nodes, which called leaders, are responsible for routing and forwarding packets from source to destination nodes. This research reviews the black hole attack, and, explains the algorithm that helps throughput to be increased as a consequence. / Graduate / manar.alnaghes@hotmail.com

In the purview of efficient communication in MANETs for enhanced data rates and reliable routing of information, this thesis deals with dual polarised directional antenna based communication. This thesis proposes a dual polarised directional communication based cross-layer solution to mitigate the problems of interference, exposed nodes, directional exposed nodes, and deafness, and to achieve efficient routing of information. At the physical layer of network protocol stack, this thesis proposes the use of dual polarised directional antenna for the mitigation of interference. Use of dual polarised directional communication at the physical layer calls for appropriate modifications in the functionality of MAC and network layers. At the MAC layer, the DPDA-MAC protocol proposed in this thesis achieves mitigation of the problems of exposed nodes, directional exposed nodes and deafness, by using dual polarised directional antenna at physical layer. At network layer, the DPDA-MRP protocol presented in this thesis facilitates the discovery of multiple routes between the source and destination nodes to route information in accordance with the desired dual polarised directional communication. To achieve efficient dual polarised directional communication and routing of information, it is essential to maintain well populated Neighbour Table (NT) and Routing Table (RT). This thesis proposes a novel Corruption Detection Pulse (CDP) based technique to handle corruption of broadcast packets such as Link ID and RREQ arising due to hidden node problem. Since the nodes participating in the formation of MANETs have limited battery energy, the protocols proposed in this thesis are featured with a provision for dynamic power control to achieve energy efficient communication. Nodes maintain Received Signal Strength Indicator (RSSI) information in the NT, which along with the information of node location is used in the formulation of decision logic of dynamic power control. Through numerous simulation studies, this thesis demonstrates the benefits of dual polarised directional communication to enhance the performance of MANET. The design principles, benefits and conceptual constraints of proposed DPDA-MAC protocol are analysed with SPDA-MAC and CSMA/CA, while those for DPDA-MRP are analysed with SPDA-MRP and DSR through performance metrics of throughput, Packet Delivery Ratio (PDR) and per hop delay. The thesis also analyses the impact of variations of channel capacity, node density, rate of packet transmission and mobility of nodes on the performance of the proposed and conventional protocols invoked in MANETs.

With the rapid development in the areas of mobile manufacturing and multimedia communications, there is an increasing demand for Networked Virtual Environment (NVE) applications, such as Augmented Reality (AR), virtual walk-throughs, and massively multiplayer online games (MMOGs), on hand-held devices. Unfortunately, downloading and rendering a complex 3D scene is very computationally intensive and is not compatible with current mobile hardware specifications nor with available wireless bandwidth. Existing NVE applications deploy client/server based 3D streaming over thin mobile devices, which suffer from single point of failure, latency, and scalability issues. To address these issues, image-based rendering (IBR) and cloud-based 3D streaming have been introduced. The former introduces visual artifacts that reduce, and usually cancel, the realistic behaviors of the Virtual Environment (VE) application, while the latter is considered very expensive to implement. Peer-to-peer (P2P) 3D streaming is promising and affordable, but it has to tackle issues in object discovery and selection as well as content provider strategies. Distributing VE content over a mobile ad-hoc network (MANET) makes the system difficult to update due to the dynamic nature of the mobile clients. In order to tackle these issues, we came up with a novel protocol that combines the pros of both central and distributed approaches. Our proposed hybrid protocol, called OCTET, enables 3D scene streaming over thin devices in a way that can cope with current mobile hardware capabilities and mitigate the challenges of client/server and P2P 3D streaming. In fact, OCTET provides strategies that select, prioritize, and deliver only those objects that contribute to the user’s visible scene. OCTET is implemented using the "ns-2" simulation environment, and extensive experiments have clearly demonstrated significant achievements in mobile resource utilization, throughput, and system scalability.

El objetivo general del presente trabajo de título fue desarrollar un tipo especial de juego, que funciona bajo dispositivos móviles de tipo PDA. Este proyecto nace como una manera de ayudar a atenuar los problemas de aburrimiento y aislamiento social que afectan a niños que se deben hospitalizar periódicamente; por ejemplo niños bajo tratamiento de quemaduras o cáncer. Para esto se requiere que el juego funcione sin utilizar los recursos del hospital, y que tenga además la capacidad de unirse a una red social, de manera de hacer del juego una experiencia colaborativa más completa y entretenida. Para resolver el problema de la infraestructura de comunicaciones, se utilizó una red MANET (Mobile Ad hoc Network), la cual ayudó a hacer que la aplicación sea independiente del soporte de comunicaciones. Debido a la dificultad para construir protocolos de comunicación que ejecuten sobre una MANET, en este trabajo de memoria se utilizó una librería llamada HLMP (High Level MANET Protocol) que implementa y maneja toda la infraestructura de comunicaciones. Como resultado final, se desarrolló un juego colaborativo móvil llamado “MagicRace”, el cual es capaz de ejecutar sobre dispositivos móviles de bajo costo, como las PDA (Personal digital Assistants). El uso de este tipo de dispositivos es importante, debido a que se pretende que las instituciones de salud donde se utilice esta aplicación (particularmente hospitales públicos), no inviertan en la compra de los dispositivos sino que se espera que éstos sean donados por empresas o miembros de la comunidad. El juego desarrollado consiste en una carrera de autos, donde se compite por equipos. Los autos durante la carrera obtienen objetos “mágicos”, que provocan que el auto tenga comportamientos extraños durante la competencia. Esto resulta en un juego más dinámico, y por lo tanto se espera más entretenido, a pesar de que los dispositivos usados no permitan entregar un mejor desempeño, desde el punto de vista gráfico. Finalmente, el ganador es el equipo que obtuvo el mayor puntaje durante las etapas, haciendo que el juego motive la colaboración entre los jugadores.

The first part focuses on general routing of computer networks. It describes the importance of routing, basic elements, algorithms and protocols. It also describes the so-called MANET networks, where there are discussed routing protocols in these networks. The next chapter deals with the analysis of routing protocols OSPF version 3 and OLSR protocol. For both protocols basic algorithms, their use and structure are described. In OSPF protocol there is also described historical development and differences between versions 2 and 3. The OLSR protocol properly describes the principle of MPR nodes, which is one of the most important parts of the protocol which differs it from the others. Next there is a brief introduction of a powerful simulation tool OPNET Modeler which allows simulating the operation and behavior of almost any computer network with a very extensive possibility of options for the functioning of the entire network, as well as nodes it selves. The practical part is divided into five parts. The first section describes the structure of process models, the basic elements, variables, and block editors OSLR routing protocol in OPNET Modeler program. The second part is devoted to the ICI data structure, which is used for inter-process communication and verify the creation and reception of messages using this function. The third part deals with the process model of OLSR routing model. There is a description of various blocks and functions involved in its function of protocol and significance. The fourth chapter shows an extension of data unit protocol OLSR HELLO messages to other fields, which is able to transmit a numeric value between neighboring stations, and these values print it in the console. The last block of the practical part is dedicated to creating its own message which is broadcast between stations like part of the OLSR packet messages. This message includes the parameter of actual data traffic rate of each communicating stations. These values are for each station exported to an external file for later processing.

Mobile ad hoc networks (MANETs) have experienced rapid growth in their use for various military, medical, and commercial scenarios. This is due to their dynamic nature that enables the deployment of such networks, in any target environment, without the need for a pre-existing infrastructure. On the other hand, the unique characteristics of MANETs, such as the lack of central networking points, limited wireless range, and constrained resources, have made the quest for securing such networks a challenging task. A large number of studies have focused on intrusion detection systems (IDSs) as a solid line of defense against various attacks targeting the vulnerable nature of MANETs. Since cooperation between nodes is mandatory to detect complex attacks in real time, various solutions have been proposed to provide cooperative IDSs (CIDSs) in efforts to improve detection efficiency. However, all of these solutions suffer from high rates of false alarms, and they violate the constrained-bandwidth nature of MANETs. To overcome these two problems, this research presented a novel CIDS utilizing the concept of social communities and the Dempster-Shafer theory (DST) of evidence. The concept of social communities was intended to establish reliable cooperative detection reporting while consuming minimal bandwidth. On the other hand, DST targeted decreasing false accusations through honoring partial/lack of evidence obtained solely from reliable sources. Experimental evaluation of the proposed CIDS resulted in consistently high detection rates, low false alarms rates, and low bandwidth consumption. The results of this research demonstrated the viability of applying the social communities concept combined with DST in achieving high detection accuracy and minimized bandwidth consumption throughout the detection process.

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

Wireless network devices, especially in ad hoc networks, are typically battery-powered. The growing need for energy efficiency in wireless networks, in general, and in mobile ad hoc networks (MANETs), in particular, calls for power enhancement features. The goal of this dissertation is to extend network lifetime by improving energy utilization in MANET routing. We utilize the ability of wireless network interface cards to dynamically change their transmission power, as well as the ability of wireless devices to read the remaining battery energy of the device to create a table of what we term "reluctance values," which the device uses to determine how to route packets. Choosing routes with lower reluctance values, on average and with time, leads to better utilization of the energy resources of the devices in the network. Our power-aware scheme can be applied to both reactive and proactive MANET routing protocols. As examples and to evaluate performance, the technique has been applied to the Dynamic Source Routing (DSR) protocol, a reactive routing protocol, and the Optimized Link State Routing (OLSR) protocol, a proactive routing protocol. Simulations have been carried out on large static and mobile networks. Results show improvements in network lifetime in static and certain mobile scenarios. Results also show better distribution of residual node energies at the end of simulations, which means that the scheme is balancing energy load more evenly across network nodes than the unmodified versions of DSR and OLSR. Average change in energy over time in the unmodified protocols show a steady increase with time, while the power-aware protocols show an increase in the beginning, then it levels for sometime before it starts to decrease. The power-aware scheme shows improvements in static and in coordinated mobility scenarios. In random mobility the power-aware protocols show no advantage over the unmodified protocols. / Ph. D.

A mobile ad hoc network (MANET) is formed by a collection of self-organizing nodes. Such networks are being deployed in a variety of environments, for example to provide mission-critical services in times of crises. Nodes participating in a MANET tend to have limited energy and computing resources and depend on various network-based resources to operate as a cohesive system. The same features such as dynamic and adaptive network topologies that make MANETs powerful also make the discovery and operation of network services a challenge. This thesis presents the design and implementation of an extensible information dissemination scheme that is integrated with the Optimized Link State Routing (OLSR) protocol to address the challenges of service discovery in mobile ad hoc networks. The thesis presents a detailed design of the information dissemination scheme based on the Naval Research Laboratory's (NRL) ProtoLib network protocol programming framework. In the proposed scheme, a solution that separates the routing process from the NRL OLSR routing protocol was designed, thus making OLSR a topology discovery protocol. This can further facilitate the implementation of various routing algorithms based on other metrics, such as the signal-to-noise ratio (SNR) of wireless links or the nodes' level of cooperation, when forwarding messages in the network. Additionally, a reusable event-driven programming interface to the NRL OLSR routing protocol was designed and implemented in this research. Events are triggered based on changes in the network topology. This programming interface can be used by other management and monitoring clients on the network for receiving real-time updates about link and topology changes as seen by OLSR. A priority message delivery scheme was developed that provides different quality of service (QoS) levels for information dissemination in mobile ad hoc networks. To ensure a fair use of the transport media and support various message sizes, a message fragmentation solution was implemented. The proposed information dissemination solution was then deployed in a real wireless ad-hoc environment for further validation and testing. Using experiments with six nodes and various test scenarios, this research verified the functionality and characterized the performance of the proposed system. It was observed that the link-state nature of information dissemination solution helped it to adapt to topology changes. It was also realized that service discovery latency after information convergence in the network was independent of the number of nodes between the service providers and clients. The experiments also confirmed that the immediate message delivery scheme provides superior quality of service to registered users in presence of radio interference and other delays caused by Multipoint Relay Nodes (MPR) message forwarding in OLSR. / Master of Science

Prior research in routing for wireless ad hoc networks has shown that multipath routing can enhance data delivery reliability and provide load balancing. Nevertheless, only a few multipath routing algorithms have been proposed and their interaction with transport layer protocols has not been thoroughly addressed in the literature. In this work, we propose the multipath “Fresnel zone” routing (FZR) algorithm for wireless ad hoc networks. FZR constructs multiple parallel paths from source to destination based on the concept of “Fresnel zones” in a wireless network. The zone construction method assigns intermediate routers into different “Fresnel zones” according to their capacity and efficiency in forwarding traffic. The central idea in FZR is to disperse traffic to different zones according to network load and congestion conditions, thus achieving better throughput and avoiding congestion at intermediate routers. FZR differs from most existing multipath routing approaches in that both source and intermediate nodes use multiple forwarding paths. FZR also adopts a combination of proactive and on-demand (reactive) approaches to reduce control overhead and latency for packet delivery. Simulation experiments have shown that FZR outperforms unipath distance vector routing, multipath distance vector (MDV) routing, and split multipath routing (SMR) algorithms in quasistatic wireless ad hoc networks. In our simulations, FZR achieves up to 100 percent higher average throughput using the User Datagram Protocol (UDP) and 50 percent higher average throughput using the Transmission Control Protocol (TCP). FZR can also provide better load balancing among different paths, improve network resource utilization, and enable fairer resource allocation among different data transmission sessions. Future work is needed to evaluate FZR in mobile scenarios. / Master of Science