A New Method to Find a High Reliable Route in IoT by Using Reinforcement Learning and Fuzzy Logic

Recently, Internet is moving quickly toward the interaction of objects, computing devices, sensors, and which are usually indicated as the Internet of things (IoT). The main monitoring infrastructure of IoT systems main monitoring infrastructure of IoT systems is wireless sensor networks. A wireless sensor network is composed of a large number of sensor nodes. Each sensor node has sensing, computing, and wireless communication capability. The sensor nodes send the data to a sink or a base station by using wireless transmission techniques However, sensor network systems require suitable routing structure to optimizing the lifetime. For providing reasonable energy consumption and optimizing the lifetime of WSNs, novel, efficient and economical schemes should be developed. In this paper, for enhancing network lifetime, a novel energy-efficient mechanism is proposed based on fuzzy logic and reinforcement learning. The fuzzy logic system and reinforcement learning is based on the remained energies of the nodes on the routes, the available bandwidth and the distance to the sink. This study also compares the performance of the proposed method with the fuzzy logic method and IEEE 802.15.4 protocol. The simulations of the proposed method which were carried out by OPNET (Optimum Network performance) indicated that the proposed method performed better than other protocols such as fuzzy logic and IEEE802.15.4 in terms of power consumption and network lifetime.

     

Trust-Based Routing Mechanism in MANET: Design and Implementation

Mobile Ad hoc Network (MANET) is a self-organizing wireless network for mobile devices. It does not require any fixed infrastructure to be configured which makes it more suitable to be used in environments that require on-the-fly setup. This paper discusses the challenging issues in MANET routing security. It presents FrAODV, a trust-based scheme for securing AODV routing protocol in MANET using the friendship mechanism. The nodes can evaluate the routing paths according to some selected features (such as node reputation and identity information) before forwarding the data through these routes. We have used two types of implementation in our scheme, simulation (using NS2) and real test-bed (using JADHOC). This scheme is believed to provide a robust environment where MANET nodes can trust each other in a secure community.     

Intelligent energy-aware efficient routing for MANET

Designing an energy efficient routing protocol is one of the main issue of Mobile Ad-hoc Networks (MANETs). It is challenging task to provide energy efficient routes because MANET is dynamic and mobile nodes are fitted with limited capacity of batteries. The high mobility of nodes results in quick changes in the routes, thus requiring some mechanism for determining efficient routes. In this paper, an Intelligent Energy-aware Efficient Routing protocol for MANET (IE2R) is proposed. In IE2R, Multi Criteria Decision Making (MCDM) technique is used based on entropy and Preference Ranking Organization METHod for Enrichment of Evaluations-II (PROMETHEE-II) method to determine efficient route. MCDM technique combines with an intelligent method, namely, Intuitionistic Fuzzy Soft Set (IFSS) which reduces uncertainty related to the mobile node and offers energy efficient route. The proposed protocol is simulated using the NS-2 simulator. The performance of the proposed protocol is compared with the existing routing protocols, and the results obtained outperforms existing protocols in terms of several network metrics.     

A Memory Aided Broadcast Mechanism with Fuzzy Classification on a Device-to-Device Mobile Ad Hoc Network

Each device in being mobile ad hoc network (MANET) is overcome to navigate independently in any direction of side. The key challenge in building a MANET is availing every device to frequently maintain the information using static and dynamic topology. When the mobility is high scalable broadcast algorithm (SBA) is used and when the mobility is low memory aided broadcast algorithm (MaBA) is used for broadcasting packets. The MaBA is the algorithm where hubs on their memory to choose whether to forward stream or backward stream. The fuzzy enabled environs aware broadcast algorithm; a host maintains the local mobility around itself and defined user to choose which of two broadcast mechanisms to use. The Fuzzy logic is a Boolean conventional logic which has been increased to handle the concept of partial values between “completely true” and “completely false”. As its name convinced different logic underlying the modes of reasoning which are approximate rather than exact. The significance of fuzzy logic from the host derives. The fuzzy logic is going to work with the two algorithms SBA and MaBA and it divides the network into static, semi-static and dynamic.     

Improving Bandwidth Utilization of Intermittent Links in Highly Dynamic Ad Hoc Networks

Non-uniform node densities occur and intermittent links exist in highly dynamic ad hoc networks. To fit these networks, researchers usually combine delay tolerant network (DTN) routing protocols and mobile ad hoc network (MANET) routing protocols. The DTN protocol separates end-to-end links into multiple DTN links, which consist of multi-hop MANET links. Determining how to arrange DTN links and MANET links from source to end and dealing with intermittent links are performance issues, because node density ranges from sparse to dense and MANET protocols are much lighter than DTN protocols. This paper presents HMDTN, an application-network cross-layer framework, to solve the previously mentioned issues. The application layer in HMDTN supports disrupt tolerance with a large data buffer while adjusting the routing table on the basis of the connection state of links (link is disrupted or recovered), which are collected by the network layer. As a result, HMDTN increases the bandwidth utilization of intermittent links without compromising the efficiency of the MANET protocol in a reliable network. The HMDTN prototype was implemented based on Bytewalla (a Java version of DTN2) and Netfilter-based AODV. Experiments on Android devices show that unlike AODV and Epidemic, HMDTN increases the bandwidth utilization of intermittent links with a negligible increase of network overhead. In particular, HMDTN maintains the network throughput as high as regular network conditions even if the network undergoes relatively long-term (dozens of seconds or few minutes) data link disruptions.

     

Dynamic Task-Based Anycasting in Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) have received significant attention in the recent past owing to the proliferation in the numbers of tetherless portable devices, and rapid growth in popularity of wireless networking. Most of the MANET research community has remained focused on developing lower layer mechanisms such as channel access and routing for making MANETs operational. However, little focus has been applied on higher layer issues, such as application modeling in dynamic MANET environments. In this paper, we present a novel distributed application framework based on task graphs that enables a large class of resource discovery based applications on MANETs. A distributed application is represented as a complex task comprised of smaller sub-tasks that need to be performed on different classes of computing devices with specialized roles. Execution of a particular task on a MANET involves several logical patterns of data flow between classes of such specialized devices. These data flow patterns induce dependencies between the different classes of devices that need to cooperate to execute the application. Such dependencies yield a task graph (TG) representation of the application.We focus on the problem of executing distributed tasks on a MANET by means of dynamic selection of specific devices that are needed to complete the tasks. In this paper, we present simple and efficient algorithms for dynamic discovery and selection (instantiation) of suitable devices in a MANET from among a number of them providing the same functionality. This is carried out with respect to the proposed task graph representation of the application, and we call this process Dynamic Task-Based Anycasting. Our algorithm periodically monitors the logical associations between the selected devices, and in the event of a disruption in the application owing to failures in any component in the network, it adapts to the situation and dynamically rediscovers the affected parts of the task graph, if possible. We propose metrics for evaluating the performance of these algorithms and report simulation results for a variety of application scenarios differing in complexity, traffic, and device mobility patterns. From our simulation studies, we observed that our protocol was able to instantiate and re-instantiate TG nodes quickly and yielded high effective throughput at low to medium degrees of mobility and not much below 70% effective throughput for high mobility scenarios.     

Gateway Selection Protocol in Hybrid MANET Using DYMO Routing

In this paper, we propose a novel gateway (GW) selection protocol in hybrid Mobile Ad hoc Networks (MANETs). We focus on the situation that occurs when specialized, sensitive data is sent to the Internet from MANET nodes. These special data types are especially susceptible to security risks such as information leak and data falsification. Therefore, it is necessary for such special data to be forwarded by a secure/trusted GW which is controlled by a trusted network administrator. However, there should be multiple GWs deployed in a MANET, where the cost ineffectiveness makes it difficult for a network administrator to simultaneously manage every GW. Because of the risk of forwarding special data through an unmaintained GW, we propose a routing protocol which allows a source node to have sensitive data forwarded to the Internet through a trusted GW. To achieve this desirable performance, we improve upon one of the newest routing protocols, Dynamic MANET On-demand (DYMO), which works in consideration of application data. Through simulations, we evaluate our protocol in comparison with the conventional DYMO protocol. The results show that our protocol can make MANET source nodes choose GWs for specific data.     

FPS‐MAC: Fuzzy priority scheduling‐based MAC protocol for intelligent monitoring systems

Recent advances in microelectronics have encouraged the implementation of a wireless sensor network (WSN) in intelligent monitoring systems (IMSs). The IMS for time‐critical applications requires timely and reliable data delivery without sacrificing the energy efficiency of the network. This paper proposes FPS‐MAC, a fuzzy priority scheduling‐based medium access control protocol, designed for event critical traffic in hierarchical WSN. The FPS‐MAC allows time‐critical event traffic to opportunistically steal the data slots allocated for periodic data traffic in event‐based situations. Additionally, a fuzzy logic‐based slot scheduling mechanism is introduced to provide guaranteed and timely medium access to emergency traffic load and ensures the quality‐of‐service (QoS) requirements of IMSs. Both analytical and simulation results for data throughput, energy consumption, and transmission delay of FPS‐MAC, TLHA, E‐BMA, and BMA‐RR have been analyzed to demonstrate the superiority of the proposed FPS‐MAC protocol.     

Cross‐layer design for topology control and routing in MANETs

A mobile ad hoc network (MANET) is a self‐organized and adaptive wireless network formed by dynamically gathering mobile nodes. Since the topology of the network is constantly changing, the issue of routing packets and energy conservation become challenging tasks. In this paper, we propose a cross‐layer design that jointly considers routing and topology control taking mobility and interference into account for MANETs. We called the proposed protocol as Mobility‐aware Routing and Interference‐aware Topology control (MRIT) protocol. The main objective of the proposed protocol is to increase the network lifetime, reduce energy consumption, and find stable end‐to‐end routes for MANETs. We evaluate the performance of the proposed protocol by comprehensively simulating a set of random MANET environments. The results show that the proposed protocol reduces energy consumption rate, end‐to‐end delay, interference while preserving throughput and network connectivity. Copyright © 2010 John Wiley & Sons, Ltd.     

Enhancing QoE for video streaming in MANETs via multi-constraint routing

In this paper, we propose a Multi-Constraint Quality-of-Experience (QoE) centric Routing (MCQR) technique for efficient real-time video streaming over Mobile Ad-hoc Networks (MANETs). The dynamic estimation of link quality metric during MCQR route discovery process is the key of enhancing QoE at end user. MCQR limits end-to-end delay and jitter of received data packets by selecting long lifetime routes with maximum permissible delay. This minimizes the distortion caused fluctuations in perceived video. To prove the effectiveness of MCQR for real-time video streaming, we have designed a hybrid MANET consisting of simulated nodes and physical machines. In our hybrid network, the source and destination nodes are video traffic generators and receivers running on physical devices. Emulation results are obtained using real-time video streaming over high fidelity virtual wireless network, and conforming that the MCQR protocol provides satisfactory QoE to end users as compared to existing similar techniques. The packet delivery ratio of MCQR is higher than 90 % and its mean opinion score is higher than three (i.e., satisfactory) even when mobility and shadowing effects are kept high in target network scenarios. These improvements are achieved along with still maintaining similar or better routing overhead and processing delays.     

Secure way routing protocol for mobile ad hoc network

Mobile adhoc network is dynamic in nature and it operates completely in an infrastructure-less environment. It discovers the way routes dynamically to reach the destination. Securing a dynamic way route, which is not known before establishing communication, is always a challenge in the mobile ad hoc network. Most of the existing secure routing protocols target to evade specific type of attacks or malicious behaviour of the nodes or networks. We propose a novel secure way routing protocol for securing the dynamic way routes in MANET. It provides a unique session key for each route to secure the data communication. Moreover, it authenticates the data packets using asymmetric cryptography and secures the routing field message using two-way asymmetric cryptography. The proposal is implemented and tested for assessing the protocol’s performance. We have also compared the protocol with the other secure routing protocols for evaluating its performance.     

Bandwidth-satisfied multicast trees in large-scale ad-hoc networks

The purpose of this paper is to construct bandwidth-satisfied multicast trees for QoS applications in large-scale ad-hoc networks (MANETs). Recent routing protocols and multicast protocols in large-scale MANETs adopt two-tier infrastructures to avoid the inefficiency of the flooding. Hosts with a maximal number of neighbors are often chosen as backbone hosts (BHs) to forward packets. Most likely, these BHs will be traffic concentrations/bottlenecks of the network. In addition, since host mobility is not taken into consideration in BH selection, these two-tier schemes will suffer from more lost packets if highly mobile hosts are selected as BHs. In this paper, a new multicast protocol is proposed for partitioning large-scale MANET into two-tier infrastructures. In the proposed two-tier multicast protocol, hosts with fewer hops and longer remaining connection time to the other hosts will be selected as BHs. The objective is not only to obtain short and stable multicast routes, but also to construct a stable two-tier infrastructure with fewer lost packets. Further, previous MANET quality-of-service (QoS) routing/multicasting protocols determined bandwidth-satisfied routes for QoS applications. Some are implemented as a probing scheme, but the scheme is inefficient due to high overhead and slow response. On the contrary, the others are implemented by taking advantage of routing and link information to reduce the inefficiency. However, the latter scheme suffers from two bandwidth-violation problems. In this paper, a novel algorithm is proposed to avoid the two problems, and it is integrated with the proposed two-tier multicast protocol to construct bandwidth-satisfied multicast trees for QoS applications in large-scale MANETs. The proposed algorithm aims to achieve better network performance by minimizing the number of forwarders in a tree.     

Simulation of Ad Hoc Routing Protocols using OMNeT++

Mobile Ad Hoc Networks (MANETs) have evolved in the last years into standards in the communication world. By definition, they do not need any network infrastructure to facilitate communication between participating nodes. Therefore, MANETs are dealing with new challenges in the context of ad hoc routing. Simulation techniques are one of the fundamental methodologies to support the protocol engineering process, especially in the early stages of ad hoc network protocol design. In this paper, we set out common criteria that may serve as guidelines for meaningful simulative evaluations of ad hoc routing protocols. We present typical and necessary measures for ad hoc routing in general and MANET routing in particular. As a case study, we demonstrate a comprehensive performance evaluation of the Dynamic MANET On Demand (DYMO) routing protocol using a model we implemented for the popular OMNeT+ + discrete event simulation environment.     

Intrusion Detection System Against Colluding Misbehavior in MANETs

Routing protocol of MANET works with the presumption that nodes will transmit the data in collaboration. This presumption is a limitation of routing protocol which gives an occasion to attackers to hinder the security of the device and data in the network. Therefore, it becomes vital to develop methods and systems which will ensure the safety, integrity and confidentiality of data in such devices and systems. Although, existing IDS are able to detect various types of attack but some misbehavior goes undetected which potentially damage the network. Collusion attack is one such misbehavior where nodes perform maliciously in collaboration with neighboring nodes without being detected. In this work, Intrusion detection algorithm has been proposed that can effectively detect and isolate colluding nodes from the network so that these malicious nodes do not affect the performance of the network . Proposed detection algorithm uses in–out traffic information and overhearing statistics of nodes to identify colluding attackers. Detection algorithm works successfully for DSR routing protocol. Experimental results on NS-2 show that the proposed algorithm is capable of reducing the packet drops consequently improving the throughput of the network in presence of collusion attack.     

FUCA: Fuzzy‐based unequal clustering algorithm to prolong the lifetime of wireless sensor networks

Wireless sensor network comprises billions of nodes that work collaboratively, gather data, and transmit to the sink. “Energy hole” or “hotspot” problem is a phenomenon in which nodes near to the sink die prematurely, which causes the network partition. This is because of the imbalance of the consumption of energy by the nodes in wireless sensor networks. This decreases the network's lifetime. Unequal clustering is a technique to cope up with this issue. In this paper, an algorithm, “fuzzy‐based unequal clustering algorithm,” is proposed to prolong the lifetime of the network. This protocol forms unequal clusters. This is to balance the energy consumption. Cluster head selection is done through fuzzy logic approach. Input variables are the distance to base station, residual energy, and density. Competition radius and rank are the two output fuzzy variables. Mamdani method is employed for fuzzy inference. The protocol is compared with well‐known algorithms, like low‐energy adaptive clustering hierarchy, energy‐aware unequal clustering fuzzy, multi‐objective fuzzy clustering algorithm, and fuzzy‐based unequal clustering under different network scenarios. In all the scenarios, the proposed protocol performs better. It extends the lifetime of the network as compared with its counterparts.     

A Shoelace-Based QoS Routing Protocol for Mobile Ad Hoc Networks Using Directional Antenna

In this paper, we propose a new quality-of-service (QoS) routing protocol for mobile ad hoc network (MANET) using directional antennas. The proposed scheme offers a bandwidth-based routing protocol for QoS support in MANET using the concept of multi-path. Our MAC sub-layer adopts the CDMA-over-TDMA channel model. The on-demand QoS routing protocol calculates the end-to-end bandwidth and allocates bandwidth from the source node to the destination node. The paths are combined with multiple cross links, called shoelace, when the network bandwidth is strictly limited. Due to the property of the directional antenna, these cross links can transmit data simultaneously without any data interference. We develop a shoelace-based on-demand QoS routing protocol by identifying shoelaces in a MANET so as to construct a QoS route, which satisfied the bandwidth requirement, more easily. The shoelace-based route from the source to the destination is a route whose sub-path is constructed by shoelace structure. With the identified shoelaces, our shoelace-based scheme offers a higher success rate to construct a QoS route. Finally, simulation results demonstrate that the proposed routing protocol outperform existing QoS routing protocols in terms of success rate, throughput, and average latency.     

Secure message transmission in mobile ad hoc networks

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the mobile ad hoc networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the open, collaborative MANET environment, practically any node can maliciously or selfishly disrupt and deny communication of other nodes. In this paper, we propose the secure message transmission (SMT) protocol to safeguard the data transmission against arbitrary malicious behavior of network nodes. SMT is a lightweight, yet very effective, protocol that can operate solely in an end-to-end manner. It exploits the redundancy of multi-path routing and adapts its operation to remain efficient and effective even in highly adverse environments. SMT is capable of delivering up to 83% more data messages than a protocol that does not secure the data transmission. Moreover, SMT achieves up to 65% lower end-to-end delays and up to 80% lower delay variability, compared with an alternative single-path protocol––a secure data forwarding protocol, which we term secure single path (SSP) protocol. Thus, SMT is better suited to support quality of service for real-time communications in the ad hoc networking environment. The security of data transmission is achieved without restrictive assumptions on the network nodes’ trust and network membership, without the use of intrusion detection schemes, and at the expense of moderate multi-path transmission overhead only.     

SEPFL routing protocol based on fuzzy logic control to extend the lifetime and throughput of the wireless sensor network

In this paper a new protocol using fuzzy logic control has been proposed. The protocol is based on Stable Election Protocol (SEP). Fuzzy logic control based on three variables, distance of nodes form base station, density of nodes and the battery level of nodes along with the traditional threshold values used in SEP are used to enhance the process of cluster head election in the existing SEP protocol and improve the lifetime and throughput of the Wireless Sensor Network. The result of the simulation which has been done in MATLAB simulator indicates that Stable Election Protocol based on fuzzy logic is more energy efficient and improves the lifetime and throughput of the network by 73.2 and 68.54 % respectively comparing with the existing SEP protocol.     

GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. One prospective direction to assist routing in such an environment is to use location information provided by positioning devices such as global positioning systems (GPS). In this paper, we propose a new routing protocol called GRID, which tries to exploit location information in route discovery, packet relay, and route maintenance. Existing protocols, as compared to ours, are either not location-aware or partially location-aware in that location knowledge is not fully exploited in all these three aspects. One attractive feature of our protocol is its strong route maintenance capability – the intermediate hosts of a route can perform a handoff operation similar to that in cellular systems when it roams away to keep a route alive. This makes routes in the MANET more stable and insensitive to host mobility. Simulation results show that our GRID routing protocol can reduce the probability of route breakage, reduce the number of route discovery packets used, and lengthen routes' lifetime.