• Journal of Software Assessment and Valuation
• /
• v.16 no.2
• /
• pp.53-62
• /
• 2020

In the end-user domain of an IoT environment, there are more and more intelligent M2M devices that provide resources to create and share application services. Therefore, it can be very useful to manage trust by transferring the role of the existing centralized service provider to end users in a P2P environment. However, in a decentralized M2M computing environment where end users independently provide or consume services, mutual trust building is the most important factor. This is because malicious users trying to build malfunctioning services can cause security problems in M2M computing environments such as IoT. In this paper, we provide an integrated analysis and approach for trust evaluation of M2M application services, and an optimized trust evaluation model that can guarantee reliability among users of the M2M community.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.2
• /
• pp.110-115
• /
• 2006

In pure P2P environment, it is possible to provide service by using a little real-time information without using accumulated information. But in case of using only a little information that was locally collected, quality of recommendation service can be fallen-off. Therefore, it is necessary to study a method to improve qualify of recommendation service by using users' context information. But because a great volume of users' context information can be recognized in a moment, there can be a scalability problem and there are limitations in supporting differentiated services according to fields and items. In this paper, we solved the scalability problem by clustering context information per each service field and classifying it per each user, using SOM. In addition, we could recommend proper services for users by quantifying the context information of the users belonging to the similar classification to the service requester among classified data and then using collaborative filtering.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.189-198
• /
• 2009

Unstructured peer-to-peer systems are most commonly used in today's internet. But file placement is random in these systems and no correlation exists between peers and their contents. There is no guarantee that flooding queries will find the desired data. In this paper, we propose to cluster nodes in unstructured P2P systems using the agglomerative hierarchical clustering algorithm to improve the search method. We compared the delay time of clustering the nodes between our proposed algorithm and the k-means clustering algorithm. We also simulated the delay time of locating data in a network topology and recorded the overhead of the system using our proposed algorithm, k-means clustering, and without clustering. Simulation results show that the delay time of our proposed algorithm is shorter compared to other methods and resource overhead is also reduced.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.105-109
• /
• 2011

In this paper, we study the dominating-free sest which is defined as follows: k points called servers and n points called clients in the plane are given. For a point p in the plane is said to be dominated by a client c if for every server s, the distance between s and p is greater than the distance between s and c. The dominating-free set is the set of points in the plane which aren't dominated by any client. We present an O(nklogk+$n^2k$) time algorithm for computing the dominating-free set under the $L_1$-metric. Specially, we present an O(nlogn) time algorithm for the problem when k=2. The algorithm uses some variables and 1-dimensional arrays as its principle data structures, so it is easy to implement and runs fast.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.11-19
• /
• 2004

P2P network environments provide users with direct data transmission and sharing facilities and those environments can be classified into hybrid P2P network environments and pure P2P network environments according to the arbitration mechanism among the peers in the network. In hybrid P2P network environments, there exists a server that maintains index information for the data to be shared and network isolation does not occur because every peer always keeps connection to the server. In pure P2P network environments, however, each peer directly connects to another peer and gets services without server intervention, and so, network isolation can occur when the mediating peer fails to work. In this paper. we propose a scheme for each peer to keep connection to other peers continuously by maintaining IP addresses of its neighbor peers and connecting to the peers when the mediating peer fails to work. Although the P2P application that uses our proposed framework should obtain one or more IP addresses of the neighbor peers manually, after instantiation, the application can do its job while maintaining connection to the network continuously and automatically. To evaluate our proposed scheme, we measured and analyzed the time for a peer to reconnect to the network when the mediating peer fails and the network isolation occurs.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.05a
• /
• pp.51-54
• /
• 2021

본 논문은 차량과 보행자 간 충돌 사고를 예측하는 V2P(Vehicle to Pedestrian) 서비스에서 보행자 휴대기기의 데이터 전송 시점을 동적으로 계산함으로써 불필요한 통신을 감소시켜 에너지 효율을 향상시키는 것을 목적으로 하며, MEC(Mobile Edge Computing) 기반 V2P 서비스를 제안하였다. V2P 서비스에서는 보행자와 차량 간 충돌 가능성을 예측하기 위하여 두 객체의 실시간 GPS 데이터가 요구된다. 이때 보편적으로 보행자에 비해 차량의 이동속도가 더 빠르기 때문에 보행자가 빠르게 이동해 들어오는 주변 차량에 발견될 수 있기 위해서는 자신의 위치에는 의미 있는 변화가 발생하지 않았더라도 차량 이동속도에 맞춘 빠른 주기로 차량 혹은 중앙 클라우드 서버로 자신의 데이터를 송신해야만 한다. 이 과정에서 보행자 휴대폰의 에너지가 급속하게 소모된다. 따라서 본 연구는 이러한 문제를 해결하기 위하여 MEC 서버를 배치한 V2P 서비스를 제안하였고, 보행자가 본인의 상태 정보를 활용하여 효율적인 다음 데이터 전송 시점을 계산할 수 있는 동적시점계산 알고리즘을 제안하였다.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.1033-1042
• /
• 2004

According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.141-149
• /
• 2006

In this paper, we introduce an improved algorithm for computing matrix triple product that commonly arises in primal-dual optimization method. In computing $P=AHA^{t}$, we devise a single pass algorithm that exploits the block diagonal structure of the matrix H. This one-phase scheme requires fewer floating point operations and roughly half the memory of the generic two-phase algorithm, where the product is computed in two steps, computing first $Q=HA^{t}$ and then P=AQ. The one-phase scheme achieved speed-up of 2.04 on Intel Itanium II platform over the two-phase scheme. Based on memory latency and modeled cache miss rates, the performance improvement was evaluated through performance modeling. Our research has impact on performance tuning study of complex sparse matrix operations, while most of the previous work focused on performance tuning of basic operations.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.257-266
• /
• 2004

Mobile agents are defined as processes which can be autonomously delegated or transferred among the hosts in a network in order to perform some computations on behalf of the user and co-operate with other agents. Currently, mobile agents are used in various fields, such as electronic commerce, mobile communication, parallel processing, search of information, recovery, and so on. In pure P2P network environment, if mobile agents that require computing resources rashly migrate to another peers without consideration on the peer's capacity of resources, the peer may have a problem that the performance of the peer is degraded due to lack of resources. To solve this problem, we propose resource reservation based load balancing scheme of using RMA(Resource Management Agent) that monitors workload information of the peers and that decides migrating agents and destination peers. In mobile agent migrating procedure, if the resource of specific peer is already reserved, our resource reservation scheme prevents other mobile agents from allocating the resource.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.389-400
• /
• 2008

As the wireless network technologies and the capability of the mobile terminals are evolving, advanced peer to peer applications for mobile users are attracting interests. In this paper, we propose the mobile P2P communication platform(MPCP) which provides transparency to the wireless network technologies and solutions to the limited resources of the mobile terminals. MPCP classifies the connection into two levels: a virtual channel and a session. A virtual channel is the network layer connection between the terminals whereas a session is the application layer connection. MPCP classifies the sessions into four types and applies different scheduling priority and data processing policies such as segmentation and reassembly. It selects proper wireless network technologies depending on the distance between the communication endpoints. To acquire dynamically changed access address, we harness the Session Initiation Protocol. We implemented MPCP on embedded Linux simulator and utilized the implementation in mobile P2P service development. For the quantitative analysis, we compared the performance of MPCP with that of ftp. Regardless of the number of simultaneous sessions, MPCP maintains the relative performance.