SARSA based access control with approximation by TileCoding
0
Citation
34
Reference
10
Related Paper
Abstract:
Traditional sensor nodes ignore the packet loss rate during information transmission and the access control security problem caused by server utilization when uploading data. To solve the problem, we propose a SARSA based access control method with approximation by TileCoding (SACT), which takes the sensor packet loss rate and the server error rate into account. The network state is estimated by the packet loss rate and variable bit error rate to get a server access control strategy to improve security performance. The eventual strategy complies with the minimum information loss and the maximum server utilization. Results of experiments show that the algorithm is capable of achieving good results in the total amount of information received by the server system. The SACT improves the server utilization rate and the overall security performance of the network.Keywords:
Upload
Packet loss
Topics:
The use of repeat neural networks with high iterating values to identify and avoid packet losses is expected to result in a more successful WSN test randomization technique, which will further reduce packet losses. According to the planned research results, it was discovered in the first seven GUI tests and recommended seven times as a result of the findings. Given that only a small number of packets were lost in a single packet, it is clear that a certain number of packets were initially sent when specific packets were sent. As a result, when it comes to digital data, the results of the necessary effort are immediately visible. It nearly doubled when compared to the previous year. It is thus clear that when a repeating neural network employs large iteration values, the use of very active pattern recognition methods ensures that the network also repartees packet loss issues, thereby reducing packet loss. As a result of this change, overall latency and performance are only marginally improved. As a result, the proposed approach performs admirably in terms of packet drop during transmission and estimation of packet loss.
Packet loss
Packet analyzer
End-to-end delay
Cite
Citations (1)
In this paper, we develop effective solutions for enabling mobile sensing/data collection in community IoT deployments where sensing/communication coverage is intermittent and varying. Specifically, we address the optimized upload planning problem, i.e. determine optimal schedules for upload of gathered information to enable timely data collection in dynamic settings. We develop a two-phase approach and associated policies, where an initial upload plan is generated with prior knowledge of upload opportunities and data needs, and a subsequent runtime adaptation phase alters the plan based on dynamic network and data conditions. To validate our approach, we designed and built SCALECycle, a prototype mobile data collection platform and deployed it in real world community settings; measurements from testbeds in Rockville, MD and Irvine, CA are used to drive extensive simulations. Experimental results indicate that a judicious combination of policies in the two phases of upload planning (a balanced delay-opportunity-priority method with Lyapunov-inspired upload adaptation) can result in a 30-60% improvement in overall utility of collected data compared with opportunistic operation along with 30% reduction in collection delays /overheads.
Upload
Cite
Citations (10)
The Directorate General of Taxes submits the provisions of the new rules regarding tax invoices in accordance with the Director General of Taxes Number PER-03/PJ/2022. This study discusses the analysis of e-Faktur upload time restrictions in terms of the ease of administration principle. The data collection techniques used in this research are literature study and in-depth interviews. The result of the research is that the implementation of the e-Faktur upload time limitation policy still does not meet the ease of administration criteria. Certainty dimension has not been fulfilled because the e-Faktur upload time limitation policy does not have clear provisions regarding the procedures for the solution for late taxpayers to upload their e-Faktur. From the Convenience dimension, the limitation of time for uploading the e-Faktur adds criteria that allow the e-Faktur to be approved by the Directorate General of Taxes.
Upload
Certainty
Cite
Citations (0)
Estimating packet loss-rate by using delay information and combined with change-of-measure framework
We previously proposed a change-of-measure based performance measurement method which combines active and passive measurement to estimate user-experienced performance. We also applied this method to packet-delay estimation. We apply this method to loss-rate estimation. Because packet loss rarely occurs in current networks, its measurement usually requires a huge number of probe packets, which imposes a non-negligible load on the networks. We propose a loss-rate estimation method which requires significantly fewer probe packets. In our proposed method, the correlation between delay and loss is measured in advance, and at the time of measurement, the time-averaged loss rate is estimated by using the delay of probe packets and the correlation. We have also applied our change-of-measure framework to estimating the loss rate in user packets by using this time-averaged loss rate. We prove that the mean square error in our method is lower than the simple loss measurement which is estimated by dividing the number of lost packets by the total number of sent packets. We evaluate our method through simulations and actual measurements and find that it can estimate below 10/sup -3/ packet loss rate with only 900 probe packets.
Packet loss
Cite
Citations (11)
This article discusses downloading from OPACs in general and from the INNOPAC system in particular. It begins by setting out a brief philosophy of downloading, providing an introduction to OPAC downloading. It then discusses the practice of OPAC downloading with particular emphasis on tools for capturing and “postprocessing” downloaded flies. Technical and institutional constraints on downloading are addressed and an innovative program for overcoming some of these constraints is described in detail. The article concludes by considering various proposals for improving INNOPAC downloading capabilities.
Upload
Cite
Citations (1)
The research done in this study has delved deeply into the changes made to digital images that are uploaded to three of the major social media platforms and image storage services in today's society: Facebook, Flickr, and Google Photos. In addition to providing up-to-date data on an ever-changing landscape of different social media networks' digital fingerprints, a deep analysis of the social networks' filename conventions has resulted in two new approaches in (i) estimating the true upload date of Flickr photos, regardless of whether the dates have been changed by the user or not, and regardless of whether the image is available to the public or has been deleted from the platform; (ii) revealing the photo ID of a photo uploaded to Facebook based solely on the file name of the photo.
Upload
Cite
Citations (0)
Since there are a number of Internet-of-Things (IoT) applications that need to collect data sets from a large number of sensors or devices in real-time, sensing and communication need to be integrated for efficient uploading from devices. In this paper, we introduce the notion of data-aided sensing (DAS) where a base station (BS) utilizes a subset of data that is already uploaded and available to select the next device for efficient data collection or sensing. Thus, using DAS, certain tasks in IoT applications, including federated learning, can be completed by uploading from a small number of selected devices. Two different types of DAS are considered: one is centralized DAS and the other is distributed DAS. In centralized DAS, the BS decides the uploading order, while each device can decide when to upload its own local data set among multiple uploading rounds in distributed DAS. In distributed DAS, random access is employed where the access probability of each device is decided according to its local measurement for efficient uploading.
Upload
Cite
Citations (5)
A smart home equipped with various smart devices allows a service provider to automatically identify daily living activities from sensor/appliance data, but it is risky for dwellers to upload all the data generated in the home. In this paper, we define a threat model in which an attacker(s) can access all or part of the smart home data uploaded to the untrusted cloud server and can physically observe activities. Hence, the attacker can identify the association between the data and the home by matching the uploaded data and the observed data. The proposed method employs k-anonymity for dwellers to make a decision on whether the data should be uploaded or not. We computed values of k from the existing datasets and asked 18 participants to answer upload/no-upload for each pair of activities and time zone. As a result, our k-anonymity based method can reflect the dweller's sensitivity of privacy in uploading the data.
Upload
Cite
Citations (6)