Enhancing Cooperation in MANET Using the Backbone Group Model (An Application of Maximum Coverage Problem)

AbstractMANET is a cooperative network in which every node is responsible for routing and forwarding as a result consumes more battery power and bandwidth. In order to save itself in terms of battery power and bandwidth noncooperation is genuine. Cooperation can be enhanced on the basis of reduction in resource consumption by involving a limited number of nodes in routing activities rather than all. To get accurate selection of nodes to define a backbone several works have been proposed in the literature. These works define a backbone with impractical assumptions that is not feasible for MANET. In this paper we have presented the Backbone Group (BG) model, which involve the minimum number of nodes called BG in routing activities instead of all. A BG is a minimal set of nodes that efficiently connects the network. We have divided a MANET in terms of the single hop neighborhood called locality group (LG). In a LG we have a cluster head (CH), a set of regular nodes (RNs) and one or more border nodes (BNs). The CHs are responsible for the creation and management of LG and BG. The CHs use a BG for a threshold time then switches to another BG, to involve all nodes in network participation. The proposed model shows its effectiveness in terms of reduction in routing overhead up to a ratio (n2: n2/k) where k is the number of LGs

Naming and Address Resolution in Heterogeneous Mobile Ad hoc Networks

This doctoral thesis deals with naming and address resolution in heterogeneous networks to be used in disaster scenarios. Such events could damage the communication infrastructure in parts or completely. To reestablish communication, Mobile Ad hoc Networks (MANETs) could be used where central entities have to be eliminated broadly. The main focus of the thesis lies on two things: an addressing scheme that helps to find nodes, even if they frequently change the subnet and the local addressing, by introducing an identifying name layer; and a MANET-adapted substitution of the Domain Name System (DNS) in order to resolve node identities to changing local addresses. We present our solution to provide decentralized name resolution based on different underlying routing protocols embedded into an adaptive routing framework. Furthermore, we show how this system works in cascaded networks and how to extend the basic approach to realize location-aware service discovery.Auch im Buchhandel erhältlich: Naming and Address Resolution in Heterogeneous Mobile Ad hoc Networks / Sebastian Schellenberg Ilmenau : Univ.-Verl. Ilmenau, 2016. - xvi, 177 Seiten ISBN 978-3-86360-129-4 Preis (Druckausgabe): 17,60

SEREMA: self-organized routing in heterogeneous mobile ad hoc networks

After natural disasters like earthquakes or after human-made disasters like terrorist attacks, it is very important to organize the disaster response teams. Therefore, communication infrastructure is very important. However, this infrastructure could be heavily damaged during the disaster. Typically, all the disaster response teams as well as the victims carry along mobile devices. These mobile network devices can be combined to ad hoc networks which can be used for communication. The performance of wireless ad hoc networks is mainly affected by the routing protocol. A lot of routing protocols are available for wireless ad hoc networks. However, these protocols are not suitable for highly dynamic mobile ad hoc networks because they are not able to adapt to major changes in the network topology. In disaster scenarios, highly dynamic networks are considered. This work presents an adaptive approach which is able to switch between multiple routing protocols during the runtime of the network.Nach Naturkatastrophen, wie beispielsweise Erdbeben, Wirbelstürmen, Flutwellen oder auch nach durch den Menschen verursachten Katastrophen wie Terroranschlägen oder Unfällen, ist es sehr wichtig die Ersthelfer zu organisieren. Hierfür ist eine Kommunikationsinfrastruktur, welche zum Beispiel Basisstationen für Mobilfunknetze enthält, von entscheidender Bedeutung. Diese Infrastruktur kann durch die Katastrophe jedoch schwer beeinträchtigt oder vollkommen zerstört sein. Heutzutage sind Ersthelfer als auch Opfer üblicherweise mit leistungsfähigen mobilen Endgeräten, wie Smartphones oder Notebooks, ausgerüstet. Diese mobilen Endgeräte, welche über eine Vielzahl von Netzzugangstechnologien verfügen, können zu einem sogenannten Ad-hoc-Netzwerk zusammengeschlossen werden und bilden anschließend eine infrastrukturlose Kommunikationsbasis. Die Leistungsfähigkeit von kabellosen Ad-hoc-Netzwerken ist dabei stark von der Anzahl bekannter Verbindungen im Netz abhängig. Diese Verbindungen, auch Routen genannt, werden durch das verwendete Routingprotokoll gesucht und ständig aktualisiert. Hierzu stehen verschiedenartige Routingprotokolle zur Verfügung, welche Topologieinformationen zwischen den einzelnen Knoten eines Netzwerks austauschen. Für kabellose Ad-hoc-Netzwerke sind hierfür zahlreiche Routingprotokolle verfügbar, jedoch sind diese bereits existierenden Protokolle nur eingeschränkt für hochdynamische mobile Ad-hoc-Netzwerke geeignet. Dies liegt darin begründet, dass sie nicht in der Lage sind, sich an große Änderungen im Netzwerk anzupassen. In Katastrophenszenarien können allerdings hochdynamische Netzwerke vorkommen, in welchen beispielsweise die Größe des Netzes zwischen einigen wenigen und einigen hundert Knoten schwankt oder sich die Knotengeschwindigkeit von statischen bis hin zu hochmobilen Knoten verändert. Die vorliegende Arbeit präsentiert einen adaptiven Ansatz, welcher in der Lage ist, die gegebenen Parameter des Netzwerks in einer dezentralen Weise zu ermitteln und anschließend das verwendete Routingprotokoll während der Laufzeit zu wechseln, um somit das Routing sehr flexibel an die Gegebenheiten des Netzwerks anzupassen.After natural disasters like earthquakes, hurricanes, tsunamis or after human-made disasters like terrorist attacks or accidents, it is very important to organize the disaster response teams. Therefore, communication infrastructure like base stations for cellular networks is very important. However, this infrastructure could be heavily damaged during the disaster. Nevertheless, communication should be possible. Typically, all the disaster response teams as well as the victims carry along mobile devices such as smartphones or notebooks. These mobile network devices can be combined to an ad hoc network; this is an infrastructureless network that can be used for communication. The performance of wireless ad hoc networks is mainly affected by the routing protocol. It is a very important task of the routing protocol to find suitable routes for data forwarding in a fast and efficient way. The routes are found using different routing protocols which exchange some type of topology information between the nodes, which are usually mobile devices. A lot of routing protocols are available for wireless ad hoc networks. However, these protocols are not suitable for highly dynamic mobile ad hoc networks because they are not able to adapt to major changes in the network topology. In disaster scenarios, highly dynamic networks are considered where the size of these networks can vary from a few nodes to hundreds of nodes and the movement of the nodes can vary from static to highly mobile nodes, for example. This work presents an adaptive approach which gathers information about the network in a self-organized way and is able to switch between multiple routing protocols during the runtime of the network to adapt routing very flexibly to highly dynamic mobile ad hoc networks

NETWORK AND DOMAIN AUTOCONFIGURATION: A UNIFIED FRAMEWORK FOR LARGE MOBILE AD HOC NETWORKS

Configuration management is critical to correct and efficient operation of large networks. In those cases where the users and networks are dynamic and ad hoc, manual configuration quickly becomes too complex. The combination of the sheer number of nodes with the heterogeneity and dynamics makes it almost impossible for the system administrator to ensure good configuration or even ensure correct operation. To achieve the vision of pervasive computing, nodes must automatically discover their environment and self-configure, then must automatically reconfigure to adapt to changes. Protocols such as DHCP, DDNS and mDNS provide some degree of host autoconfiguration, but network administrators must still configure information such as address pools, routing protocols, or OSPF routing areas. Only limited progress has been made to automate the configuration of routers, servers and network topology. This dissertation proposes the autoconfiguration of most host, router and server information, including the automatic generation and maintenance of hierarchy, under the same architectural, algorithmic and protocol framework. The proposed unified framework consists of modules (DRCP, DCDP, YAP, ACA) responsible for the entity autoconfiguration and from a modified and well adjusted general optimization (Simulated Annealing) based algorithm for the domain autoconfiguration. Due to the generality of the optimization algorithm, the generated hierarchy can improve dynamically selected network performance aspects represented by appropriately designed objective functions and constraints. An indicative set related to the physical characteristics of the domains and node mobility is provided. Even though SA has been adjusted for faster convergence, it may still be unable to capture the dynamics of rapidly changing networks. Thus, a faster but suboptimal distributed hierarchy generation mechanism that follows the design philosophy of SA-based mechanism has also been introduced. Inevitably, due to network dynamics, the quality of the hierarchy will degrade. In such scenarios, the frequent reapplication of the expensive optimization based hierarchy generation is prohibitive. Hence, for extending the domain formation framework, distributed maintenance mechanisms have been proposed for reconstructing the feasibility and quality of the hierarchy by enforcing localized decisions. The proposed framework has been applied to provide solutions on some realistic network problems related to hierarchical routing and topology control

Topics on modelling and simulation of wireless networking protocols

The use of computer simulation to study complex systems has grown significantly over the past several decades. This is especially true with regard to computer networks, where simulation has become a widespread tool used in academic, commercial and military applications. Computer model representations of communication protocol stacks are used to replicate and predict the behavior of real world counterparts to solve a variety of problems.The performance of simulators, measured in both accuracy of results and run time, is a constant concern to simulation users. The running time for high delity simulation of large-scale mobile ad hoc networks can be prohibitively high. The execution time of propagation e ects calculations for a single transmission alone can grow unmanageable to account for all potential receivers. Discrete event simulators can also su er from excessive generation and processing of events, both due to network size and model complexity. In this thesis, three levels of abstracting the Institute of Electrical and Electronics Engineers (IEEE) 802.11 Request to Send/Clear to Send (RTS/CTS) channel access mechanism are presented. In the process of assessing the abstractions' ability to mitigate runtimecost while retaining comparable results to that of a commercially available simulator, OPNET, the abstractions were found to be better suited to collecting one metric over another.Performance issues aside, simulation is an ideal choice for use in prototyping and developing protocols. The costs of simulation are orders of magnitude smaller than that of network testbeds, especially after factoring in the logistics, maintenance, and space required to test live networks. For instance, Internet Protocol version 6 (IPv6) stateless address autocon guration protocols have yet to be convincingly shown to cope with the dynamic, infrastructure-free environment of Mobile Ad hoc Networks (MANETs). This thesis provides a literature survey of autocon guration schemes designed for MANETs, with particular focus on a stateless autocon guration scheme by Jelger andNoel (SECON 2005). The selected scheme provides globally routable IPv6 pre xes to a MANET attached to the Internet via gateways. Using OPNET simulation, the Jelger-Noel scheme is examined with new cluster mobility models, added gateway mobility, and varied network sizes. Performance of the Jelger-Noel scheme, derived from overhead, autocon gura ion time and pre x stability metrics, was found to be highly dependent on network density, and suggested further re nement before deployment.Finally, in cases where a network testbed is used to test protocols, it is still advantageous to run simulations in parallel. While testbeds can help expose design aws due to code or hardware di erences, discrete event simulation environments can o er extensive debugging capabilities andevent control. The two tools provide independent methods of validating the performance of protocols, as well as providing useful feedback on correct protocol implementation and con guration. This thesis presents the Open Shortest Path First (OSPF) routing protocol and its MANET extensions as candidate protocols to test in simulated and emulated MANETs. The measured OSPF overhead from both environments was used as a benchmark to construct equivalent MANET representations and protocol con guration, made particularly challenging due to the wired nature of the emulation testbed. While attempting to duplicate and validate results of a previous OSPF study, limitations of the simulated implementation of OSPF were revealed.M.S., Electrical Engineering -- Drexel University, 200

Self-stabilizing cluster routing in Manet using link-cluster architecture

We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called a clusterhead that contains the routing information about inter and intra-cluster communication. A cluster is comprised of all nodes that choose the corresponding clusterhead as their leader. The algorithm consists of two main tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, it is within two hops of the clusterhead, it knows the direct neighbor on the shortest path towards the clusterhead, and there exist no two adjacent clusterheads. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterheads (as per the link-cluster architecture), there is no need to check the consistency of the routing tables. Second, since all other nodes have significantly less work (they only forward messages), they use much less power than the clusterheads. Therefore, if a clusterhead runs out of power, a neighboring node (that is not a clusterhead) can accept the role of a clusterhead. (Abstract shortened by UMI.)

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: vehicular ad-hoc networks, security and caching, TCP in ad-hoc networks and emerging applications. It is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

The Application of Ant Colony Optimization

The application of advanced analytics in science and technology is rapidly expanding, and developing optimization technics is critical to this expansion. Instead of relying on dated procedures, researchers can reap greater rewards by utilizing cutting-edge optimization techniques like population-based metaheuristic models, which can quickly generate a solution with acceptable quality. Ant Colony Optimization (ACO) is one the most critical and widely used models among heuristics and meta-heuristics. This book discusses ACO applications in Hybrid Electric Vehicles (HEVs), multi-robot systems, wireless multi-hop networks, and preventive, predictive maintenance

Models and Protocols for Resource Optimization in Wireless Mesh Networks

Wireless mesh networks are built on a mix of fixed and mobile nodes interconnected via wireless links to form a multihop ad hoc network. An emerging application area for wireless mesh networks is their evolution into a converged infrastructure used to share and extend, to mobile users, the wireless Internet connectivity of sparsely deployed fixed lines with heterogeneous capacity, ranging from ISP-owned broadband links to subscriber owned low-speed connections. In this thesis we address different key research issues for this networking scenario. First, we propose an analytical predictive tool, developing a queuing network model capable of predicting the network capacity and we use it in a load aware routing protocol in order to provide, to the end users, a quality of service based on the throughput. We then extend the queuing network model and introduce a multi-class queuing network model to predict analytically the average end-to-end packet delay of the traffic flows among the mobile end users and the Internet. The analytical models are validated against simulation. Second, we propose an address auto-configuration solution to extend the coverage of a wireless mesh network by interconnecting it to a mobile ad hoc network in a transparent way for the infrastructure network (i.e., the legacy Internet interconnected to the wireless mesh network). Third, we implement two real testbed prototypes of the proposed solutions as a proof-of-concept, both for the load aware routing protocol and the auto-configuration protocol. Finally we discuss the issues related to the adoption of ad hoc networking technologies to address the fragility of our communication infrastructure and to build the next generation of dependable, secure and rapidly deployable communications infrastructures