Packet Overhead Research Articles

An Efficient Buffer Overflow Control Scheme to Mitigate Packet Loss in Manets

MANET (Mobile Ad hoc Network) is self-configuring, self-organizing, infrastructure-less network of mobile devices connected without wires. Because of the dynamic changes in the network topology, there is no centralized control in ad hoc networks. So, mobile nodes can communicate with each other via intermediate nodes. The buffer size of intermediate nodes plays a significant role to hold packets in the buffer before dropping the newly arrived packets. In MANET, buffer overflow (congestion) occurs in any intermediary nodes when data packets pass through source to destination and incurs packet loss, which causes the performance degradations of a network. Congestion can be reduced by using several Active Queue Management [AQM] techniques. Queue Management Node or “QMN” is an active queue management strategy to control packet drops by assigning space of a buffer node to all its neighbouring nodes dynamically depending upon the total number of packets received from its neighbours. In this scheme, authors did not take into account the impact of collaboration between neighbors of a central node. They only consider the characteristics of nodes, while ignoring the message properties in MANET. And also a new node has to be waiting until it will get enough equal space from the QMN along with other neighbor nodes. During this waiting period, high packet loss can be occurred. So, an efficient buffer overflow control scheme is required to make sure every node has adequate storage space to hold the data once the buffer of the node is near to congestion. In this paper, we proposed a scheme that integrates QMN technique with combinational buffer management (CBM) strategy, which includes both the features of messages and nodes, and transfer the duplicated messages to neighbour node for total utility optimization, rather than deleting them. By using this scheme packet loss can be mitigated in MANETs efficiently. Our simulation results here reveal that, the proposed scheme achieves better performance than other existing schemes in terms of packet delivery ratio, throughput, overhead ratio and end to end delay .

Mutual Authentication using improved Chaotic Maps to remove packet dropping attack from MANETs

Background: MANET is self-organized wireless network with no infrastructure. Especially data transfer from one system to another system needs to be done in a secure way. In order to provide data integrity, authentication plays an important role in data communication. RSA, ECC are widely used algorithms in real world but authentication using these algorithms is time consuming. Towards this, various algorithms came into existence with different security primitives. However, it is important to study the key agreement process among these security mechanisms. We have studied the patents related to secure end to end communication in MANET. Methods: Therefore our aim is to design chaos based mutual authentication algorithm that takes less time than these existing algorithms and evaluate with respect to attack resiliency, Packet delivery fraction, delay, throughput and overhead. Results:: Simulation results show the result of the proposed mechanism and gives better performance in terms of said parameters. Conclusion: Comparison of proposed system presents better results when compared to RSA, ECC in terms of key generation mechanism.

Improved routing in MANET with optimized multi path routing fine tuned with hybrid modeling

Routing in MANET is very challenging due to movement of nodes. Predicting the node position and routing based on predicted positions helps to establish routing path with much longevity. Most predictions approaches are based on the past locations of the node. In this work a node location prediction based on the temporal and spatial characteristics with respect to its neighborhood is applied to estimate the probable locations using a hybrid model. A multi path routing protocol based on estimated probability locations with path diversion at necessary places along path is proposed for improved routing performance without larger packet overhead.

Single tag scheme for segment routing in software-defined network

This paper proposes a scheme to reduce a size of a packet header for a segment routing (SR) scheme in a software-defined network (SDN). The SR scheme inserts a segment identification (SID) list into the packet header to indicate a path for the source–destination pair of the packet. The path can be split into different segments to suit the service requirement and the segments are carried by the SID-list whose length increases with the number of segments. This also increases the packet overhead, and an additional packet is needed if the packet length exceeds the maximum transmission unit (MTU). Moreover, it may not be possible to implement SR in SDN due to the limited number of stacked labels provided by the switch vendor. In the proposed scheme, the SID-list is replaced by a single tag to indicate a node edge, called a swapping node. The tag is replaced by a new tag at the swapping node. With this scheme, the size of SID-list is fixed and does not vary with the number of segments, and no additional packets are required. A mathematic model to balance the number of flow entries in each swapping node is introduced by minimizing the maximum number of flow entries in each swapping node over the network. We implement the proposed scheme on the transmission-Japan science information network (SINET5) and demonstrate confirms its functionality.

An energy efficient distributed queuing random access (EE-DQRA) MAC protocol for wireless body sensor networks

In wireless sensor networks, a significant amount of energy is consumed by the sensor nodes during data packet transmission and reception. An IEEE 802.15.4 MAC protocol is not able to completely satisfy all the requirements of wireless body sensor networks (BSNs) in a healthcare environment. Hence there is a demand for the design of a new scalable and energy saving MAC protocols. In this paper the challenging healthcare requirements are considered and based upon these requirements, an energy efficient distributed queuing random access (EE-DQRA) MAC protocol is proposed for BSN scenarios which utilizes the concept of distributed queuing for enhanced radio channel utilization. The theoretical analysis of energy efficient EE-DQRA MAC protocol is being carried out systematically considering the limitations of IEEE 802.15.4 and DQ-MAC protocol. Further, EE-DQRA performance is validated with IEEE 802.15.4 system parameters using computer simulations. The effect of relative traffic load and payload length on the energy consumption, delay and throughput are also analyzed. The simulation results shows that the proposed EE-DQRA MAC with M/M/K queuing has better energy performance than the existing DQ-MAC and IEEE 802.15.4 MAC in BSN scenarios due to collisionless transmission in the data transmission queuing (DTQ) module while keeping the control packet overhead smaller in collision resolution queuing (CRQ) module. It is also evident that EE-DQRA requires a minimum delay in comparison to IEEE802.15.4 and DQ-MAC, due to overhead minimization and M/M/K queuing utilization in DTQ system.

Energy-Constrained Uncoordinated Multiple Access for Next-Generation Networks

This article analyzes the performance of a distributed joint power/packet diversity random access scheme in the presence of energy requirements. In particular, the two main approaches separately developed in the recent years for exploiting the Interference Cancellation (IC) capabilities of modern receivers, that is, Non-Orthogonal Multiple Access (NOMA) and Packet Repetition (PR), are firstly compared and then combined by imposing a constraint on the total available power. This constraint, which is alternative to the commonly adopted one based on the maximum power allowed for a transmission, results much more practical, since it enables to better infer the energy efficiency of a scheme, be it a pure NOMA, PR or combined NOMA/PR one. Both theoretical derivations and numerical simulations are carried out to evaluate the success probability and the throughput of the considered schemes by accounting for evolved reception criteria and different fading scenarios. Furthermore, the influence of several nonidealities, including imperfect IC and packet overhead, is discussed together with the impact of the system parameters, such as the user rate, the average signal to noise ratio, and the number of slots that compose a random access frame.

Impacts of Mobility Models on RPL-Based Mobile IoT Infrastructures: An Evaluative Comparison and Survey

With the widespread use of IoT applications and the increasing trend in the number of connected smart devices, the concept of routing has become very challenging. In this regard, the IPv6 Routing Protocol for Low-power and Lossy Networks (PRL) was standardized to be adopted in IoT networks. Nevertheless, while mobile IoT domains have gained significant popularity in recent years, since RPL was fundamentally designed for stationary IoT applications, it could not well adjust with the dynamic fluctuations in mobile applications. While there have been a number of studies on tuning RPL for mobile IoT applications, but still there is a high demand for more efforts to reach a standard version of this protocol for such applications. Accordingly, in this survey, we try to conduct a precise and comprehensive experimental study on the impact of various mobility models on the performance of a mobility-aware RPL to help this process. In this regard, a complete and scrutinized survey of the mobility models has been presented to be able to fairly justify and compare the outcome results. A significant set of evaluations has been conducted via precise IoT simulation tools to monitor and compare the performance of the network and its IoT devices in mobile RPL-based IoT applications under the presence of different mobility models from different perspectives including power consumption, reliability, latency, and control packet overhead. This will pave the way for researchers in both academia and industry to be able to compare the impact of various mobility models on the functionality of RPL, and consequently to design and implement application-specific and even a standard version of this protocol, which is capable of being employed in mobile IoT applications.

A Wireless Sensor Networks Security Protocol Architecture

A wireless sensor network is made up of extremely small autonomous units capable of sensing, computing and communicating. There are numerous restrictions on wireless sensor networks as the resource available to the wireless sensor network is limited. Thus, a number of clustering protocols in a routing sensor organization of sensor networks have been proposed in the literature which increase the throughput, save energy and decrease the delay in the system. In this paper, we put forward SNP, the one of its type link layer security architecture for wireless sensor networks. In this, the design vulnerabilities which were found in the protocols such as 802.11b and GSM are addressed using SNP. Security protocols have very conservative approach while guaranteeing the security and typically add up around 16-32 bytes as overhead. Owing to the scenario that sensor networks have limited supply of energy, little memory and low power processors, a 30 byte packet is more of unaffordable luxury for the wireless sensor networks. In SNP, the different trade-offs between separate cryptographic algorithms and wireless sensor network limitations are used to find an optimum point where packet overhead, security and resource requirements are met.

Mitigation of DIS flooding attacks in RPL‐based 6LoWPAN networks

AbstractThe IPv6 Routing Protocol for Low‐Power and Lossy Networks (RPL) is the de facto routing protocol for IPv6‐based Low‐Power Wireless Personal Area Networks (6LoWPAN). In RPL protocol, DODAG Information Solicitation (DIS) messages are sent by the node to join the network. A malicious node can exploit this mechanism to send illegitimate DIS messages to the neighbor nodes to perform a DIS flooding attack. In this research paper, it is observed that the DIS flooding attack increases the control packet overhead of the network, which significantly degrades the network's performance. This further increases the power consumption of the nodes in the network. To address this problem, a mitigation scheme named Secure‐RPL is proposed. The proposed scheme mitigates significantly the effects of DIS flooding attack on the network's performance. The effectiveness of the proposed Secure‐RPL scheme is compared with standard RPL protocol. The experimental results show that Secure‐RPL detects and mitigates DIS flooding attack quickly and efficiently in both static and dynamic network scenarios, without adding any significant overhead to the nodes.

Distributed and Localized Hub-Based Hierarchical Information Transmission Control in Large-Scale Wireless Cloud Networks

This paper proposes a virtual infrastructure-based hierarchical information transmission scheme consisting of two phases, macroscopic transmission and local transmission controls. The macroscopic transmission control builds a hub-node-based virtual infrastructure and then finds the optimal hub route that satisfies the stochastic end-to-end delay constraint. Each node determines whether it belongs to a hub node by itself in a distributed manner. The local transmission control builds a robust local path between hub nodes by using the synchronized redundancy concept; this minimizes the effects of transmission failure by reducing the control traffic overhead and time to reconfigure transmission paths without rediscovery of the transmission path from the source node. Simulations confirmed that, as the network size increased, the performance of the proposed transmission scheme increased in terms of packet delivery ratio and control packet overhead. The scheme can be applied to mobile ad hoc cloud computing systems based on self-organizing vehicular networks or drone networks as a key control.

Directed data dissemination to optimize packet delivery rate, delay, and overhead in vehicular ad-hoc networks

Directed data dissemination to optimize packet delivery rate, delay, and overhead in vehicular ad-hoc networks

WSN and IoT based smart city model using the MQTT protocol

The Internet of things in integration with wireless sensor networks changed the world exponentially by connecting a huge number of devices and providing the ability to control them remotely and globally. This research work is emphasized on proposing the smart city model and implementation that model based on IoT using MQTT protocol. The comparison is done with HTTP protocol. HTTP is used for transferring the information using request and response model so require control packets overhead. To handle the limitation of HTTP, MQTT is proposed. It uses publish/subscribe model, reduces control packets overhead and suitable for IoT. It uses “Named based routing” and prevents IP address in IoT data transfer. The smart city model is proposed and developed using Network Simulation Software (Cisco Packet Tracer v7.2).Cisco introduces IoT and MQTT feature in version 7.1. Here Message Queuing Telemetry Transport (MQTT) protocol is used which gives fast and reliable performance for IoT devices. A network model is developed with multiple sensors and IoT Devices which acts as MQTT client. Here a data center is created which has multiple Servers (MQTT Broker). Using the MQTT broker all the IoT devices can be monitored by just logging in to the broker. A prototype model is implemented and tested in real time using Node MCU. The devices are remotely monitored from anywhere in the world which fulfill the requirement of smart city model. Future aspects include the integration of machine learning algorithms in the protocols developed for IoT for quick smart decisions in monitoring the critical applications.

Opportunistic Directional Location Aided Routing Protocol for Vehicular Ad-Hoc Network

The Vehicular ad-hoc network (VANET) is an autonomous system mobile vehicle connected over a wireless link to transmit data packets in the network. It is noteworthy that vehicles are highly mobile with a limited communication range so that they change their network topology frequently. Therefore, efficient and robust data delivery in VANET is a challenging task due to dynamic network topology, unstable links, and high mobility. In this paper, an opportunistic routing protocol named Opportunistic Directional-Location Added Routing (OD-LAR) protocol proposed that uses full broadcast characteristics. The proposed protocol OD-LAR is a combination of geographical location, link quality, and angular deviation. Using all of these three metrics proposed protocol prioritizes the candidate next-hop forwarder (CNHF) nodes at the border area (BA) of the forward area (FA) towards destination node D. The proposed protocol OD-LAR assign the highest priority to CNHF node has the minimum distance from destination, good link quality, and minimum angular deviation and selects it as an optimal next hop forwarder (ONHF) node. The basic aim of the proposed OD-LAR protocol is to improve packet overhead, packet drop rates, delay, and throughput. To evaluate the performance of OD-LAR, it has simulated through network simulator-2 (NS-2) and compared with the directional-location aided routing (D-LAR) and location aided routing (LAR) protocols. Through simulated results, it has shown packet drop rate and delay is minimum in OD-LAR as compared to the D-LAR and LAR protocols.

An Energy-Efficient Transmission in WSNs for Different Climatic Conditions

Applications of wireless sensor networks (WSNs) are increasing tremendously to facilitate and establish a link between the physical world and information system. The major issues to design such type of WSNs are to reduce the power consumption of sensor nodes and enhance the life-time of nodes having limited battery capacity. In this paper, an energy-efficient transmission scheme in dynamic climatic conditions in WSNs has been proposed. This scheme is IEEE 802.15.4 standard adaptable. It considers two processes one is with feedback and another is without feedback. Process without feedback is used to evaluate and compensate the link quality due to effects of different climatic conditions such as temperature, rain, and snow (dry and wet), albeit process with feedback is used to divide the network into two logical regions to decrease the overhead of control packets. The current number of nodes $$[n_c(t)]$$ and power loss in each region are used to adjust the transmit power level $$(P_{level})$$ of node according to variations in link quality and climatic conditions. Simulation results show that proposed scheme adjusts transmission $$P_{level}$$ to compensate link quality with less packets overhead resulting less energy consumption.

LSB: A Lightweight Scalable Blockchain for IoT security and anonymity

In recent years, Blockchain has attracted tremendous attention due to its salient features including auditability, immutability, security, and anonymity. Resulting from these salient features, blockchain has been applied in multiple non-monetary applications including the Internet of Things (IoT). However, blockchain is computationally expensive, has limited scalability and incurs significant bandwidth overheads and delays which are not suited for most IoT applications. In this paper, we propose a Lightweight Scalable blockchain (LSB) that is optimized for IoT requirements while also providing end-to-end security. Our blockchain instantiation achieves decentralization by forming an overlay network where high resource devices jointly manage the blockchain. The overlay is organized as distinct clusters to reduce overheads and the cluster heads are responsible for managing the public blockchain. We propose a Distributed Time-based Consensus algorithm (DTC) which reduces the mining processing overhead and delay. Distributed trust approach is employed by the cluster heads to progressively reduce the processing overhead for verifying new blocks. LSB incorporates a Distributed Throughput Management (DTM) algorithm which ensures that the blockchain throughput does not significantly deviate from the cumulative transaction load in the network. We explore our approach in a smart home setting as a representative example for broader IoT applications. Qualitative arguments demonstrate that our approach is resilient to several security attacks. Extensive simulations show that packet overhead and delay are decreased and blockchain scalability is increased compared to relevant baselines.

Implementation of optimal solution for network lifetime and energy consumption metrics using improved energy efficient LEACH protocol in MANET

In current scenarios MANET mainly focus on low power battery operated devices. Moreover in a MANET transmission of large data consumes more energy that affects the performance of network, energy consumption, throughput, end to end delay, and packet overhead. The sum of these parameter metrics measure must be taken into account to increase the life-time and network energy efficiency. The main constraint in WSN is due to the restricted power in a node, which cannot be substituted. The node senses the data and it is moved towards the sink. This action of data movement needs to be efficient and the usage of battery in the sensor node requires to be efficiently employed to improve the network lifetime. The development of the energy efficient algorithms is of primary concern in the research arena of MANET. In any network, most of the routing protocols are focused directly to collect and bifurcate the large data for long distance communication. The prime goal of this research focused to identifies and survey more suitable routing protocol for MANET. That consumed less energy and increase life time of network. In this paper the author made on attempt on improved energy efficient LEACH protocol for MANET to reduce the energy dissipation that to life time of the network during the data transmission between source nodes and destination nodes.

A generic algorithmic protocol approaches to improve network life time and energy efficient using combined genetic algorithm with simulated annealing in MANET

PurposeIn the present networking scenarios, MANETs mainly focus on reducing the consumed power of battery-operated devices. The transmission of huge data in MANETs is responsible for greater energy usage, thereby affecting the parameter metrics network performance, throughput, packet overhead, energy consumption in addition to end-to-end delay. The effective parameter metric measures are implemented and made to enhance the network lifetime and energy efficiency. The transmission of data for at any node should be more efficient and also the battery of sensor node battery usage should be proficiently applied to increase the network lifetime. The paper aims to discuss these issues.Design/methodology/approachIn this research work for the MANETs, the improvement of energy-efficient algorithms in MANETs is necessary. The main aim of this research is to develop an efficient and accurate routing protocol for MANET that consumes less energy, with an increased network lifetime.FindingsIn this paper, the author has made an attempt to improve the genetic algorithm with simulated annealing (GASA) for MANET to minimize the energy consumption of 0.851 percent and to enhance the network lifetime of 61.35 percent.Originality/valueIn this paper, the author has made an attempt to improve the GASA for MANET to minimize the energy consumption of 0.851 percent and to enhance the network lifetime of 61.35 percent.

SPB: A Secure Private Blockchain-Based Solution for Distributed Energy Trading

Blockchain is increasingly being used to provide a distributed, secure, trusted, and private framework for energy trading in smart grids. However, existing solutions suffer from a lack of privacy, processing and packet overheads, and reliance on trusted third party (TTP) to secure the trade. To address these challenges, we propose a secure private blockchain (SPB) framework. SPB enables energy producers and consumers to directly negotiate the energy price. To reduce the associated overheads, we propose a routing method which routes packets based on the destination public key (PK). SPB eliminates the reliance on TTP to ensure both energy producer and consumer commit to their obligations by introducing atomic meta-transactions. The latter consists of two transactions: first the consumer generates a CTP transaction, committing to pay the energy price to the producer. On receipt of the energy, the smart meter of the consumer generates an energy receipt confirmation (ERC) which triggers a smart contract to transfer the committed price in CTP to the energy producer. To verify that the ERC is generated by a genuine smart meter, SPB supports authentication of anonymous smart meters to prevent malicious nodes from linking ERC transactions and thus enhance the user privacy. Qualitative security analysis shows the resilience of SPB against a range of attacks. Implementation results demonstrate that SPB reduces monetary cost and delay compared to existing solutions.

Energy efficient clustering and secure routing using reinforcement learning for three‐dimensional mobile ad hoc networks

Mobile ad hoc network (MANET) comprises a set of wireless nodes that provide communication benefits for users without any access points or centralised control. Owing to the highly dynamic wireless nature, MANET has many challenges such as limited energy, packet loss, and security. Therefore, a special energy efficient and secure routing protocol is of great importance in MANETs. In this study, three-dimensional (3D) MANET is considered where mobile nodes are distributed and moved within 3D space. The energy consumption (EC) and throughput increases in the 3D environment compared to 2D. Initially, cell clustering is performed by node residual energy, distance, and mobility in which a cumulative fitness value is computed using the firefly algorithm (firefly with cyclic randomisation algorithm). Then introduced a novel routing scheme referred to as two-hop relay selection by multi-metric based reinforcement learning algorithm. Multi-metric considered for routing is the following: node delay, node distance, node stability, node mobility, and node degree. Before transmission, data packets are encrypted based on the robust cipher watermarking scheme (watermark generation, embedding, and extraction). An extensive simulation is conducted using NS3.26 under a 3D environment in terms of packet delivery ratio, end-to-end delay, routing packet overhead, EC, and security strength.

Predictive geographic multicast routing protocol in flying ad hoc networks

In the past decades, the unmanned aerial systems have been utilized only for military operations. However, recently, the potential uses and applicability of unmanned aerial vehicles (commonly known as drones) in civilian application domains are becoming a fast-growing phenomenon. A flying ad hoc network is a wireless ad hoc network specifically designed for the communication of unmanned aerial vehicles. Multicast routing is one of the vital aspects in wireless ad hoc networks. Using multicast transmission approaches, flying ad hoc network applications may need to send the same message to a specific group of flying nodes. The multicast communication approaches can benefit flying ad hoc network applications in conserving the scarce resources of flying nodes. Research works have been proposed to tackle the challenges in multicast routing with multi-hop communication in ad hoc network environments. Nevertheless, the conventional multicast routing mechanisms incur excessive control message overhead when a large number of nodes experience frequent topological changes. A scalable geographic multicast routing mechanism, which specially require localized operation and reduced control packet overhead, is necessary. Multicast routing in flying ad hoc networks is extremely challenging because of the dynamic topology changes and network disconnection resulted from frequent mobility of nodes. In this article, we present and implement a scalable and predictive geographic multicast routing mechanism in flying ad hoc networks. In uniform and random deployment scenarios, the MATLAB-based evaluation result has revealed that when the communication range increases, the probability of finding one-hop predicted forwarders to reach multicast destinations also increases. The implementation of scalable and predictive geographic multicast routing mechanism in flying ad hoc network is done using Optimizing Network Engineering Tools Modeler 16.0. We have added the scalable and predictive geographic multicast routing mechanism in flying ad hoc network as a new routing scheme in the Mobile Ad hoc Network routing protocol groups of the Optimizing Network Engineering Tools Modeler. Then, the performance of scalable and predictive geographic multicast routing mechanism in flying ad hoc network is compared with two of the existing Mobile Ad hoc Network routing protocols (Geographic Routing Protocol and Dynamic Source Routing). Eventually, we present two instance scenarios regarding the integration of scalable and predictive geographic multicast routing mechanism in flying ad hoc network scheme in the Internet of Things platform.