• Title/Summary/Keyword: peer communication

Search Result 405, Processing Time 0.026 seconds

Mobile Data System Implementation of P2P used (P2P를 이용한 모바일 데이터 시스템 구현)

  • Kim, Dong-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1691-1695
    • /
    • 2005
  • Mobile P2P Service can compose free network from one client to another without central server function. Diversified Information & Data are able to be transmitted among peer to peer based upon extended mobile concept. In this paper Mobile P2P Service is applied to the program which gathering, sharing, analysis agricultural information and the natural disasters Information We desire to authenticate request about service to user who is administered between each user to limit connection. Wish to admit authentication mechanism to mechanism that can do information sharing suety in P2P environment to solve this in this treatise and design authentication mechanism.

Scrambling Technology in MPEG Video Environment (MPEG비디오 부호화기 내의 scrambling 기술)

  • Kwon, Goo-Rak;Youn, Joo-Sang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.7
    • /
    • pp.1279-1284
    • /
    • 2009
  • With the advance of multimedia technology, multimedia sharing among multiple devices has become the main issue. This allows users to expect the peer-to-peer distribution of unprotected and protected contents over public network. Inevitably, this situation has caused an incredible piracy activity and Web sites have begun to provide copyrighted A/V data for free. In order to, protect the contents from illegal attacks and distribution, digital right management (DRM) is required. In this paper, we present the minimal cost scrambling scheme for securing the copyrighted multimedia using the data encryption standard (DES) encryption technique. Experimental results indicate that the proposed scrambling techniques achieve a very good compromise between several desirable properties such as speed, security, and file size.

Efficient Data Publishing Method for Protecting Sensitive Information by Data Inference (데이터 추론에 의한 민감한 정보를 보호하기 위한 효율적인 데이터 출판 방법)

  • Ko, Hye-Kyeong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.9
    • /
    • pp.217-222
    • /
    • 2016
  • Recent research on integrated and peer-to-peer databases has produced new methods for handling various types of shared-group and process data. This paper with data publishing, where the publisher needs to specify certain sensitive information that should be protected. The proposed method cannot infer the user's sensitive information is leaked by XML constraints. In addition, the proposed secure framework uses encrypt to prevent the leakage of sensitive information from authorized users. In this framework, each node of sensitive data in an eXtensible Markup Language (XML) document is encrypted separately. All of the encrypted data are moved from their original document, and are bundled with an encrypted structure index. Our experiments show that the proposed framework prevents information being leaked via data inference.

Inter-Process Correlation Model based Hybrid Framework for Fault Diagnosis in Wireless Sensor Networks

  • Zafar, Amna;Akbar, Ali Hammad;Akram, Beenish Ayesha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.536-564
    • /
    • 2019
  • Soft faults are inherent in wireless sensor networks (WSNs) due to external and internal errors. The failure of processes in a protocol stack are caused by errors on various layers. In this work, impact of errors and channel misbehavior on process execution is investigated to provide an error classification mechanism. Considering implementation of WSN protocol stack, inter-process correlations of stacked and peer layer processes are modeled. The proposed model is realized through local and global decision trees for fault diagnosis. A hybrid framework is proposed to implement local decision tree on sensor nodes and global decision tree on diagnostic cluster head. Local decision tree is employed to diagnose critical failures due to errors in stacked processes at node level. Global decision tree, diagnoses critical failures due to errors in peer layer processes at network level. The proposed model has been analyzed using fault tree analysis. The framework implementation has been done in Castalia. Simulation results validate the inter-process correlation model-based fault diagnosis. The hybrid framework distributes processing load on sensor nodes and diagnostic cluster head in a decentralized way, reducing communication overhead.

A Study on Information leak state and measure by Peer-to-Peer Program in Japan (일본의 P2P프로그램 정보유출 현황 및 대책 연구)

  • Wan-Soo Kim;Sik Kim
    • Annual Conference of KIPS
    • /
    • 2008.11a
    • /
    • pp.1393-1396
    • /
    • 2008
  • P2P프로그램에 대한 연구는 정보공유 및 성능 향상을 초점으로 많은 연구가 진행되어 왔다. 그러나 P2P프로그램의 정보유출 문제에 대한 원인분석 및 대응방안에 대한 연구는 미비한 실정이다. 일본은 2004년부터 P2P프로그램을 통한 정보유출 사건이 빈번히 발생하고 있다. 이와 같은 이유로 본 연구는 일본의 P2P프로그램을 통한 정보유출 현황, 원인, 대응방안을 연구했다. 정보유출 현황을 조사하기 위해 정보유출에 관련된 언론기사를 수집했고, 일본 P2P프로그램으로부터 유출되고 있는 정보를 30개월간 수집했다. 정보유출 원인을 이해하고 대응방안을 파악하기 위해서 일본 P2P프로그램의 사용현황, 정보유출 사례, 정보유출 원인, 일본 정부·기관·기업·군의 대응방안을 조사하고 분석했다. 유출된 정보를 수집한 결과 개인 신상정보, 기업, 관공서, 군 등의 내부 자료를 수집할 수 있었으며, 유출 정보로 인한 사회적 심각성을 이해할 수 있었다. 또한 일본 민·관·군의 정보유출 대응방안이 실효성을 거두고 있는가를 검증하기위해서 유출정보를 지속적으로 수집하였다. 그 결과 대응방안 적용 시점부터 유출정보가 급격히 감소했음을 확인했다. 이러한 연구 결과는 타 국가의 P2P프로그램을 통한 정보유출 대응방안수립에 도움이 될 것이다.

Empirical Analysis of Young Startup Project Digital Papers to Strengthen Entrepreneurship: Focusing on Readiness and Collaboration by Generation Z (기업가정신 강화를 위한 디지털 청년창업일지 실증분석: Z세대의 스타트업 준비와 협업을 중심으로)

  • Yeryung Moon;Geonuk Nam;Hanjin Lee
    • Journal of Information Technology Services
    • /
    • v.23 no.3
    • /
    • pp.91-101
    • /
    • 2024
  • Based on the analysis of 174 Young Startups Project Papers from university students majoring in entrepreneurship, this study aimed to identify the thoughts and characteristics of prospective entrepreneurs and derive their main agendas. Detailed information was collected on their preparation and ambitions for entrepreneurship, market research in their fields of interest, analysis of potential target users, requirements, and team management. We refined, categorized, and interpreted 84,818 words across 396 digital pages on LMS, and visualized using word clouds program. Additionally, interviews about peer learning were conducted by Zoom. The analysis revealed unique differences in students' perspectives on entrepreneurship based on their major, academic year, and gender. Also we could find that they actively utilize AI tech with a strong spirit of challenge in the startups. Interestingly, they emphasized horizontal communication and collaboration capabilities to improve productivity. This suggests the need to consider diversity in the design of entrepreneurship incubating content and programs for generation Z technically and academically.

Service Discovery Mechanism based on Trustable DHT in MANET (MANET에서 신뢰성 있는 DHT기반의 서비스 발견 기법)

  • Han, In-Sung;Ryou, Hwang-Bin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1947-1954
    • /
    • 2009
  • Service discovery mechanism is a core technique for getting a desired service in MANET(Mobile Ad-Hoc NETwork) environment. However, As feature of MANET, existing mechanisms have some problem that service requester search for trustable service. also it can not support scalability. in this paper, how to reliably support applications such as service discovery on top of MANET. we are firstly finding a trustable service provider and configure DHT(Distributed Hash Table). P2P's DHT can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both are instances of self-organizing decentralized systems. Especially, Proposed DHT systems used for P2P overlay network can be effective in reducing the communication overhead in service discovery. So proposed mechanism can support for reliably searching required service and scalability. Simulation results show that our mechanism is scalable and outperforms existing service discovery mechanism.

A Study on the Information Effluence State and Measure by Peer-to-Peer Programs in Korea and Japan (P2P프로그램을 통한 한국과 일본의 정보유출 현황 및 대책 연구)

  • Kim, Wan-Soo;Kim, Shik
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.1
    • /
    • pp.67-74
    • /
    • 2009
  • Information Effluence leaks are caused by the wide use of the P2P program in Japan and Korea lead by the increase of internet use and network infrastructure expansion. This research confirms the seriousness of the data collected from the P2P leaks of the two countries and furthers its study by researching how countermeasures are applied. The effectiveness is verified by collecting data according to countermeasure applied periods. Both countries had information leaks, but in the case of Japan, not only personal information leaks but corporation, administrative agency, military, and others in a wide range as well. As a countermeasure against information effluence, Korea is enforcing counter plans mainly against the P2P service businesses and for Japan, various plans are taken such as business guides for each agency, organization management, SW development and supply, HW supply, and ect. The leaks in Japan were more severe than the ones in Korea but they had well planned countermeasures that were applied. Therefore if the Japanese countermeasure on information effluence of P2P programs is taken as a lesson, Korea can prevent the problem of leaks beforehand.

  • PDF

The Procedural Design and Evaluation of RPT Learning Model for NLE Beginners (비선형 편집 입문자를 위한 RPT 학습모형 절차 설계 및 평가)

  • Jang, Kyeong-Su
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.4
    • /
    • pp.163-172
    • /
    • 2017
  • In recent days, the Non-Linear Editing is mainly used in the field of broadcasting. In comparison to conventional editing, Non-Linear Editing can immediately access the image of the desired position and facilitate the insertion and deletion of video frame. Furthermore, it directly apply a title and transition effect to video frame. Moreover, it has an advantage of preview and easy modification in title effect, transition and editing prior to export. However, students who learn Non-Linear Editing first time are not easy to learn it. In this paper, we propose a new learning model based on Reciprocal Peer Teaching (RPT), which helps NLE beginners to understand Non-Linear editing more clearly. We divide the students into two groups i.e. control group and experimental group. The control group students do not apply proposed method while experimental group performs evaluation over our model. Furthermore, we carry out the experiments, which include the overall average of the two groups, academic achievement of students with low grades, standard deviation, T-test and satisfaction surveys. The experimental group shows the superiority in performed experiments and higher satisfaction ratings than the control group.

A Leader Election Algorithm and Performance Evaluation for Mobile Ad hoc Networks (이동 에드 혹 네트워크를 위한 제어노드 선택 알로리즘 및 성능 평가)

  • Parvathipuram Pradeep;Yang Gi-Chul;Oh Sooyul
    • The KIPS Transactions:PartC
    • /
    • v.11C no.6 s.95
    • /
    • pp.829-834
    • /
    • 2004
  • Nodes communicate through wireless channels under peer-to-peer level in ad-hoc mobile networks. The nodes are free to move around in a geographical area and are loose]y bounded by the transmission range of the wireless channels. Also, a node is completely free to move around, there is no fixed final topology. Hence, to manage the inter-node communication and data exchange among them a leader node is required. In this paper we introduce an efficient leader election algorithm for mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes. Furthermore we present the result of performance evaluation through simulation. The algorithm is efficient and practical since it uses least amount of wireless resources and does not affect the movement of the nodes.