• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.201-208
• /
• 2005

Event notification service is a event-based messaging middleware 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.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.149-156
• /
• 2011

In wireless multi-hop network, many applications need multicast communication where the group leader needs to send data to all members of the group. Multicast routing provides a balanced, efficient, and fairness network environment for the group members. However, large load for transmission management to leader node and signal interference between several paths for multi-hop links always took long transmission delay and low throughput efficiency. In this paper, we propose a Zone-based Hierarchical Multicast Routing Protocol (ZHMP). This routing protocol is designed based on zone routing schemes, where proactive routing is applied for intra-zone node level multicasting and reactive routing is used for searching inter-zone paths. By each hierarchical and independent multicast working in separated zones, load of multicast source node will be distributed by several zone-level routings for a better load balance and signal interference between each multi-hop paths will be resisted for a maximum multicast throughput.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.121-129
• /
• 2011

One of the major challenges of minimum energy consumption for wireless sensor networks(WSN) environment. LEACH protocol is hierarchical routing protocol that obtains energy efficiency by using clustering. However, LEACH protocol in each round, because the new cluster configuration, cluster configuration, whenever the energy consumed shorten the life of the network. Therefore in this paper, the cluster is formed in WSN environment in early stage and the problems with energy waste have been solved by selecting C-node. In the initial round of proposed model uses 26 percent more than traditional LEACH energy consumption. However, as the round is ongoing, it has been proved by the network simulation tool that the waste of energy could be diminished up to 35%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.927-937
• /
• 2003

Network based VPN(Virtual Private Network) using MPLS(Multiprotocol Label Switching) technology is regarded as a good solution for intranets or extranets because of the low cost and the flexibility of the service provision. In this paper, we describea mechanism that allows the VPN users to move from one site to another site of the VPN network based on the BGP-E MPLS technology. This mechanism is designed for and implemented on PE(Provider Edge) routers of the backbone network. PE routers connected to the VPN sites establish a new MPLS path to the mobile node after they detect movement of the mobile VPN node. The new location may belong to the same VPN or to different VPN. We designed VPN management and control functions of the PE routers in order to interface with the Mobile IP protocol. The pilot implementation and performance measurement were carried out on a testbed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.617-623
• /
• 2007

A novel c-DSDV routing protocol is proposed in clustered mobile ad hoc networks. Clusterheads that manage members in their own cluster construct a higher layer backbone to which the DSDV concept is applied. Each clusterhead maintains its own global routing table by exchanging Update Request (UREQ) messages with its neighboring clusterheads. A number of entries in the table is as small as a number of clusterheads unlike a number of nodes in DSDV Since a UREQ message travels from one clusterhead to all its neighboring clusterheads that are at most 3 hops away, the topology convergence range by each UREQ message is at least 9 times as wide as that of DSDV and CGSR, greatly improving accuracy of routing information. However, overhead in c-DSDV is similar to that of DSDV because only clusterheads initiate UREQ messages. Delivery ratio increases by about 32$\sim$50%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.219-224
• /
• 2008

In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.807-810
• /
• 2005

Constructed network test environment of wireless base for confidentiality guarantee of data and safe transmission that is transmited at Mobile node of Wireless Network environment in this paper. And, progressed research about IKEv2's Multiple-Key Exchange mechanism for efficient security transmission that use IPSec that is built-in to basis to IPv6 of Mobile environment. Have several key to single terminal to solve that is seam at hand off packet transmission process of Mobile Node in Wireless Network and Re-setting for Key and Re-exchange problem that happen frequently and studied technology that move. Key exchange protocol that is used for an experiment loads basically in MIPv6 and used IKEv2 protocol that is used for management and distribution of reliable encryption key between both end. Using network simulator of SSFNet(Scalable Simulation Framework Network Models) in this paper Key exchange delay value of IKEv2's security transmission analyzing comparison Performance measure and studied about problem and improvement way accordingly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.592-599
• /
• 2011

Proxy Mobile IPv6 (PMIPv6) is the network-based mobility management protocol that network supports the mobility of mobile node (MN) on behalf of the MN. In PMIPv6, a multi-homed MN can connect to the PMIPv6 domain by using only one interface even though it has multiple interfaces. It would be efficient when such a multi-homed MN connects to the PMIPv6 domain by using all of its interfaces. If such a multi-homed MN utilizes all of its interfaces, flow mobility can be provided that the MN handovers one or more flows from one interface to another without re-establishing session. In this paper, we propose the flow-based mobility management protocol by considering the intention of the user. The Router Advertisement (RA) message is used in order for the PMIPv6 domain to inform that the MN can utilize the flow mobility. The proposed mechanism is evaluated by analyzing signaling overhead and handover latency, and the numerical results show that the performance is affected by mobility speed of the MN and the failure probability of the wireless link.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.245-250
• /
• 2008

Efficient service discovery mechanism is a crucial feature for the usability of a wireless ad-hoc network. A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration. We propose an efficient service discovery mechanism using non-disjoint multi-path routing protocol for a wireless ad-hoc network. Our scheme has advantages of not only multi-path routing protocol but also cross-layer service discovery. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.579-582
• /
• 2008

Since there are a lot of researches regarding RFID nowadays, the idea of RFID Middleware has great popular appeal to improve the efficiency of most use the data from RFID Readers. Even though, there are many RFID Middleware products and solutions in the developing processing, there are unsatisfied researches to manage RFID equipments effectively. In this paper, highly recommends a solution to support various RFID Readers from ALE-complient RFID Middleware in an efficient path of constructing Middleware Connection Information and data protocol form various RFID Readers as an ontology metadata. Therefore, not only reuses of RFID Reader Ontology, but also, by adding the ontology regarding additional RFID Reader and protocol data as a Middleware in a near future, it is able to extend to be treated easily.