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.     

Cluster‐based mobility management algorithms for wireless mesh networks

Wireless mesh networks (WMNs) have been the recent advancements and attracting more academicians and industrialists for their seamless connectivity to the internet. Radio resource is one among the prime resources in wireless networks, which is expected to use in an efficient way especially when the mobile nodes are on move. However, providing guaranteed quality of service to the mobile nodes in the network is a challenging issue. To accomplish this, we propose 2 clustering algorithms, namely, static clustering algorithm for WMNs and dynamic clustering algorithm for WMNs. In these algorithms, we propose a new weight‐based cluster head and cluster member selection process for the formation of clusters. The weight of the nodes in WMN is computed considering the parameters include the bandwidth of the node, the degree of node connectivity, and node cooperation factor. Further, we also propose enhanced quality of service enabled routing protocol for WMNs considering the delay, bandwidth, hopcount, and expected transmission count are the routing metrics. The performance of the proposed clustering algorithms and routing protocol are analyzed, and results show high throughput, high packet delivery ratio, and low communication cost compared with the existing baseline mobility management algorithms and routing protocols.     

Congestion Aware Geographic Routing Protocol for Wireless Ad Hoc and Sensor Networks

Geographic routing protocols forward packets according to the geographical locations of nodes. Thus, the criteria used to select a forwarding node impacts on the performance of the protocols such as energy efficiency and end-to-end transmission delay. In this paper, we propose a congestion aware forwarder selection (CAFS) method for a geographic routing protocol. To design CAFS, we devise a cost function by combining not only the forward progress made to a packet but also the amount of energy required for packet forwarding, forwarding direction, and congestion levels of potential forwarders. Among the potential forwarders, CAFS selects the next forwarder having the minimum cost. In our simulation studies, we compare the performance of CAFS with those of the maximum progress (MP) method and the cost over progress (CoP) method in various network conditions. The results show that compared with MP, the length of a routing path in terms of the number of hops becomes longer when CAFS is used. However, the shorter hop distance helps to avoid unnecessary retransmissions caused by packet loss in a wireless channel. In addition, since CAFS considers congestion levels of candidate forwarders, it reduces the queuing delay in each forwarder. Therefore, CAFS is superior to the MP and the CoP in terms of the energy consumption, end-to-end packet transfer delay, and the successful packet delivery rate.     

Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks

In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-forward approach. In this paper, an opportunistic routing protocol is proposed, along with its compatible media access control, for non-real-time services in delay-tolerant networks. The scheme is mobility-aware such that each network node needs to know its own position and velocity. The media access control employs a four-fold handshake procedure to probe the wireless channel and cooperatively prioritize candidate nodes for packet replication. It exploits the broadcast characteristic of the wireless medium to utilize long-range but unreliable links. The routing process seizes opportunities of node contacts for data delivery. It takes a multiple-copy approach that is adaptive with node movements. Numerical results in mobile ad hoc networks and vehicular ad hoc networks show superior performance of the proposed protocol compared with other routing protocols. The mobility-aware media access control and routing scheme exhibits relatively small packet delivery delay and requires a modest amount of total packet replications/transmissions.     

Adding sense of spatial locality to routing protocols for mobile ad hoc networks

Recently, there has been an increasing interest in mobile ad hoc networks. In a mobile ad hoc network, each mobile node can freely move around and the network is dynamically constructed by collections of mobile nodes without using any existing network infrastructure. Compared to static networks, it faces many problems such as the inefficiency of routing algorithms. Also, the number of control packets in any routing algorithm increases as the mobile speed or the number of mobile nodes increases. Most of the current routing protocols in ad hoc networks broadcast the control packets to the entire network. Therefore, by reducing the number of control packets, the efficiency of the network routing will be improved. If we know where the destination is, we can beam our search toward that direction. However, without using global positioning systems, how can we do this? Define the range nodes as the 1‐hop or 2‐hop neighbors of the destination node. In this paper, we propose using the range nodes to direct our searches for the destination. It can be combined with the existing routing protocols to reduce the control overhead. We show through simulations that AODV and DSR combined with the range node method outperforms the original AODV and DSR routing protocols in terms of control packets overhead. We also show that the delay introduced in find range nodes is insignificant. Copyright © 2006 John Wiley & Sons, Ltd.     

一种不可信环境下的匿名位置辅助路由激励机制

不可信环境下的路由性能问题,是移动自组织网(mobile ad-hoc networks,MANET)匿名路由协议面临的主要问题之一.本文为在不可信环境下通过对自私节点进行高效的协作激励,提高匿名路由协议的性能,提出了一种基于哈希链的匿名位置辅助路由激励机制.该机制利用哈希链在计算上的高效性和安全上的不可逆性,达成了对匿名数据转发节点的即时激励;通过基于支付代价的路由选择机制,优化了现有位置辅助路由机制的路由发现过程.匿名性分析证明,该机制能保证参与路由节点的匿名性.效率评价表明,在数据传输总量较大时,该机制对路由性能的影响很小,且该机制在较小规模的网络中有更好的性能.     

FUCEM: futuristic cooperation evaluation model using Markov process for evaluating node reliability and link stability in mobile ad hoc network

The cooperation between the nodes is one of the potential factor for successful routing in mobile ad hoc networks. The non-cooperative behaviour of the node disturbs the routing as well as degrades network performances. The non-cooperativeness is due to the resource constraint characteristics of a mobile node. The battery energy is an important constraint of a node because it exhausts after some period. On the other side, the mobility of nodes also affects routing performances. Hence, this work concentrates on evaluating cooperation of a node by probing future node energy and mobility. This paper proposes a futuristic cooperation evaluation model (FUCEM) for evaluating node reliability and link stability to establish effective routing. The FUCEM model examines influencing factors of cooperation and state transition of nodes using Markov process. Node reliability and link stability manipulated through the Markov process. The Markov process helps in fixing the upper and lower bounds of the cooperation and calculates the cooperation factor. The NS2 simulator simulates the proposed work and evaluates performance results with different scenarios. The result indicates that the proposed FUCEM has 13–21% higher packet delivery ratio than other algorithms. The remaining energy of the nodes increases to 6–7% as compared with the existing algorithms in a higher mobility scenario. Further, it significantly improves the results of routing overhead and average end-to-end delay than the existing models.

     

A Scalable-Adaptive Snack Routing Strategy (SRS) for Semi-Administrated Mobile Ad Hoc Networks (SAMANETs)

Recently, Mobile Ad Hoc networks (MANETs) are growing in popularity and importance. They present a possible communication among a set of mobile nodes with no need for either a pre-established infrastructure or a central administration. However, in order to guarantee an efficient communication among network nodes, efficient routing algorithms should be established. Routing plays the central role in providing ubiquitous network communications services in such dynamic networks. The problem is further aggravated through the node mobility as any node may move at any time without notice. Several routing protocols had been proposed; however, most of them suffer from control packet flooding, which results in a scalability problem. In this paper, a new routing strategy for MANETs is proposed which is called Snack Routing Strategy (SRS). The basic idea of SRS is to continuously inform the network mobile nodes with any changes in the network topology without overloading the network by a huge amount of control messages. SRS is a hybrid routing strategy that relies on Learning by accumulation, hence, new routes can be discovered by learning the accumulative data stored in the nodes routing tables by several foraging artificial snacks. SRS uses no periodic routing advertisement messages but uses artificial snacks instead, thereby reducing the network bandwidth overhead and minimizing end-to-end transmission delay. SRS has been compared against two well known protocols AODV and DSR. Experimental results have shown that SRS outperforms both AODV and DSR as it introduces the minimal routing overheads.     

A location-based routing method for mobile ad hoc networks

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (terminode remote routing, TRR), used when the destination is far, and link state-routing (terminode local routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: friend assisted path discovery and geographical map-based path discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks; the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms, existing location-based or MANET routing protocols.     

Probabilistic analysis of routes on mobile ad hoc networks

The ad hoc network is comprised of mobile nodes without wires or any infrastructures. All data are transmitted from source node to destination node through wireless channels. The ad hoc network is self-organized by ad hoc network routing protocols. Due to the mobility of nodes, the route which is constructed from many proposed ad hoc network routing protocols and comprised of several direct node-to-node links exists only for a certain period. That also means the route is subject to frequent breakages. In this letter, the probabilistic behavior of a constructed route is investigated through simulation and curve fitting. The simulation results show that the probability density function of a route is exponential distribution. The simulation also shows how the time proportion is distributed among different route lengths under a certain scenario. The route is a basic factor in the ad hoc network which operates without any central controller. The characteristics of the route have much influence on the performance of the ad hoc network. Thus the probabilistic analysis provides important implications when we are designing ad hoc network routing protocols and deploying ad hoc networks.     

G-STAR: Geometric STAteless Routing for 3-D wireless sensor networks

3-D aerial and underwater sensor networks have found various applications in natural habitat monitoring, weather/earthquake forecast, terrorist intrusion detection, and homeland security. The resource-constrained and dynamic nature of such networks has made the stateless routing protocol with only local information a preferable choice. However, most of the existing routing protocols require sensor nodes to either proactively maintain the state information or flood the network from time to time. The existing stateless geometric routing protocols either fail to work in 3-D environments or have tendency to produce lengthy paths. In this paper, we propose a novel routing protocol, namely Geometric STAteless Routing (G-STAR) for 3-D networks. The main idea of G-STAR is to distributively build a location-based tree and find a path dynamically. G-STAR not only generalizes the notion of geographic routing from two modes to one mode, but also guarantees packet delivery even when the location information of some nodes is either inaccurate or simply unavailable regardless of the uses of virtual coordinates. In addition, we develop a light-weight path pruning algorithm, namely Branch Pruning (BP), that can be combined with G-STAR to enhance the routing performance with very little overhead. The extensive simulation results by ns-2 have shown that the proposed routing protocols perform significantly better than the existing 3-D geometric routing protocols in terms of delivery rate with competitive hop stretch. We conclude that the proposed protocols serve as a strong candidate for future high-dimensional sensor networks.     

Trust-Aware Fuzzy Evaluation Method for Preventive Route Generation in Mobile Network

The existence of a non-cooperative or black hole node as an intermediate node in a mobile network can degrade the performance of the network and affects the trust of neighbor nodes. In this paper, a trust-aware routing protocol is defined for improving the routing reliability against black hole attacks. A new Trust aware and fuzzy regulated AODV (TFAODV) protocol is investigated in this work as an improvement over the existing AODV protocol. The session-driven evaluation of stability, communication-delay, and failure-ratio parameters are conducted for evaluating the trust of nodes. The fuzzy rules apply to these parameters for computing the degree of trust. This trust vector isolates the attack-suspected and trustful nodes. The proposed TFAODV protocol used the trustful mobile nodes as the intermediate path nodes. The proposed protocol has been experimented with in the NS2 simulation environment. The analytical results are obtained in terms of PDR ratio, Packet Communication, Loss rate parameters. The comparative results are derived against the AODV, Probabilistic AODV, PDS-AODV, PSAODV, and Juneja et al. protocols. The analysis is performed on different scenarios varied in terms of network density, degree of stability, and the number of attackers. The simulation results ensured the proposed TFAODV protocol has improved the PDR ratio and reduced the communication loss significantly against these state-of-art protocols.

     

Predictive and Fault-Tolerant Location Service in Mobile Ad Hoc Networks

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks (MANETs). One of the biggest challenge in geographic routing protocols is the design of efficient distributed location services that can locate the positions of mobile nodes. The accurate positioning of mobile nodes in MANETs is important to location service scheme since they are related to efficiency of routing protocols. We propose a grid-based predictive Location Service (GPLS) scheme and a hole-tolerant grid-based predictive Location Service (GPLS-H) scheme. In proposed location service scheme GPLS and GPLS-H, the network is partitioned into grids and grids are divided into groups by using a HASH function, which guarantees the uniform distribution of location servers of a node in the network. The main contribution of this paper is that the proposed location service scheme GPLS and GPLS-H provide accurate location query capability by means of location prediction of mobile nodes and GPLS-H can tolerate the “holes” in grid networks. The simulation results show that the location service scheme GPLS and GPLS-H have better performance than CRLS and SLURP in query success ratio, query delay and location availability.     

Survey of Secure Routing Protocols for Wireless Ad Hoc Networks

The mobile ad hoc network is a type of wireless network characterized by mobile nodes without a centralized administration. Frequent variations of the topology and the nature of the radio links have a negative impact on the stability of the links. Indeed, the link quality deteriorates rapidly and link breaks become frequent. To overcome these problems, new forms of routing protocols are used as the MultiPath routing. In addition, routing protocols require the knowledge of the nodes neighborhood to build and manage routes. The neighbor discovery process is performed by a Hello protocol. The Hello protocol typically involves several parameters such as the packet’s period; node’s transmit power, node’s position and node’s battery level. The purpose of this paper is to change the behavior of ad hoc On demand Multi-path Distance Vector (AOMDV) routing protocol by considering the density of the nodes as well as the interference of the neighboring nodes. This selection of paths goes through two stages. In the first step, we study the impact of the neighbor discovery process to select a set of paths having a minimum number of neighboring nodes to diminish contention problems and interference rate. In the second step, the Interference Ratio (IR) metric is used to select the paths in which the nodes are surrounded by a minimum of interference. We choose for our study two proposed approaches based on AOMDV routing protocol. The first is called AOMDV_neighbor and considers the density parameter as a path metric. The second is called AOMDV_neighbor_IR which considers the interference rate (IR) between each node and its neighborhood as a path metric. We evaluate the proposed routing protocols performance under various NS2 simulation scenarios in a shadowing environment.

     

缓存交换：间歇连通车载网络中的路到路的路由机制

Due to the road-constrained data delivery and highly dynamic topology of vehicle nodes in a Vehicular Ad Hoc Network (VANET), it is better to construct routing based on the road-to-road pattern than the traditional node-to-node routing pattern in MANETs. However, the challenging issue is the opportunistic forwarding at intersections. Therefore, we propose a novel routing scheme, called Buffer and Switch (BAS). In BAS, each road buffers the data packets with multiple duplicates propagation in order to provide more opportunities for packet switching at intersections. Different from conventional protocols in VANETs, the propagation of duplicates in BAS is bidirectional along the routing path. Moreover, BAS's cost is much lower than other flooding-based protocols due to its spatio-temporally controlled duplicates propagation. Different from recent researches, BAS can deliver packets not only to a stationary node, but also to the stationary or mobile nodes in a specified area. We conduct the extensive simulations to evaluate the performance of BAS based on the road map of a real city collected from Google Earth. The simulation results show that BAS can outperform the existing protocols, especially when the network resources are limited.     

DirMove: direction of movement based routing in DTN architecture for post-disaster scenario

Network architecture based on opportunistic Delay Tolerant Network (DTN) is best applicable for post-disaster scenarios, where the controlling point of relief work is any fixed point like a local school building or a hospital, whose location is known to everyone. In this work, 4-tier network architecture for post-disaster relief and situation analysis is proposed. The disaster struck area has been divided into clusters known as Shelter Points (SP). The architecture consists of mobile Relief Workers (RW) at tier 1, Throw boxes (TB) at tier 2 placed at fixed locations within SPs. Data Mules (DM) like vehicles, boats, etc. operate at tier 3 that provide inter-SP connectivity. Master Control Station (MCS) is placed at tier 4. The RWs are provided with smart-phones that act as mobile nodes. The mobile nodes collect information from the disaster incident area and send that information to the TB of its SP, using DTN as the communication technology. The messages are then forwarded to the MCS via the DMs. Based on this architecture, a novel DTN routing protocol is proposed. The routing strategy works by tracking recent direction of movement of mobile nodes by measuring their consecutive distances from the destination at two different instants. If any node moves away from the destination, then it is very unlikely to carry its messages towards the destination. For a node, the fittest node among all its neighbours is selected as the next hop. The fittest node is selected using parameters like past history of successful delivery and delivery latency, current direction of movement and node’s recent proximity to the destination. Issues related to routing such as fitness of a node for message delivery, buffer management, packet drop and node energy have been considered. The routing protocol has been implemented in the Opportunistic Networks Environment (ONE) simulator with customized mobility models. It is compared with existing standard DTN routing protocols for efficiency. It is found to reduce message delivery latency and improve message delivery ratio by incurring a small overhead .     

Clustering Based Two Dimensional Motion of Sink Node in Wireless Sensor Networks

The wireless sensor network (WSN) is always known for its limited-energy issues and finding a good solution for energy minimization in WSNs is still a concern for researchers. Implementing mobility to the sink node is used widely for energy conservation or minimization in WSNs which reduces the distance between sink and communicating nodes. In this paper, with the intention to conserve energy from the sensor nodes, we designed a clustering based routing protocol implementing a mobile sink called ‘two dimensional motion of sink node (TDMS)’. In TDMS, each normal sensor node collects data and send it to their respective leader node called cluster head (CH). The sink moves in the two dimensional direction to collect final data from all CH nodes, particularly it moves in the direction to that CH which has the minimum remaining energy. The proposed protocol is validated through rigorous simulation using MATLAB and comparisons have been made with WSN’s existing static sink and mobile sink routing protocols over two different geographical square dimensions of the network. Here, we found that TDMS model gives the optimal result on energy dissipation per round and increased network lifetime.

     

An EDRI-based approach for detecting and eliminating cooperative black hole nodes in MANET

Mobile Ad hoc Network (MANET) is a self-configurable, self-maintenance network with wireless, mobile nodes. Special features of MANET like dynamic topology, hop-by-hop communications and open network boundary, made security highly challengeable in this network. From security aspect, routing protocols are highly vulnerable against a wide range of attacks like black hole. In black hole attack malicious node injects fault routing information to the network and leads all data packets toward it-self. In this paper, we proposed an approach to detect and eliminate cooperative malicious nodes in MANET with AODV routing protocol. A data control packet is used in order to check the nodes in selected path; also, by using an Extended Data Routing Information table, all malicious nodes in selected path are detected, then, eliminated from network. For evaluation, our approach and a previous work have been implemented using Opnet 14 in different scenarios. Referring to simulation results, the proposed approach decreases packet overhead and delay of security mechanism with no false positive detection. In addition, network throughput is improved by using the proposed approach.     

Secure opportunistic routing protocols: methods,models, and classification

Addressing communication reliability and security has always been of significant importance in wireless networks. Opportunistic routing (OR) protocols comprise a promising area of research that aims to improve the reliability of communications, particularly in lossy networks. The main concept behind OR protocols is to utilize the broadcast nature of the wireless medium and determine a group of neighboring node candidates, known as candidate set, to collaboratively forward packets towards the destination using a candidate coordination approach. However, similar to traditional routing protocols, OR protocols operate poorly in the presence of malicious nodes and attackers. Therefore, researchers have designed and developed a number of security enhancements, considering the specific characteristics of such protocols. In this paper, following a brief overview on OR protocols, we examine, classify, and compare the different categories of security approaches proposed for OR protocols. More precisely, we divide security-related OR protocols into three categories, including trust-based approaches, game-theory-oriented solutions, and other related protocols. Furthermore, the most significant algorithms of each category are investigated as case studies. Finally, a comparison of different protocols is presented considering the main features, advantages, and shortcomings of each protocol.

     

QoS routing based on multi-class nodes for mobile ad hoc networks

In this paper, we present a new quality of service (QoS) routing protocol for mobile ad hoc networks (MANETs). Most of the existing routing protocols assume homogeneous nodes in MANETs, i.e., all nodes have the same communication capabilities and characteristics. However, in many ad hoc networks, nodes are not the same. Some nodes have longer transmission range, larger transmission bandwidth, and are more reliable and robust than other nodes. We take advantage of the non-homogeneous property to design more efficient QoS routing protocol. And node location information is used to aid routing. We also develop a new algorithm to calculate end-to-end bandwidth for a given path. Our QoS routing protocol contains end-to-end bandwidth calculation and bandwidth reservation. QoS route is discovered and setup only when it is needed. Extensive simulation studies demonstrate the good performance of the QoS routing protocol.