Quality of experience aware network selection model for service provisioning in heterogeneous network

Heterogeneous wireless networks (HWNs) are capable of integrating the different radio access technologies that make it possible to connect mobile users based on the performance parameters. Further quality of service (QoS) is one of the major topics for HWNs, moreover existing radio access technology (RAT) methodology are designed to provide network QoS criteria. However, limited work has been carried out for the RAT selection mechanism considering user QoS preference and existing models are developed based on the multi-mode terminal under a given minimal density network. For overcoming research issues this paper present quality of experience (QoE) RAT (QOE-RAT) selection methodology, incorporating both network performance criteria and user preference considering multiple call and multi-mode HWNs environment. First, this paper presents fuzzy preference aware weight (FPAW) and multi-mode terminal preference aware TOPSIS (MMTPA-TOPSIS) for choosing the best RAT for gaining multi-services. Experiment outcomes show the QOE-RAT selection method achieves much superior packet transmission outcomes when compared with state-of-art Rat selection methodologies.

An Enhanced Packet Transmission Framework for Handling Real Time Burst Traffic in Wireless Sensor Networks

Congestion control for real time traffic is an important network measure to be handled in case of repeated event triggers, continuous packet re-transmissions, node interference, node deaths and node failures in Wireless Sensor Networks (WSNs). Network modelling for transmission of packets from source node to sink using probabilistic M/Pareto and Poisson processes have been examined in the past. The existing methodologies are deficit in designing a queuing framework considering other network parameters such as energy consumption and delay for alleviating congestion and thereby efficiently routing packets to sink by reducing packet drops. To overcome this fall back, a Minimum Weight Estimation for Mitigating Congestion during Real Time Burst Traffic (MWCBT) framework is proposed. This gives a precautionary solution against heavy traffic occupancy among the interim and sink-neighbouring nodes in WSNs is proposed. Routing of packets using a congestion-free path is required to increase the node lifespan. An optimal M/Pareto stochastic traffic generator is used in combination with traffic factors such as energy and delay to predict amount of traffic across nodes. A simpler congestion prediction mechanism is performed to control the occurrence of heavy-tailed traffic distributions. A torrent weight value for incoming traffic is generated at each node periodically that directs routing of data packets to sink. The devised MWCBT framework supervises real-time traffic congestion and is found to be more optimal than the existing approaches for network traffic modelling. The proposed approach achieves greater packet delivery ratio and less node congestion compared to the existing network modelling techniques.

A Novel Optimal Robotized Parking System Using Advanced Wireless Sensor Network

This article addresses the importance of parking system which makes the movement of moving vehicles to be unrestricted thus providing integration between hominid classification and sensing systems. If two distinct systems are combined, then all the vehicles can monitor the parking space, and they can directly move towards the destination end within short span of time. In addition for this type of establishment, rapidity of transportation vehicles is calculated with error minimization technique where all technical hitches will be avoided by sustaining the user constraints. Further, to solve the designed user constraints, a nonlinear optimization which is termed as machine learning algorithm is introduced for avoiding high loss during packet transmission technique, and percentage of efficiency is analyzed using simulated results with network simulator (NS2). Moreover, from simulated results, it is substantiated that the projected method on automatic parking of vehicles provides high efficient operation, and even cost of installation is reduced.

Applying Infinite Petri Nets to the Cybersecurity of Intelligent Networks, Grids and Clouds

Correctness of networking protocols represents the principal requirement of cybersecurity. Correctness of protocols is established via the procedures of their verification. A classical communication system includes a pair of interacting systems. Recent developments of computing and communication grids for radio broadcasting, cellular networks, communication subsystems of supercomputers, specialized grids for numerical methods and networks on chips require verification of protocols for any number of devices. For analysis of computing and communication grid structures, a new class of infinite Petri nets has been introduced and studied for more than 10 years. Infinite Petri nets were also applied for simulating cellular automata. Rectangular, triangular and hexagonal grids on plane, hyper cube and hyper torus in multidimensional space have been considered. Composing and solving in parametric form infinite Diophantine systems of linear equations allowed us to prove the protocol properties for any grid size and any number of dimensions. Software generators of infinite Petri net models have been developed. Special classes of graphs, such as a graph of packet transmission directions and a graph of blockings, have been introduced and studied. Complex deadlocks have been revealed and classified. In the present paper, infinite Petri nets are divided into two following kinds: a single infinite construct and an infinite set of constructs of specified size (and number of dimensions). Finally, the paper discusses possible future work directions.

An Improved Backoff Scheme and Its Performance Analysis for Full Duplex MAC Protocols in VLC Networks

IEEE 802.15.7 Visible Light Communication (VLC) networks suffer from performance degradation caused by the hidden device collisions due to the directional transmission with narrow beamwidth. One of the solutions for mitigating the hidden device collisions is to employ a full-duplex transmission technique. As a side effect of the full-duplex transmission in the VLC networks, however, the data-packet discard due to the retransmission limitation occurs frequently in the networks. This paper proposes an improved backoff scheme and its performance analysis to suppress the packet discard. The proposed backoff scheme increases the Backoff Exponent (BE) and the Number of Backoff stage (NB) in IEEE 802.15.7 only when the data packet transmission fails. To evaluate the system performance theoretically, this paper also provides the Markov-chain model for channel access with the proposed scheme. The performance evaluations through simulation and theoretical analysis show the effectiveness of the proposed scheme.

Contextual Bandit Based Rate Adaptation Mechanism for IEEE 802.11 Mobile Wireless LANs

<div>Rate adaptation (RA) is used in IEEE 802.11 WLANs to determine the optimal datarate for a particular channel condition. It becomes especially difficult to determine the optimal datarate for the new High-Throughput WLANs (802.11ac/ax) since the number of available datarates in these standards are very high. Moreover, a mobile environment poses additional challenge in RA as the channel conditions will keep on changing from time to time. In this paper, we propose a Contextual Bandits based Rate Adaptation (ContRA) algorithm for mobile users in IEEE 802.11ac/ax standards. Based on the Received Signal Strength Indicator (RSSI) range that the receiver is currently in, the RA algorithm tries to determine the optimal rate from the rate set suitable for packet transmission in that RSSI range. Performance studies show that the proposed RA algorithm is able to adapt to changing channel conditions and quickly choose a suitable datarate for those channel conditions.</div>

Contextual Bandit Based Rate Adaptation Mechanism for IEEE 802.11 Mobile Wireless LANs

<div>Rate adaptation (RA) is used in IEEE 802.11 WLANs to determine the optimal datarate for a particular channel condition. It becomes especially difficult to determine the optimal datarate for the new High-Throughput WLANs (802.11ac/ax) since the number of available datarates in these standards are very high. Moreover, a mobile environment poses additional challenge in RA as the channel conditions will keep on changing from time to time. In this paper, we propose a Contextual Bandits based Rate Adaptation (ContRA) algorithm for mobile users in IEEE 802.11ac/ax standards. Based on the Received Signal Strength Indicator (RSSI) range that the receiver is currently in, the RA algorithm tries to determine the optimal rate from the rate set suitable for packet transmission in that RSSI range. Performance studies show that the proposed RA algorithm is able to adapt to changing channel conditions and quickly choose a suitable datarate for those channel conditions.</div>

Event Reliability in Wireless Sensor Networks

<p>Ensuring reliable transport of data in resource-constrained Wireless Sensor Networks (WSNs) is one of the primary concerns to achieve a high degree of efficiency in monitoring and control systems. The two reliability mechanisms typically used in WSNs are packet reliability and event reliability. Packet reliability, which requires all packets from all the sensor nodes to reach the sink, can result in wastage of the sensors' limited energy resources. Event reliability, which only requires that one packet related to each event reaches the sink, exploits the overlap of the sensing regions of densely deployed sensor nodes to eliminate redundant packets from nodes in close proximity that contain duplicate information about an event. The majority of previous research in this area focuses on packet reliability rather than event reliability. Moreover, the research that does focus on event reliability relies on the sink to impose some form of control over the flow of data in the network. The sinks' centralized control and decision-making increases the transmission of unnecessary packets, which degrades overall network performance in terms of energy, congestion and data flow. This thesis proposes a distributed approach to the control of the flow of data in which each node makes in-node decisions using data readily available to it. This reduces the transmission of unnecessary packets, which reduces the network cost in terms of energy, congestion, and data flow. The major challenges involved in this research are to: (i) accurately identify that multiple packets are carrying information about the same event, (ii) reliably deliver the packets carrying information about the unique event, (iii) ensure that enough information about the area of interest is reliably delivered to the sink, and (iv) maintain the event coverage throughout the network. This thesis presents the Event Reliability Protocol (ERP) and its extension, the Enhanced Event Reliability Protocol (EERP). The protocols aim for the reliable transmission of a packet containing information about each unique event to the sink while identifying and minimizing the unnecessary transmission of similar redundant packets from nodes in the region of the event. In this way, the sensor nodes consume less energy and increase the overall network lifetime. EERP uses a multilateration technique to identify multiple packets containing similar event information and thus is able to filter redundant packets of the same event. It also makes use of implicit acknowledgment (iACKs) for reliable delivery of the packets to the sink node. The process is based on the hop-by-hop mechanism where the decisions are made locally by the intermediate nodes. The thesis reports on simulations in QualNet 5.2 for verifying the accuracy of our event identification and event reliability mechanisms employed in the ERP and EERP. The results show that EERP performs better in terms of minimizing overall packet transmission and hence the energy consumption at the sensor nodes in a WSN. Also, the results for event identification mechanism and reliable event delivery show that EERP considerably improves upon other protocols in terms of unique events delivery.</p>

Energy-Efficient Routing in Wireless Sensor Networks

Efficient data collection is the core concept of implementing Industry4.0 on IoT platforms. This requires energy aware communication protocols for Wireless Sensor Networks (WSNs) where different functions, like sensing and processing on the IoT nodes must be supported by local battery power. Thus, energy aware network protocols, such as routing, became one of fundamental challenges in IoT data collection schemes.In our research, we have developed novel routing algorithms which guarantee minimum energy consumption data transfer which is achieved subject to pre-defined reliability constraints. We assume that data is transmitted in the form of packets and the routing algorithm identifies the paths over which the packets can reach the Base Station (BS) with minimum transmission energy, while the probability of successful packet transmission still exceeds a pre-defined reliability parameter. In this way, the longevity and the information throughput of the network is maximized and the low energy transmissions will considerably extend the lifetime of the IoT nodes. In this paper we propose a solution that maximizes the lifetime of the nodes.

Event Reliability in Wireless Sensor Networks

<p>Ensuring reliable transport of data in resource-constrained Wireless Sensor Networks (WSNs) is one of the primary concerns to achieve a high degree of efficiency in monitoring and control systems. The two reliability mechanisms typically used in WSNs are packet reliability and event reliability. Packet reliability, which requires all packets from all the sensor nodes to reach the sink, can result in wastage of the sensors' limited energy resources. Event reliability, which only requires that one packet related to each event reaches the sink, exploits the overlap of the sensing regions of densely deployed sensor nodes to eliminate redundant packets from nodes in close proximity that contain duplicate information about an event. The majority of previous research in this area focuses on packet reliability rather than event reliability. Moreover, the research that does focus on event reliability relies on the sink to impose some form of control over the flow of data in the network. The sinks' centralized control and decision-making increases the transmission of unnecessary packets, which degrades overall network performance in terms of energy, congestion and data flow. This thesis proposes a distributed approach to the control of the flow of data in which each node makes in-node decisions using data readily available to it. This reduces the transmission of unnecessary packets, which reduces the network cost in terms of energy, congestion, and data flow. The major challenges involved in this research are to: (i) accurately identify that multiple packets are carrying information about the same event, (ii) reliably deliver the packets carrying information about the unique event, (iii) ensure that enough information about the area of interest is reliably delivered to the sink, and (iv) maintain the event coverage throughout the network. This thesis presents the Event Reliability Protocol (ERP) and its extension, the Enhanced Event Reliability Protocol (EERP). The protocols aim for the reliable transmission of a packet containing information about each unique event to the sink while identifying and minimizing the unnecessary transmission of similar redundant packets from nodes in the region of the event. In this way, the sensor nodes consume less energy and increase the overall network lifetime. EERP uses a multilateration technique to identify multiple packets containing similar event information and thus is able to filter redundant packets of the same event. It also makes use of implicit acknowledgment (iACKs) for reliable delivery of the packets to the sink node. The process is based on the hop-by-hop mechanism where the decisions are made locally by the intermediate nodes. The thesis reports on simulations in QualNet 5.2 for verifying the accuracy of our event identification and event reliability mechanisms employed in the ERP and EERP. The results show that EERP performs better in terms of minimizing overall packet transmission and hence the energy consumption at the sensor nodes in a WSN. Also, the results for event identification mechanism and reliable event delivery show that EERP considerably improves upon other protocols in terms of unique events delivery.</p>