Search

• A real-time application for secure data transmission using a different approach. • The receiver system requires a confirmation signal to perform necessary action. • Utilizing chaos dynamics for generating secret codes used in the algorithm. • The transmitted data can be a simple bit or any multimedia data of major systems. In today's technology, remote control or access is widely used in many platforms. However, the fact that remotely controlled platforms are open to external attacks or not secure enough which can have serious negative consequences. In this paper, a real-time LoRa modulation based data transmission application is achieved. The security of remotely transmitted data is not only provided with a basic encryption structure, but also a confirmation signal based transceiver system is designed in which the required process is performed only with a certain time interval. Firstly, the data to be transmitted is mixed with a secret key using XOR operation then transmitter creates a random period of time that specifies how long after the confirmation signal will be sent relative to the data signal. Hence, the entire system security is enhanced by the timing algorithm running with millisecond precision between the transceiver circuits. Encryption of the confirmation signal in a similar structure as the data signal improves security of the entire system. In this application, a PWM signal containing voltage information has been successfully transmitted in ciphered form using LoRa modulation. The designed algorithm for the receiver and transmitter circuits has been tested and verified in real time application. Experimental results show that the proposed scheme can be applied to any application-based communication system. [ABSTRACT FROM AUTHOR]

SUMMARY This paper investigates bidding strategy problems of generation companies in electricity markets. A new bidding model is set up, and a solution approach is presented. Compared with existing models, the model proposed in this paper has some different characteristics. First, the model adopts a bilevel optimization framework where the upper-level optimization is to maximize the profit of generation companies, and the aim of the lower-level optimization is the maximal social welfare and the security of the operation system considered by the Independent System Operator. This model combines practical situations faced by market agents in real-life operations and the requirement of both the system security and the social welfare. Second, the popular risk measure, called conditional value at risk, is used in the bidding model, which can quantify the market risk and describe the competitive mechanism effectively. For solving the complicated bilevel optimization model, a hybrid particle swarm optimization algorithm is presented. Numerical examples are used to validate the model and the algorithm. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Approaches to access control (AC) policy languages, such as eXtensible access control markup language, do not provide a formal representation for specifying rule- and policy-combining algorithms or for verifying properties of AC policies. Some authors propose formal representations for these combining algorithms. However, the proposed models are not expressive enough to represent formally history-based classes of these algorithms, such as ordered-permit-overrides. In addition, some other authors propose a formal representation but do not present automated support for formal verification of properties of AC policies that use these algorithms. This paper demonstrates a new representation that can express all existing AC rule and policy combinations of which the authors are aware. This representation can also be used to automate the formal verification of properties of AC policies related to these algorithms. A new modeling representation for rule- and policy-combining algorithms based on state machines is used to specify rule- and policy-combining algorithms. Examples of these algorithms are programmed in the language of the SPIN model checker, and the programs are then used to support the automated formal verification of properties of AC policies. We present our approach and then use the AC policies and properties of CONTINUE, a conference management system, to compare it with prior work. Our first contribution is a new modeling representation for combining algorithms based on state machines. The second contribution is the formal verification of AC properties under certain combining algorithms that are beyond the capability of other approaches. [ABSTRACT FROM AUTHOR]