QoS-Based Web Service Discovery in Mobile Ad Hoc Networks Using Swarm Strategies

Mobile ad hoc networks are noncentralised, multihop, wireless networks that lack a common infrastructure and hence require self-organisation. Their infrastructureless and dynamic nature entails the implementation of a new set of networking technologies in order to provide efficient end-to-end communication according to the principles of the standard TCP/IP suite. Routing, IP address autoconfiguration and Web service discovery are among the most challenging tasks in the ad hoc network domain. Swarm intelligence is a relatively new approach to problem solving that takes inspiration from the social behaviours of insects, such as ants and bees. Self-organization, decentralization, adaptivity, robustness, and scalability make swarm intelligence a successful design paradigm for the above-mentioned problems. In this paper we proposeBeeAdHocServiceDiscovery, a new service discovery algorithm based on the bee metaphor, which also takes into account quality metrics estimates. The protocol has been specifically designed to work in mobile ad hoc network scenarios operating withBeeadhoc, a well-known routing algorithm inspired by nature. We present both the protocol strategy and the formal evaluation of the discovery overhead and route optimality metrics showing thatBeeAdHocServiceDiscoveryguarantees valuable performances even in large scale ad hoc wireless networks. Eventually, future research suggestions are sketched

MANET Network in Internet of Things System

In the current world of technology, various physical things can be used for facilitation of a human work. That is why the Internet of Things,an innovative technology and a good solution which allows the connection of the physical things with the digital world through the use of heterogeneous networks and communication technologies, is used. The Internet of Things in smart environments interacts with wireless sensor network (WSN) and mobile ad‐hoc network (MANET), making it even more attractive to the users and economically successful. Interaction between wireless sensor and mobile ad‐hoc networks with the Internet of Things allows the creation of a new MANET‐IoT systems and IT‐based networks. Such the system gives the greater mobility for a user and reduces deployment costs of the network. However, at the same time it opens new challenging issues in its networking aspects as well. In this work, the authors propose a routing solution for the Internet of Things system using a combination of MANET protocols and WSN routing principles. The presented results of solution\u27s investigation provide an effective approach to efficient energy consumption in the global MANET‐IoT system. And that is a step forward to a reliable provision of services over global Future Internet infrastructure

The design and simulation of routing protocols for mobile ad hoc networks.

Thesis (Ph.D.)-University of Natal, Durban, 2000.This thesis addresses a novel type of network known as a mobile ad hoc network. A mobile ad hoc network is a collection of entirely mobile nodes that can establish communication in the absence of any fixed infrastructure. Envisioned applications of these networks include virtual classrooms, emergency relief operations, military tactical communications, sensor networks and community networking. Mobile ad hoc networking poses several new challenges in the design of network protocols. This thesis focuses on the routing problem. The main challenges in the design of a routing protocol for mobile ad hoc networks result from them having limited resources and there being frequent topological changes that occur unpredictably. Moreover, there is no fixed infrastructure that supports routing. The conventional routing protocols are not generally suitable for mobile ad hoc networks, as they cannot react quickly to the changing network topology, cause excessive communication and computation, or converge very slowly creating routing loops. In this thesis we propose two classes of routing schemes for mobile ad hoc networks. The first class is known as Limited Flooding Protocol. The protocol is fully reactive and does not require the computation of routing tables. It uses some basic principles of flooding, but reduces the communication overhead by restricting packet propagation through the network. Several variations of limited flooding are considered including deterministic, randomised and priority-based mechanisms. The main advantage of this protocol is that it can be used in networks with unpredictable topological changes and highly mobile nodes, since maintaining routing table at the intermediate nodes is not required. The second class of routing protocols is based on hierarchical clustering architecture and is intended for use in a relatively low mobility environment. The basic idea of this protocol is to partition the entire network into smaller units known as clusters and define routing mechanisms both within and between clusters using a hierarchical architecture. The main advantage of this architecture is reduction of storage requirements of routing information, communication overhead and computational overhead at each node. Discrete-event simulation is used for modelling and performance evaluation. Various options and variations of the protocols are examined in the…[Page 2 of abstract is missing.]Page 2 of abstract is missing

Applying named data networking in mobile ad hoc networks

This thesis presents the Name-based Mobile Ad-hoc Network (nMANET) approach to content distribution that ensure and enables responsible research on applying named data networking protocol in mobile ad-hoc networks. The test framework of the nMANET approach allows reproducibility of experiments and validation of expected results based on analysis of experimental data. The area of application for nMANETs is the distribution of humanitarian information in emergency scenarios. Named-Data Networking (NDN) and ad-hoc mobile communication allow exchange of emergency information in situations where central services such as cellular towers and electric systems are disrupted. The implemented prototype enables researchers to reproduce experiments on content distribution that consider constraints on mobile resources, such as the remaining power of mobile devices and available network bandwidth. The nMANET framework validates a set of experiments by measuring network traffic and energy consumption from both real mobile devices and those in a simulated environment. Additionally, this thesis presents results from experiments in which the nMANET forwarding strategies and traditional wireless services, such as hotpost, are analysed and compared. This experimental data represents the evidence that supports and validates the methodology presented in this thesis. The design and implementation of an nMANET prototype, the Java NDN Forwarder Daemon (JNFD) is presented as a testing framework, which follows the principles of continuous integration, continuous testing and continuous deployment. This testing framework is used to validate JNFD and IP-based technologies, such as HTTP in a MANET using the OLSR routing protocol, as well as traditional wireless infrastructure mode wireless. The set of experiments executed, in a small network of Android smart-phones connected in ad-hoc mode and in a virtual ad-hoc network simulator show the advantages of reproducibility using nMANET features. JNFD is open source, all experiments are scripted, they are repeatable and scalable. Additionally, JNFD utilises real GPS traces to simulate mobility of nodes during experiments. This thesis provides experimental evidence to show that nMANET allows reproducibility and validation of a wide range of future experiments applying NDN on MANETs

Local Approximation Schemes for Ad Hoc and Sensor Networks

We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1+ε)-approximation to the problems at hand for any given ε > 0. The time complexity of both algorithms is O(TMIS + log*! n/εO(1)), where TMIS is the time required to compute a maximal independent set in the graph, and n denotes the number of nodes. We then extend these results to a more general class of graphs in which the maximum number of pair-wise independent nodes in every r-neighborhood is at most polynomial in r. Such graphs of polynomially bounded growth are introduced as a more realistic model for wireless networks and they generalize existing models, such as unit disk graphs or coverage area graphs

A contrasting look at self-organization in the Internet and next-generation communication networks

This article examines contrasting notions of self-organization in the Internet and next-generation communication networks, by reviewing in some detail recent evidence regarding several of the more popular attempts to explain prominent features of Internet structure and behavior as "emergent phenomena." In these examples, what might appear to the nonexpert as "emergent self-organization" in the Internet actually results from well conceived (albeit perhaps ad hoc) design, with explanations that are mathematically rigorous, in agreement with engineering reality, and fully consistent with network measurements. These examples serve as concrete starting points from which networking researchers can assess whether or not explanations involving self-organization are relevant or appropriate in the context of next-generation communication networks, while also highlighting the main differences between approaches to self-organization that are rooted in engineering design vs. those inspired by statistical physics

Social-aware Forwarding in Opportunistic Wireless Networks: Content Awareness or Obliviousness?

With the current host-based Internet architecture, networking faces limitations in dynamic scenarios, due mostly to host mobility. The ICN paradigm mitigates such problems by releasing the need to have an end-to-end transport session established during the life time of the data transfer. Moreover, the ICN concept solves the mismatch between the Internet architecture and the way users would like to use it: currently a user needs to know the topological location of the hosts involved in the communication when he/she just wants to get the data, independently of its location. Most of the research efforts aim to come up with a stable ICN architecture in fixed networks, with few examples in ad-hoc and vehicular networks. However, the Internet is becoming more pervasive with powerful personal mobile devices that allow users to form dynamic networks in which content may be exchanged at all times and with low cost. Such pervasive wireless networks suffer with different levels of disruption given user mobility, physical obstacles, lack of cooperation, intermittent connectivity, among others. This paper discusses the combination of content knowledge (e.g., type and interested parties) and social awareness within opportunistic networking as to drive the deployment of ICN solutions in disruptive networking scenarios. With this goal in mind, we go over few examples of social-aware content-based opportunistic networking proposals that consider social awareness to allow content dissemination independently of the level of network disruption. To show how much content knowledge can improve social-based solutions, we illustrate by means of simulation some content-oblivious/oriented proposals in scenarios based on synthetic mobility patterns and real human traces.Comment: 7 pages, 6 figure

Breaking the Legend: Maxmin Fairness notion is no longer effective

In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.Comment: 8 Page