• 제목/요약/키워드: Distributed Research Networks

검색결과 273건 처리시간 0.025초

지연 감내 네트워크에서 커뮤니티 기반 영향력 측정 기법 (A Community-Based Influence Measuring Scheme in Delay-Tolerant Networks)

  • 김찬명;김용환;한연희
    • 한국통신학회논문지
    • /
    • 제38B권1호
    • /
    • pp.87-96
    • /
    • 2013
  • 사회 관계망에서 영향력의 전파는 중요한 연구 이슈이다. 영향 전파는 임의의 노드로 부터 새로운 아이디어, 정보, 소문의 전파로 인해 다른 노드들의 상태나 성질이 변화하는 것을 뜻한다. 영향을 받은 노드는 자신과 통신하는 다른 노드에게도 영향을 주고 영향은 확산되어 네트워크 내에서 퍼져 나간다. 입소문 마케팅에 기반을 둔 영향력 전파 문제는 네트워크에 가장 영향력을 끼칠 수 있는 노드들을 찾아 전체 네트워크에 영향력을 최대화 하는 것이 목적이다. 본 논문에서는 Delay-Tolerant Networks에서 각 노드의 영향력을 측정하여 가장 영향력 있는 노드 집합을 선택하는 문제를 다룬다. 노드 간 연결성이 항시 보장되지 않는 Delay-Tolerant Networks 환경에서는 전체 네트워크 정보를 정확히 알 수 없기 때문에 노드의 영향력을 정확히 측정하는 것은 쉽지 않다. 본 논문에서는 Delay-Tolerant Networks 환경에서 분산 방식으로 각자 노드가 $k$-clique 구조로 커뮤니티를 구성하여 한정된 지역 정보만을 활용하여 자신의 영향력을 추정하는 방법을 제시한다. 또한, 실험을 통해 제안 기법으로 산출한 영향력 있는 노드 정보가 전체 네트워크 관점에서 산출한 영향력 있는 노드 정보와 거의 일치함을 보인다.

Data Management and Communication Networks for Man-Machine Interface System in Korea Advanced Liquid MEtal Reactor : Its Functionality and Design Requirements

  • Cha, Kyung-Ho;Park, Gun-Ok;Suh, Sang-Moon;Kim, Jang-Yeol;Kwon, Kee-Choon
    • 한국원자력학회:학술대회논문집
    • /
    • 한국원자력학회 1998년도 춘계학술발표회논문집(1)
    • /
    • pp.291-296
    • /
    • 1998
  • The DAta management and Communication NETworks (DACONET), Which it is designed as a subsystem for Man-Machine Interface System of Korea Advanced LIquid MEtal Reactor(KALIMER MMIS) and advanced design concept is approached, is described. The DACONET has its roles of providing the real-time data transmission and communication paths between MMIS systems, providing the quality data for protection, monitoring and control of KALIMER and logging the static and dynamic behavioral data during KALIMER operation. The DACONET is characterised as the distributed real-time system architecture with high performance, Future direction, in which advanced technology is being continually applied to Man-Machine interface System Development of Nuclear Power Plants, will be considered for designing data management and communication networks of KALIMER MMIS

  • PDF

HDF: Hybrid Debugging Framework for Distributed Network Environments

  • Kim, Young-Joo;Song, Sejun;Kim, Daeyoung
    • ETRI Journal
    • /
    • 제39권2호
    • /
    • pp.222-233
    • /
    • 2017
  • Debugging in distributed environments, such as wireless sensor networks (WSNs), which consist of sensor nodes with limited resources, is an iterative and occasionally laborious process for programmers. In sensor networks, it is not easy to find unintended bugs that arise during development and deployment, and that are due to a lack of visibility into the nodes and a dearth of effective debugging tools. Most sensor network debugging tools are not provided with effective facilities such as real-time tracing, remote debugging, or a GUI environment. In this paper, we present a hybrid debugging framework (HDF) that works on WSNs. This framework supports query-based monitoring and real-time tracing on sensor nodes. The monitoring supports commands to manage/control the deployed nodes, and provides new debug commands. To do so, we devised a debugging device called a Docking Debug-Box (D2-Box), and two program agents. In addition, we provide a scalable node monitor to enable all deployed nodes for viewing. To transmit and collect their data or information reliably, all nodes are connected using a scalable node monitor applied through the Internet. Therefore, the suggested framework in theory does not increase the network traffic for debugging on WSNs, and the traffic complexity is nearly O(1).

Competitive Resource Sharing Based on Game Theory in Cooperative Relay Networks

  • Zhang, Guopeng;Cong, Li;Zhao, Liqiang;Yang, Kun;Zhang, Hailin
    • ETRI Journal
    • /
    • 제31권1호
    • /
    • pp.89-91
    • /
    • 2009
  • This letter considers the problem of resource sharing among a relay and multiple user nodes in cooperative transmission networks. We formulate this problem as a sellers' market competition and use a noncooperative game to jointly consider the benefits of the relay and the users. We also develop a distributed algorithm to search the Nash equilibrium, the solution of the game. The convergence of the proposed algorithm is analyzed. Simulation results demonstrate that the proposed game can stimulate cooperative diversity among the selfish user nodes and coordinate resource allocation among the user nodes effectively.

  • PDF

Hybrid Distributed Stochastic Addressing Scheme for ZigBee/IEEE 802.15.4 Wireless Sensor Networks

  • Kim, Hyung-Seok;Yoon, Ji-Won
    • ETRI Journal
    • /
    • 제33권5호
    • /
    • pp.704-711
    • /
    • 2011
  • This paper proposes hybrid distributed stochastic addressing (HDSA), which combines the advantages of distributed addressing and stochastic addressing, to solve the problems encountered when constructing a network in a ZigBee-based wireless sensor network. HDSA can assign all the addresses for ZigBee beyond the limit of addresses assigned by the existing distributed address assignment mechanism. Thus, it can make the network scalable and can also utilize the advantages of tree routing. The simulation results reveal that HDSA has better addressing performance than distributed addressing and better routing performance than other on-demand routing methods.

Efficient Interference Control Technology for Vehicular Moving Networks

  • Oh, Sung-Min;Lee, Changhee;Lee, Jeong-Hwan;Park, Ae-Soon;Shin, Jae Sheung
    • ETRI Journal
    • /
    • 제37권5호
    • /
    • pp.867-876
    • /
    • 2015
  • This paper proposes an efficient interference control scheme for vehicular moving networks. The features of the proposed scheme are as follows: radio resources are separated into two resource groups to avoid interference between the cellular and vehicle-to-vehicle (V2V) links; V2V links are able to share the same radio resources for an improvement in the resource efficiency; and vehicles can adaptively adjust their transmission power according to the interference among the V2V links (based on the distributed power control (DPC) scheme derived using the network utility maximization method). The DPC scheme, which is the main feature of the proposed scheme, can improve both the reliability and data rate of a V2V link. Simulation results show that the DPC scheme improves the average signal-to-interference-plus-noise ratio of V2V links by more than 4 dB, and the sum data rate of the V2V links by 15% and 137% compared with conventional schemes.

국내 배전망 정책 및 환경변화를 고려한 배전부분 발전방향 연구 (KEPCO's Movement on Distribution Sector Regarding Renewable Energy Transition of Distribution Network in Korea)

  • Hyun, Seung-Yoon;Kim, Chang-Hwan;Lee, Byung-Sung
    • KEPCO Journal on Electric Power and Energy
    • /
    • 제7권1호
    • /
    • pp.93-99
    • /
    • 2021
  • The government has proposed a mission to enhance intelligent power networks, decrease coal-fired generation, expand distributed energy resources, and promote energy prosumer into the distribution network in Korea. Installation cost of facility expansion to guaranteed interconnection with small distributed energy resources increases dramatically on KEPCO's distribution sector. And it is hard to withdraw in time. In addition, there are explicit research is required to meet the reliability on grid corresponding to the increase of distributed power. Infrastructure support for accommodating energy prosumer is also needed. Therefore, KEPCO is pushing transition to DSO by expanding distribution management scope and changing its roles. In addition, KEPCO is proactively preparing for integrated operation between distribution network and existing distributed power which is accommodated passively. KEPCO is also trying to accept multiple network users, e.g. building platforms, to manage a data and promote new markets. In the long term, transition to DSO will achieve saving investment costs for accommodating distributed sources and maintaining stable electrical quality. And it will be possible to create new business model using the platform to secure revenue.

6G in the sky: On-demand intelligence at the edge of 3D networks (Invited paper)

  • Strinati, Emilio Calvanese;Barbarossa, Sergio;Choi, Taesang;Pietrabissa, Antonio;Giuseppi, Alessandro;De Santis, Emanuele;Vidal, Josep;Becvar, Zdenek;Haustein, Thomas;Cassiau, Nicolas;Costanzo, Francesca;Kim, Junhyeong;Kim, Ilgyu
    • ETRI Journal
    • /
    • 제42권5호
    • /
    • pp.643-657
    • /
    • 2020
  • Sixth generation will exploit satellite, aerial, and terrestrial platforms jointly to improve radio access capability and unlock the support of on-demand edge cloud services in three-dimensional (3D) space, by incorporating mobile edge computing (MEC) functionalities on aerial platforms and low-orbit satellites. This will extend the MEC support to devices and network elements in the sky and forge a space-borne MEC, enabling intelligent, personalized, and distributed on-demand services. End users will experience the impression of being surrounded by a distributed computer, fulfilling their requests with apparently zero latency. In this paper, we consider an architecture that provides communication, computation, and caching (C3) services on demand, anytime, and everywhere in 3D space, integrating conventional ground (terrestrial) base stations and flying (non-terrestrial) nodes. Given the complexity of the overall network, the C3 resources and management of aerial devices need to be jointly orchestrated via artificial intelligence-based algorithms, exploiting virtualized network functions dynamically deployed in a distributed manner across terrestrial and non-terrestrial nodes.

Semijoin-Based Spatial Join Processing in Multiple Sensor Networks

  • Kim, Min-Soo;Kim, Ju-Wan;Kim, Myoung-Ho
    • ETRI Journal
    • /
    • 제30권6호
    • /
    • pp.853-855
    • /
    • 2008
  • This paper presents an energy-efficient spatial join algorithm for multiple sensor networks employing a spatial semijoin strategy. For optimization of the algorithm, we propose a GR-tree index and a grid-ID-based spatial approximation method, which are unique to sensor networks. The GR-tree is a distributed spatial index over the sensor nodes, which efficiently prunes away the nodes that will not participate in a spatial join result. The grid-ID-based approximation provides great reduction in communication cost by approximating many spatial objects in simpler forms. Our experiments demonstrate that the algorithm outperforms existing methods in reducing energy consumption at the nodes.

  • PDF

Scalable Quasi-Dynamic-Provisioning-Based Admission Control Mechanism in Differentiated Service Networks

  • Rhee, Woo-Seop;Lee, Jun-Hwa;Yu, Jae-Hoon;Kim, Sang-Ha
    • ETRI Journal
    • /
    • 제26권1호
    • /
    • pp.27-37
    • /
    • 2004
  • The architecture in a differentiated services (DiffServ) network is based on a simple model that applies a per-class service in the core node of the network. However, because the network behavior is simple, the network structure and provisioning is complicated. If a service provider wants dynamic provisioning or a better bandwidth guarantee, the differentiated services network must use a signaling protocol with QoS parameters or an admission control method. Unfortunately, these methods increase the complexity. To overcome the problems with complexity, we investigated scalable dynamic provisioning for admission control in DiffServ networks. We propose a new scalable $qDPM^2$ mechanism based on a centralized bandwidth broker and distributed measurement-based admission control and movable boundary bandwidth management to support heterogeneous QoS requirements in DiffServ networks.

  • PDF