Achieving Spatial Disjointness in Multipath Routing without Location Information

Since flooding is used for route discovery in on-demand routing protocols in wireless sensor networks, the routing overhead increases obviously, especially in simple flooding. Many routing protocols adopt measures to control flooding overhead but result limited effect. In this paper, a novel on-demand protocol, based MPR flooding, is presented. The protocol reduces the flooding overhead effectively by using MPR mechanism during route discovery, makes the best use of the routing information and increases the performance observably. Simulation results show that the protocol is better than AODV in performance such as rate, end-to-end delay, and successful rate and so on.

Nodes in a multi-hop wireless network rely on each other to maintain network connectivity. A primary design objective of these networks is to eliminate or minimize the unavailability of network at some point. However, the movement of nodes creates service disruption and delay as path failure detection and re-establishment consume considerable amount of time. Existing solutions for link classification and prediction operate on discrete values resulting in performance degradation. This problem can best be modelled using fuzzy logic. This work presents a new fuzzy logic based link status classification mechanism for the use with multipath routing protocols in multi-hop wireless networks. The new Enhanced Adhoc On-demand Multipath Distance Vector (eAOMDV) uses fuzzy logic to classify the link status as active, about-to-break or broken. On the basis of fuzzy input parameters RSSI, velocity, distance and bit error rate, the fuzzy based classification mechanism predicts in advance that a particular link, on the active path between the sender and receiver, is about-to-break and helps the reactive multipath routing protocol to start the rerouting operation, thus minimizing the service disruption time, route discovery frequency, end-to-end delay and the packet loss.

Wireless sensor networks congestion occurs easily due to its centralized traffic pattern. Normally, mono-sync wireless sensor network experiences multiple traffic flow congestion in the dense environment of the network, which leads to excess energy consumption and severe packet loss. To overcome these issues, a congestion detection and alleviation mechanism using cluster based heuristic optimized hierarchical routing protocol is proposed in this paper. Here, congestion detection and alleviation utilize the features of sensor nodes. The congestion is categorized into two types: (i) node level congestion and (ii) link level congestion. The node level congestion is detected by assessing the buffer utilization and the interval amid the consecutive data packets. The link level congestion is considered with computing link usage utilizing back-off step of round robin carrier sense multi-access with collision avoidance. Congestion detection and alleviation reactively affected node/link through cuckoo hosted rider search multi-hop routing algorithm. It has two phases: the cluster head selection and multi-path routing. Cluster head selection is performed through Taylor multiple random forest kernel fuzzy C-means clustering algorithm and multi-path routing is performed through cuckoo hosted rider search multi-hop routing algorithm. The simulation of the proposed method is done in network simulator tool. Here, the performance metrics, like packet delivery ratio, delay, energy consumption, packet drop, overhead, network lifetime and throughput are calculated. The experimental outcomes of the proposed technique shows 11.6%, 18.4% and 28.1% lower delay, 78.2%, 65.4% and 52.6% higher packet delivery ratio, and 29.2%, 37.4% and 40.8% lower packet drop compared with the existing methods, like congestion detection and alleviation using multi-attribute decision-making in optimization-based hybrid congestion alleviation routing protocol in wireless sensor networks, congestion detection and alleviation using hybrid K-means with greedy best first search algorithms in packet rate reduction utilizing adaptive weight firefly algorithm ant colony optimization based routing protocol in wireless sensor networks and congestion detection and alleviation using multi-input time on task optimization algorithm for altered gravitational search algorithm routing protocol in wireless sensor networks.

In Wireless Sensor Networks (WSNs), fair utilisation of the network resources is a challenging task. In this regard, one of the determining factors is the routing protocol that plays an important role to route the data traffic from the source to the destination, under limited network resources. Most of the routing protocols and their variants in WSNs replace the routing metric of the prevalent routing protocol with their proposed routing metric and keep the route discovery mechanism intact. However, replacing only the routing metric is insufficient to improve the performance of the entire network as it can generate high End-to-End (ETE) delay in finding the destination as per the routing criteria. In this paper, a novel single path loop-free Distributed On-demand Multi-Optional routing (DOMO) protocol is presented. The DOMO selects the best sensor node based on the routing metric(s) amonst various alternatives at each stage during forward route formation. A simulation has been performed in ns-2.35 and it has been observed that, using the same routing metric(s), DOMO performs better for long-term communication in WSNs as compared to Ad hoc On Demand Distance Vector (AODV). The results have revealed that DOMO improves the average ETE delay by 17% and normalises the routing load by 47% as compared to AODV.

A mobile ad hoc network is a network of mobile nodes connected by multi-hop wireless links without centralized infrastructure support. The area of ad hoc networking is receiving increasing attention in recent years. Efficient dynamic routing is an important research challenge in such a network. In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing, in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. A variety of new multipath routing protocols targeted at the ad hoc networking environment have been proposed. Multipath routing improves the throughput of ad hoc networks; it is a straightforward mechanism to recover from route losses in a dynamic network. In this paper we have considered a very well-known multipath routing protocol called ad hoc on-demand multipath distance vector routing (AOMDV) on both MAC layers, the standard IEEE 802.11 and a TDMA MAC protocol called evolutionary-TDMA (E-TDMA). We have evaluated the performance of these multipath routing through simulations using NS2 varying the number of paths (particularly we have considered 2 and 3 paths) and varying the number of temporary colors.

Routing protocols play an important role for communications in MANET. Most of the protocols, however, use a single route and do not utilize multiple alternate paths. Thus a dynamic multi-path source routing (DMSR) protocol is proposed to improve existing on-demand routing protocols. It consists of three major phases, namely routing discovery, multi-path routing selecting and routing maintenance. In multi-path routing selecting phase, the ideal number of multi-path routing is achieved to compromise between load balancing and network overhead. Simulation results show that such protocol remarkably increases the packet delivery ratio with lower routing overhead. It will provide an effective solution for wireless communication.

Majority of the energy-aware routing protocols for wireless sensor networks focus on hierarchical routing mechanism, e.g., clustering algorithm. The significant disadvantage of the clustering approach was rapid depletion of battery of sensor nodes near the sink due to uneven distribution of packets, even in a multihop propagation strategy. To mitigate the adverse effect of improper packet distribution policy flowing toward cluster head, we have introduced a novel packet distribution policy so that powers at all nodes are uniformly dissipated, keeping the packet generation rates at all the intermediate nodes be constant. In a nonlinear network in a multipath approach, incorporation of constrained optimization problem in packet distribution ratios to each and every neighbor nodes toward cluster head facilitates to keep the power dissipation rate of the participated nodes to be equal. Our analysis shows, for a nonlinear network, this optimization strategy can be effectively employed for a 1D nonlinear network with maximum three parallel paths with maximum six nodes. The performance of our proposed method has been analyzed with respect to conventional load balancing protocols, e.g., load-balanced routing (LBR) protocol, energy efficient sleep awake aware (EESAA) protocol, respectively. We have also investigated the performance of our proposed scheme utilizing a real-life dataset with respect to four popular low-power, low-cost commercial radio devices, e.g., CC1100, CC2420, Maxim 2820 and RFM TR 1000, respectively, widely used in WSN IoT applications.KeywordsWireless sensor networkEnergy-efficient routingLoad-balanced in multipath routing

The MANET (Mobile Ad hoc Network) is a wireless network with the features of dynamic topology, multi-hop, self-configuring, and distributed-routing. How to provide a stable routing is one of the recent most challenges for mobile ad hoc networks. This paper proposes a novel stability adaptive routing protocol (NSAR) for low mobility wireless multi-hop networks, which with low complexity and high accuracy. Instead of using signal strength or route lifetime as link stability metrics, the basic idea of this paper is that nodes gather statistics of delivery ratio for a period of time to indicate different link status. Then nodes can make adaptive adjustments according to the link status to choose a more stable route. This study conduct experiments to compare NSAR with classical routing protocols (such as AODV, DSR) and obtain their performance parameters in our laboratory designed test platform. The test results show that NSAR performs better in improving the stability and effectiveness of the network.

Wireless internet has become popular in recent years due to the tremendous growth in the number of mobile computing devices and high demand for continuous network connectivity regardless of physical locations. In this paper, we investigate the effects of routing protocols on the performance of Transmission Control Protocol (TCP) variants in multi-hop wireless networks. Through simulations we study the effects of Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR), Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) routing protocols on TCP Tahoe, TCP Reno, TCP Newreno, TCP with Selective Acknowledgment (SACK) option and TCP Vegas. The simulations are carried out for static as well as mobile nodes. The performance metric used is throughput. Another metric, expected throughput is used for the comparison of throughput when nodes are mobile.

In this paper we propose and develop a new simple routing protocol for wireless mesh network. This protocol, called multipath parallel routing protocol MPRP, is a reactive, distance vector routing protocol. It uses a simple mechanism to build multiple paths for a couple of nodes source and destination. These multiple paths are used in a parallel fashion. Multiple paths are not necessarily disjoint but they are loop-free. Moreover, we implemented the coordinated distributed scheme (CDS) of the Std. IEEE 802.16. We used a well-known simulation tool, NS2 in order to compare performance of the multipath protocol and the ad hoc on demand distance vector routing protocol (AODV), both running over the MAC layer in which is incorporated the CDS scheme. Simulation results show as multiple paths used in a parallel fashion permit better results in terms of throughput and delay to be obtained.

In hierarchical networks, nodes are separated to play different roles such as CHs and cluster members. Each CH collects data from the cluster members within its cluster, aggregates the data and then transmits the data to the sink. Each algorithm that is used for packet routing in quality of service (QoS) based applications should be able to establish a tradeoffs between end to end delay parameter and energy consumption. Therefore, enabling QoS applications in sensor networks requires energy and QoS awareness in different layers of the protocol stack. We propose an Energy efficient and QoS based Multi-path Hierarchical Routing Protocol in wireless sensor networks namely EQMH. In this protocol, we try to satisfy the QoS requirements with the minimum energy via hierarchical methods. Our routing protocol performs cluster heads election and routes discovery using multiple criteria such as residual energy, remaining buffer size, signal-to-noise ratio and distance to sink. EQMH maximizes the network lifetime through data transmission across multiple paths as load balancing that causes energy consume uniformly throughout the network. Furthermore employs a queuing model to handle both real-time and non-real-time traffic. Simulation results show that our proposed protocol is more efficient than EAP and MCMP protocols in providing QoS requirements and minimizing energy consumption.

Sensor networks are one of the fastest growing areas in broad wireless ad hoc networking field. A sensor node, typically, contains signal-processing circuits, micro-controllers and a wireless transmitter/receiver antenna. Energy saving is one of the critical issue for sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Routing schemes are used to transfer data collected by sensor nodes to base stations. In the literature many routing protocols for wireless sensor networks are suggested. In this work, four routing protocols for wireless sensor networks viz. flooding, Gossiping, GBR and LEACH have been simulated using TinyOS and their power consumption is studied using PowerTOSSIM. A realization of these protocols has been carried out using Mica2 Motes.

Hybrid <span>wireless networks (HWNs) are resulted from the integration of a mobile Ad hoc networks (MANET) and an infrastructure wireless networks. These networks have received increasing interest from researchers for their superior performance and reliability. Packet routing protocols in hybrid wireless networks are important to increase the capacity and scalability of these networks, therefore, several routing protocols have been proposed. Routing protocols in HWNs are designed and implemented from combining <span>the cellular transmission mode with the Ad hoc transmission mode. To route a message to the intended recipient of the sender, hybrid wireless networks use multi-hop technology. However, the source node needs relay nodes, which may be either adjacent nodes or base stations depending on set of parameters like bandwidth, load balancing, or the nearest node. This paper explores routing protocols for hybrid wireless networks and the techniques to enhance the security, performance, and capacity of these routing protocols.</span></span>

In this paper, we design grid-based routing (GBR) protocols for wireless multi-hop networks. The objective is to effectively reduce the protocol overhead for network management with the assistance of position information. GBR divides networks into equally spaced grids. To perform a routing operation, GBR requires as few grids as possible to participate while preserving network connectivity. We design different protocols for different environments and deduce analytical results to observe the high performance of the designed protocols.

Aimed at energy conservation and QoS requirement, a novel node-disjoint multipath routing protocol for wireless multimedia sensor networks is proposed in this paper. Source routing approach is adopted to generate multipath. By overall considering several attributes, the model of path efficiency is defined through fuzzy multiple criteria decision making approach, which is based on trapezoidal fuzzy AHP and hierarchical fuzzy integral. Two parameters - path ID and path efficiency - are introduced into the forwarding process of intermediate node, so that only the appropriate RREQs are forwarded, the overhead is reduced accordingly. The simulation results indicates that, compared with SMR and TinyONDMR protocol, the overhead of route establishment of the new protocol is lower and energy distribution of node of path is better. Furthermore, the new protocol causes higher communications energy efficiency under the condition that no propagation delay is increased.