scholarly journals Research and Development of Delay-Sensitive Routing Tensor Model in IoT Core Networks

Sensors ◽  
2021 ◽  
Vol 21 (11) ◽  
pp. 3934
Author(s):  
Oleksandr Lemeshko ◽  
Jozef Papan ◽  
Oleksandra Yeremenko ◽  
Maryna Yevdokymenko ◽  
Pavel Segec
Keyword(s):  
Research And Development ◽  
Optimality Criteria ◽  
Internal Node ◽  
Problem Solution ◽  
Tensor Model ◽  
Routing Problem ◽  
Core Networks ◽  
Delay Sensitive ◽  
End To End Delay ◽  
End To End

In the article, we present the research and development of an improved delay-sensitive routing tensor model for the core of the IoT network. The flow-based tensor model is considered within the coordinate system of interpolar paths and internal node pairs. The advantage of the presented model is the application for IoT architectures to ensure the Quality of Service under the parameters of bandwidth, average end-to-end delay, and the probability of packet loss. Hence, the technical task of delay-sensitive routing is formulated as the optimization problem together with constraints and conditions imposed on the corresponding routing variables. The system of optimality criteria is chosen for an investigation. Each selected criterion concerning the specifics of the demanded routing problem solution aims at the optimal use of available network resources and the improvement of QoS indicators, namely, average end-to-end delay. The analysis of the obtained routing solutions under different criteria is performed. Numerical research of the improved delay-sensitive routing tensor model allowed us to discover its features and proved the adequacy of the results for the multipath order of routing.

USING NEURAL NETWORKS TO SOLVE THE MULTICAST ROUTING PROBLEM IN PACKET RADIO NETWORKS

1996 ◽  
Vol 07 (05) ◽  
pp. 617-626 ◽  
Author(s):  
THOMAS L. HEMMINGER ◽  
CARLOS A. POMALAZA-RAEZ
Keyword(s):  
Multicast Routing ◽  
Optimal Solution ◽  
Packet Delay ◽  
Hopfield Neural Network ◽  
Routing Problem ◽  
Packet Radio ◽  
Packet Radio Network ◽  
End To End Delay ◽  
Packet Delays ◽  
End To End

The primary function of a packet radio network is the efficient transfer of information between source and destination nodes using minimal bandwidth and end-to-end delay. Many researchers have investigated the problem of minimizing the end-to-end delay from a single source to a single destination for a variety of networks; however, very little work is reported about routing mechanisms for the common case where a particular information packet is intended to be sent to more than one destination in the network. This is known as multicasting. A simplified version of the problem is to ignore the packet delay at each node, then the problem becomes one of finding solutions which require the least number of transmissions. Determination of an optimal solution is NP-complete meaning that suboptimal solutions are frequently tolerated. The problem becomes more rigorous if packet delays are included in the network topology. This paper describes a practical technique for the computation of optimum or near optimum solutions to the multicasting problem with and without packet delay. The method is based on the Hopfield neural network and experiment has shown this method to yield near optimal solutions while requiring a minimum of CPU time.

End-to-End Delay Modeling for Embedded VNF Chains in 5G Core Networks

2019 ◽  
Vol 6 (1) ◽  
pp. 692-704 ◽  
Author(s):  
Qiang Ye ◽  
Weihua Zhuang ◽  
Xu Li ◽  
Jaya Rao
Keyword(s):  
Core Networks ◽  
End To End Delay ◽  
End To End

scholarly journals Timely Reliability Analysis of Virtual Machines Considering Migration and Recovery in an Edge Server

Sensors ◽  
2020 ◽  
Vol 21 (1) ◽  
pp. 93
Author(s):  
Kangkai Liu ◽  
Linhan Guo ◽  
Yu Wang ◽  
Xianyu Chen
Keyword(s):  
Virtual Machines ◽  
First Passage Time ◽  
Passage Time ◽  
Edge Computing ◽  
Delay Constraint ◽  
Vm Migration ◽  
Delay Sensitive ◽  
End To End Delay ◽  
End To End ◽  
The Impact

For the edge computing network, whether the end-to-end delay satisfies the delay constraint of the task is critical, especially for delay-sensitive tasks. Virtual machine (VM) migration improves the robustness of the network, whereas it also causes service downtime and increases the end-to-end delay. To study the influence of failure, migration, and recovery of VMs, we define three states for the VMs in an edge server and build a continuous-time Markov chain (CTMC). Then, we develop a matrix-geometric method and a first passage time method to obtain the VMs timely reliability (VTR) and the end-to-end timely reliability (ETR). The numerical results are verified by simulation based on OMNeT++. Results show that VTR is a monotonic function of the migration rate and the number of VMs. However, in some cases, the increase in task VMs (TVMs) may conversely decrease VTR, since more TVMs also brings about more failures in a given time. Moreover, we find that there is a trade-off between TVMs and backup VMs (BVMs) when the total number of VMs is limited. Our findings may shed light on understanding the impact of VM migration on end-to-end delay and designing a more reliable edge computing network for delay-sensitive applications.

End-to-End QoS Guarantee for Delay-Sensitive Mobile Multimedia Conferencing

2014 ◽  
Vol 36 (7) ◽  
pp. 1399-1412
Author(s):  
Ji-Yan WU ◽  
Xiu-Quan QIAO ◽  
Bo CHENG ◽  
Jun-Liang CHEN ◽  
Yun-Lei SUN
Keyword(s):  
Mobile Multimedia ◽  
Qos Guarantee ◽  
Delay Sensitive ◽  
End To End ◽  
Multimedia Conferencing

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.

Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

Sign in / Sign up

Export Citation Format

Share Document