Average Packet Delivery Delay Research Articles

Controlled Redundancy Schemes in Collaborative IoT by Smartphones

Internet of Things (IoT) operators tend to utilize smartphones in establishing reliable and sustainable communication links for their services. Collaborative IoT (CIoT) is a concept where the smartphones are utilized as a mobile gateway (GW) that connects sensors to the cloud. CIoT scheme has many challenges including the redundancy in transmissions of sensor readings. As the same sensor data is sent by many uncoordinated users, this leads to consuming network resources and degrading Quality of Services (QoS) for primary users. This paper has three main contributions: First, four metrics for evaluating redundancy and its effects in CIoT network are defined and explained. Second, a novel redundancy control scheme (Fresh-List redundancy control) is proposed and evaluated against well-known probabilistic transmission schemes using the proposed metrics. Finally, a simulation setup for CIoT environment is implemented using a computer equipped with Bluetooth network card. The setup simulates many CIoT users with different scenarios of random entry, departure, and dwelling times. Results show the ability of Fresh-List method to reduce redundancy order and increase efficiency compared to non-controlled redundancy. It is also shown that a mix between probabilistic transmission and Fresh-List methods provide even more better redundancy control at an acceptable increase at the average packet delivery delay.

An Enhancement for IEEE 802.11p to Provision Quality of Service with Context Aware Channel Access for the Forward Collision Avoidance Application in Vehicular Ad Hoc Network.

Key application of an intelligent transportation system is traffic safety, and it provides driver assistance. Safety messages are of two types, beacon messages and event messages. The nodes broadcast these messages in the vehicular networks. The system must rely on a robust medium access control (MAC) protocol to support delivery of safety messages. The standard medium access scheme that is used in vehicular networks to provide service differentiation to support various applications is IEEE 802.11p. The emergency event messages should reach the drivers immediately to take necessary steps to avoid casualties on the road. In IEEE 802.11p, both of these messages are considered with the same priority so that no separate differentiation is created. The proposed work focuses on improving the quality of service for forward collision warning applications in intelligent transportation systems. The scheme proposes a priority-based cooperative MAC (PCMAC) for channel access that works on the context of information. Simulation and analytical results validate improved performance of PCMAC in terms of packet delivery ratio, throughput, and average packet delivery delay, as compared with other eminent MAC protocols. The simulation results show that it has a 9% higher improvement in throughput than IEEE 802.11p and has better performance in the increasing number of emergency messages.

MCA-MAC: Modified Cooperative Access MAC Protocol in Wireless Sensor Networks

Throughput, energy efficiency and average packet delivery delay are some of the most crucial metrics that should be considered in Wireless Sensor Networks (WSNs). This paper proposes a modified Medium Access Control (MAC) protocol for WSNs, called (MCA-MAC). MCA-MAC aims to improve the previous metrics and thus the overall performance of WSNs through using cooperative communication. It enables source nodes from using intermediate nodes as relays to send their data through them to the access point. MCA-MAC protocol is also acting as a cross layer protocol where the best end-to-end path between the source and destination is found through an efficient algorithm. Mathematical analysis demonstrates that MCA-MAC protocol can determine the optimal relay node that has the minimum transmission time for the given source-destination pair. Using Multi-Paradigm Programming Language (MATLAB) simulation environment, this paper estimates MCA-MAC protocol performance in terms of system throughput, energy efficiency and delay. The results show that MCA-MAC protocol outperforms the existing scheme called Throughput and Energy aware Cooperative MAC protocol (TEC-MAC) protocol under ideal and dynamic channel conditions. Under ideal conditions, MCA-MAC protocol achieved throughput, and energy efficiency improvements of 12%, and 50% respectively, more than TEC-MAC protocol. While the packet delay through using MCA-MAC has been decreased by about 48% less than TEC-MAC protocol.

A priority-aware lightweight secure sensing model for body area networks with clinical healthcare applications in Internet of Things

In this study, a priority-aware lightweight secure sensing model for body area networks with clinical healthcare applications in internet of things is proposed. In this model, patients’ data is labeled according to the proposed prioritizing mechanism. This provides a prioritized and delay-less service in the server side for the patients with critical conditions. In the proposed model, the sensed data is monitored in a real time way to calculate its sparsity level. Then, the ,calculated sparsity level is used to determine the number of required measurements for data sampling. This allows to sample the data with the number of measurements proportional to the sparsity level and information content of the data. Moreover, the particular design of the measurement matrix causes the aggregated data to be encrypted and its security be guaranteed. Simulation results show that compared to its counterpart schemes, the proposed sensing model not only provides security but also reduces the average energy consumption of the sensor nodes and the average packet delivery delay. This improvement originates from the reduction of the number of required bits for transferring the sensed data and is due to the consideration of the information content and sparsity level variation in the sensed data.

RETRACTED ARTICLE: K-Partitioned Smallest Distance Mining Tree for Path Optimation in Wireless Sensor Network

In wireless sensor networks (WSN), energy efficiency is an important issue, since the sensor nodes act as both data originator and data router. The sink functionality typically includes mining and sensing data from sensors in the network via multihop relays performing data processing. The nodes which are closer to the sink have to take more substantial traffic load consequently reduce their energy quickly leading to energy hole around the sink. Then the energy hole may cause failure in the sensor network and create large coverage hole. Sink repositioning can be performed using multiple sink deployment and sink mobility. Relocating or repositioning the sink is very challenging during the regular network operation. It is challenging in a multi-hop network environment to find an optimal location. Most of the existing localization solutions had low accuracy in congested situations and did not consider the resource limitations of WSN. To rectify the issues of sink repositioning, this work presents a K-partitioned smallest distance tree (k-PSDT) utilizing the ideal scan for setting an ideal number of sinks in sensor networks. At first, the quantity of sinks is resolved utilizing the ideal sink algorithm fulfilling the h-jump requirement. k-PSDT is developed for situating numerous sink nodes and setting up the courses. In the wake of deciding the ideal number of sink positions and directing, best sink reposition is chosen by ideal pursuit technique. Sink development is finished by utilizing the canny development, and it confines the sinks developments while keeping up their bearing to the ideal positions. The performance of the new techniques is implemented using network simulator (NS2). Simulation results show that the proposed technology do the better performance as compared to the existing method regarding the metrics such as average packet delivery ratio, delay, and energy consumption.

A proportional fairness scheduling for wireless sensor networks

A packet scheduling algorithm used for wireless sensor network meeting the proportional fairness principle is proposed. Based on the weighted round robin (WRR) strategy, the proposed scheduling algorithm allocates different service quota to different traffics according to their average packet arrival rates to guarantee the proportion fairness on the average packet delivery delay and the average packet loss ratio. Since the scheduling algorithm does not perform the high-load operations such as adding time stamps, sorting and so on, it can be implemented easily and is suitable for resource-limited WSN. The proposed algorithm is tested in a wireless sensor network. The performance shows that the scheduling algorithm can guarantee the average packet delivery delay proportional fairness when the average packet delivery delay is used as the performance metric and the average packet loss ratio proportional fairness is realized when all the queues are overflowing and the average packet loss ratio is used as the performance metric.

On the Throughput-Delay Tradeoff in Georouting Networks

We study the scaling properties of a georouting scheme in a wireless multi-hop network of $n$ mobile nodes. Our aim is to increase the network capacity quasi-linearly with $n$ , while keeping the average delay bounded. In our model, we consider mobile nodes moving according to an independent identically distributed random walk with velocity $v$ and transmitting packets to randomly chosen fixed and known destinations. The average packet delivery delay of our scheme is of order $1/v$ , and it achieves network capacity of order $({n}/{\log n\log \log n})$ . This shows a practical throughput-delay tradeoff, in particular when compared with the seminal result of Gupta and Kumar, which shows network capacity of order ${(n/\log n)}^{1/2}$ and negligible delay and the groundbreaking result of Grossglauser and Tse, which achieves network capacity of order $n$ but with an average delay of order $\sqrt {n}/v$ . The foundation of our improved capacity and delay tradeoff relies on the fact that we use a mobility model that contains straight-line segments, a model that we consider more realistic than classic Brownian motions. We confirm the generality of our analytical results using simulations under various interference models.

Improving AODV Route Recovery Mechanisms with Connectivity and Particle Swarm Optimization DOI: 10.14209/jcis.2012.3

This paper proposes a new function for the Ad Hoc On-Demand Distance Vector (AODV) algorithm using the connectivity concept to decide between source and local repair when a link break occurs. Besides, we used a Computational Intelligence algorithm, called Particle Swarm Optimization (PSO), which enables to find candidate solutions in all considered search space in order to reduce average data packet delivery delay sent over the network. The performance of the original AODV protocol, according to its Request for Comments (RFC), is compared with this new implemented approach, called here as AODVPSO. Three metrics were used to evaluate the performance of the algorithm: throughput (as data packet delivery fraction), routing overhead and average data packet delivery delay. We observed that the AODV-PSO outperformed the original AODV protocol in the scenarios studied in this paper.

Evaluation of the Average Packet Delivery Delay in Highly-Disrupted Networks: The DTN and IP-like Protocol Cases

Delay/Disruption-Tolerant Networking (DTN) represents an innovative communication paradigm that enables the communication over Intermittently-Connected Networks (ICNs). ICNs are characterized by unpredictable or scheduled contacts among nodes, high latency, and high bit error rates. DTNs, unlike TCP/IP protocols, make use of store-and-forward techniques in order to cope with intermittent link issues. In this letter, a simple model is proposed to compute the average packet delivery delay in ICNs. Both the IP-like paradigm used by traditional TCP/IP protocols and DTN are considered. The results provide theoretical insights into the applications of these two approaches to ICNs. Numerical results and simulations are presented, too.

Benefits of Network Coding for Unicast Application in Disruption-Tolerant Networks

In this paper, we investigate the benefits of applying a form of network coding known as random linear coding (RLC) to unicast applications in disruption-tolerant networks (DTNs). Under RLC, nodes store and forward random linear combinations of packets as they encounter each other. For the case of a single group of packets originating from the same source and destined for the same destination, we prove a lower bound on the probability that the RLC scheme achieves the minimum time to deliver the group of packets. Although RLC significantly reduces group delivery delays, it fares worse in terms of average packet delivery delay and network transmissions. When replication control is employed, RLC schemes reduce group delivery delays without increasing the number of transmissions. In general, the benefits achieved by RLC are more significant under stringent resource (bandwidth and buffer) constraints, limited signaling, highly dynamic networks, and when applied to packets in the same flow. For more practical settings with multiple continuous flows in the network, we show the importance of deploying RLC schemes with a carefully tuned replication control in order to achieve reduction in average delay, which is observed to be as large as 20% when buffer space is constrained.

Impact of source counter on routing performance in resource constrained DTNs

We study routing schemes for Disruption Tolerant Networks (DTNs) where transmission bandwidth is scarce. In such a setting, a key issue is how to schedule the transmission of packets under limited bandwidth to optimize performance. Such a scheduling consists of source control (i.e., source nodes choosing a routing scheme) and the local transmission scheduling performed by each node. Existing works typically focus on transmission scheduling and buffer management aspects, but due to theoretical and practical difficulties, only heuristics have been proposed. In this work, we explore an alternative way to improve DTN routing performance via source control. We first show through simulation that for spray-and-wait routing scheme where the source node specifies the maximum allowed number of copies of a packet in the network, there exists an optimal counter value that achieves the minimum network-wide average packet delivery delay. Then as a first step towards understanding multi-hop multi-copy DTN routing schemes such as spray-and-wait scheme, we perform modeling study of two-hop single-copy scheme and two-hop multi-copy scheme under various transmission scheduling schemes, via queuing network analysis and continuous time Markov chain model analysis. Our modeling analysis provides insights into the impact of source counter on routing performance and further suggests the existence of an optimal counter value. Relying on the insights gained via simulations and modeling studies, we propose an adaptive scheme where nodes adjust their counter values to achieve minimum packet delivery delay, in a distributed and asynchronous fashion. Simulations demonstrate the effectiveness of our scheme and suggest the potential of exploring this rich area for improving DTN routing performance.

Comparative Analysis of AODV Route Recovery Mechanisms in Wireless Ad Hoc Networks

This work investigates the behavior of the Ad Hoc On-Demand Distance Vector (AODV) routing protocol in situations of link failures due to the mobility of nodes in wireless ad hoc networks. The AODV performance is compared when the failure repair happens locally from the node before the link break to the case where the repair is performed from the source node for four metrics: throughput (as packet delivery fraction), overhead, average packet delivery delay and average hop count, the last being only used to validate throughput and delay analyses. From the scenarios studied, it was observed that the throughput and delay for source repair have better performance, while overhead was better for local repair in sparse networks.

Hotspot Preventing Routing algorithm for delay-sensitive applications of in vivo biomedical sensor networks

Networks of implanted biomedical sensor nodes promise to give a new direction to medical research. The in vivo sensor nodes collect desired biometric data and communicate the data wirelessly to a base-station through a multi-hop network. The wireless communication produces heat, leading to a rise in the temperature of the nodes. A high temperature of the in vivo nodes for a prolonged period is not desired as it might damage the surrounding tissues. Medical applications are also often delay-sensitive. In this paper, we propose Hotspot Preventing Routing (HPR) algorithm that performs much better than the shortest hop routing algorithm and the previously proposed Thermal Aware Routing Algorithm (TARA) in terms of preventing the formation of hotspots and reducing the average packet delivery delay by dynamically adapting to the network load. The simulation results presented also show that the HPR algorithm is highly scalable, increases the operational life of the network and helps reduce the number of packets dropped.

Integrating service discovery with routing and session management for ad-hoc networks

In this paper, we propose GSR: a new routing and session management protocol for ad-hoc networks as an integral part of a service discovery infrastructure. Traditional approaches place routing at a layer below service discovery. While this distinction is appropriate for wired networked services, we argue that in ad-hoc networks this layering is not as meaningful and show that integrating routing with discovery infrastructure increases system efficiency. Central to our protocol is the idea of reusing the path created by the combination of a service discovery request and a service advertisement for data transmission. This precludes the need to use separate routing and discovery protocols. GSR also combines transport layer features and provides end-to-end session management that detects disconnections, link and node failures and enables service-centric session redirection to handle failures. This enables GSR to accommodate service-centric routing apart from the traditional node-centric routing. We compare GSR with AODV in terms of packet delivery ratio, response time and average number of hops traveled by service requests as well as data. GSR achieves better packet delivery ratio with a minor increase of the average packet delivery delay.