Protocol Overhead Research Articles

Hybrid Zoning Algorithm to Optimize Overhead in Smart Mobile Communication

With the increase of mobile terminals, routing protocols in wireless communications must provide better quality of service to meet bandwidth and reliability requirements. In networks without infrastructure, such as ad hoc and sensor networks, where a device performs as both a terminal and a router to forward data of other nodes, maintaining the network topology consumes considerable resources in terms of energy and bandwidth. These parameters need to be considered when designing routing protocols for wireless networks. To reduce the cost of the protocol overhead, some algorithms act on the forwarders, while others act on the transmission of messages. Finally, the hybrid ones are a combination of both. In this paper, we propose a new algorithm with two zoning strategies to enhance the performance of mobile network. The first strategy helps to select dispersive forwarders in order to reduce the collision in radio channel. The second strategy aims to reduce the transmission of redundant messages. Both strategies are based on the location information of nodes. We implemented our algorithm in the optimized link state routing protocol, the most used protocol in mobile ad hoc networks. We showed by simulations that our solution reduces drastically the cost of the overhead with no hindrance to the network topology.

Optimization of swift protocols

Swift, an increasingly-popular programming language, advocates the use of protocols, which define a set of required methods and properties for conforming types. Protocols are commonly used in Swift programs for abstracting away implementation details; e.g., in a large industrial app from Uber, they are heavily used to enable mock objects for unit testing. Unfortunately, heavy use of protocols can result in significant performance overhead. Beyond the dynamic dispatch often associated with such a feature, Swift allows for both value and reference types to conform to a protocol, leading to significant boxing and unboxing overheads. In this paper, we describe three new optimizations and transformations to reduce the overhead of Swift protocols. Within a procedure, we define LocalVar, a dataflow analysis and transformation to remove both dynamic dispatch and boxing overheads. We also describe Param, which optimizes the case of protocol-typed method parameters using specialization. Finally, we describe SoleType, a transformation that injects casts when a global analysis (like type-hierarchy analysis) discovers some protocol variable must have some concrete type. We also describe how these optimizations work fruitfully together and with existing Swift optimizations to deliver further speedups. We perform elaborate experimentation and demonstrate that our optimizations deliver an average 1.56x speedup on a suite of Swift benchmarks that use protocols. Further, we applied the optimizations to a production iOS Swift application from Uber used by millions of customers daily. For a set of performance spans defined by the developers of the application, the optimized version showed speedups ranging from 6.9% to 55.49%. A version of our optimizations has been accepted as part of the official Swift compiler distribution.

Improvements in Aodv Routing Protocol using IPV6 and 802.11e in Manets

Development of IEEE 802.11e standard is a cost-efficient wireless technique for services and improves the QoS potentiality to wireless networks. It provides outstanding enhancement to multimedia communication which lead to gain vogue and overcome the significant challenges in reaching the up-marks of the applications related to multimedia. Mobile Adhoc Networks (MANETs) face challenges with reference to QoS, limited bandwidth, mobility, limited battery power, routing and so on. These issues are raising due insufficient resources in MANETs, this leads to a difficulty in achieving marked QoS. AODV, QAODV, ZRP, DSDV, OLSR, etc., can be regarded as well known routing protocols of MANETs[1] The instigation of IPv6 has bought un-eliminating certainty with vital consequences, it’s very much essential to verify and examine the changes. In MANET and other Ad-hoc systems, the implementation of IPV6 brought good results in the all the moving nodes in different ways in distinct environments. In the present paper we examine Adhoc On Demand Distance Vector routing protocol (AODV) of MANET by including (Internet Protocol version) IPv6 and 802.11e implementation on OMINI network and ns2 for simulation. The performance level of routing protocol AODV is measured with relation to throughput, delay and packets loss. MANETs are very much benefited by new technology, it is most widely installed and utilized by wireless medias that belongs to IEEE-802.11 constructs. The work in proposed paper aims at the results related to the reciprocity of MANETs-Reactive routing protocols by considering the IPV6, IEEE 802.11e technique. This results in considerable improvements in terms of routing protocol properties and overheads are reduced due to enriched routing protocol.

Flexible sampling-based in-band network telemetry in programmable data plane

Abstract In-band network telemetry (INT) is an emerging network monitoring framework based on a protocol-independent packet processor (P4). Network devices can be programmed with a domain-specific language to embed switch-internal states into data packets as they traverse through networks. However, the current P4-based INT does not support a sampling; thus, INT headers should be augmented for all incoming packets, which will incur high overhead in a large-scale network. In this paper, we propose a flexible sampling-based INT (FS-INT) scheme to address the aforementioned issues. Simulation results show that FS-INT can reduce the protocol overhead in a controlled manner while providing sufficiently high accuracy.

Globally Synchronized Time via Datacenter Networks

Synchronized time is critical to distributed systems and network applications in a datacenter network. Unfortunately, many clock synchronization protocols in datacenter networks such as NTP and PTP are fundamentally limited by the characteristics of packet-switched networks. In particular, network jitter, packet buffering and scheduling in switches, and network stack overheads add non-deterministic variances to the round trip time, which must be accurately measured to synchronize clocks precisely. We present the Datacenter Time Protocol (DTP), a clock synchronization protocol that does not use packets at all, but is able to achieve nanosecond precision. In essence, the DTP uses the physical layer of network devices to implement a decentralized clock synchronization protocol. By doing so, the DTP eliminates most non-deterministic elements in clock synchronization protocols and has virtually zero protocol overhead since it does not add load at layer-2 or higher at all. It does require replacing network devices, which can be done incrementally and with very small amount of hardware resource consumption. We demonstrate that the precision provided by DTP in hardware is bounded by 4TD where D is the longest distance between any two nodes in a network in terms of number of hops and T is the period of the fastest clock. The precision can be further improved by combining DTP with frequency synchronization. By contrast, the precision of the state-of-the-art protocol (PTP) is not bounded: The precision is hundreds of nanoseconds in an idle network and can decrease to hundreds of microseconds in a heavily congested network.

A geographical segment architecture for connected vehicle networks

Equipped with wireless transceivers, vehicles can be connected into a vehicular ad hoc network to collect, share and utilize data for a variety of purposes, such as safety, navigation and entertainment. As diverse sensors are integrated into vehicles and large numbers of wireless access points are deployed within cities, far more data can be collected and utilized to support smarter applications. However, the data explosion puts further strain on the broadcasting and routing protocols which are already challenged by the high mobility vehicular environment. In this paper, we propose a geographical segment architecture (GSA) which clusters vehicles based on their geographic locations with respect to road segments. Leveraging on a two-tier architecture, consisting of segment heads and ordinary vehicles, the GSA can exploit cluster IDs to implement efficient broadcasting strategies and routing protocols. We propose three GSA-based routing protocols: GSA-SR (which uses reactive routing), GSA-GR (which uses geographic routing) and IGSAR (which is infrastructure based). Extensive simulations of connected vehicular networks in three road topology scenarios (City, Rural, and Highway) show that GSA-based protocols can achieve relatively higher performance than existing protocols in terms of throughput, packet delivery rate, delay and protocol overhead.

Design and analysis of an improved AODV protocol for black hole and flooding attack in vehicular ad-hoc network (VANET)

Today Vehicular Networks is not a new term. In the past three to four years, Vehicular Networking has acquired immense publicity especially in the area of Research and Academic Industry. VANET is infrastructural less network in which node connect and disconnect automatically. The basic reason behind this ever-increasing technology is that it has been one of the most valuable and recognizable research concept for enhancing efficiency and ensuring safety measures in near future transportations. VANET have node to node connectivity free mobility distribution operation, so sue to their flexible nature this network is vulnerable for many attack. In this paper we implement the attack like flooding and black hole attack using AODV routing protocol and improved AODV routing. Three different scenario are simulated using NS2.35 simulator and measure the performance parameters like end to end delay, packet overhead ,packet delivery rate and packet drop ratio, which are analyzed and compared with the exiting protocol. In this simulation flooding attack routing protocol overhead is 21.8% and black hole attack routing protocol overhead is 18.04% overhead. Packet deliver ratio when flooding attack is 15.6% and in black hole attack is 10.5% , Which show that AODV routing protocol is more vulnerable than Black hole attack.

VoLTE cell capacity estimation using AMR‐WB codecs and considering VAF, SID, packet bundling, and TTI bundling

SummaryThe Voice over Long‐Term Evolution (VoLTE) cell capacity notably has an influence on Call Admission Control (CAC) in Long‐Term Evolution (LTE) network. In literature, many techniques have been studied to estimate the LTE cell capacity, but most of them are throughput‐based physical layer (PHY layer) estimate. These estimates do not consider delay requirement, transmission loss, and protocol overhead. In this paper, we have proposed novel analytical models for estimating the VoLTE cell capacity in terms of number of users by considering available physical resource blocks (PRBs) in each bandwidth, voice traffic‐based characteristics such as voice activity factor (VAF), silent insertion descriptor (SID), and radio‐specific techniques such as packet bundling and transmission time interval (TTI) bundling. Our developed analytical models are then used to investigate the effect of modulation and coding scheme (MCS) and Adaptive Multi‐RateWideband (AMR‐WB) voice codec on VoLTE cell capacity. Results show that higher order modulation scheme with lower bit voice codec accommodates maximum number of VoLTE users. Further, the impact of VAF, SID, packet bundling, and TTI bundling on VoLTE cell capacity is investigated in different radio conditions. Finally, using our proposed model, the effect of hybrid automatic repeat request (HARQ) retransmission on VoLTE cell capacity is investigated.

ENHANCED CLUSTER HEAD MANAGEMENT IN LARGE SCALE WIRELESS SENSOR NETWORK USING PARTICLE SWARM OPTIMIZATION (PSO) ON THE BASIS OF DISTANCE, DENSITY & ENERGY

Wireless Sensor Networks (WSNs) are utilized for a plethora of applications such as weather forecasting, monitoring systems, surveillance, and so on. The critical issues of the WSN are energy constraints, limited memory, and computation time. This spectrum of criticality takes a deep dive with large-scale WSNs. In such scenario, the network lifetime has to be efficiently utilized with the available resources by organizing into clusters. Even though the technique of clustering has proven to be highly effective in minimizing the energy, the tradition cluster based WSNs, the protocol overhead is high for Cluster Heads (CHs) as it receives and aggregates the data from its cluster members. Therefore, efficient management of CH along with routing behavior is vital in prolonging the network lifetime. In this paper, an enhanced CH-Management technique is proposed which efficiently elects its CH using Particle Swarm Optimization (PSO), hereafter referred to as PSO_DDE. The PSO_DDE approach considers various parameters such as within-cluster distance between nodes (intra-cluster distance), neighbor density, and residual energy of nodes for the best candidate selection of CH. Also, the cluster formation is defined by the k-means based on the Euclidian distance. The PSO_DDE approach is integrated with the Dynamic Source Routing (DSR) for efficiently traversing the data packet to the sink node. The performance metrics are compared with the existing approaches using NS-2 simulator, and the proposed approach shows superiority of results.

Dynamic Path Planning Design for Mobile Sink with Burst Traffic in a Region of WSN

In mobile wireless sensor networks, priori-trail planning for the mobile sink is a commonly used solution to data collection from the whole network, for its low protocol overhead. However, these trail-based approaches lack efficient load balance mechanism to handle burst WSN traffic, which needs to be sent to the base station correctly with low delay. This paper proposed a dynamic path planning for mobile sink to balance load and avoid traffic bottleneck. It contains grid partition of the network, priori-trail creation, burst-traffic awareness and estimation, resources collaborative strategy, and dynamic routing adjustment. Experiments on NS-2 platform show that the proposed algorithm can efficiently balance the regular and burst data traffic with a low-delay and low loss rate performance of the network.

Fog Massive MIMO: A User-Centric Seamless Hot-Spot Architecture

The decoupling of data and control planes in the forthcoming 5G wireless networks enables the efficient implementation of multitier architectures, where coverage and connectivity are guaranteed by top-tier macro-cells, and at the same time, high throughput and low latency are achieved locally by lower tiers in the hierarchy. This paper considers a new architecture for such lower tiers, dubbed fog massive multi-in multi-out (MIMO), where the user equipment (UE) nodes can connect to a “fog” of the densely deployed remote radio heads (RRHs) in a seamless, user-centric, and opportunistic manner. In the case of dense small cells, traditional cellular architectures inherently give rise to frequent handovers and pilot sequence re-assignments, which typically incur excessive protocol overhead and latency. In the proposed fog massive MIMO architecture, the UEs implicitly associate themselves with the most convenient RRHs in a completely autonomous manner. Each UE makes use of the uplink pilot sequences that contain equal-weight codewords and enable a novel “on-the-fly” pilot contamination control mechanism. We analyze the spectral efficiency and the outage probability of the proposed architecture via stochastic geometry, using some recent results on unique coverage in Boolean models, and provide a detailed comparison with the benchmark represented by massive MIMO cellular system with a genie-aided minimum-distance user-cell association. Our analysis, corroborated by extensive system simulation, reveals that there exists a “sweet spot” of the per pilot user load (number of users per pilot), such that the proposed system achieves a spectral efficiency close to that of the genie-aided cellular system. In these conditions, it is possible to achieve the low protocol overhead and low user RRH association latency promised by the fog massive MIMO at virtually no significant performance cost in terms of system spectral efficiency with respect to the cellular benchmark.

Reduction of overhead in routing protocols for MANET using fuzzy set-based decision making

It is well-known that dynamic topology, mobility of nodes, infrastructure less property and absence of central coordinator; make the behaviour of mobile ad hoc network (MANET) uncertain. Routing is the major step in the operation of MANET and the establishment of route from source to destination thus becomes crucial. Routing decision is distributed among the nodes in the network and the reliable and effective routing predominantly depends on proper establishment of route from source to destination. Route establishment depends largely on control packets and those packets induce more overhead in the network, which in turn degrades the performance of the network. The present work proposes a novel method to reduce the control overhead by predicting the quality of the neighbouring nodes that sustain more, using a fuzzy set decision approach. The flooding of control packets is based on a fuzzy decision taken on success rate of each link in the previous trials and residual energy of the neighbouring nodes. Simulation study reveals that this approach significantly reduces the control overhead in the network and improves the overall performance.

Neighbor Discovery ++− a Scalable and Robust Address Auto-Configuration for Future Internet of Things Networks

The growing complexity of the Internet of Things (IoT) solutions along with highly increased application needs call for more complex and robust networking solutions. Especially the importance of autonomic, self-configuration capabilities becomes particularly significant. The IPv6-based mobile ad hoc networks are envisioned to be a good candidate technology for the IoT networks. However, they lack efficient address auto-configuration mechanisms, which could extend the IPv6 to cover the requirements of such a demanding networking environment. To address this challenge, we have proposed the Neighbor Discovery ++ (ND++) solution for the enhanced stateless address auto-configuration. The ND++ incorporates a well-performing flooding control mechanism to the basic IPv6 ND design, which results in a very low protocol overhead in the order of few messages per node. The presented simulation-based evaluation, performed under diversified mobile scenarios, confirms the scalability and robustness of this approach with regard to the key identified metrics-reliability, overhead, and latency.

Error and congestion control for wireless sensor networks

SummaryIn the wireless sensors network (WSN) field, a wide variety of sensors produce a heterogeneous traffic mix, targeting diverse applications with different reliability requirements. We focus on emergency response scenarios, where a mobile rescuer moves through a, possibly disconnected, network, trying to talk to diverse sensors. We assume two types of sensors, event sensors triggered by an event and periodic sensors activated at predefined time intervals, as well as two types of transmission, either using the highest bit rate available or using predefined bit rates. Our reliable transport protocol for sensor networks with mobile sinks (RT‐SENMOS) takes into account all these parameters and tries to provide the best possible user experience under the current circumstances of the network, using a sink‐driven approach where an application‐specific sink is combined with generic sensors. RT‐SENMOS was implemented and tested over a real network with emulated losses and compared against rate‐controlled reliable transport (RCRT), a well‐known sink‐driven protocol. The results show that RT‐SENMOS fully exploits the available bandwidth in all cases, while RCRT only manages to exploit 60% to 90% of it. Furthermore, RT‐SENMOS adapts much faster to prevailing network conditions, while its protocol overhead, in terms of control messages exchanged, is much lower than that of RCRT.

Using Two Antennas to Reduce the Generated Overhead of Beacon-Based Protocols in VANET

In this work, a new routing protocol has been exclusively designed for reducing the generated overhead of beacon-based routing at the road segments of city environments in Vehicular Ad hoc Network. The main objective is to reduce the resulted overhead from the periodic exchange of beacon messages while preserving the same network awareness. To do so, the proposed protocol exploits the availability of two directional antennas to decrease the size of the beacons instead of their number. In particular, the proposed protocol modifies greedy forwarding at the road segments so the distance between a packet holder and its direct neighbors can be calculated using the neighbors’ received power instead of their current geographical position. Results have shown a decrease in both control and beacon overheads of the proposed protocol compared to other beacon-based protocols.

MoHoP: A protocol providing for both mobility management and host privacy

The types and numbers of moving objects connected to the Internet are rapidly increasing. Thus, a number of methods have been proposed to provide mobility to moving objects and to ensure host privacy. However, when both methods are applied at the same time without considering their interoperation, either host privacy cannot be provided or packets are delivered to an incorrect location. In this paper, we propose a protocol termed MoHoP which provides both mobility management and host privacy simultaneously. MoHoP obtains the identifier of a mobile node by decoding an anonymized identifier included in a packet. Using the obtained identifier in a distributed hash table, it finds an edge router to which a mobile node is connected, and delivers the packet. We implemented MoHoP in a testbed and proved that it supports mobility. Moreover, the identifier of a mobile node is not exposed in a packet header during the packet transmission process. Our experiment also demonstrated that MoHoP offers low protocol overhead and low handover delay.

A Scalable and Statistically Robust Beam Alignment Technique for Millimeter-Wave Systems

Millimeter-wave (mm-wave) frequency bands provide an opportunity for much wider channel bandwidth compared with the traditional sub-6-GHz band. Communication at mm-waves is, however, quite challenging due to the severe propagation pathloss incurred by conventional isotropic antennas. To cope with this problem, directional beamforming both at the base station (BS) side and at the user equipment (UE) side is necessary in order to establish a strong path conveying enough signal power. Finding such beamforming directions is referred to as beam alignment (BA). This paper presents a new scheme for efficient BA. Our scheme finds a strong propagation path identified by an angle-of-arrival (AoA) and angle-of-departure (AoD) pair, by exploring the AoA–AoD domain through pseudo-random multi-finger beam patterns and constructing an estimate of the resulting second-order statistics (namely, the average received power for each pseudo-random beam configuration). The resulting under-determined system of equations is efficiently solved using non-negative constrained least-squares, yielding naturally a sparse non-negative vector solution whose maximum component identifies the optimal path. As a result, our scheme is highly robust to variations of the channel time dynamics compared with alternative concurrent approaches based on the estimation of the instantaneous channel coefficients, rather than of their second-order statistics. In the proposed scheme, the BS probes the channel in the downlink and trains simultaneously an arbitrarily large number of UEs. Thus, “beam refinement,” with multiple interactive rounds of downlink/uplink transmissions, is not needed. This results in a scalable BA protocol, where the protocol overhead is virtually independent of the number of UEs, since all the UEs run the BA procedure at the same time. Extensive simulation results illustrate that our approach is superior to the state-of-the-art BA schemes proposed in the literature in terms of training overhead in multi-user scenarios and robustness to variations in the channel dynamics.

Optimization of Data Communication on Air Control Device Based on Internet of Things with Application of HTTP and MQTT Protocols

In this research, we proposed ALDEBARAN (Air Control Device Based on Internet of Things), that is, a device the HTTP protocol which can be applied as a protocol to communicate with the IoT ANTARES (Internet of Things Application and Technology Platform as your Reliable Solution) platform. Wi-Fi connectivity is needed to build a communication between devices and platforms, also to sends data continuously. Because the HTTP has a high overhead protocol resulting in waste of power consumption, so it needs to be optimized. The focus of this research is to optimize data communications on our device to create data communication and power saving efficiently. The method used is implementing the HTTP and MQTT protocols that are combined with several data transmission algorithms. Parameters such as latency and current consumption are compared and analysed to obtain the most optimal combination of protocols and algorithms. The result of this research is that MQTT protocol can be applied to our device and data communication with our scheme becomes more optimal.

An Adaptive Bi-Threshold-Based On-Demand Energy-Efficient Multicast Routing Protocol for Wireless Ad Hoc and Sensor Networks

Energy efficient multicast is a crucial issue in wireless ad hoc and sensor networks. In this paper, we propose an adaptive bi-threshold-based on-demand energy-efficient multicast routing protocol EAP, which is aimed to achieve reduced energy consumption and prolonged network lifetime. For this purpose, EAP introduces two thresholds: One is link power threshold, which is to avoid use of over-long links in a multicast tree so as to reduce the total power for multicasting data packets; the other is energy protection threshold, which is used to discourage energy critical nodes from joining a multicast tree as relay nodes, whenever possible. We elaborate how these two thresholds can facilitate the on-demand energy-efficient multicast tree constructions and also how they can be adaptively updated as network evolves while causing little protocol overhead. We present detailed design description of EAP. Simulation results show that EAP can achieve high performance in terms of network lifetime with little protocol overhead.

Mitigation of Selfish Node Attacks in Autoconfiguration of MANETs

Mobile ad-hoc networks (MANETs) are composed of mobile nodes connected by wireless links without using any pre-existent infrastructure. Hence the assigning of unique IP address to the incoming node becomes difficult. There are various dynamic auto configuration protocols available to assign IP address to the incoming nodes including grid based protocol which assigns IP address with less delay and low protocol overhead. Such protocols get affected by presence of either selfish nodes or malicious nodes. Moreover there is no centralized approach to defend against these threats like in wired network such as firewall, intrusion detection system, proxy etc. The selfish nodes are the nodes which receive packet destined to it and drop packet destined to other nodes in order to save its energy and resources. This behavior of nodes affects normal functioning of auto configuration protocol. Many algorithms are available to isolate selfish nodes but they do not deal with presence of false alarm and protocol overhead. And also there are certain algorithms which use complex formulae and tedious mathematical calculations. The proposed algorithm in this paper helps to overcome the attack of selfish nodes effect in an efficient and scalable address auto configuration protocol that automatically configures a network by assigning unique IP addresses to all nodes with a very low protocol overhead, minimal address acquisition delay and computational overhead.