• 제목/요약/키워드: Key Constraints

검색결과 317건 처리시간 0.021초

Dynamic Session Key based Pairwise Key Management Scheme for Wireless Sensor Networks

  • Premamayudu, B;Rao, Koduganti Venkata;Varma, P. Suresh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권12호
    • /
    • pp.5596-5615
    • /
    • 2016
  • Security is one of the major challenges in the Wireless Sensor Networks (WSNs). WSNs are more vulnerable to adversarial activities. All cryptographic security services indirectly depend on key management. Symmetric key management is the best key establishment process for WSNs due to the resource constraints of the sensors. In this paper, we proposed dynamic session key establishment scheme based on randomly generated nonce value and sensor node identity, in which each sensor node is equipped with session key on expire basis. The proposed scheme is compare with five popular existing key management systems. Our scheme is simulated in OMNET++ with MixiM and presented experimental results. The analytical study and experimental results show the superiority of the proposed scheme over the existing schemes in terms of energy, storage, resilience and communication overhead.

Zoning Permanent Basic Farmland Based on Artificial Immune System coupling with spatial constraints

  • Hua, Wang;Mengyu, Wang;Yuxin, Zhu;Jiqiang, Niu;Xueye, Chen;Yang, Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권5호
    • /
    • pp.1666-1689
    • /
    • 2021
  • The red line of Permanent Basic Farmland is the most important part in the "three-line" demarcation of China's national territorial development plan. The scientific and reasonable delineation of the red line is a major strategic measure being taken by China to improve its ability to safeguard the practical interests of farmers and guarantee national food security. The delineation of Permanent Basic Farmland zoning (DPBFZ) is essentially a multi-objective optimization problem. However, the traditional method of demarcation does not take into account the synergistic development goals of conservation of cultivated land utilization, ecological conservation, or urban expansion. Therefore, this research introduces the idea of artificial immune optimization and proposes a multi-objective model of DPBFZ red line delineation based on a clone selection algorithm. This research proposes an objective functional system consisting of these three sub-objectives: optimal quality of cropland, spatially concentrated distribution, and stability of cropland. It also takes into consideration constraints such as the red line of ecological protection, topography, and space for major development projects. The mathematical formal expressions for the objectives and constraints are given in the paper, and a multi-objective optimal decision model with multiple constraints for the DPBFZ problem is constructed based on the clone selection algorithm. An antibody coding scheme was designed according to the spatial pattern of DPBFZ zoning. In addition, the antibody-antigen affinity function, the clone mechanism, and mutation strategy were constructed and improved to solve the DPBFZ problem with a spatial optimization feature. Finally, Tongxu County in Henan province was selected as the study area, and a controlled experiment was set up according to different target preferences. The results show that the model proposed in this paper is operational in the work of delineating DPBFZ. It not only avoids the adverse effects of subjective factors in the delineation process but also provides multiple scenarios DPBFZ layouts for decision makers by adjusting the weighting of the objective function.

Profit-Maximizing Virtual Machine Provisioning Based on Workload Prediction in Computing Cloud

  • Li, Qing;Yang, Qinghai;He, Qingsu;Kwak, Kyung Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권12호
    • /
    • pp.4950-4966
    • /
    • 2015
  • Cloud providers now face the problem of estimating the amount of computing resources required to satisfy a future workload. In this paper, a virtual machine provisioning (VMP) mechanism is designed to adapt workload fluctuation. The arrival rate of forthcoming jobs is predicted for acquiring the proper service rate by adopting an exponential smoothing (ES) method. The proper service rate is estimated to guarantee the service level agreement (SLA) constraints by using a diffusion approximation statistical model. The VMP problem is formulated as a facility location problem. Furthermore, it is characterized as the maximization of submodular function subject to the matroid constraints. A greedy-based VMP algorithm is designed to obtain the optimal virtual machine provision pattern. Simulation results illustrate that the proposed mechanism could increase the average profit efficiently without incurring significant quality of service (QoS) violations.

Study on multi-objective optimization method for radiation shield design of nuclear reactors

  • Yao Wu;Bin Liu;Xiaowei Su;Songqian Tang;Mingfei Yan;Liangming Pan
    • Nuclear Engineering and Technology
    • /
    • 제56권2호
    • /
    • pp.520-525
    • /
    • 2024
  • The optimization design problem of nuclear reactor radiation shield is a typical multi-objective optimization problem with almost 10 sub-objectives and the sub-objectives are always demanded to be under tolerable limits. In this paper, a design method combining multi-objective optimization algorithms with paralleling discrete ordinate transportation code is developed and applied to shield design of the Savannah nuclear reactor. Three approaches are studied for light-weighted and compact design of radiation shield. Comparing with directly optimization with 10 objectives and the single-objective optimization, the approach by setting sub-objectives representing weight and volume as optimization objectives while treating other sub-objectives as constraints has the best performance, which is more suitable to reactor shield design.

A multilingual grammar model of honorification: using the HPSG and MRS formalism

  • Song, Sanghoun
    • 한국언어정보학회지:언어와정보
    • /
    • 제20권1호
    • /
    • pp.25-49
    • /
    • 2016
  • Honorific forms express the speaker's social attitude to others and also indicate the social ranks and level of intimacy of the participants in the discourse. In a cross-linguistic perspective of grammar engineering, modelling honorification has been regarded as a key strategy for improving language processing applications. Using the HPSG and MRS formalism, this article provides a multilingual grammar model of honorification. The present study incorporates the honorific information into the Meaning Representation System (MRS) via Individual Constraints (ICONS), and then conducts an evaluation to see if the model contributes to semantics-based language processing.

  • PDF

Two-level Key Pool Design-based Random Key Pre-distribution in Wireless Sensor Networks

  • Mohaisen, Abedelaziz;Nyang, Dae-Hun;AbuHmed, Tamer
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제2권5호
    • /
    • pp.222-238
    • /
    • 2008
  • In this paper, the random key pre-distribution scheme introduced in ACM CCS'02 by Eschenauer and Gligor is reexamined, and a generalized form of key establishment is introduced. As the communication overhead is one of the most critical constraints of any successful protocol design, we introduce an alternative scheme in which the connectivity is maintained at the same level as in the original work, while the communication overhead is reduced by about 40% of the original overhead, for various carefully chosen parameters. The main modification relies on the use of a two-level key pool design and two round assignment/key establishment phases. Further analysis demonstrates the efficiency of our modification.

Joint Beamforming and Power Allocation for Multiple Primary Users and Secondary Users in Cognitive MIMO Systems via Game Theory

  • Zhao, Feng;Zhang, Jiayi;Chen, Hongbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권6호
    • /
    • pp.1379-1397
    • /
    • 2013
  • We consider a system where a licensed radio spectrum is shared by multiple primary users(PUs) and secondary users(SUs). As the spectrum of interest is licensed to primary network, power and channel allocation must be carried out within the cognitive radio network so that no excessive interference is caused to PUs. For this system, we study the joint beamforming and power allocation problem via game theory in this paper. The problem is formulated as a non-cooperative beamforming and power allocation game, subject to the interference constraints of PUs as well as the peak transmission power constraints of SUs. We design a joint beamforming and power allocation algorithm for maximizing the total throughput of SUs, which is implemented by alternating iteration of minimum mean square error based decision feedback beamforming and a best response based iterative power allocation algorithm. Simulation results show that the algorithm has better performance than an existing algorithm and can converge to a locally optimal sum utility.

Coalition Formation Game Based Relay Selection and Frequency Sharing for Cooperative Relay Assisted Wireless D2D Networks with QoS Constraints

  • Niu, Jinxin;Tang, Wei;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권11호
    • /
    • pp.5253-5270
    • /
    • 2016
  • With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

Deformable Surface 3D Reconstruction from a Single Image by Linear Programming

  • Ma, Wenjuan;Sun, Shusen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권6호
    • /
    • pp.3121-3142
    • /
    • 2017
  • We present a method for 3D shape reconstruction of inextensible deformable surfaces from a single image. The key of our approach is to represent the surface as a 3D triangulated mesh and formulate the reconstruction problem as a sequence of Linear Programming (LP) problems. The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which are designed to retain original lengths of mesh edges. We use a closed-form method to generate an initial structure, then refine this structure by solving the LP problem iteratively. Compared with previous methods, ours neither involves smoothness constraints nor temporal consistency, which enables us to recover shapes of surfaces with various deformations from a single image. The robustness and accuracy of our approach are evaluated quantitatively on synthetic data and qualitatively on real data.

전력거래에서 제약조건이 고려된 내쉬 균형점의 복합전략 연구 (Mixed Strategy of Nash Equilibrium in Power Transaction With Constraints)

  • 이광호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제51권4호
    • /
    • pp.196-201
    • /
    • 2002
  • An important aspect of the study of power system markets involves the assessment of strategic behavior of participants for maximizing their profits. In models for imperfect competition of a deregulated system, the key tack is to find the Nash equilibrium. When the constraints are not considered in the power market, the equilibrium has the form of a pure strategy. However, the constraints are considered, the equilibrium has the form of a mired strategy. In this paper the bimatrix game approach leer finding a mixed equilibrium is analyzed. The Nash equilibrium of a mixed strategy will be used adequately for the analysis of market power.