scholarly journals QoE-Oriented Cooperative Broadcast Optimization for Vehicular Video Streaming

2021 ◽  
Vol 2021 ◽  
pp. 1-22
Author(s):  
Jingyao Liu ◽  
Guangsheng Feng ◽  
Jiayu Sun ◽  
Liying Zheng ◽  
Huiqiang Wang
Keyword(s):  
Service Providers ◽  
Scalable Video Coding ◽  
Base Station ◽  
Wireless Channel ◽  
Service Reliability ◽  
Buffer Action ◽  
Linear Integer Programming ◽  
Buffer Occupancy ◽  
Data Volume ◽  
Total Data

The popularity of online vehicular video has caused enormous information requests in Internet of vehicles (IoV), which brings huge challenges to cellular networks. To alleviate the pressure of base station (BS), Roadside Units (RSUs) and vehicle peers are introduced to collaboratively provide broadcast services to vehicle requesters where vehicles act as both service providers and service requesters. In this paper, we propose an efficient framework leveraging scalable video coding (SVC) technique to improve quality of experience (QoE) from two perspectives: (1) maximizing the data volume received by all requesters and (2) determining buffer action based on playback fluency and average playback quality. For (1), potential providers cooperate to determine the precached video content and delivery policy with the consideration of vehicular mobility and wireless channel status. If one provider fails, other sources will complement to provide requested content delivery. Therefore, their cooperation can improve the QoE and enhance the service reliability. For (2), according to buffer occupancy status, vehicle requesters manage buffer action whether to buffer new segments or upgrade the enhancement level of unplayed segment. Furthermore, the optimization of the data volume is formulated as an integer nonlinear programming (INLP) problem, which can be converted into some linear integer programming subproblems through McCormick envelope method and Lagrange relaxation. Numerical simulation results show that our algorithm is effective in improving total data throughput and QoE.

scholarly journals The Geometric Brownian Motion of Indosat Telecommunications Daily Stock Price During the Covid-19 Pandemic in Indonesia

2021 ◽  
Vol 2084 (1) ◽  
pp. 012012
Author(s):  
Tiara Shofi Edriani ◽  
Udjianna Sekteria Pasaribu ◽  
Yuli Sri Afrianti ◽  
Ni Nyoman Wahyu Astute
Keyword(s):  
Brownian Motion ◽  
Stock Price ◽  
Service Providers ◽  
Main Idea ◽  
Geometric Brownian Motion ◽  
Government Policies ◽  
Percentage Error ◽  
Price Movement ◽  
Data Movement ◽  
Total Data

Abstract One of the major telecommunication and network service providers in Indonesia is PT Indosat Tbk. During the coronavirus (COVID-19) pandemic, the daily stock price of that company was influenced by government policies. This study addresses stock data movement from February 5, 2020 to February 5, 2021, resulted in 243 data, using the Geometric Brownian motion (GBM). The stochastic process realization of this stock price fluctuates and increases exponentially, especially in the 40 latest data. Because of this situation, the realization is transformed into log 10 and calculated its return. As a result, weak stationary in variance is obtained. Furthermore, only data from December 7, 2020 to February 5, 2021 fulfill the GBM assumption of stock price return, as R t 1 * , t 1 * = 1 , 2 , 3 , … , 40 . The main idea of this study is adding datum one by one as much as 10% – 15% of the total data R t 1 * , starting from December 4, 2020 backwards. Following this procedure, and based on the 3% < p-value < 10%, the study shows that its datum can be included in R t 1 * , so t 1 * = − 4. − 3 , − 2 , … , 40 and form five other data groups, R t 2 * , … , R t 6 * . Considering Mean Absolute Percentage Error (MAPE) and amount of data from each group, R t 6 * is selected for modelling. Thus, GBM succeeded in representing the stock price movement of the second most popular Indonesian telecommunication company during COVID-19 pandemic.

scholarly journals AgriTrust—A Trust Management Approach for Smart Agriculture in Cloud-based Internet of Agriculture Things

Sensors ◽  
2020 ◽  
Vol 20 (21) ◽  
pp. 6174 ◽  
Author(s):  
Kamran Ahmad Awan ◽  
Ikram Ud Din ◽  
Ahmad Almogren ◽  
Hisham Almajed
Keyword(s):  
Trust Management ◽  
Service Providers ◽  
Base Station ◽  
Security And Privacy ◽  
Management Approach ◽  
Time Interval ◽  
Management Mechanism ◽  
Trust Degree ◽  
Smart Agriculture ◽  
Compromised Nodes

Internet of Things (IoT) provides a diverse platform to automate things where smart agriculture is one of the most promising concepts in the field of Internet of Agriculture Things (IoAT). Due to the requirements of more processing power for computations and predictions, the concept of Cloud-based smart agriculture is proposed for autonomic systems. This is where digital innovation and technology helps to improve the quality of life in the area of urbanization expansion. For the integration of cloud in smart agriculture, the system is shown to have security and privacy challenges, and most significantly, the identification of malicious and compromised nodes along with a secure transmission of information between sensors, cloud, and base station (BS). The identification of malicious and compromised node among soil sensors communicating with the BS is a notable challenge in the BS to cloud communications. The trust management mechanism is proposed as one of the solutions providing a lightweight approach to identify these nodes. In this article, we have proposed a novel trust management mechanism to identify malicious and compromised nodes by utilizing trust parameters. The trust mechanism is an event-driven process that computes trust based on the pre-defined time interval and utilizes the previous trust degree to develop an absolute trust degree. The system also maintains the trust degree of a BS and cloud service providers using distinct approaches. We have also performed extensive simulations to evaluate the performance of the proposed mechanism against several potential attacks. In addition, this research helps to create friendlier environments and efficient agricultural productions for the migration of people to the cities.

scholarly journals An efficient cryptographic technique using modified Diffie–Hellman in wireless sensor networks

2020 ◽  
Vol 16 (6) ◽  
pp. 155014772092577 ◽  
Author(s):  
Shahwar Ali ◽  
A Humaria ◽  
M Sher Ramzan ◽  
Imran Khan ◽  
Syed M Saqlain ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Security ◽  
Response Times ◽  
Base Station ◽  
Wireless Channel ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Key Generation ◽  
Diffie Hellman

In wireless sensor networks, the sensors transfer data through radio signals to a remote base station. Sensor nodes are used to sense environmental conditions such as temperature, strain, humidity, sound, vibration, and position. Data security is a major issue in wireless sensor networks since data travel over the naturally exposed wireless channel where malicious attackers may get access to critical information. The sensors in wireless sensor networks are resource-constrained devices whereas the existing data security approaches have complex security mechanisms with high computational and response times affecting the network lifetime. Furthermore, existing systems, such as secure efficient encryption algorithm, use the Diffie–Hellman approach for key generation and exchange; however, Diffie–Hellman is highly vulnerable to the man-in-the-middle attack. This article introduces a data security approach with less computational and response times based on a modified version of Diffie–Hellman. The Diffie–Hellman has been modified to secure it against attacks by generating a hash of each value that is transmitted over the network. The proposed approach has been analyzed for security against various attacks. Furthermore, it has also been analyzed in terms of encryption/decryption time, computation time, and key generation time for different sizes of data. The comparative analysis with the existing approaches shows that the proposed approach performs better in most of the cases.

Scheduling and Access Control for Wireless Connections with Throughput Guarantees

2010 ◽  
pp. 353-376
Author(s):  
Peifang Zhang ◽  
Scott Jordan
Keyword(s):  
Resource Allocation ◽  
Access Control ◽  
Utility Function ◽  
Base Station ◽  
Wireless Channel ◽  
Service Differentiation ◽  
Data Services ◽  
Slow Fading ◽  
Code Division Multiple ◽  
Music Streaming

Emerging wideband code division multiple access (WCDMA) data services will likely require resource allocation to ensure that throughput targets are met. Scheduling and access control can both be key components in this task. In this chapter, we introduce a two-layer scheduler and connection access controller that attempts to balance efficiency with fairness. We first propose a scheduler that takes advantage of variations in the wireless channel—both channel fluctuations in time for each user, and channel variations among multiple users at a particular time. By mixing a max-min policy with a policy of serving users with relatively good channels, the scheduler can achieve individual average throughput targets in a manner that encourages system efficiency. We then propose a two-layer algorithm that offers targeted throughput for interactive nomadic data streams, such as video or music streaming. The design purpose is to provide users with service differentiation, which lays the groundwork for network optimization in terms of capacity or utility, and can be easily extended to revenue maximization. Upon the request of a data stream connection, a target throughput is negotiated between the user and the network/base station. The network attempts to achieve the throughput targets over the duration of each individual connection by maximizing a system objective based on users’ satisfaction that is represented by a utility function. We assume that a users’ utility function depends not only on the throughput target but also on final achieved throughput. The algorithm integrates connection access control and resource allocation per connection request with rate scheduling on a per frame basis adaptive to slow fading. Through numerical analysis, the proposed joint scheduler and connection access controller is shown to achieve the design goals.

scholarly journals Multipath Dynamic Adaptive Streaming over HTTP Using Scalable Video Coding in Software Defined Networking

2020 ◽  
Vol 10 (21) ◽  
pp. 7691
Author(s):  
Ali Gohar ◽  
Sanghwan Lee
Keyword(s):  
Video Coding ◽  
Network Topology ◽  
Service Providers ◽  
Scalable Video Coding ◽  
Software Defined Networking ◽  
Multimedia Streaming ◽  
Scalable Video ◽  
Adaptive Streaming ◽  
Network Bandwidth

Dynamic Adaptive Streaming over HTTP (DASH) offers adaptive and dynamic multimedia streaming solutions to heterogeneous end systems. However, it still faces many challenges in determining an appropriate rate adaptation technique to provide the best quality of experience (QoE) to the end systems. Most of the suggested approaches rely on servers or client-side heuristics to improve multimedia streaming QoE. Moreover, using evolving technologies such as Software Defined Networking (SDN) that provide a network overview, combined with Multipath Transmission Control Protocol (MPTCP), can enhance the QoE of streaming multimedia media based on scalable video coding (SVC). Therefore, we enhance our previous work and propose a Dynamic Multi Path Finder (DMPF) scheduler that determines optimal techniques to enhance QoE. DMPF scheduler is a part of the DMPF Scheduler Module (DSM) which runs as an application over the SDN controller. The DMPF scheduler accommodates maximum client requests while providing the basic representation of the media requested. We evaluate our implementation on real network topology and explore how SVC layers should be transferred over network topology. We also test the scheduler for network bandwidth usage. Through extensive simulations, we show clear trade-offs between the number of accommodated requests and the quality of the streaming. We conclude that it is better to schedule the layers of a request into the same path as much as possible than into multiple paths. Furthermore, these result would help service providers optimize their services.

scholarly journals Enabling Location Privacy Preservation in MANETs Based on Distance, Angle, and Spatial Cloaking

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 458
Author(s):  
Nanlan Jiang ◽  
Sai Yang ◽  
Pingping Xu
Keyword(s):  
Privacy Preservation ◽  
Location Privacy ◽  
Differential Privacy ◽  
Geographic Routing ◽  
Base Station ◽  
Wireless Channel ◽  
Location Based Services ◽  
Location Information ◽  
Communication Overhead ◽  
Spatial Cloaking

Preserving the location privacy of users in Mobile Ad hoc Networks (MANETs) is a significant challenge for location information. Most of the conventional Location Privacy Preservation (LPP) methods protect the privacy of the user while sacrificing the capability of retrieval on the server-side, that is, legitimate devices except the user itself cannot retrieve the location in most cases. On the other hand, applications such as geographic routing and location verification require the retrievability of locations on the access point, the base station, or a trusted server. Besides, with the development of networking technology such as caching technology, it is expected that more and more distributed location-based services will be deployed, which results in the risk of leaking location information in the wireless channel. Therefore, preserving location privacy in wireless channels without losing the retrievability of the real location is essential. In this paper, by focusing on the wireless channel, we propose a novel LPP enabled by distance (ranging result), angle, and the idea of spatial cloaking (DSC-LPP) to preserve location privacy in MANETs. DSC-LPP runs without the trusted third party nor the traditional cryptography tools in the line-of-sight environment, and it is suitable for MANETs such as the Internet of Things, even when the communication and computation capabilities of users are limited. Qualitative evaluation indicates that DSC-LPP can reduce the communication overhead when compared with k-anonymity, and the computation overhead of DSC-LPP is limited when compared with conventional cryptography. Meanwhile, the retrievability of DSC-LPP is higher than that of k-anonymity and differential privacy. Simulation results show that with the proper design of spatial divisions and parameters, other legitimate devices in a MANET can correctly retrieve the location of users with a high probability when adopting DSC-LPP.

scholarly journals Efficient and secure attribute-based heterogeneous online/offline signcryption for body sensor networks based on blockchain

2019 ◽  
Vol 15 (9) ◽  
pp. 155014771987565 ◽  
Author(s):  
Jawaid Iqbal ◽  
Arif Iqbal Umar ◽  
Noorul Amin ◽  
Abdul Waheed
Keyword(s):  
Sensor Networks ◽  
Universal Access ◽  
Security Analysis ◽  
Data Access ◽  
Base Station ◽  
Wireless Channel ◽  
Patient Data ◽  
Body Sensor Networks ◽  
Health Record ◽  
Patient Health

In body sensor networks, both wearable and implantable biosensors are deployed in a patient body to monitor and collect patient health record information. The health record information is then transmitted toward the medical server via a base station for analysis, diagnosis, and treatment by medical experts. Advancement in wireless technology although improves the patient health–monitoring mechanism, but still there are some limitations regarding security, privacy, and efficiency due to open wireless channel and limited resources of body sensor networks. To overcome these limitations, we have proposed an efficient and secure heterogeneous scheme for body sensor networks, in which biosensor nodes use a certificate-less cryptography environment to resolve the key escrow and certificate-management problems, while MS uses a public key infrastructure environment to enhance the scalability of the networks. Furthermore, we design an online/offline signcryption method to overcome the burden on biosensor nodes. We split the signcryption process into two phases: offline phase and online phase. In the offline phase, the major operations are computed without prior knowledge of patient data. While in online phase, the minor operations are computed when patient data are known. Besides, we have used a new hybrid blockchain technology approach for the secure transmission of patient information along with attributes stored in the medical server toward the cloud that provides ease of patient data access remotely from anywhere by the authorized users and data backup in case of medical server failure. Moreover, hybrid blockchain provides advantages of interoperability, transparency traceability, and universal access. The formal security analysis of the proposed scheme is proved in the standard model, and informal security assures that our scheme provides resistance against possible attacks. As compared to other existing schemes, our proposed scheme consumes fewer resources and efficient in terms of processing cost, transmission overhead, and energy consumption.

OpenMobileNetwork

2013 ◽  
Vol 9 (4) ◽  
pp. 46-64 ◽  
Author(s):  
Abdulbaki Uzun ◽  
Eric Neidhardt ◽  
Axel Küpper
Keyword(s):  
Network Topology ◽  
Linked Data ◽  
Service Providers ◽  
Open Data ◽  
Mobile Network ◽  
Base Station ◽  
Network Provisioning ◽  
Crowdsourced Data ◽  
Mobile Network Operators

Mobile network operators maintain data about their mobile network topology, which is mainly used for network provisioning and planning purposes restricting its full business potential. Utilizing this data in combination with the extensive pool of semantically modeled data in the Linking Open Data Cloud, innovative applications can be realized that would establish network operators as service providers and enablers in the highly competitive services market. In this article, the authors introduce the OpenMobileNetwork (available at http://www.openmobilenetwork.org/) as an open solution for providing approximated network topology data based on the principles of Linked Data along with a business concept for network operators to exploit their valuable asset. Since the quality of the estimated network topology is crucial when providing services on top of it, the authors further analyze and evaluate state-of-the-art approaches for estimating base station positions out of crowdsourced data and discuss the results in comparison to real base station locations.

scholarly journals Muting the noise cone in near‐surface reflection data: An example from southeastern Kansas

Geophysics ◽  
1998 ◽  
Vol 63 (4) ◽  
pp. 1332-1338 ◽  
Author(s):  
Gregory S. Baker ◽  
Don W. Steeples ◽  
Matt Drake
Keyword(s):  
Data Processing ◽  
Seismic Data ◽  
Hydrocarbon Exploration ◽  
Seismic Reflection Profile ◽  
Seismic Data Processing ◽  
Near Surface ◽  
Surface Reflection ◽  
Reflection Data ◽  
Data Volume ◽  
Total Data

A 300-m near‐surface seismic reflection profile was collected in southeastern Kansas to locate a fault(s) associated with a recognized stratigraphic offset on either side of a region of unexposed bedrock. A substantial increase in the S/N ratio of the final stacked section was achieved by muting all data arriving in time after the airwave. Methods of applying traditional seismic data processing techniques to near‐surface data (200 ms of data or less) often differ notably from hydrocarbon exploration‐scale processing (3–4 s of data or more). The example of noise cone muting used is contrary to normal exploration‐scale seismic data processing philosophy, which is to include all data containing signal. The noise cone mute applied to the data removed more than one‐third of the total data volume, some of which contains signal. In this case, however, the severe muting resulted in a higher S/N ratio in the final stacked section, even though some signal could be identified within the muted data. This example supports the suggestion that nontraditional techniques sometimes need to be considered when processing near‐surface seismic data.

Sign in / Sign up

Export Citation Format

Share Document