• Title/Summary/Keyword: fully distributed model

Search Result 89, Processing Time 0.024 seconds

A Distributed Decision-Making Mechanism for Wireless P2P Networks

  • Wu, Xu;He, Jingsha;Xu, Fei;Zhang, Xi
    • Journal of Communications and Networks
    • /
    • v.11 no.4
    • /
    • pp.359-367
    • /
    • 2009
  • Trust-based solutions provide some form of payment to peers to encourage good behavior. The problem with trust management systems is that they require prior knowledge to work. In other words, peers are vulnerable to attack if they do not have knowledge or correct knowledge of other peers in a trust management system. Therefore, considering only trust is inadequate when a decision is made to identify the best set of peers to utilize. In order to solve the problem, we propose a distributed decision-making mechanism for wireless peer-to-peer (P2P) networks based on game theory and relevant trust mechanisms in which we incorporate the element of trust and risk into a single model. The main idea of our mechanism is to use utility function to express the relationship between benefits and costs of peers, and then make the decision based on expected utility as well as risk attitude in a fully distributed fashion. The unique feature of our mechanism is that it not only helps a peer to select its partners, but also mitigates vulnerabilities in trust-based mechanisms. Through analysis and experiments, we believe our approach is useful for peers to make the decision regarding who to interact with. In addition, it is also a good starting point for exploring tradeoffs among risk, trust and utility.

Analytical Study on Improvement in Load Sharing for Planetary Gear Set using Floating Ring Gear

  • Chung, Woo-Jin;Choi, Kyujeong;Oh, Jooseon;Park, Young-Jun;Lee, Ki-Hun
    • Journal of Biosystems Engineering
    • /
    • v.43 no.4
    • /
    • pp.263-272
    • /
    • 2018
  • Purpose: The load on the planet gear of a planetary gear set is uniformly distributed. However, manufacturing and assembly errors cause uneven load sharing in the planetary gear set. To solve this problem, most studies have suggested applying a floating sun gear to the planetary gear set. However, the effect of the floating ring gear and floating carrier has not been extensively studied. This study aimed to investigate the effect of the floating ring gear. Methods: Two models were developed; one was the fixed ring gear model, and the other was the floating ring gear model. In the fixed ring gear model, the clearance between the ring gear and the housing was $0{\mu}m$, and in the floating ring gear model, the clearance was from $10{\mu}m$ to $100{\mu}m$. The load sharing of the planetary gear set was evaluated by the load sharing factor. Results: Our study showed that with increase in clearance, the load sharing factor of the planetary gear set approached unity. In addition, when the clearance increased above a certain level by which a fully floating ring gear was achieved, the load sharing factor was not affected by the clearance. Conclusions: This indicates that the fully floating ring gear increased the power density of the planetary gearbox by uniformly dividing the load of the planetary gear set. For this reason, the size of the gearbox could be decreased by using a fully floating ring gear.

A Study on the Implementation of CAN in the Distributed System of Power Plant (발전설비 분산제어 시스템에서 CAN 구축기술 연구)

  • Kim, Uk-Heon;Hong, Seung-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.6
    • /
    • pp.760-772
    • /
    • 1999
  • The CAN is a serial communication protocol for distributed real-time control and automation systems. Data generated from field devices in the distributed control of power plant are classified into three categories: real-time event data, real-time control data, non-real-time data. These data share a CAN medium. If the traffic of the CAN protocol is not efficiently controlled, performance requirements of the power plant system could not be satisfied. This paper proposes a bandwidth allocation algorithm that can be applicable to the CAN protocol. The bandwidth allocation algorithm not only satisfies the performance requirements of the real-time systems in the power plant but also fully utilizes the bandwidth of CAN. The bandwidth allocation algorithm introduced in this paper is validated using the integrated discrete-event/continuous-time simulation model which comprises the CAN network and distributed control system of power plant.

  • PDF

Distributed Data Processing for Bigdata Analysis in War Game Simulation Environment (워게임 시뮬레이션 환경에 맞는 빅데이터 분석을 위한 분산처리기술)

  • Bae, Minsu
    • The Journal of Bigdata
    • /
    • v.4 no.2
    • /
    • pp.73-83
    • /
    • 2019
  • Since the emergence of the fourth industrial revolution, data analysis is being conducted in various fields. Distributed data processing has already become essential for the fast processing of large amounts of data. However, in the defense sector, simulation used cannot fully utilize the unstructured data which are prevailing at real environments. In this study, we propose a distributed data processing platform that can be applied to battalion level simulation models to provide visualized data for command decisions during training. 500,000 data points of strategic game were analyzed. Considering the winning factors in the data, variance processing was conducted to analyze the data for the top 10% teams. With the increase in the number of nodes, the model becomes scalable.

  • PDF

Performance Analysis of the DQDB Protocol (DQDB (Distributed Queue Dual Bus) 프로토콜의 성능분석)

  • 이창훈;박광만;홍정완
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.3
    • /
    • pp.1-14
    • /
    • 1994
  • In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.

  • PDF

Analysis of a Decentralized Mobility Management Support for u-City Wireless Network Infrastructure

  • Caytiles, Ronnie D.;Park, Byungjoo
    • Journal of Advanced Information Technology and Convergence
    • /
    • v.10 no.2
    • /
    • pp.73-81
    • /
    • 2020
  • The number of mobile devices roaming into a ubiquitous city (u-city) continues to rise as wireless systems have been widely deployed. The number of mobile devices also varies with time, and they tend to frequently change their locations. In addition, the available wireless access networks may belong to different domains, administrations, management, and internet service providers (ISPs). A fusion of overlapping heterogeneous wireless access networks (e.g., WiMax, Wi-Fi, LTE, etc.) serves the u-city in order to reach different coverage. In this context, technical challenges arise in mobility management for heterogeneous networks to realize their potential coverage and capacity benefits. This paper deals with the analysis of a decentralized mobility management support for u-City wireless network infrastructure. This scheme takes advantage of the features of the fully-distributed model of networked-based mobility management protocol to alleviate and realize the ubiquitous requirements of a u-City.

Variables influencing older people's participation in exercise - Based on Transtheorethical Model (TM) -

  • Cho, Young-Suk
    • Korean Journal of Health Education and Promotion
    • /
    • v.19 no.4
    • /
    • pp.61-76
    • /
    • 2002
  • The purpose of this study is to identify differences in processes of change, decision making, and self-efficacy by exercise behavioral stages and determine variables significantly affecting the older people's participation in exercises. The subjects of this study included 299 people aged 65 or over who were residents of G and S districts in Busan Metropolitan City. They were selected through purposive quota sampling at colleges and centers for old people and homes in order that they could be evenly distributed over stages of pre-contemplation, contemplation, preparation, action and maintenance. Data were analyzed using descriptive, ANOVA, Logistic Regression. Variables that discriminate between participants and non-participants in exercise include self-reevaluation, reinforcing management, cons and self-efficacy. Thus if variables that discriminate between participant and non-participation in exercise such as self-reevaluation, reinforcing management, cons and self-efficacy are fully considered in designing nursing interventions for inducing old people to become exercise participants, it would provide guidelines for nursing intervention programs as appropriate for the people's exercise stages. The purpose of this study is to identify differences in processes of change, decision making, and self-efficacy by exercise behavioral stages and determine variables significantly affecting the older people's participation in exercises. The subjects of this study included 299 people aged 65 or over who were residents of G and S districts in Busan Metropolitan City. They were selected through purposive quota sampling at colleges and centers for old people and homes in order that they could be evenly distributed over stages of pre-contemplation, contemplation, preparation, action and maintenance. Data were analyzed using descriptive, ANOVA, Logistic Regression. Variables that discriminate between participants and non-participants in exercise include self-reevaluation, reinforcing management, cons and self-efficacy. Thus if variables that discriminate between participation and non-participation in exercise such as self-reevaluation, reinforcing management, cons and self-efficacy are fully considered in designing nursing interventions for inducing old people to become exercise participants, it would provide guidelines for nursing intervention programs as appropriate for the people's exercise stages.

A Medium Access Control Mechanism for Distributed In-band Full-Duplex Wireless Networks

  • Zuo, Haiwei;Sun, Yanjing;Li, Song;Ni, Qiang;Wang, Xiaolin;Zhang, Xiaoguang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5338-5359
    • /
    • 2017
  • In-band full-duplex (IBFD) wireless communication supports symmetric dual transmission between two nodes and asymmetric dual transmission among three nodes, which allows improved throughput for distributed IBFD wireless networks. However, inter-node interference (INI) can affect desired packet reception in the downlink of three-node topology. The current Half-duplex (HD) medium access control (MAC) mechanism RTS/CTS is unable to establish an asymmetric dual link and consequently to suppress INI. In this paper, we propose a medium access control mechanism for use in distributed IBFD wireless networks, FD-DMAC (Full-Duplex Distributed MAC). In this approach, communication nodes only require single channel access to establish symmetric or asymmetric dual link, and we fully consider the two transmission modes of asymmetric dual link. Through FD-DMAC medium access, the neighbors of communication nodes can clearly know network transmission status, which will provide other opportunities of asymmetric IBFD dual communication and solve hidden node problem. Additionally, we leverage FD-DMAC to transmit received power information. This approach can assist communication nodes to adjust transmit powers and suppress INI. Finally, we give a theoretical analysis of network performance using a discrete-time Markov model. The numerical results show that FD-DMAC achieves a significant improvement over RTS/CTS in terms of throughput and delay.

A Fully Distributed Secure Approach using Nondeterministic Encryption for Database Security in Cloud

  • Srinu Banothu;A. Govardhan;Karnam Madhavi
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.1
    • /
    • pp.140-150
    • /
    • 2024
  • Database-as-a-Service is one of the prime services provided by Cloud Computing. It provides data storage and management services to individuals, enterprises and organizations on pay and uses basis. In which any enterprise or organization can outsource its databases to the Cloud Service Provider (CSP) and query the data whenever and wherever required through any devices connected to the internet. The advantage of this service is that enterprises or organizations can reduce the cost of establishing and maintaining infrastructure locally. However, there exist some database security, privacychallenges and query performance issues to access data, to overcome these issues, in our recent research, developed a database security model using a deterministic encryption scheme, which improved query execution performance and database security level.As this model is implemented using a deterministic encryption scheme, it may suffer from chosen plain text attack, to overcome this issue. In this paper, we proposed a new model for cloud database security using nondeterministic encryption, order preserving encryption, homomorphic encryptionand database distribution schemes, andour proposed model supports execution of queries with equality check, range condition and aggregate operations on encrypted cloud database without decryption. This model is more secure with optimal query execution performance.

Achieving and Reasoning about Common Beliefs based on Social Networking Services: on the Group Chatting Model of KakaoTalk (소셜 네트워크에서 공통믿음의 형성과 추론: 카카오톡 채팅방을 중심으로)

  • Kim, Koono
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.27 no.1
    • /
    • pp.7-14
    • /
    • 2017
  • Theoretically, it is known that common beliefs and/or common knowledge cannot be attained in asynchronously distributed multiagent environments, however, it show that some propositions with deadlines can be attained as common beliefs among a set of fully trusted agents even when they communicate to each other asynchronously. Generally, in the multiagent environment, the attainment of common beliefs is approached as a problem of communication, and for the common beliefs paradox that the common beliefs is not attained on a system without communication time restriction is applied to loose coarser granularity and it prove that forming common beliefs is possible by relaxing necessary requirements through the KakaoTalk chatting model. I also experimented with the reasoning function that confirms the common beliefs by inquiring about the common belief generated by implementing the inference function in each agent of the KakaoTalk chatting model. Through utilizing metalogic programming, a formalization of the presentation and reasoning of common beliefs has been achieved, and the group chatting model of KakaoTalk was adopted in experiments to show that common beliefs can be formed among distributed agents using asynchronous communication.