• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.77-83
• /
• 2010

Vehicular Ad Hoc Networks are self-organizing Peer-to-Peer networks that typically have highly mobile vehicle nodes, moving at high speeds, very short-lasting and unstable communication links. VANETs are formed without fixed infrastructure, central administration, and dedicated routing equipment, and network nodes are mobile, joining and leaving the network 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 connect, without centralized control. In this paper, we propose a rough set based anomaly detection method that efficiently identify malicious behavior of vehicle node activities in these VANETs, and the performance of a proposed scheme is evaluated by a simulation in terms of anomaly detection rate and false alarm rate for the threshold ${\epsilon}$.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.729-733
• /
• 2006

Short message service (SMS) is a Popular mobile data service in cellular networks. One SMS message can carry 50 Korean alphabets. Cellular operators standard and develop multimedia message service (MMS) based on P2P as color phones having multimedia solutions such as MIDI, MP3, JPG, PNG, and MPEG have been developed. MMS can be a key cash flow in the non-voice mobile revenue together with SMS. Copyrights protection of contents in a MMS message can be issued as MMS can be the popular P2P service such as MMS. In this paper, we propose MMS DRM system to protect copyrights of contents in MMS with the minimum change of MMS system. The proposed MMS DRM system protect copyrights of contents using DRM Packager, DRM Server, and DRM Agent and support various use cases to activates MMS in mobile networks.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.109-117
• /
• 2009

In this paper, we propose an efficient service discovery scheme that combines peer-to-peer caching advertisement and node ID-based selective forwarding service requests. P2P caching advertisement quickly spreads available service information and reduces average response hop count since service information store in neighbor node cache. In addition, node ID-based service requests can minimize network transmission delay and can reduce network load since do not broadcast to all neighbor node. Proposed scheme does not require a central lookup server or registry and not rely on flooding that create a number of transmission messages. Simulation results show that proposed scheme improved network loads and response times since reduce a lot of messages and reduce average response hop counts using adaptive selective nodes among neighbor nodes compared to traditional flooding-based protocol.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.11
• /
• pp.804-809
• /
• 2001

In this paper, a shared channel scheme and routing algorithms are proposed to reduce the number of wavelength channels for the optical WDM multihop networks using the every-other-row-connecting bilayered ShuffleNet scheme. In the shared channel scheme proposed, 2P nodes share the common wavelength channel reducing the number of required channels compare to other ones. By assigning an effective address each node, packets can be routed to the destination nodes through the intermediate nodes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.18-26
• /
• 2012

As the performance of the next-generation broadband wireless networks is dramatically enhanced, various services (i.e., education, video conferencing, online games, etc.) have been provided to users through a smart mobile platform. Since those services are usually provided by using the centralized architecture, it is difficult for a lot of users to provide the scalable communication service with regard to traffic management. To solve these problems, we have proposed an architecture of P2P-based group communication management scheme using smart mobile device. More specifically, we design the group management protocol and algorithm for the group member management and the traffic management. By using these methods, the mobile multimedia streaming service can be provided with scalability. In order to verify the performance of the proposed scheme, we have mathematically analyzed the performance in terms of the average transmission delay and bandwidth utilization.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.783-788
• /
• 2005

Recently researches that apply P2P networks to VOD streaming have been actively published In the previous works on VOD streaming, they aimed at achieving two major goals, which are zero-delay transmission and minimization of service rejection ratio. This paper proposes a new method, called ForwardCast, for VOD streaming based on a P2P-based multicasting tree in order to achieve theses two goals. In this method,- basically a new client selects one of the preceding clients and starts receiving a whole video from the selected one without any delay. In some situation, two preceding clients are selected to transfer the ending part of the video and its the remaining part simultaneously. In our experiment, ForwardCast can reduce the rejection ratio compared to previous works without increasing server stress.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.11-19
• /
• 2019

Recently, hybrid CDN/P2P video streaming architecture is specially designed and deployed to achieve the scalability of P2P networks and the desired low delay and high throughput of CDNs. In this paper, we propose a cooperative video streaming and active node buffer management technique in hybrid CDN/P2P architecture. The key idea of this streaming strategy is to minimize network latency such as jitter and packet loss and to maximize the QoS(quality of service) by effectively and efficiently utilizing the information sharing of file location in CDN's proxy server which is an end node located close to a user and P2P network. Through simulation, we show that the proposed cooperative video streaming and active node buffer management technique based on CDN and P2P network improves the performance of realtime video streaming compared to previous methods.

• KNOM Review
• /
• v.22 no.3
• /
• pp.20-24
• /
• 2019

Blockchain is a distributed ledger-based technology where all nodes participating in the blockchain network are connected to the P2P network. When a transaction is created in the blockchain network, the transaction is propagated and validated by the blockchain nodes. The verified transaction is sent to peers connected to each node through P2P network, and the peers keep the transaction in the memory pool. Due to the nature of P2P networks, the number and type of transactions delivered by a blockchain node is different for each node. As a result, all nodes do not have the same memory pool. Research is needed to solve problems such as attack detection. In this paper, we analyze transactions in the memory pool before solving problems such as transaction fee manipulation, double payment problem, and DDos attack detection. Therefore, this study collects transactions stored in each node memory pool of Bitcoin and Ethereum, a cryptocurrency system based on blockchain technology, and analyzes how much common transactions they have using jacquard similarity.