• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.9
• /
• pp.209-216
• /
• 2019

Publish-subscribe communication model is popular for various type of distributed applications because of its loosely coupled style connections. Among the various architecture style for publish-subscribe system, peer-to-peer architecture has been used for the mission critical application domain since it provides high scalability and real-timeness. On the other hand, to utilize the bandwidth of given networks, message filtering is frequently used to reduce the number of messages on the system. Even if P2P provides superior scalability, it is hard to apply filtering to the its messaging system because the filtering process should be done on the peer-side in P2P architecture that are usually done on the broker server in conventional pub/sub architecture. In this paper, we propose a hierarchical subscription management structure as well as message forwarding scheme for efficient data dissemination. Our proposed scheme reduces the number of received messages by filter-out un-wanted messages and offloading the message dissemination work to other subscribers to enhance the messaging throughput.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.95-103
• /
• 2003

Event notification service is a event-based messaging middle ware service needed for various vertical domains, such as, business applications, distributed system management, and web service integration. In this paper, we investigate the architecture of an event notification service that includes a subject-based event dissemination service and a flexible message communication service. The event dissemination service is in charge of transferring events asynchronously but speedy according to the subjects of events and their environmental knowledge. It also includes content-based message filtering. The message communication service provides a common communication infrastructure supporting variety types of messages and variety of protocols. Depending on application domains and situation, we can re-configurate the communication infrastructure in order to optimize the efficiency and usability. This paper shows the performance analysis of our event notification service with various types of message formats and protocols.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.141-145
• /
• 2008

Wireless sensor network (WSN) is expected to be used in many applications. However, sensor nodes still have some secure problems to use them in the real applications. They are typically deployed on open, wide, and unattended environments. An adversary using these features can easily compromise the deployed sensor nodes and use compromised sensor nodes to inject fabricated data to the sensor network (false data injection attack). The injected fabricated data drains much energy of them and causes a false alarm. To detect and drop the injected fabricated data, a filtering-based security method and adaptive methods are proposed. The number of different partitions is important to make event report since they can make a correctness event report if the representative node does not receive message authentication codes made by the different partition keys. The proposed methods cannot guarantee the detection power since they do not consider the filtering scheme. We proposed clustering method for filtering-based secure methods. Our proposed method uses fuzzy system to enhance the detection power of a cluster.

• Convergence Security Journal
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2008

In wireless sensor networks, an adversary can launch the wormhole attacks, where a malicious node captures packets at one location and tunnels them to a colluding node, which retransmits them locally. The wormhole attacks are very dangerous against routing protocols since she might launch these attacks during neighbor discovery phase. A strategic placement of a wormhole can result in a significant breakdown in communication across the network. This paper presents a compromise-resilient tunneled packet filtering method for sensor networks. The proposed method can detect a tunneled message with hop count alteration by a comparison between the hop count of the message and one of the encrypted hop counts attached in the message. Since the proposed method limits the amount of security information assigned to each node, the impact of wormhole attacks using compromised nodes can be reduced.

• Journal of Internet Computing and Services
• /
• v.13 no.4
• /
• pp.33-43
• /
• 2012

Smart phones can be used in parking management to receive important notifications. An infrastructure based from such approach should consider message persistence which is currently supported through push notification systems. However, the broadcast method produces high overhead when sending notifications throughout the clients. This paper uses a filtering method to prevent unnecessary message overheads. The heuristic approach selects the mobile clients with corresponding preference values based on the notification tag values. The simulation result showed that the proposed filtering method was faster in re-establishing connections and had lower message overhead compared to conventional messaging frameworks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4183-4204
• /
• 2018

The existing en-route filtering schemes only consider some simple false data injection attacks, which results in lower safety performance. In this paper, we propose an efficient geographical information-based en-route filtering scheme (EGEFS), in which each forwarding node verifies not only the message authentication codes (MACs), but also the report identifier and the legitimacy and authenticity of locations carried in a data report. Thus, EGEFS can defend against not only the simple false data injection attacks and the replay attack, but also the collusion attack with forged locations proposed in this paper. In addition, we propose a new method for electing the center-of-stimulus (CoS) node, which can ensure that only one detecting node will be elected as the CoS node to generate one data report for an event. The simulation results show that, compared to the existing en-route filtering schemes, EGEFS has higher safety performance, because it can resist more types of false data injection attacks, and it also has higher filtering efficiency and lower energy expenditure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2301-2308
• /
• 2013

These days, Rehabilitation psychology analysis system is being used by world wide web in everyday's life. And on the other hand, we are facing spam messages' problems. To block these spam message, we are using filtering or pricing systems. But these solutions are raising other problems such as impediment in reception or availability caused by false positive or payment resistance. To solve these problems, we propose an Indirect Model on Message Control System(IMMCS) which controls an unsolicited message and prevents an useful message from discarding. We design and implement the IMMCS to enhance the usefulness and the availability. Being tested the IMMCS to verify the usability and the efficiency, it gave us a very successful result.

• International journal of advanced smart convergence
• /
• v.7 no.3
• /
• pp.101-109
• /
• 2018

In this paper, we propose an adaptive filtering scheme of connection requests for the defense of malicious energy consumption attacks against wireless computing devices with limited energy budget. The energy consumption attack tries to consume the battery energy of a wireless device with repeated connection requests and shut down the wireless device by exhausting its energy budget. The proposed scheme blocks a connection request of the energy consumption attack in the middle, if the same connection request is repeated and its request result is failed continuously. In order to avoid the blocking of innocuous mistakes of normal users, the scheme gives another chance to allow connection request after a fixed blocking time. The scheme changes the blocking time adaptively by comparing the message arriving ate during non-blocking period and that during blocking period. Evaluation shows that the proposed defense scheme saves up to 94% energy consumption compared to the non-defense case.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.262-270
• /
• 2008

We propose a technique to protect digital images using the magnitude and orientation of their edges. The proposed technique uses the content-associated copyright message generated by combining the original copyright message with the magnitude and orientation of some edges of a digital image. It enables the distribution of the original copyright message without any distortion of original digital images by avoiding embedment of the original copyright message into images. In addition to the advantage in the image quality, it also has a relatively low computational complexity by using simple operations to generate the content-associated copyright message. To verify the proposed technique, we performed experiments on its robustness to the external attacks such as histogram equalization, median filtering, rotation, and cropping. Experimental results on restoring the copyright message from images distorted by attacks show that more than 90%, on the average, can be recovered.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.388-398
• /
• 2004

This paper focuses on the reduction method of message traffic occurred when multiple participants collaborate in the distributed virtual environment. It is referred to as filtering method of update message to minimize data traffic exchanged in the virtual environment, and it is the essential process to improve the scalability of the virtual environment. Spatial partitioning method, a popular filtering technique, divides the whole environment into smaller sub-parts in order to make it small the regions to be maintained consistently. However, it is less flexible and adaptable because the information of area of interest must be configured before simulation. In this paper, the concept of dynamic area of interest is proposed, which is highly adaptable by applying dynamic environmental elements to AOI management. It uses multiple layering and multiple consistency algorithms for dynamic management, and makes it possible to consume system resource efficiently. For performance evaluation, experiments are performed with virtual avatars, measuring message traffic. Finally, the proposed model could be applied to the AOI management systems which accommodate massive users like MMORPG, or virtual communities.