Reduce Control Overhead Research Articles

Enhancement of DSR and AODV Protocols Using Link Availability Prediction

Routing in wireless ad hoc networks is highly affected by its dynamic topology and power constrained mobile devices. Several routing protocols like proactive, reactive, hybrid, geographical, etc. have been proposed in the literature. Ineffectiveness of any routing protocol in such networks is caused due to the ignorance of link availability during the routing phase. In this paper, we proposed two link availability prediction techniques which are performed during routing of control packets. The first technique referred as zone based estimation, divides the transmission range area of every node into three zones namely inner, middle and outer, based on the received signal strength. Here, nodes lying in the inner and outer zone are prohibited from the control packet transmission as they have extremely high and low received signal strength, respectively. Nodes in the middle region are only allowed for the control packet flow within the locality. The second technique is an improvement over zone based estimation, where nodes in the outer zone are considered for route selection and is referred as segment based estimation. It calculates node’s link availability ratio for each adjacent links based on the current available position of the neighbor, its adjoining segment and sector where the neighbor is present within the transmission region of the node. This information assist in the control packet transfer within the outer zone. Simulation has been performed over DSR and AODV protocols in terms of control overhead bandwidth, number of control packets, route length and number of route errors generated in the network. The results show that the knowledge of link status during routing phase helps to find more stable routes with reduced control overhead and hence increases the overall network performance.

Optimising loops in dynamic dataflow

Dynamic dataflow allows simultaneous execution of instructions in different iterations of a loop, boosting parallelism exploitation. In this model, operands are tagged with their associated instance number, which is incremented as they go through the loop. Instruction execution is triggered when all input operands with the same tag become available. However, this traditional tagging mechanism often requires the generation of several control instructions to manipulate tags and guarantee the correct match. To address this problem, this work presents three dataflow loop optimisation techniques. The stack-tagged dataflow is a tagging mechanism that uses stacks of tags to reduce control overheads in dataflow. On the other hand, as nested loops may increase the overhead of stack-tag comparison, tag resetting can be used to set the tag to zero whenever it is safe, allowing a one-level reduction at the stack depth. Finally, loop skipping allows to further avoid stack comparison overhead in loops, when the number of iterations can be determined by the compiler. Experimental results show the overhead, drawbacks and benefits for the three optimisations presented. Moreover, the results suggested that a hybrid compiling approach can be used to get the best performance of each technique.

Cross-Layer-Based Adaptive Traffic Control Protocol for Bluetooth Wireless Networks

Bluetooth technology is particularly designed for a wireless personal area network that is low cost and less energy consuming. Efficient transmission between different Bluetooth nodes depends on network formation. An inefficient Bluetooth topology may create a bottleneck and a delay in the network when data is routed. To overcome the congestion problem of Bluetooth networks, a Cross-layer-based Adaptive Traffic Control (CATC) protocol is proposed in this paper. The proposed protocol is working on backup device utilization and network restructuring. The proposed CATC is divided into two parts; the first part is based on intra-piconet traffic control, while the second part is based on inter-piconet traffic control. The proposed CATC protocol controls the traffic load on the master node by network restructuring and the traffic load of the bridge node by activating a Fall-Back Bridge (FBB). During the piconet restructuring, the CATC performs the Piconet Formation within Piconet (PFP) and Scatternet Formation within Piconet (SFP). The PFP reconstructs a new piconet in the same piconet for the devices which are directly within the radio range of each other. The SFP reconstructs the scatternet within the same piconet if the nodes are not within the radio range. Simulation results are proof that the proposed CATC improves the overall performance and reduces control overhead in a Bluetooth network.

Network Intelligence Based on Network State Information for Connected Vehicles Utilizing Fog Computing

This paper proposes a method to take advantage of fog computing and SDN in the connected vehicle environment, where communication channels are unstable and the topology changes frequently. A controller knows the current state of the network by maintaining the most recent network topology. Of all the information collected by the controller in the mobile environment, node mobility information is particularly important. Thus, we divide nodes into three classes according to their mobility types and use their related attributes to efficiently manage the mobile connections. Our approach utilizes mobility information to reduce control message overhead by adjusting the period of beacon messages and to support efficient failure recovery. One is to recover the connection failures using only mobility information, and the other is to suggest a real-time scheduling algorithm to recover the services for the vehicles that lost connection in the case of a fog server failure. A real-time scheduling method is first described and then evaluated. The results show that our scheme is effective in the connected vehicle environment. We then demonstrate the reduction of control overhead and the connection recovery by using a network simulator. The simulation results show that control message overhead and failure recovery time are decreased by approximately 55% and 5%, respectively.

Performance Improvement of Cluster-Based Routing Protocol in VANET

Vehicular ad-hoc NETworks (VANETs) have received considerable attention in recent years, due to its unique characteristics, which are different from mobile ad-hoc NETworks, such as rapid topology change, frequent link failure, and high vehicle mobility. The main drawback of VANETs network is the network instability, which yields to reduce the network efficiency. In this paper, we propose three algorithms: cluster-based life-time routing (CBLTR) protocol, Intersection dynamic VANET routing (IDVR) protocol, and control overhead reduction algorithm (CORA). The CBLTR protocol aims to increase the route stability and average throughput in a bidirectional segment scenario. The cluster heads (CHs) are selected based on maximum lifetime among all vehicles that are located within each cluster. The IDVR protocol aims to increase the route stability and average throughput, and to reduce end-to-end delay in a grid topology. The elected intersection CH receives a set of candidate shortest routes (SCSR) closed to the desired destination from the software defined network. The IDVR protocol selects the optimal route based on its current location, destination location, and the maximum of the minimum average throughput of SCSR. Finally, the CORA algorithm aims to reduce the control overhead messages in the clusters by developing a new mechanism to calculate the optimal numbers of the control overhead messages between the cluster members and the CH. We used SUMO traffic generator simulators and MATLAB to evaluate the performance of our proposed protocols. These protocols significantly outperform many protocols mentioned in the literature, in terms of many parameters.

Fog Computing을 적용한 Connected Vehicle 환경에서 상태 정보에 기반한 네트워크 지능화

This paper proposes a method to take advantage of fog computing and SDN in the connected vehicle environment, where communication channels are unstable and the topology changes frequently. A controller knows the current state of the network by maintaining the most recent network topology. Of all the information collected by the controller in the mobile environment, node mobility information is particularly important. Thus, we divide nodes into three classes according to their mobility types and use their related attributes to efficiently manage the mobile connections. Our approach utilizes mobility information to reduce control message overhead by adjusting the period of beacon messages and to support efficient failure recovery. One is to recover the connection failures using only mobility information, and the other is to suggest a real-time scheduling algorithm to recover the services for the vehicles that lost connection in the case of a fog server failure. A real-time scheduling method is first described and then evaluated. The results show that our scheme is effective in the connected vehicle environment. We then demonstrate the reduction of control overhead and the connection recovery by using a network simulator. The simulation results show that control message overhead and failure recovery time are decreased by approximately 55% and 5%, respectively.

SMAC: A Soft MAC to Reduce Control Overhead and Latency in CDMA-Based AMI Networks

The use of state-of-the-art 3G cellular CDMA technologies in a utility owned AMI network results in a large amount of control traffic relative to data traffic, increases the average packet delay and hence are not an appropriate choice for smart grid distribution applications. Like the CDG, we consider a utility owned cellular like CDMA network for smart grid distribution applications and classify the distribution smart grid data as scheduled data and random data. Also, we propose SMAC protocol, which changes its mode of operation based on the type of the data being collected to reduce the data collection latency and control overhead when compared to 3G cellular CDMA2000 MAC. The reduction in the data collection latency and control overhead aids in increasing the number of smart meters served by a base station within the periodic data collection interval, which further reduces the number of base stations needed by a utility or reduces the bandwidth needed to collect data from all the smart meters. The reduction in the number of base stations and/or the reduction in the data transmission bandwidth reduces the CAPital EXpenditure (CAPEX) and OPerational EXpenditure (OPEX) of the AMI network. The proposed SMAC protocol is analyzed using markov chain, analytical expressions for average throughput and average packet delay are derived, and simulation results are also provided to verify the analysis.

Mobile Sink-based Self Adaptive and Energy Efficient Proactive Data Collection Protocol for Wireless Sensor Network

In Wireless Sensor Networks (WSNs), trailing data sinks’ mobility for data gathering has drawn popular in recent years. To achieve optimized network performance, or target at collecting a small portion of sensed data in the network recent researches will either focus on planning a mobile sink’s moving trajectory in advance. In many application scenarios, however, a mobile sink cannot move freely in the deployed area. In this paper they propose energy consuming proactive data reporting protocols, SinkTrail for mobile sink-based data collection to avoid constant sink location update traffics when a sink’s future locations cannot be scheduled in advance. SinkTrail differs their approach from previous ones: 1) allow sufficient flexibility in the movement of mobile sinks and also predict various terrestrial changes. 2) SinkTrail doesn’t require GPS devices or predefined anchors (landmarks); it establishes a logical coordinate system for routing and forwarding data packets, making it suitable for various application scenarios. They systematically observed the impact of several design factors in the proposed algorithms. Finally conclude that both theoretical analysis and simulation results demonstrate that the proposed algorithms reduce control overheads and good performance in finding shorter routing paths.

On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography

In this proposed method a new routing protocol is SelfAdaptive on demand Geographic routing protocols. One of the distinctive features has provide reliable and energy efficient feature to existing schemes in order to increase the lifetime of the network and reduces control overhead compute up to the proactive schemes which provides reliable routing at the same time with a lesser amount of energy utilization. We are embedding optimization (Marko chain algorithm) on the delivery probability performance in a two-hop relay algorithm with erasure coding. The erasure coding used for the message that is erasure coded into multiple frames at source node. Also we developed finite-state Markov chain model to characterize the complicated message delivery process in the MANETs. Based on the above model, closed-form expressions are further derived for the corresponding message delivery probability under any given message lifetime and message size. The above concept is verified through simulation studies, which can be used to accurately predict the message delivery probability behavior and characterize its relationship with the message size.

TGRP: A New Hybrid Grid-based Routing Approach for Manets

Most existing grid-based routing protocols use reactive mechanisms to build routing paths. In this paper, we propose a new hybrid approach for grid-based routing in MANETs which uses a combination of reactive and proactive mechanisms. The proposed routing approach uses shortest-path trees to build the routing paths between source and destination nodes. We design a new protocol based on this approach called the Tree-based Grid Routing Protocol (TGRP). The main advantage of the new approach is the high routing path stability due to availability of readily constructed alternative paths. Our simulation results show that the stability of the TGRP paths results in a substantially higher performance compared to other protocols in terms of lower end-to-end delay, higher delivery ratio and reduced control overhead.

이동 애드혹 네트워크를 위한 생체모방 라우팅 프로토콜

Bio-inspired routing protocol uses a principle of swarm intelligence, which finds the optimal path to the destination in a distributed and autonomous way in dynamic environments, so that it can maximize routing performances, reduce control overhead, and recover a path failure quickly according to the change of network topology. In this paper, we propose a bio-inspired routing protocol for mobile ad hoc networks. The proposed scheme uses a function of overhearing via wireless media in order to obtain the routing information without additional overhead. Through overhearing, the pheromone is diffused around the shortest path between the source and destination. Based on this diffused pheromone, a probabilis tic path exploration is executed and the useful alternative routes between the source and destination are collected. Therefore, the proposed routing protocol can ensure the up-to-date routing information while reducing the control overhead. The simulation results show that the proposed scheme outperforms the typical AODV and AntHocNet protocols in terms of routing performances and significantly decreases the routing overhead against the AntHocNet. 논문 15-40-11-13

Efficient topology discovery in OpenFlow-based Software Defined Networks

Software Defined Networking (SDN) is a new networking paradigm, with a great potential to increase network efficiency, ease the complexity of network control and management, and accelerate the rate of technology innovation. One of the core concepts of SDN is the separation of the network’s control and data plane. The intelligence and the control of the network operation and management, such as routing, are removed from the forwarding elements (switches) and are concentrated in a logically centralised component, i.e. the SDN controller. In order for the controller to configure and manage the network, it needs to have up-to-date information about the state of the network, in particular its topology. Consequently, topology discovery is a critical component of any Software Defined Network architecture. In this paper, we evaluate the efficiency of the de facto standard approach to topology discovery currently implemented by the major SDN controller frameworks, and propose simple and practical modifications, which achieve a significantly improved efficiency and reduced control overhead. We have implemented our new topology discovery approach on the widely used POX controller platform, and have evaluated it for a range of network topologies via experiments using the Mininet network emulator as well as a specific topology in the OFELIA SDN testbed. Our results show that our proposed modifications achieve an up to 40% reduction in controller load compared to the current state-of-the-art approach, while delivering identical discovery functionality.

TLSR: A tree link state routing protocol using message aggregation based on a skewed wait time assignment for infrastructure-based mobile ad hoc networks

The existing protocols for the Internet connectivity of Mobile Ad Hoc Networks suffer from a high overhead since they often rely on flooding in executing mobility management and/or route discovery. In this paper, we propose a tree link state routing protocol in which a mobility management protocol builds topology information at the Internet Gateway (IG) as well as manages mobile nodes using tree topology and a routing protocol exploits the topology information, tackling the inherent problem of the excessive control overhead which appears in link state routing protocols. The activities of routing protocol including the delivery of data packet and control message also help the update of the topology information. In this way, mobility management and routing protocol collaborate with each other to increase convergence speed of topology and reduce control overhead. In addition, the progressive path discovery and the message aggregation technique based on the skewed wait time assignment are employed to reduce control overhead of the nodes near the Internet Gateway that process much more data packets and control messages. Simulation results show that the proposed method far outperforms AODV-Hybrid and OLSR+.

Performance improvement for source mobility in named data networking based on global–local FIB updates

The mobile devices have become the norm, rather than an exception for people’s daily life, and these devices possess strong ability (e.g., increasingly large storage) to serve as content sources in future information-centric networks, e.g., named data networking (NDN). The efficient discovery of contents provided by mobile devices is a challenging task. Most of existing studies adopted ID-Locator split architecture to handle the problems raised by source mobility in NDN, e.g., the content source is suddenly disconnected from the network when providing on-going services. However, these solutions require very high control overhead to maintain up-to-date location information of sources in an ID-Locator mapping system. Software defined networking (SDN) is a promising tool to make cross-layer decisions based on its logically centralized controller, and thus can facilitate the implementation of forwarding strategies in NDN according to application requirements. To this end, this paper proposes a new packet forwarding algorithm under SDN paradigm that is able to update the forwarding information base (FIB) of NDN node considering both the mobility pattern of mobile sources and network states. In particular, the algorithm leverages the SDN controller to perform the tradeoff between global FIB updates on all NDN nodes and local FIB updates on NDN nodes that are previously connected by mobile sources to lower the control overhead. A discrete-event simulator based on NS3 simulation framework is developed to validate the effectiveness and feasibility of the proposed algorithm. In addition, the performance of the algorithm is compared with that of existing solutions based on ID-Locator split architecture. The results show that the proposed packet forwarding algorithm has a lower request-to-response latency and higher successful content request ratio with reduced control overhead under different working conditions.

An Efficient Routing Protocol for Discovering the Optimum Path in Mobile Ad Hoc Networks

Mobile ad hoc networks include mobile nodes which move freely and communicate through wireless links. Due to high mobility of nodes, energy and bandwidth limitation and coverage range limit of nodes, routing in these networks is very complicated. Many routing protocols have been proposed for ad hoc networks. These protocols include a wide range of designing methods, and each has its own particular advantages and disadvantages; thus they can be used in a particular environment with specific conditions. In this paper, we choose an appropriate protocol (AODV) among existing protocols for congestion conditions of a network and fast mobility of nodes. Then we present a method for path backup in order to reduce control overhead and improve the performance of this protocol. Simulation results show that the proposed method has a high performance compared to similar onesKeywords: Backup, End to End Delay, Local Recovery, Routing Protocol

Gateway pheromone-based adaptive internet access scheme for mobile ad hoc networks

Control messages produced in the gateway discovery process degrade the performance of hybrid mobile ad hoc networks. Thus, the optimisation is required to release resources for the data transmissions. This paper proposes a novel adaptive gateway discovery scheme to improve the performance. In the scheme, active regions, which are delineated by gateway pheromone, are defined to optimise the propagation of control messages. To adapt to dynamic network topology, active regions are adjusted periodically to keep their availability by adaptive maintenance operations. Moreover, a link robustness evaluation model based on signal strength is integrated into the scheme to help build stable routes. Therefore, the control overhead can be further reduced because the messages generated due to the link breakages can be avoided. Extensive experiments have been conducted to evaluate the effectiveness of the proposed scheme in different scenarios. The results show that our scheme outperforms the existing gateway discovery mechanisms especially in terms of control overhead reduction.

English

ZigBee is the emerging industrial standard for Ad-hoc wireless networks based on IEEE 802.15.4, having characteristics such as low data rate, low price, and low power consumption. It is widely used in wireless sensor networks for remote monitoring, Home-appliance networks, and industrial automation. It supports tree and mesh routing. A major concern in wireless sensor networks (WSNs) is energy conservation, since battery-powered sensor nodes are expected to operate for a long time (for months or even years). AODV, an on-demand routing protocol is used for ZigBee mesh networks. The high number of control packets, makes AODV unsuitable for certain applications that requires energy efficient communications. A new routing strategy (sEAODV) is proposed here: combination of i) simplified AODV (sAODV): will try to reduce control overhead and hence energy consumption and ii) Energy Aware Mesh Routing (EAODV): to prevent early death of nodes having low energy (less than 10% of its initial energy level) will not forward RREQ messages hence, they will not be a part of communication. The algorithm performance is simulated using NS-2 simulator. Our proposed scheme shows overall performance improvement compared to original AODV in terms of Energy Consumption, Routing Overhead and Number of packet drops. At the end one idea is proposed to indicate emergency/urgent data (fire alarm or sensory data of a patient in ICU) by a flag bit, which forces even the low energy node to deliver the data to the destination node.

Binary Tree Model-Based Mobile Ad Hoc Network Dynamic Address Allocation Mechanism Research

Mobile Ad Hoc network is a multihop temporary network composed of a set of mobile intelligent terminals with no center. According to the related questions of mobile Ad Hoc network address configuration, on the basis of the existing application in mobile Ad Hoc network address automatic configuration mechanism, this paper discusses Binary Tree Model-based Dynamic Address Allocation Mechanism. The mechanism dynamically configures a unique address for the nodes according to their relative positions in network topology, reduces control overhead, and with the help of node number, processes network merger and division to effectively address resource management. It has good scalability, and is suitable for mobile Ad Hoc network.

A Location Based-Energy Aware Routing Approach for Mobile Ad Hoc Networks

Among all the wireless network architectures, Mobile Ad hoc Networks (MANET) has got the attention of the researchers due to its ability to create a temporary network on a fly without any centralized infrastructure. Though, the mobility feature offers multiple paths to reach the destination from which an optimal path can be selected, minimizing energy consumption of the mobile nodes have always been a challenge in MANET routing. Since the mobile nodes are battery powered, it needs to be utilized very effectively in order to keep the network connected and functioning for longtime. In this paper, we proposed and implemented a Location Based Energy Aware Routing (LB-EAR) approach which achieves load balancing and increases network life time with improved energy efficiency. Variable Transmission Power model was proposed to achieve minimum energy consumption of nodes in the network and the probability of packet re-transmission rate was reduced by controlling network overhead with some topology control. Upon comparing and analyzing the simulation results with Location Aided Routing (LAR), LB-EAR approach achieves high energy efficiency, high packet delivery ratio with low end to end delay with reduced control overhead.

COLLECTIVE APPROACH FOR MANETS TO SUPPORT PACKET LOSS AND DELAY SENSITIVE APPLICATIONS IN REAL

Mobile ad hoc network is network with different applications are developing with different service requirement. In particular multimedia applications and other real-time applications e.g. voice transmission. MANET is a autonomous network where communicating entities can communicate without the aid of any downlink power controller called base stations. Therefore there is no centralized control over links. Further the link quality varies due to mobility of the nodes. Existing routing protocols like AODV or any other QoS routing does not account for changes in link quality once the path is established. Therefore the performance of such a system degrades with high mobility. Hence in this work we emphasis on incorporating link quality estimation based on mobility prediction along with Node's geographic location and incorporate same in the routing decision further new routes are accumulated and the primary transmission path is changed in case a better route in terms of link quality is obtained. We mingled the idea of link stability and power consumption with Location aware routing to propose a new technique for MANET that reduces control overhead and provides better performance.