Simulation results for the end-to-end vector distribution function of short polymethylene chains

1982 ◽  
Vol 15 (5) ◽  
pp. 1411-1416 ◽  
Author(s):  
Ana M. Rubio ◽  
Juan J. Freire
Keyword(s):  
Distribution Function ◽  
Vector Distribution ◽  
Simulation Results ◽  
End To End

Investigation of the end‐to‐end vector distribution function for linear polymers in different regimes

1991 ◽  
Vol 95 (6) ◽  
pp. 4589-4592 ◽  
Author(s):  
Marvin Bishop ◽  
Julian H. R. Clarke ◽  
Antonio Rey ◽  
Juan J. Freire
Keyword(s):  
Distribution Function ◽  
Linear Polymers ◽  
Vector Distribution ◽  
End To End

WS-Security on PRODML

2014 ◽  
Vol 1 (1) ◽  
pp. 9-34
Author(s):  
Bobby Suryajaya
Keyword(s):  
Web Services ◽  
Digital Signature ◽  
Data Transfer ◽  
Web Services Security ◽  
Soap Message ◽  
Simulation Results ◽  
End To End

SKK Migas plans to apply end-to-end security based on Web Services Security (WS-Security) for Sistem Operasi Terpadu (SOT). However, there are no prototype or simulation results that can support the plan that has already been communicated to many parties. This paper proposes an experiment that performs PRODML data transfer using WS-Security by altering the WSDL to include encryption and digital signature. The experiment utilizes SoapUI, and successfully loaded PRODML WSDL that had been altered with WSP-Policy based on X.509 to transfer a SOAP message.

QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

Dual-Hop Amplify-and-Forward Variable Gain Relaying over Mixture Gamma Fading Channels

2015 ◽  
Vol 719-720 ◽  
pp. 767-772
Author(s):  
Wei Jun Cheng
Keyword(s):  
Fading Channels ◽  
Signal To Noise Ratio ◽  
Symbol Error Rate ◽  
Amplify And Forward ◽  
Variable Gain ◽  
Average Symbol Error Rate ◽  
Simulation Results ◽  
End To End ◽  
The Moment ◽  
Relaying System

In this paper, we present the end-to-end performance of a dual-hop amplify-and-forward variablegain relaying system over Mixture Gamma distribution. Novel closed-form expressions for the probability density function and the moment-generation function of the end-to-end Signal-to-noise ratio (SNR) are derived. Moreover, the average symbol error rate, the average SNR and the average capacity are found based on the above new expressions, respectively. These expressions are more simple and accuracy than the previous ones obtained by using generalized-K (KG) distribution. Finally, numerical and simulation results are shown to verify the accuracy of the analytical results.

scholarly journals Estimating a Distribution Function at the Boundary

2020 ◽  
Vol 49 (1) ◽  
pp. 1-23
Author(s):  
Shunpu Zhang ◽  
Zhong Li ◽  
Zhiying Zhang
Keyword(s):  
Distribution Function ◽  
Kernel Estimation ◽  
Kernel Estimator ◽  
Distribution Functions ◽  
Practical Application ◽  
Real World Applications ◽  
Distribution Kernel ◽  
Estimation Of Distribution ◽  
Simulation Results ◽  
Boundary Correction

Estimation of distribution functions has many real-world applications. We study kernel estimation of a distribution function when the density function has compact support. We show that, for densities taking value zero at the endpoints of the support, the kernel distribution estimator does not need boundary correction. Otherwise, boundary correction is necessary. In this paper, we propose a boundary distribution kernel estimator which is free of boundary problem and provides non-negative and non-decreasing distribution estimates between zero and one. Extensive simulation results show that boundary distribution kernel estimator provides better distribution estimates than the existing boundary correction methods. For practical application of the proposed methods, a data-dependent method for choosing the bandwidth is also proposed.

scholarly journals An Energy-Efficient Two-Stage Cooperative Routing Scheme in Wireless Multi-Hop Networks

Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1002 ◽  
Author(s):  
Jianming Cheng ◽  
Yating Gao ◽  
Ningbo Zhang ◽  
Hongwen Yang
Keyword(s):  
Energy Efficiency ◽  
Network Lifetime ◽  
Cooperative Transmission ◽  
Transmission Model ◽  
Two Stage ◽  
Routing Scheme ◽  
Cooperative Routing ◽  
Link Cost ◽  
Simulation Results ◽  
End To End

Cooperative routing is one of the most widely used technologies for improving the energy efficiency and energy balance of wireless multi-hop networks. However, the end-to-end energy cost and network lifetime are greatly restricted if the cooperative transmission model is not designed properly. The main aim of this paper is to explore a two-stage cooperative routing scheme to further improve the energy efficiency and prolong the network lifetime. A two-stage cooperative (TSC) transmission model is firstly designed in which the core helper is introduced to determine the helper set for cooperation. Then, the two-stage link cost is formulated where x, the weight of residual energy, is introduced to be adjusted for different design goals. By selecting the optimal helper set, the two-stage link cost of each link can be optimized. Finally, based on the designed TSC transmission model and the optimized two-stage link cost, a distributed two-stage cooperative routing (TSCR) scheme is further proposed to minimize the end-to-end cooperative routing cost. Simulation results evaluate the effect of x on the different performance metrics. When x equals 0, TSCR can achieve the shortest end-to-end transmission delay and highest energy efficiency, while a larger x can achieve a longer network lifetime. Furthermore, simulation results also show that the proposed TSCR scheme can effectively improve both the energy efficiency and network lifetime compared with the existing schemes.

Perceptually Optimized UDP-Lite Protocol for 3D Model Streaming among Lossy Network

2010 ◽  
Vol 143-144 ◽  
pp. 533-537
Author(s):  
Bai Lin Yang
Keyword(s):  
Wireless Network ◽  
3D Model ◽  
Important Data ◽  
End To End Delay ◽  
Simulation Results ◽  
End To End

This paper proposes a perceptually optimized UDP-lite protocol for streaming the 3D model over lossy wireless network. Before the transmission, the model is divided into perceptually important data and less perceptually important data and constructed into a progressive representation. And then, the progressive model is streamed by the modified protocol based on the UDP_lite protocol. The simulation results demonstrate that end-to-end delay has significant improvement and the graphics quality has no apparent degradation.

Sign in / Sign up

Export Citation Format

Share Document