• International Journal of Computer Science & Network Security
• /
• v.21 no.12spc
• /
• pp.399-408
• /
• 2021

Information security reports four types of basic attacks on information. One of the attacks is named as fabrication. Even though mobile devices and applications are showing its maturity in terms of performance, security and ubiquity, location-based applications still faces challenges of quality of service, privacy, integrity, authentication among mobile devices and hence mobile users associated with the devices. There is always a continued fear as how location information of users or IoT appliances is used by third party LB Service providers. Even adversary or malicious attackers get hold of location information in transit or fraudulently hold this information. In this paper, location information fabrication scenarios are presented after knowing basic model of information attacks. Peer-to-Peer broadcast model of location privacy is proposed. This document contains introduction to fabrication, solutions to such threats, management of fabrication mitigation in collaborative or peer to peer location privacy and its cost analysis. There are various infrastructure components in Location Based Services such as Governance Server, Point of interest POI repository, POI service, End users, Intruders etc. Various algorithms are presented and analyzed for fabrication management, integrity, and authentication. Moreover, anti-fabrication mechanism is devised in the presence of trust. Over cost analysis is done for anti-fabrication management due to nature of various cryptographic combinations.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.591-601
• /
• 2012

Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.275-278
• /
• 2001

인터넷의 활용이 급속도로 확산되어지고 사용환경도 점점 고급화가 되어가고 있다. 분산환경에는 네트웍에 연결된 각 Peer 들의 유휴자원을 이용하여 대규모의 데이터를 처리하기 위한 연구와 기존의 클라이언트-서버 환경에서의 부하를 각 Peer들에게 분산시키는 연구가 활발하게 진행되고 있다. 이 연구에서는 서버의 지원이 없는 순수 Peer-to-Peer 환경에서 현재의 Peer 들의 네트웍 구성을 살펴보고 효율적으로 중복된 메시지를 제어하기 위한 Ring-based 클러스터를 통한 네트웍 구성 환경과 클러스터간의 메시지 전파와 대역폭에 따른 클러스터 기법을 제안한다.

• Human Ecology Research
• /
• v.51 no.5
• /
• pp.473-481
• /
• 2013

The purpose of this study was to investigate the moderating effects of a size of the friendship network and quality of friendship on the associations between mutual antipathy and maladjustment. The subjects were 678 fifth- and sixth-grade primary school children who were recruited from a public school in Bucheon City. The Peer Nomination Inventory was used to assess mutual antipathy, peer victimization, social withdrawal, aggression, and the friendship network. The children were given a classroom roster and asked to nominate up to three classmates who fit each description. Additionally, the children reported the quality of their friendships using the Friendship Quality Scale. Each child was asked to indicate his or her one best friend and rate how accurately a sentence describe done of their best friends on the scale. The results revealed that the friendship network and friendship quality significantly moderated the relationships between mutual antipathy and social withdrawal, and peer victimization. The magnitude of the association between mutual antipathy and social withdrawal was not significant for large friendship networks and high quality friendships. Although mutual antipathy was significantly associated with peer victimization, the association was stronger at lower levels than at higher levels of the friendship network and quality. However, there was no moderating effect of the friendship network and quality on the association between mutual antipathy and aggression. A large friendship network and high quality friendship could be protective factors among those who have mutual antipathy in peer groups.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.511-520
• /
• 2004

A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme called fixed-length slotted scheduling, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming ca-pacity increases, called FAST.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.165-173
• /
• 2009

Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.49-57
• /
• 2012

In P2P streaming management, peer's churning and finding efficient topology architecture optimization algorithm that reduces streaming delay is important. This paper studies a topology optimization algorithm based on the P2P streaming using peer's link information. The proposed algorithm is based on the estimation of peer's upload bandwidth using peer's link information on mesh-network. The existing algorithm that uses the information of connected links is efficient to reduce message overload in the point of resource management. But it has a risk of making unreliable topology not considering upload bandwidth. And when some network error occurs in a server-closer-peer, it may make the topology worse. In this paper we propose an algorithm that makes up for the weak point of the existing algorithm. We compare the existing algorithm with the proposed algorithm using test data and analyze each simulation result.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.207-208
• /
• 2009

Peer-to-Peer (P2P) network has great potential on utilizing the network while reducing the server loads. Video on Demand (VoD) has become widely used since we can watch contents we like without having to download the overall file first. The mobile users may not need high quality of video; they only need good enough quality that can be played in the limited resource of physical device and network. So does with the devices with very limited network bandwidth. These issues emerge an idea of allowing Free-Rider in the P2P VoD system, where those low performance devices will only optimize the network utilization, affecting none to the performance of main system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.311-322
• /
• 2006

Peer-to-peer (P2P) systems have become a popular medium through which to share huge amounts of data. On the basis of network topology, P2P systems are divided into three types: centralized, structured distribution, unstructured distribution. Unstructured P2P systems such as Gnutella are novel in the sense that they are extensible and reliable. However, as the number of nodes increases, unstructured P2P systems would suffer from the high complexity of search operations that have to scan the network to find the required data items. Efficient replication of data items can reduce the complexity, but it introduces another problem of maintaining consistency among replicated data items when each data item could be updated. In this paper, we propose a new update propagation algorithm that propagates an updated data item to all of its replica. The proposed algorithm can reduce the message transfer overhead by adopting the notion of timestamp and hybrid push/pull messaging.

• Journal of the Korean Home Economics Association
• /
• v.45 no.5
• /
• pp.75-83
• /
• 2007

The purpose of this study was to investigate the relationships between peer victimization by peers, bullying, and friendships, with a focus on friendship network, friendship quality, and friends' characteristics. The subjects were 678 fifth and sixth grade primary school children recruited from a public school in Bucheon city. The peer nomination index was used to assess peer victimization, bullying, and friendship network. In addition, children themselves reported on the quality of their friendships using the Friendship Quality Scale. The results showed that victimization by peers was influenced by friendship network size, support, and victimization of friends, whereas bullying was explained by support and the bullying behaviors of friends.