Improving Energy Efficiency in MANETs by Multi-Path Routing

Some multi-path routing algorithm in MANET, simultaneously send information to the destination through several directions to reduce end-to-end delay. In all these algorithms, the sent traffic through a path affects the adjacent path and unintentionally increases the delay due to the use of adjacent paths. Because, there are repetitive competitions among neighboring nodes, in order to obtain the joint channel in adjacent paths. The represented algorithm in this study tries to discover the distinct paths between source and destination nodes with using Omni directional antennas, to send information through these simultaneously. For this purpose, the number of active neighbors is counted in each direction with using a strategy. These criterions are effectively used to select routes. Proposed algorithm is based on AODV routing algorithm, and in the end it is compared with AOMDV, AODVM, and IZM-DSR algorithms which are multi-path routing algorithms based on AODV and DSR. Simulation results show that using the proposed algorithm creates a significant improvement in energy efficiency and reducing end-to-end delay

Intra-Domain Pathlet Routing

Internal routing inside an ISP network is the foundation for lots of services that generate revenue from the ISP's customers. A fine-grained control of paths taken by network traffic once it enters the ISP's network is therefore a crucial means to achieve a top-quality offer and, equally important, to enforce SLAs. Many widespread network technologies and approaches (most notably, MPLS) offer limited (e.g., with RSVP-TE), tricky (e.g., with OSPF metrics), or no control on internal routing paths. On the other hand, recent advances in the research community are a good starting point to address this shortcoming, but miss elements that would enable their applicability in an ISP's network. We extend pathlet routing by introducing a new control plane for internal routing that has the following qualities: it is designed to operate in the internal network of an ISP; it enables fine-grained management of network paths with suitable configuration primitives; it is scalable because routing changes are only propagated to the network portion that is affected by the changes; it supports independent configuration of specific network portions without the need to know the configuration of the whole network; it is robust thanks to the adoption of multipath routing; it supports the enforcement of QoS levels; it is independent of the specific data plane used in the ISP's network; it can be incrementally deployed and it can nicely coexist with other control planes. Besides formally introducing the algorithms and messages of our control plane, we propose an experimental validation in the simulation framework OMNeT++ that we use to assess the effectiveness and scalability of our approach.Comment: 13 figures, 1 tabl

On-demand Construction of Non-interfering Multiple Paths in Wireless Sensor Networks

In this paper we present a routing scheme for on-demand construction of multiple non-interfering paths in wireless sensor networks. One usage of this multipath scheme is to provide a source the ability to increase the likelihood that its data reaches the sink by sending a copy of a packet on more than one path. The routing scheme is based on the assumption that the sensor nodes are aware of their geographic position

Source-specific routing

Source-specific routing (not to be confused with source routing) is a routing technique where routing decisions depend on both the source and the destination address of a packet. Source-specific routing solves some difficult problems related to multihoming, notably in edge networks, and is therefore a useful addition to the multihoming toolbox. In this paper, we describe the semantics of source-specific packet forwarding, and describe the design and implementation of a source-specific extension to the Babel routing protocol as well as its implementation - to our knowledge, the first complete implementation of a source-specific dynamic routing protocol, including a disambiguation algorithm that makes our implementation work over widely available networking APIs. We further discuss interoperability between ordinary next-hop and source-specific dynamic routing protocols. Our implementation has seen a moderate amount of deployment, notably as a testbed for the IETF Homenet working group

Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network

A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes a novel hybrid multipath routing algorithm with an efficient clustering technique. A node is selected as cluster head if it has high surplus energy, better transmission range and least mobility. The Energy Aware (EA) selection mechanism and the Maximal Nodal Surplus Energy estimation technique incorporated in this algorithm improves the energy performance during routing. Simulation results can show that the proposed clustering and routing algorithm can scale well in dynamic and energy deficient mobile sensor network.Comment: 9 pages, 4 figure

Proactive Highly Ambulatory Sensor Routing (PHASeR) protocol for mobile wireless sensor networks

This paper presents a novel multihop routing protocol for mobile wireless sensor networks called PHASeR (Proactive Highly Ambulatory Sensor Routing). The proposed protocol uses a simple hop-count metric to enable the dynamic and robust routing of data towards the sink in mobile environments. It is motivated by the application of radiation mapping by unmanned vehicles, which requires the reliable and timely delivery of regular measurements to the sink. PHASeR maintains a gradient metric in mobile environments by using a global TDMA MAC layer. It also uses the technique of blind forwarding to pass messages through the network in a multipath manner. PHASeR is analysed mathematically based on packet delivery ratio, average packet delay, throughput and overhead. It is then simulated with varying mobility, scalability and traffic loads. The protocol gives good results over all measures, which suggests that it may also be suitable for a wider array of emerging applications