• Title/Summary/Keyword: policy updating

Search Result 61, Processing Time 0.025 seconds

TF-CPABE: An efficient and secure data communication with policy updating in wireless body area networks

  • Chandrasekaran, Balaji;Balakrishnan, Ramadoss;Nogami, Yasuyuki
    • ETRI Journal
    • /
    • v.41 no.4
    • /
    • pp.465-472
    • /
    • 2019
  • The major challenge in wireless body area networks (WBAN) is setting up a protected communication between data consumers and a body area network controller while meeting the security and privacy requirements. This paper proposes efficient and secure data communication in WBANs using a Twofish symmetric algorithm and ciphertext-policy attribute-based encryption with constant size ciphertext; in addition, the proposed scheme incorporates policy updating to update access policies. To the best of the author's knowledge, policy updating in WBAN has not been studied in earlier works. The proposed scheme is evaluated in terms of message size, energy consumption, and computation cost, and the results are compared with those of existing schemes. The result shows that the proposed method can achieve higher efficiency than conventional methods.

Enabling Fine-grained Access Control with Efficient Attribute Revocation and Policy Updating in Smart Grid

  • Li, Hongwei;Liu, Dongxiao;Alharbi, Khalid;Zhang, Shenmin;Lin, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1404-1423
    • /
    • 2015
  • In smart grid, electricity consumption data may be handed over to a third party for various purposes. While government regulations and industry compliance prevent utility companies from improper or illegal sharing of their customers' electricity consumption data, there are some scenarios where it can be very useful. For example, it allows the consumers' data to be shared among various energy resources so the energy resources are able to analyze the data and adjust their operation to the actual power demand. However, it is crucial to protect sensitive electricity consumption data during the sharing process. In this paper, we propose a fine-grained access control scheme (FAC) with efficient attribute revocation and policy updating in smart grid. Specifically, by introducing the concept of Third-party Auditor (TPA), the proposed FAC achieves efficient attribute revocation. Also, we design an efficient policy updating algorithm by outsourcing the computational task to a cloud server. Moreover, we give security analysis and conduct experiments to demonstrate that the FAC is both secure and efficient compared with existing ABE-based approaches.

Updating Policy of Indoor Moving Object Databases for Location-Based Services: The Kalman Filter Method (위치기반서비스를 위한 옥내 이동객체 데이터베이스 갱신전략: 칼만 필터 방법)

  • Yim, Jae-Geol;Joo, Jae-Hun;Park, Chan-Sik;Gwon, Ki-Young;Kim, Min-Hye
    • The Journal of Information Systems
    • /
    • v.19 no.1
    • /
    • pp.1-17
    • /
    • 2010
  • This paper proposes an updating policy of indoor moving object databases (IMODB) for location-based services. our method applies the Ka1man filter on the recently collected measured positions to estimate the moving object's position and velocity at the moment of the most recent measurement, and extrapolate the current position with the estimated position and velocity. If the distance between the extrapolated current position and the measured current position is within the threshold, in other words if they are close then we skip updating the IMODB. When the IMODB needs to know the moving object's position at a certain moment T, it applies the Kalman filter on the series of the measurements received before T and extrapolates the position at T with the estimations obtained by the Kalman filter. In order to verify the efficiency of our updating method, we performed the experiments of applying our method on the series of measured positions obtained by applying the fingerprinting indoor positioning method while we are actually walking through the test bed. In the analysis of the test results, we estimated the communication saving rate of our method and the error increment rate caused by the communication saving.

Generating Korean synthetic populations by using the iterative proportional updating method (Iterative Proportional Updating 방법을 이용한 한국 가상 인구 데이터 생성)

  • Son, Woo-Sik;Kwon, Okyu;Lee, Sang-Hee
    • Journal of the Korea Society for Simulation
    • /
    • v.25 no.4
    • /
    • pp.13-20
    • /
    • 2016
  • Microsimulation model has aimed to simulate the impact of policy at the level of individual and household. Recently, microsimulation model has been widely accepted in OECD countries for evaluating their economic and social policies. For improving the availability of microsimulation model, the population data which shows good accordance with the official statistics should be required. In this paper, we generate Korean synthetic populations by using the iterative proportional updating method. For the validation of Korean synthetic populations, we compute the difference between the generated synthetic populations and the summary table of Korean census. Then, we confirm that it shows good accordance with the summary table.

Petri Net Model for Moving Objects Database (이동물체 데이터베이스의 페트리 넷 모형)

  • 임재걸;이계영
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.1-10
    • /
    • 2004
  • Quite many papers about moving objects database (MOD) have been Published. Most of them are concerning of improving efficiency of updating policy, but none of them talks about verification of system's requirements. No matter how efficient updating policy is employed, a system designer still has to verify if the MOD satisfies user's requirement at the beginning of system lifestyle. For example, if a MOD serves n moving objects, then the designer must verity if it can update information for n moving objects and provide new information to moving objects within specified time limit. For the purpose of requirement analysis of MODs, we build a Petri net model for MOD using Design/CPN, and then we show how to verify whether the MOD satisfies user's requirements by simulation. The contribution of this paper is providing a simulation model for requirement analysis of MOD for the first time. The model is expansion of our previous fuzzy-timing Petri net model. The distance-based updating policy, and distributed database management system are reflected in this model and system analysis for moving objects is considered. It is built in Design/CPN so that the simulation can be automatically performed. The application of our model is not limited to requirement analysis, it is useful to study other MOD design issues, such as the trade-offs between update cost and information accuracy, and between the tim interval needed for updating database and MOD system resources, etc.

View Maintenance Policy for considering MIN/MAX query in Data warehousing (데이터웨어하우징에서 MIN/MAX질의를 고려한 뷰관리 정책)

  • 김근형;김두경
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.8
    • /
    • pp.1336-1345
    • /
    • 2002
  • Materialized views in data warehouse play important roles in rapidly answering to users's requests for information Processing. More views in data warehouse, can respond to the users more rapidly because the user's requests may be processed by using only the materialized views with higher probabilities rather than accessing base relations. The limited duration, during which the materialized views are updated due to base relations's changes, limits the number of materialized views in data warehouse. In this paper, we propose efficient policy for updating the materialized views, which can save the update duration of views although MIN/MAX values frequently change in base relation. The policy updates the materialized views by distinguishing whether MIN/MAX values's changes in the base relation are insert value or delete value. Then, the number of accesses to the base relation is descreased when updating the MIN/MAX values in the materialized views.

A study on the establishment and development of the Daesoon Thought Thesaurus (대순사상 시소러스의 구축에 관한 연구)

  • Lee, Sang-Bok;Jang, In-Ho
    • Journal of the Daesoon Academy of Sciences
    • /
    • v.19
    • /
    • pp.21-45
    • /
    • 2005
  • The purpose of this study is to examine the establishment and development of Daesoon Thought Thesaurus. Specifically, this study examined the matters to be considered in the stage of Thesauri planning according to the Thesauri Construction process : presents the methods and standards of Thesauri Construction according to processes such as identification of the indexing policy, establishment of Thesauri system, collection of vocabulary, selection of preferred term, clustering of the terms, establishment of term relationships, overall adjustment, Thesauri test, proofreading by professional display, maintenance and updating. Since religion information is unique or totally different from the information in other areas, it is most important to construct the Thesauri suitable for system after carefully recognizing the concept of religion terms.

  • PDF

Optimal solution search method by using modified local updating rule in ACS-subpath algorithm (부경로를 이용한 ACS 탐색에서 수정된 지역갱신규칙을 이용한 최적해 탐색 기법)

  • Hong, SeokMi;Lee, Seung-Gwan
    • Journal of Digital Convergence
    • /
    • v.11 no.11
    • /
    • pp.443-448
    • /
    • 2013
  • Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the total frequency of visits of the currently selected node in the previous iteration. I used the ACS algoritm using subpath for search. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

The Need for Updating the Survey Population of Traditional Market (전통시장 모집단 현행화의 필요성)

  • Lee, Chul-Sung;Kim, Young-Ki;Kim, Seung-Hee
    • Journal of Distribution Science
    • /
    • v.17 no.4
    • /
    • pp.77-85
    • /
    • 2019
  • Purpose - Statistics of Traditional Market is the only source of information on traditional markets, shopping street, and underground shopping street. The government conducts a survey of traditional market conditions every year to look at the current status of traditional markets and provide effective support. Therefore, this study examines the necessity and validity of updating about the Survey Population of Traditional Market Research design, data, and methodology - This study investigated the necessity of updating about the Survey Population of Traditional Market through literature review. Therefore this study examined the necessity of the current population based on the review of the population related to the sample design, methods, and the sampling frame. Next, we examined the change patterns of the population and the sample by dividing the population and sample of the current survey of the traditional market survey into the market unit, the store unit within the market, and finally the individual store unit. Results - As a result, the population of traditional market changes about 4~6%. Next, the analysis of the store unit in the market shows that the number of stores is very variable even though the market is continuously included in the survey target. Finally, as a result of examining the characteristics of individual stores, the stores with less than one year were more than 6% of the total surveyed stores based on the traditional market. These results are generally inconsistent with the idea that stores in traditional markets will operate for a long time in one place. Next, we proposed the establishment of a management system, applying Citizen Generated Data, and circulation survey. Additionally, this study proposes to change the stratification variables at the regional level rather than the market unit. Conclusions - Therefore, in this study, it is suggested that a current population of traditional market is needed updating, and that a population survey should be updated at least four years. In addition, a system for investigating traditional markets and districts was established and a circulation survey was proposed for efficient use of budgets. Based on these research results and policy suggestions, the future research directions are suggested.

Dynamic Task Scheduling Via Policy Iteration Scheduling Approach for Cloud Computing

  • Hu, Bin;Xie, Ning;Zhao, Tingting;Zhang, Xiaotong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1265-1278
    • /
    • 2017
  • Dynamic task scheduling is one of the most popular research topics in the cloud computing field. The cloud scheduler dynamically provides VM resources to variable cloud tasks with different scheduling strategies in cloud computing. In this study, we utilized a valid model to describe the dynamic changes of both computing facilities (such as hardware updating) and request task queuing. We built a novel approach called Policy Iteration Scheduling (PIS) to globally optimize the independent task scheduling scheme and minimize the total execution time of priority tasks. We performed experiments with randomly generated cloud task sets and varied the performance of VM resources using Poisson distributions. The results show that PIS outperforms other popular schedulers in a typical cloud computing environment.