• Title/Summary/Keyword: Mobile P2P(Peer-to-Peer)

Search Result 108, Processing Time 0.044 seconds

Efficient Skyline Query Processing Scheme in Mobile P2P Networks (모바일 P2P 네트워크에서 효율적인 스카이라인 질의 처리 기법)

  • Bok, Kyoung-Soo;Park, Sun-Yong;Kim, Dae-Yeon;Lim, Jong-Tae;Shin, Jae-Ryong;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.7
    • /
    • pp.30-42
    • /
    • 2015
  • In this paper, we propose a new skyline query processing scheme to enhance accuracy of query processing and communication cost in mobile P2P environments. The proposed scheme consists of three stages such as the pre-skyline processing, the query transmission range extension policy, and the continuous skyline query processing. In the pre-skyline processing, a peer selects the candidate filtering objects who have the potential to be selected. By doing so, the proposed scheme reduces the filtering cost when processing the query. In the query transmission range extension policy, we have improved the accuracy by extending the query transmission range. In addition, it can handle continuous skyline query by performing the monitoring after the first skyline query processing. In order to show the superiority of the proposed method, we compare it with the existing schemes through performance evaluation. As a result, it was shown that the proposed scheme outperforms the existing schemes.

A Geographic Distributed Hash Table for Virtual Geographic Routing in MANET (MANET에서 가상 위치 기반 라우팅을 위한 지역 분산 해쉬 테이블 적용 방법)

  • Ko, Seok-Kap;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.58-65
    • /
    • 2008
  • This paper presents a new geographic distributed hash table (GDHT) for MANETs or Mesh networks, where virtual geographic protocol is used. In previous wort GDHT is applied to a network scenario based on two dimensional Cartesian coordinate system. Further, logical data space is supposed to be uniformly distributed. However, mobile node distribution in a network using virtual geographic routing is not matched to data distribution in GDHT. Therefore, if we apply previous GDHT to a virtual geographic routing network, lots of DHT data are probably located at boundary nodes of the network or specific nodes, resulting in long average-delay to discover resource (or service). Additionally, in BVR(Beacon Vector Routing) or LCR(Logical Coordinate Routing), because there is correlation between coordinate elements, we cannot use normal hash function. For this reason, we propose to use "geographic hash function" for GDHT that matches data distribution to node distribution and considers correlation between coordinate elements. We also show that the proposed scheme improves resource discovery efficiently.

An Exploratory Study on the Effects of Mobile Proptech Application Quality Factors on the User Satisfaction, Intention of Continuous Use, and Words-of-Mouth (모바일 부동산중개 애플리케이션의 품질요인이 사용자 만족, 지속적 사용 및 구전의도에 미치는 영향)

  • Jaeyoung Kim;Horim Kim
    • Information Systems Review
    • /
    • v.22 no.3
    • /
    • pp.15-30
    • /
    • 2020
  • In the real estate industry, the latest changes in the Fourth Industrial Revolution, such as big data analytics, machine learning, and VR (virtual reality), combine to bring about industry change. Proptech is a new term combining properties and technology. This study aims to derive and analyze from a comprehensive perspective the quality factors (systems, services, interfaces, information) for mobile real estate brokerage services that are well known and used in the domestic market. The surveys in this study were conducted online and offline and a total of 161 samples were used for statistical analysis. As a result, all hypotheses were approved to except system quality and service quality. The results show that the domestic proptech companies who are mostly focused on real estate brokerage services, peer-to-peer lending, advertising platforms and apartments need to grow in various fields of proptech business of other countries including Europe, USA and China.

P2P-based Mobility Management Protocol for Global Seamless Handover in Heterogeneous Wireless Network (이기종망에서 글로벌 끊김 없는 핸드오버를 위한 P2P 기반 이동성 관리 프로토콜)

  • Chun, Seung-Man;Lee, Seung-Mu;Park, Jong-Tae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.73-80
    • /
    • 2012
  • In this article, we propose a P2P-based mobility management protocol for global seamless handover in heterogeneous wireless networks. Unlike previous mobility management protocols such as IETF MIPv4/6 and its variants, the proposed protocol can support global seamless handover without changing the existing network infrastructure. The idea of the proposed protocol is that the location management function for mobility management is separately supported from packet forwarding function, and bidirectional IP tunnels for packet transmission are dynamically constructed between two end-to-end mobile hosts. In addition, early handover techniques have been developed to avoid large handover delays and packet losses using the IEEE 802.21 Media Independent Handover functions. The architecture and signaling procedure of the proposed protocol have been designed in detail, and the mathematical analysis and simulation have been done for performance evaluation. The performance results show that the proposed protocol outperforms the existing MIPv6 and HMIPv6 in terms of handover latency and packet loss.

Technology and Policy for Blockchain-based Spectrum Sharing (블록체인 기반의 전파 공유 기술과 전파 정책)

  • Shin, Na Yeon;Nam, Ji-Hyun;Choi, Ye Jin;Lee, Il-Gu
    • Journal of Digital Convergence
    • /
    • v.17 no.10
    • /
    • pp.13-21
    • /
    • 2019
  • The restricted network or the unbalanced distribution of spectrum is causing the problems of lack of spectrum resources and deterioration of the service quality. In addition, the existing centralized radio sharing method has not been a fundamental solution for radio sharing and is inefficient in terms of cost, convenience, and security. In this paper, we propose a blockchain-based spectrum sharing as a low-cost, trustworthy, high-efficiency platform that can distribute and share spectrum resources, and propose policies to realize this. In the spectrum sharing platform, spectrum information about Wi-Fi AP and LTE mobile hotspot is registered in the blockchain, and spectrum sharers and users can conclude peer-to-peer spectrum sharing contract quickly and efficiently through smart contract. The pay for the shared spectrum resources and reward for spectrum quality management open platform ecosystem to activate the circulation-sharing and it can provide a convenient and efficient public wireless infrastructure.

Design and Evaluation of a Weighted Intrusion Detection Method for VANETs (VANETs을 위한 가중치 기반 침입탐지 방법의 설계 및 평가)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.181-188
    • /
    • 2011
  • With the rapid proliferation of wireless networks and mobile computing applications, the landscape of the network security has greatly changed recently. Especially, Vehicular Ad Hoc Networks maintaining network topology with vehicle nodes of high mobility are self-organizing Peer-to-Peer networks that typically have short-lasting and unstable communication links. VANETs are formed with neither fixed infrastructure, centralized administration, nor dedicated routing equipment, and vehicle nodes are moving, joining and leaving the network with very high speed over time. So, VANET-security is very vulnerable for the intrusion of malicious and misbehaving nodes in the network, since VANETs are mostly open networks, allowing everyone connection without centralized control. In this paper, we propose a weighted intrusion detection method using rough set that can identify malicious behavior of vehicle node's activity and detect intrusions efficiently in VANETs. The performance of the proposed scheme is evaluated by a simulation study in terms of intrusion detection rate and false alarm rate for the threshold of deviation number ${\epsilon}$.

An Adaptive Chord for Minimizing Network Traffic in a Mobile P2P Environment (모바일 P2P 환경에서 네트워크 트래픽을 최소화한 적응적인 Chord)

  • Yoon, Young-Hyo;Kwak, Hu-Keun;Kim, Cheong-Ghil;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.761-772
    • /
    • 2009
  • A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

An Adaptive Chord for Minimizing Network Traffic in a Mobile P2P Environment (비정기적 데이터 수집 모드에 기반한 효율적인 홈 네트워크 서비스 제어 시스템의 설계)

  • Woo, Hyun-Je;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.773-782
    • /
    • 2009
  • A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.