Reduce Routing Overhead Research Articles

An Efficient Local Repair‐Based Multi‐Constrained Routing for Congestion Control in Wireless Mesh Networks

Multi‐constrained routing is a key driver to support quality‐of‐service (QoS) for real‐time multimedia applications in wireless mesh networks (WMNs). Due to the difficulty of applying strict admission control into a public WMN, it is inevitable to accommodate multiple application flows with different QoS requirements exceeding the capacity of a certain link shared by multiple flows. However, existing multi‐constrained routing protocols under such an environment find the QoS degradation based on end‐to‐end path quality probing and trigger flooding‐based route discovery from a scratch for resolving the QoS degradation, which incurs a longer recovery time and much routing overhead. In this paper, we propose a novel multi‐constrained routing protocol for WMNs that finds problematic links that may affect QoS degradation to end‐to‐end paths and replaces them with a detour path using a local repair principle. We model congestion threshold estimation for finding problematic links and design algorithms for quickly finding detour paths and selecting an optimal path by minimizing the negative effect on existing flows nearby the detour path. Simulation results show that the proposed routing protocol achieves up to 19.6% more goodput of live video streaming applications with up to 33% reduced routing overhead compared with an existing work.

Lightweight On-demand Ad hoc Distance-vector Routing - Next Generation (LOADng): Protocol, extension, and applicability

This paper studies the routing protocol “Lightweight On-demand Ad hoc Distance-vector Routing Protocol – Next Generation (LOADng)”, designed to enable efficient, scalable and secure routing in low power and lossy networks. As a reactive protocol, it does not maintain a routing table for all destinations in the network, but initiates a route discovery to a destination only when there is data to be sent to that destination to reduce routing overhead and memory consumption. Designed with a modular approach, LOADng can be extended with additional components for adapting the protocol to different topologies, traffic, and data-link layer characteristics. This paper studies several such additional components for extending LOADng: support for smart route requests and expanding ring search, an extension permitting maintaining collection trees, a fast rerouting extension. All those extensions are examined from the aspects of specification, interoperability with other mechanisms, security vulnerabilities, performance and applicability. A general framework is also proposed to secure the routing protocol.

New Modified AODV for MANET

Mobile Communication is a wireless connection between two nodes which is having limited bandwidth and high rate of data disconnnection. So there is a requirement of new MANET routing protocol having low rate message overhead. Hence it is necessary to enhancement the performance of MANET. The reduction of routing overhead decreases the usage of bandwidth of the network. The increase of bandwidth will increase the throught and decrease the latency of the nodes of the network. This Paper proposes the new Routing Protocol which will increase the throughput,reliability and decrease the latency of the network. 1. Introduction:The mobile adhoc network[1] does not have any fixed infrastructure and base station of the network and thats why the name is used.There are many applications for ad-hoc networks like conferencing, emergency services, personal area networks, embedded computing, and sensor dust. A MANET is a network that allows direct communication of two nodes, when radio propagation conditions exist between two nodes. If there is no direct connection between the source and the sink nodes, multi-hop routing is used. In multi-hop routing, a packet is forwarded from one node to another, until it reaches the destination. A routing protocol is necessary in adhoc networks; this routing protocol has to adapt quickly to the frequent changes in the adhoc network topology. Ad-hoc routing protocols are classified into three categories. The first category is Table-driven (Proactive) routing protocols such as DSDV [2], CGSR [3], GSR [4], FSR [5], and OLSR [6]. The second category is on-demand (Reactive) routing protocols such as AODV [7], DSR [8], ABR [9], SSA [10], and TORA [11]. The third category is Hybrid (Reactive and proactive) routing protocols such as ZRP [12] and ZHLS [13].

Reducing routing overhead with neighbor knowledge probabilistic approach

Reducing routing overhead with neighbor knowledge probabilistic approach

“Review on Reducing Routing Overhead and Energy Drainage in MANET”

“Review on Reducing Routing Overhead and Energy Drainage in MANET”

P-AODV: A Priority Based Route Maintenance Process in Mobile Ad Hoc Networks

We present a route maintenance mechanism, P-AODV, which repairs a route by selecting a neighbor on the basis of the traffic being handled by it. A new parameter, priority, is introduced to segregate the nodes into high priority and low priority categories. The availability of a high priority neighbor is required for the success of P-AODV. A highly dense network--our focus--increases the probability of such neighbors in the vicinity of upstream nodes. The priorities are advertised through Hello Packets and stored in Neighbor Tables. Alternate paths are made available at neighbor nodes by overhearing the traffic. In dense networks, avoiding reroute discoveries by selecting neighbors averts the overhead caused by control packets, inherent congestion and delay. Further, we have introduced a Controlled Re-Route Discovery in P-AODV to reduce the control packets transmission. P-AODV substantially improves the overall performance of the network. In this paper we have implemented our algorithms in AODV code of network simulator, ns 2.34, and the results were compared with the existing route maintenance methods of AODV, and RLLR. Chain topologies, running constant bit rate, are created with some neighbors either common to the chains or standalones. The simulation results show significant improvement in routing overhead reduction, packet delivery ratio, and considerable improvement in throughput and end-to-end delay (reduction), comparing P-AODV and AODV.

Performance analysis of on-demand routing protocol for MANET using EA3ACK algorithm

Mobile ad-hoc networks (MANETs) do not have a fixed infrastructure. Every single node in the MANET works as both receiver and transmitter. Each node directly communicates with the other when they are both within their communication range. All nodes work as routers and take path in discovery and maintenance of routes to other nodes in the network. In this paper, a new intrusion detection system, enhanced adaptive 3 acknowledgement (EA3ACK), using EAACK with hybrid cryptography is (MARS4) specially designed for MANET. In the hybrid cryptography a two key method namely MARS4 which is a combination of RSA and MAJE4 is employed to reduce the routing overhead. Network simulator (NS2) is used to implement and test the proposed system. The proposed hybrid cryptography provides secured transmission, further it reduces routing overhead, improves packet delivery ratio and throughput.

Traffic-aware stateless multipath routing for fault-tolerance in IEEE 802.15.4 wireless mesh networks

Single-path routing is widely used in wireless networks due to low resource consumption. However, it is vulnerable to link failure because such a failure may adversely affect an entire path. To overcome this, multipath routing has been proposed providing fault-tolerance. In this paper, we propose a novel multipath routing protocol called traffic-aware stateless multipath routing (TSMR) based on an overlaid tree topology comprising two topologies, namely, bounded degree tree (BDT) and root-oriented directional tree (RODT). BDT is strong on reducing routing overhead, and RODT is resilient against lossy links. By synergistically overlaying them, TSMR dynamically selects the local optimal path according to the given traffic flow and the failure on the primary path. In particular, TSMR enables stateless and low overhead routing despite multipath routing by keeping only one-hop neighbors to maintain multiple paths. To evaluate TSMR, we conducted simulations with a shadowing model reflecting lossy links, and compared with single and multipath routing protocols, such as ZTR, STR, AODV, and RPL. The simulation results show that the overall performance of TSMR surpasses that of others for packet delivery ratio, end-to-end delay, control overhead, memory consumption, and power consumption regardless of network size, number of sessions, and traffic flow.

Crowd cloud routing protocol based on opportunistic computing for wireless sensor networks

We proposed a crowd cloud routing protocol based on opportunistic computing to improve the data transmission efficiency, reliability, and reduce routing overhead in wireless sensor networks. Based on the analysis of the demand of big data processing in wireless sensor network, the data analysis and processing platform for wireless sensor network are designed based on the combination with the cloud computing. The cloud platform includes the main nodes, the nodes, and the core nodes. There are the engine and the drive between the wireless sensor network and the cloud server. Secondly, aiming at the problem of data transmission in the cloud platform, we design an opportunistic computing model which is suitable for wireless sensor networks to minimize the weight of routing management and network overhead. Then, we design an opportunistic calculation model to guarantee the data transmission scheme of the cloud platform. Finally, by eliminating the factors that may cause the link instability, the crowd cloud routing protocol is proposed. The experimental results show that the proposed crowd cloud routing protocol has the functions of real-time and reliability and reduces the cost of routing request.

Throughput and delay analysis of directional‐location aided routing protocol for vehicular ad hoc networks

SummaryVehicular ad hoc networks is an integral component of intelligent transportation systems and it is an important requisite for smarter cities. Network formation and deformation among the vehicles are very frequent because of the variation in speed. Furthermore, for safety applications, messages should not face any kind of delay or collision. Therefore, establishing communication between the vehicles becomes even more challenging. Position‐based routing protocols work productively in vehicular ad hoc networks. Only finding an efficient routing protocol does not solve our purport. We need to carefully examine the effect of media access control layer parameters additionally. In the event of collisions, a large number of nodes would be re‐transmitting rather than sending fresh packets. A node busy in sending the retransmitted packet is called a backlog node. With an increase in the number of collisions, number of backlog nodes also increases, which affects the delay and throughput. In this article, we present the mathematical modeling of delay and throughput with IEEE 802.11 distributed coordination function (at media access control layer) for directional‐location aided routing (D‐LAR) position based routing protocol. For performance evaluation, simulation has been done in realistic environment created with SUMO (traffic simulator) and NS‐2 (network simulator). Simulation results show the comparison between D‐LAR and location aided routing (LAR) on various metrics in terms of delay, packet delivery ratio, routing overhead, throughput, and collision probability. To validate the mathematical model, analytical results has been compared with simulation results. The results confirm that performance of D‐LAR is better than LAR in terms of increasing the throughput and reduction in routing overhead and delay.

A cross-layer framework for joint routing and rate adaptation in infrastructure Wireless Mesh Networks

In this paper, we propose a cross-layer framework for joint routing and rate adaptation in multi-rate, Multi-Channel, Multi-Radio (MCMR) infrastructure Wireless Mesh Networks (WMNs). These networks use MCMR capabilities of mesh routers to achieve high performance. However, the MCMR nodes introduce interference in the multi-hop mesh networks and can degrade QoS. Thus, the design of routing metrics to improve the QoS has become an important research issue. Furthermore, as the routing metric and rate adaptation decisions are closely related, the joint approach is needed to improve the performance of the network. Towards this, we analytically derive our routing metric using IEEE 802.11 Distributed Coordination Function (DCF) basic access mechanism. Using this model, we propose Passive Interference and Delay Aware (P-IDA) routing metric which estimates the delay and interference by exploiting cross-layer information. We extend the work by performing joint routing and rate adaptation. The simulation results using NS2 reveal that proposed framework improves throughput and delay compared to existing approaches with reduced routing overhead.

Symptotics: a framework for estimating the scalability of real-world wireless networks

We present a framework for non-asymptotic analysis of real-world multi-hop wireless networks that captures protocol overhead, congestion bottlenecks, traffic heterogeneity and other real-world concerns. The framework introduces the concept of symptoticscalability to determine the number of nodes to which a network scales, and a metric called change impact value for comparing the impact of underlying system parameters on network scalability. A key idea is to divide analysis into generic and specific parts connected via a signature--a set of governing parameters of a network scenario--such that analyzing a new network scenario reduces mainly to identifying its signature. Using this framework, we present the first closed-form symptotic scalability expressions for line, grid, clique, randomized grid and mobile topologies. We model both TDMA and 802.11, as well as unicast and broadcast traffic. We compare the analysis with discrete event simulations and show that the model provides sufficiently accurate estimates of scalability. We show how our impact analysis methodology can be used to progressively tune network features to meet a scaling requirement. We uncover several new insights, for instance, on the limited impact of reducing routing overhead, the differential nature of flooding traffic, and the effect real-world mobility on scalability. Our work is applicable to the design and deployment of real-world multi-hop wireless networks including community mesh networks, military networks, disaster relief networks and sensor networks.

Communication Framework for Jointly Addressing Issues of Routing Overhead and Energy Drainage in MANET

The advancement into smart mobile devices has accelerated the adoption of various pervasive computing based ubiquitous applications, where Mobile Adhoc Network (MANET) has extended its usability from hard core military applications to civil society applications. The success for routing requires a robust computational mechanism of routing based on the collaborative framework of energy (i.e. battery power), signal strength and zonal routings. The paper presents a framework of novel routing technique in order to jointly address the problem pertaining to routing overhead and energy drainage among the mobile nodes. Different from conventional simulation mechanism, the paper presents a communication district with inclusion of auxiliary nodes for minimizing the overhead during the routing process. The outcome of the proposed study shows significant reduction in routing overhead along with energy efficiency as compared to existing AODV and DSDV protocols.

An IP Format Based Algorithm for ZigBee Routing Protocol Optimization

Learning from the conventional practice of network IP address format, this paper proposed an IP-format-based algorithm for ZigBee energy-balanced routing protocol optimization. The algorithm combines node’s cluster address and node’s network short address into a new address and divides the address’s field as IP-format. So that the address will contain information of the network’s topology and provide decision base for a routing algorithm to optimize the original algorithm selection criteria. Meanwhile, in order to improve the ratio of valid data packets and reduce routing overhead, the new algorithm controls the general direction and the number of hops of the RREQ packets to reduce unwarranted data packet transmission. Finally, the simulation carried out on NS platform demonstrates the algorithm’s superiority on network’s delay jitter, overhead and residual energy.

Light-weight trust-enhanced on-demand multi-path routing in mobile ad hoc networks

Mobile ad hoc networks (MANETs) are originally designed for a cooperative environment, which are vulnerable to a wide variety of attacks due to their intrinsic characteristics. Trust can be introduced to address this security issue at some level. In this paper, we focus on the concept of trust and abstract a decentralized trust inference model, where the trust an entity has for a neighbor forms the basic building block of this model. Basing on the interest entity׳s historical behaviors, multi-dimensional trust attributes are incorporated to reflect trust relationship׳s complexity in various angles. The weight vector of attributes is calculated by fuzzy AHP scheme based on entropy weight measure. The trust inference framework provides the considerable security with an additional small overhead, which can be incorporated into any routing protocol. In this paper, the standard Ad hoc On-demand Multi-path Distance Vector protocol (AOMDV) is extended as the base routing protocol to evaluate this model. The proposed light-weight trust-enhanced routing protocol (TeAOMDV) can provide a feasible approach to choose an optimal two-way trusted route without containing the untrust worthy entities instead of the shortest route, thus mitigate the impairment effects from such entities. It is light-weight in the sense that the trust framework uses only passive and local monitoring information to evaluate the behaviors of an interest entity which is translated to an estimate of the trust, consumes limited computational resource. Moreover, the new proposed data-driven route maintenance mechanism reduces routing overhead and route discovery frequency. The simulations show that the proposed routing scheme behaves better in attack resistance (i.e., gray-hole attack and black-hole attack), and makes an improvement on the packets delivery ratio, routing packets overhead, route discovery frequency and malicious node detection. Finally, as an extension of the trust model, by utilizing the trust assessment data sequence, we propose an improved SCGM(1,1)-Markov chain prediction method based on the system cloud gray model and Markov stochastic chain theory to forecast entity׳s trust level for future decision making.

멀티 싱크 기반 IoT 네트워크에서 불필요한 경로 업데이트 문제와 두 가지 해결 기법

Recently, as interest in IoT (Internet of Things) increase, research and standardization of a new protocol which reflects the characteristics of IoT has progressed. Among them, RPL(IPv6 for Low-Power Lossy Network) is a standardized routing protocol for IoT. RPL utilizes DIO (DODAG Information Object) messages which is flooded from the sink node to the whole network for path establish and maintenance. However, in large scale networks, not only a long time is required to propagate the DIO message to the whole networks but also a bottleneck effect around the sink node is occurred. Multi-sink based approaches which take advantage of reducing routing overhead and bottleneck effect are widely used to solve these problems. In this paper, we define 'unnecessary path update problems' that may arise when applying the RPL protocol to the multi sink based IoT networks and propose two methods namely Routing Metric based Path Update Decision method and Immediate Successor based Path Update Decision method for selective routing update.

Reduction of Routing Overhead in Wireless Sensor Network with Modified AODV-TP (Constant Packet Size)

Reduction of Routing Overhead in Wireless Sensor Network with Modified AODV-TP (Constant Packet Size)

Power Management and Reducing Routing Overhead and Delay in Wireless Sensor Network with Modified Ad-hoc on demand Distance Vector Routing Protocol using Threshold Power

management is necessary in Wireless Sensor Network because the nodes are very small in size having a small battery and that too of limited life. The routing algorithms for WSN should satisfy the features of energy consumption optimization and extension of network lifetime. We choose to modify AODV (Ad hoc On Demand Distance Vector) routing protocol, analyze this algorithm named as modified AODV- TP (Threshold Power) and is highlighted in detail. The theme is that only those nodes are chosen as neighbors of nodes during RREQ (Route Request) phase that are directed towards destination. Also, threshold is set for all the nodes. If the power of the node is less than threshold, it will not acknowledge the Route Reply (RREP) packet. The alternate route with second lowest minimum distance will be selected to forward the packet. The behavioral analysis of the modified protocol is compared to AODV-TP and from the simulation this protocol turns out to be better in terms of power conservation. Keywordssensor network; power management; nodes; AODV

Diagnosis and Layout Aware (DLA) Scan Chain Stitching

Without appropriate stitching of scan chains, even with good diagnosis algorithm and diagnostic pattern generation, the chain diagnostic resolution may still be bad. In this paper, we propose a novel pattern-independent diagnosis and layout aware (DLA) scan chain stitching method: 1) the resolution is improved by increasing and properly distributing the sensitive scan cells, which can capture useful diagnostic information under both single- and multiple-fault situations; and 2) the scan cell layout placement is taken into account to reduce routing overhead and hence preserve the chip performance. Experiments using two different techniques to diagnose ISCAS'89/ITC'99 benchmark circuits with/without embedded scan compaction show the effectiveness of the proposed method in improving the diagnostic resolution. Impacts on chip performance, embedded scan compaction, transition fault coverage, and test power dissipation are negligible. The proposed method is also successfully applied to an industry circuit manufactured with 20-nm technology. The silicon results show $7\times$ average resolution improvement comparing to without using the DLA scan chain stitching.

Bee-Sensor-C: An Energy-Efficient and Scalable Multipath Routing Protocol for Wireless Sensor Networks

A wireless sensor network (WSN) is composed of a large collection of sensor nodes with limited resources in terms of battery supplied energy, processing capability, and storage. Therefore, the design of an energy-efficient and scalable routing protocol is a crucial concern for WSN applications. In this paper, we propose Bee-Sensor-C, an energy-aware and scalable multipath routing protocol based on dynamic cluster and foraging behavior of a bee swarm. Bee-Sensor-C is an evolution from BeeSensor which is a bee-inspired routing protocol for WSNs. First of all, through introducing a dynamic clustering scheme, Bee-Sensor-C offers parallel data transmissions close to the event area. This evolution reduces routing overhead and improves the scalability. Moreover, Bee-Sensor-C adopts an enhanced multipath construction method in order to achieve the balance of the network energy consumption. Besides, Bee-Sensor-C can well support the multicluster scenario. Through simulations, the network performance is evaluated and the results demonstrate that Bee-Sensor-C outperforms the existing protocols in terms of energy efficiency, energy consumption balance, packet delivery rate, and scalability.