Packet Transmission Time Research Articles

Random Access: Packet-Based or Connection-Based?

Different from the conventional packet-based random access schemes where each data packet needs to contend for channel access, with connection-based random access, a connection is first established before data packet transmission. Despite the consensus that there exists a critical threshold of the data packet transmission time, only above which establishing a connection is beneficial, characterization of such a threshold has received little attention. In this paper, a comparative study will be presented on the optimal throughput performance of the packet-based random access and the connection-based random access to characterize criteria for beneficial connection establishment. Based on a unified channel-centric model, explicit expressions of the maximum effective throughput are obtained for both packet-based and connection-based Aloha and Carrier Sense Multiple Access (CSMA). The analysis shows that whether connection establishment is beneficial crucially depends on the sensing capability of nodes. The threshold of data packet transmission time with Aloha is found to be much lower than that with CSMA, indicating that the throughput gain brought by connection establishment is more significant when sensing is absent. The analysis sheds important light on the access design of machine-to-machine (M2M) communications.

Advances in Position Based Routing Towards ITS Enabled FoG-Oriented VANET–A Survey

With the rapid growth in connected vehicles and related innovative applications, it is getting keen interest among the researchers. Vehicular ad-hoc networks (VANETs) comprise of interconnected vehicles with sensing capabilities to exchange traffic, weather and emergency information. Intelligent transportation system (ITS) supports better coordination among vehicles and in providing reliable services. In VANET, topology is dynamic due to the high mobility of vehicles, therefore, the existing topology-based schemes are not suitable. In this paper, we have explored position based routing (PBR) protocols for VANETs by presenting a taxonomy. The existing survey papers have focused on PBR schemes but we have further focused on considering PBR for the city environment along with connectivity aware routing schemes. Moreover, linear programming, genetic algorithms, and regression-based schemes are also included. To further evaluate the strengths and weaknesses of PBR schemes, a categorical evaluation of different architectures, path strategies, and carry-forward strategies are presented. Currently, no architecture is presented for FoG-oriented VANET using parked vehicles as guards for anchor points or junctions. To fill this aspiring demand, we have presented a FoG-oriented VANET architecture that can support the PBR by utilizing road junctions for path selection. It also involves the vehicles in the parking area for packet transmission. Further, we have proposed to use parked vehicles near junction as an option for selecting guarding vehicle along with ITS as well. It reduces the probability of extensive carry forward-based communication due to the absence of guarding nodes. The records at parked vehicles can be upgraded at neighboring parked vehicles as well during the beaconing or exchange of data messages. The architecture supports better packet delivery ratios, end-to-end delay, transmission time, and communication cost. Moreover, opportunities and challenges of the proposed architecture are also explored to attract researchers toward this area of research.

A QoS‐aware energy‐efficient memetic flower pollination routing protocol for underwater acoustic sensor network

SummaryHuge number of applications ranging from commercial, scientific, to military applications are recently emerging in Underwater Acoustic Sensor Networks (UWASNs). The major research challenges associated with UWASN includes high energy consumption, large propagation delay, and low available bandwidth due to its acoustic medium. In this paper, Quality of Service (QoS)–aware Energy‐Efficient Memetic Flower Pollination Routing (MFPR) has been proposed to identify optimal energy‐efficient routing coverage set in underwater. The fitness function for MFP is formulated for Vector‐Based Forward (VBF) protocol that allocates the reliable routing path for source node within its routing pipe. The proposed algorithm works in two stages, where Memetic algorithm is responsible for identifying the optimal route cover set and FPA is responsible for switching between local and global pollination to forward packets in reliable path. In addition, the proposed work considers Grant Free Pattern Division Multiple Access (GFPDMA) packets for routing purpose, since it reduces the latency at the time of packet transmission. Hence, this forms QoS‐aware routing in UWASN. The proposed MFPR is evaluated in UWASN environment that runs applications with varied QoS requirements. The simulation result shows that the novel proposed method improves the performance of UWASN in terms of high network lifetime, less end‐to‐end delay, high energy consumption, high packet delivery ratio, and high throughput than existing Quality‐of‐Service–Aware Evolutionary Routing Protocol (QERP) and Balanced and Multi‐objective Optimized Opportunistic Routing (BMOOR) models.

Cost Optimization for On-Demand Content Streaming in IoV Networks With Two Service Tiers

On-demand streaming of high-quality video content is a widely anticipated vehicular infotainment service. How to reduce the cost of content streaming is a primary concern of the service providers, but is still an underinvestigated subject in the literature. This paper proposes an integrated mobile streaming and caching scheme that jointly leverages two communication service tiers and on-board caching resource for cost reduction. Algorithms are presented to achieve optimal buffering at the session level and optimal caching at the device level. An analytical framework is established to characterize the average cost as a function of the streaming rate in a large scale network. Numerical results demonstrate how the “cost-streaming rate” function changes with vehicle density, network congestion level, content length, and average packet transmission time. We learn an important insight that there is a minimum cost threshold even when the streaming rate approaches zero. We also show that the proposed protocol can effectively reduce the overall cost when the network is not congested. Our findings can provide useful guidelines for the business planning and operation of vehicular content streaming services.

A Queuing Delay Utilization Scheme for On-Path Service Aggregation in Services-Oriented Computing Networks

In services-oriented computing networks, packets in the process of routing to a data center must wait for a sufficient amount of data before service aggregation to reduce the network transmission load. However, packets must be uploaded to the data center as soon as possible to reduce delay. With the exponential growth in the number of IoT connected devices, the wait time for packets is longer at routers due to massive amounts of data, which causes a large queuing delay. If this queuing time can be utilized for service aggregation in a service-oriented computing network, the network performance will be substantially improved. Therefore, a queuing delay utilization scheme for on-path service aggregation (SAQD) is proposed in this paper. This scheme has the following innovations: 1) SAQD fully utilizes the queuing delay of packets for service aggregation, which can effectively reduce the transmission volume and communication overhead. Based on the proposed service aggregation algorithm, packets are divided into forwarding packets and aggregating packets, and the service aggregation of aggregating packets is completed by utilizing the transmission time of forwarding packets to ensure that the transmission volume and communication overhead are effectively reduced without additional latency. 2) SAQD can effectively alleviate the traffic pressure of the data center and balance the workload of routers. By the service aggregation and intranet cache of routers, some requests for the data center can be handled by routers, which reduces the traffic pressure of the data center, especially in the peak period. Compared with conventional schemes, the experimental results demonstrate that SAQD reduces the workload of the data center by 55.8%–66.26% and provides users with a better quality of experience by reducing the request response delay by 31.33%~51.41%.

Analysis of the queue buffer transmitting device through the channel multiple access with guaranteed delivery of packets

The article deals with the modeling of the process of data transmission from sensors in the industrial production of vinyl acetate. The data packets are transferred from the sensors to the control system and the control effect is directed to the temperature regulators of the gas-vapor mixture, the vapor pressure of the refrigerant. oxygen consumption and return acetic acid consumption by industrial Ethernet protocols over a multiple access channel with carrier control and detection of CSMA / CD collisions (Carrier Sense Multiple Access with Collision Detection). The main bottleneck of the system is a limited sensor transmission buffer, which can cause data loss when it overflows, and due to improper regulatory impact. Mathematical modeling of the transmission process was carried out according to the scheme of the Markov process with continuous time and discrete states. The transmitter transmission buffer model was constructed on the basis of the state graph, each state is displayed by two elements [i, j]: i is the number of packets in the queue waiting to be sent; j - number of sent packets pending confirmation. A column of Kolmogorov equations was constructed. The solution was carried out numerically using the Maple mathematical package (Runge-Kutta-Felberg method 4-5th order). Based on the data obtained after modeling, we can conclude that the average packet transmission time, the number of lost packets with different bandwidth and channel load transfer. The adequacy of the model was confirmed with the help of experimental data, it was tested by the Fisher criterion, and the hypothesis at the level of significance of general variances was adopted. The model allows calculating the static and dynamic characteristics of the queue on a network device (they are important for calculating the functioning of the network in real time) systems for monitoring and controlling the production of vinyl acetate

A Privacy Preservation Secure Cross Layer Protocol Design for IoT Based Wireless Body Area Networks Using ECDSA Framework.

Internet of Things (IoT) provides the collection of devices in different applications in which Wireless Body Area Network (WBAN) is placed an crucial role. The WBAN is a wireless sensor network consisting of sensor nodes that is collected from IoT which is implanted in the human body to remotely monitor the patient's physiological signals without affecting their routine work. During emergency situations or life-threatening situations there is a need for a better performance to deliver the actual data with an efficient transmission and there is still a challenge in efficient remote monitoring. So, in this paper an application for cross layer protocol design architecture of Elliptic Curve Digital Signature Algorithm (ECDSA) has been proposed. It replaces the protocol architecture of WBAN (IEEE 802.15.6), WMAN (IEEE 802.16), and 3G, WLAN (IEEE 802.11) or wired networks. The lightweight secure system provides secure data transmission and access control mechanisms by using ECDA-based proxy signature algorithm. The efficiency of the system is implemented using simulation models that were developed using NS-2, and the results obtained shows an optimum solution in terms of delay, PDR, throughput, jitter, packet transmission time, dropping ratio and packet delivery. The viability of the methodology proposed is illustrated by the response.

Position and Velocity Estimation of a Non-Cooperative Source From Asynchronous Packet Arrival Time Measurements

We tackle the problem of identifying the trajectory of a moving radio source from Time of Arrival (TOA) measurements collected by a set of cooperating receivers. The considered system is completely asynchronous: nodes clocks are affected by unknown time and frequency offsets, and no control is exerted over packet transmission times. In the proposed solution, the receiver clock offset terms are estimated from TOA measurements on packets originated by non-cooperative reference transmitters, possibly but not necessarily coincidental with reference receivers. Transmission time ambiguity is resolved by exploiting the redundancy associated to the reception of the same packet at multiple receivers. A distinguishing feature of the proposed solution is that it seeks to identify the parameters of the trajectory as a whole, rather than the individual points of transmission as done in traditional point-based approaches. This allows the effective exploitation of TOA measurements collected in lossy scenarios, where the generic packet is received by a smaller subset of the available receivers (at least two). For the problem at hand, we provide distinct estimators based on TOA and Time-Difference of Arrival (TDOA) and prove their equivalence. Numerical results from simulations and from a real WiFi testbed are provided to validate the effectiveness of the proposed method.

A new energy based power aware routing method for MANETs

A mobile ad-hoc network (MANET) is a self-configuring and self-directed functioning system that operates without infrastructure and rapidly deploys in a network. The MANET does not need centralized administration. It contains a mobile node for wireless transmission and MANETs that can be established anywhere. In addition, any instance of the ad-hoc network is effective since it is capable of eliminating the complexity of central admission and infrastructure. The MANET is widely in use in many fields such as military applications, mobile communication, and emergency situations. Energy consumption is an important issue in MANET because the mobile nodes are battery powered. In this paper, a dynamic energy ad-hoc on-demand distance vector routing protocol (DE-AODV) is proposed to minimize the packet delay, maximize the network lifetime, and reduce the energy consumption. The increase in node energy and dynamic supply of external energy is through a battery. The energy mechanisms consider whether the mobile nodes are in sleep, active, or transmit mode. The DE-AODV protocol is used to find out the selection of nodes which are energy-efficient and trustworthy to select the shortest route path from source to destination. The routing protocols use the external battery when there is a chance of link failure during packet transmission time. The proposed DE-AODV routing protocol provides efficient output when compared with other existing techniques. Simulation results show that the proposed system achieves better performance when compared with previous protocols in terms of packet delivery ratio, network stability rate, end-to-end delay of packets, end-to-end transmission, and throughput.

IW-MAC: a invite and wait MAC protocol for power efficient wireless sensor networks

Energy conservation in MAC protocol is a focal point for researchers for a long time. One of the main reasons is that sensor nodes are left unmonitored for a phase of time with only the inbuilt battery as the sole source of energy power. It’s the onus of MAC protocol to efficiently consume this available source of energy. It must be carefully designed in a way there is no wastage of energy source. Control packets in wireless sensor networks not only degrade packet transmission time but also suck out energy from the energy source built in the wireless sensor nodes. When the control packets collide and there is a need resend the control packets it adds up to further energy loss. A better energy efficient MAC protocol must aim at reducing the adoption of control packets following around the network instead give way for data packets to flow around. The energy efficient deteriorates when the nodes undergo too many overhead steps in MAC protocol thereby transmitting lesser packets in given time. In this paper a new protocol namely IWMAC-invite and wait MAC protocol which leverages efficient use of battery power in wireless sensor nodes. With IWMAC the nodes are enabled to transmit minimal control packets and deliver more data packets in a given time. The energy of the nodes are used primarily in actual data transmissions rather than succumbing to overhead of control packets, channel reservation, back off which drains out the energy source in sensor nodes.

Evaluation of teletraffic queueing model under Burr type XII service distribution

Tele-traffic is related to internet and other complex telecommunications systems. They include packet sizes, inter-arrival times, download times and transmission times, among others. Such times are followed by heavy tailed distribution. In this concern, the study of special type of M/G/1 queueing model with Burr type XII distribution is proposed for applications in tele-traffic. The limiting distribution, expected waiting time and expected busy period time are derived by using conventional technique. Finally the computational performances are carried out for evaluating this model.

Secure medical data transmission by using collaborative neighbour based method in WBAN

Wireless body area network or body area sensor network is wearable device in human body. In online healthcare, transmitting of medical data from sensor node to destination, medical device is used with the member function. However, WBAN has faced many security issues and challenges when transmitting the data. Existing ECC secure key distribution methods are implemented, using this method the time is consumed, efficiency and security of data was discussed. ECC scheme implements for secure key distribution and data exchange. The proposed collaborative neighbour based method is used. Overall, the proposed method proves a better security in healthcare devices. Collaborative neighbour selection and time taken on packet forwarding from one point to another identify the presence of data being appended in the framework. The proposed framework includes enhancement to security and efficiency by forwarding the node information and performing the verification procedure based on the received packet to filter the false data. Extensive experiments and simulation results indicate that, in terms of bandwidth efficiency, packet transmission, network security and processing time, performs favourably compared to existing ECC mechanisms in wireless body area sensor network.

Secure medical data transmission by using collaborative neighbour based method in WBAN

Wireless body area network or body area sensor network is wearable device in human body. In online healthcare, transmitting of medical data from sensor node to destination, medical device is used with the member function. However, WBAN has faced many security issues and challenges when transmitting the data. Existing ECC secure key distribution methods are implemented, using this method the time is consumed, efficiency and security of data was discussed. ECC scheme implements for secure key distribution and data exchange. The proposed collaborative neighbour based method is used. Overall, the proposed method proves a better security in healthcare devices. Collaborative neighbour selection and time taken on packet forwarding from one point to another identify the presence of data being appended in the framework. The proposed framework includes enhancement to security and efficiency by forwarding the node information and performing the verification procedure based on the received packet to filter the false data. Extensive experiments and simulation results indicate that, in terms of bandwidth efficiency, packet transmission, network security and processing time, performs favourably compared to existing ECC mechanisms in wireless body area sensor network.

Botnet detection and feature analysis using backpropagation neural network with bio-inspired algorithms

Botnets has been the major type of cybercrime recently, the amount of infected computers gradually increasing each year. Many companies and schools are often troubled with problems, such as DDOS, phishing, spam, and stealing of personal data, because botnet is constantly changing its network structure, attack patterns and data transmission, making it more and more difficult to detect. In this paper, we proposed some new features to detect the botnet traffic, and we found the best solutions by using feature selection algorithm. These two methods are particle swarm optimisation and genetic algorithms, and by using backpropagation network as the classifier, we evaluate our subset feature on botnet detection that shows high detection rate, and we validate that own manufactured feature packet transmission time of regularity can be adopted, and the accuracy will change with the t-value.

A Polling-Based Traffic-Aware MAC Protocol for Centralized Full-Duplex Wireless Networks

Recent advances in self-interference cancellation techniques have enabled in-band full-duplex (IBFD) transmission, which can double ergodic capacity and reduce end-to-end delay. However, how to solve the channel contention problem in IBFD radios with inter-node interference and asymmetric traffic is still a challenge. This paper presents pFD-MAC, a novel polling-based traffic-aware medium access control (MAC) protocol for centralized full-duplex wireless networks. To solve the channel contention problem and fully utilize the channel resources under full-duplex mode, we first design a novel polling-based transmission mechanism and make comprehensive investigations on the effect of polling profile in full-duplex communication. By characterizing the inter-node interference into a directed non-conflict graph, we study the polling profile generation problem in which our objective is to minimize the packet transmission time. The problem is then theoretically formulated and proved to be NP-hard, which means it cannot be solved in polynomial time. Thus, we develop a heuristic traffic-aware algorithm and apply it to work with the packet transmission procedure in parallel. Full-duplex communication opportunities are highly exploited by parallelly organizing per-node upstream/downstream traffic according to the generated polling profile. Moreover, to achieve fairness without sacrificing throughput, deficit round robin algorithm has been applied with respect to the access time considering concurrent transmission time. Simulation results reveal that our proposed protocol can achieve improved performance in terms of throughput and transmission delay while maintaining fairness, compared with two state-of-the-art centralized MAC protocols.

Botnet detection and feature analysis using backpropagation neural network with bio-inspired algorithms

Botnets has been the major type of cybercrime recently, the amount of infected computers gradually increasing each year. Many companies and schools are often troubled with problems, such as DDOS, phishing, spam, and stealing of personal data, because botnet is constantly changing its network structure, attack patterns and data transmission, making it more and more difficult to detect. In this paper, we proposed some new features to detect the botnet traffic, and we found the best solutions by using feature selection algorithm. These two methods are particle swarm optimisation and genetic algorithms, and by using backpropagation network as the classifier, we evaluate our subset feature on botnet detection that shows high detection rate, and we validate that own manufactured feature packet transmission time of regularity can be adopted, and the accuracy will change with the t-value.

CSMA-Based Utility-Optimal Scheduling in the WLAN With a Full-Duplex Access Point

Full-duplex wireless communication has been recognized as an effective technique to improve the system throughput. This paper designs a CSMA-based utility-optimal scheduling scheme to fully explore the performance improvement brought by AP’s full-duplex capability. In particular, to keep the backwards compatibility of the legacy users, we allow users to compete to access the channel using the CSMA protocol in their uplink transmissions while let the AP select its downlink user to communicate with for completing the full-duplex transmission upon each uplink access. Moreover, to achieve the optimal system utility, we then formulate an optimization problem of maximizing the downlink aggregate utility subject to the uplink users’ data rate constraints. The formulated problem falls into a mixed integer nonlinear programming form, which is generally NP-hard to solve. To make the problem tractable, we divide it into user pairing and access-intensity adjustment subproblems. More specifically, we devise a user pairing criterion based on the signal-to-interference-plus-noise ratio to reduce the uplink-downlink interference, and adopt the Hungarian algorithm to find the best matching between uplink and downlink users. After that, we adjust the access-intensity of users (i.e., the ratio of the mean packet transmission time to the mean backoff time) to maximize the downlink aggregate utility based on the geometric programming. Simulation results are presented to evaluate the performance of our scheduling design and demonstrate the downlink aggregate utility improvement compared to other scheduling schemes in full-duplex WLANs.

Physical Layer Design of High-Performance Wireless Transmission for Critical Control Applications

The next generations of industrial control systems will require high-performance wireless networks (named WirelessHP) able to provide extremely low latency, ultrahigh reliability, and high data rates. The current strategy toward the realization of industrial wireless networks relies on adopting the bottom layers of general purpose wireless standards and customizing only the upper layers. In this paper, a new bottom-up approach is proposed through the realization of a WirelessHP physical layer specifically targeted at reducing the communication latency through the minimization of packet transmission time. Theoretical analysis shows that the proposed design allows a substantial reduction in packet transmission time, down to 1 $\mu$ s, with respect to the general purpose IEEE 802.11 physical layer. The design is validated by an experimental demonstrator, which shows that reliable communications up to 20 m range can be established with the proposed physical layer.

Update or Wait: How to Keep Your Data Fresh

In this paper, we study how to optimally manage the freshness of information updates sent from a source node to a destination via a channel. A proper metric for data freshness at the destination is the age-of-information, or simply age, which is defined as how old the freshest received update is, since the moment that this update was generated at the source node (e.g., a sensor). A reasonable update policy is the zero-wait policy, i.e., the source node submits a fresh update once the previous update is delivered, which achieves the maximum throughput and the minimum delay. Surprisingly, this zero-wait policy does not always minimize the age. This counter-intuitive phenomenon motivates us to study how to optimally control information updates to keep the data fresh and to understand when the zero-wait policy is optimal. We introduce a general age penalty function to characterize the level of dissatisfaction on data staleness and formulate the average age penalty minimization problem as a constrained semi-Markov decision problem with an uncountable state space. We develop efficient algorithms to find the optimal update policy among all causal policies and establish sufficient and necessary conditions for the optimality of the zero-wait policy. Our investigation shows that the zero-wait policy is far from the optimum if: 1) the age penalty function grows quickly with respect to the age; 2) the packet transmission times over the channel are positively correlated over time; or 3) the packet transmission times are highly random (e.g., following a heavy-tail distribution).

Further Results on Extended Delivery Time for Secondary Packet Transmission

Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave cognitive implementation, secondary transmission may be interrupted by primary transmission. To facilitate the packet delay analysis of such secondary transmission, we study the extended delivery time of secondary packet transmission. In particular, we derive the exact distribution function of extended delivery time of a fixed-size secondary packet with non-work-preserving strategy, where interrupted packets must be repeated. We also analyze the effect of imperfect periodic sensing, i.e., the secondary user periodically senses the spectrum for availability, with a chance of missing an available channel on a certain sensing attempt. These results complement previous work on work-preserving strategy with perfect sensing. Selected numerical and simulation results are presented for verifying the mathematical formulation.