• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.111-120
• /
• 2012

As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to $log_2N$ for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.

• 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.38A no.4
• /
• pp.337-349
• /
• 2013

In this paper, we propose a new mobility management scheme, called i-FP(intelligent Fast PMIPv6). Our proposed i-FP scheme is addressed for solving the existing local mobility management problems from legacy frameworks. To move MN(Mobile Node) to other networks in one domain, i-FP employs three network entities which are extended from PMIPv6(Proxy Mobile IPv6), LMA(Local Mobility Anchor), MAG(Mobile Access Gateway) and MN. In i-FP, the three network entities can reduce the handover delay time of MNs. Also, i-FP uses an IP header swapping mechanism to avoid the traffic overhead and improve the throughput of network. To evaluate the performance of i-FP, we analyze our i-FP, HMIPv6(Hierarchical Mobile IPv6) and PMIPv6 which are legacy protocols of local mobility management in terms of various parameters. Finally, our i-FP scheme shows good performance(reduction of routing hops 10.2%, signaling costs 58.5% and handover delay 16.3%) than other network schemes for the total cost.

• KEPCO Journal on Electric Power and Energy
• /
• v.6 no.3
• /
• pp.259-269
• /
• 2020

With the proposal-agreement procedure, RSTP can reduce the network recovery time to 400 ms or less in the case of 40 bridges. While the legacy RSTP reverts the previous agreement at the bridge with the alternate port role in the ring during the fault recovery, a new position based fast fault recovery procedure is proposed in this paper to guarantee a single proposal-agreement transaction which can provide more faster recovery. By knowing the relative position of the faulty link or bridge in hops, the bridge on the middle of the ring can complete the recovery procedure without revert. The performance of proposed procedure is numerically calculated and verified by simulation and the result shows that the recovery time can be reduced up to 100 ms, which is 1/4 times of the legacy RSTP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.802-812
• /
• 2000

Multihop lightwave networks are the optical-fiber based local communication systems that employ WDM(Wavelength Division Multiplexing) technology to fully use the enormous fiber bandwidth without requiring any tunable tranceives. In this paper, we introduce a novel ShuffleNet topology, asymmetric bilayered ShuffleNet(ABS) topology as a multihop WDM network technique. For 1Gb/s transmission system, we compared ABS topology with previously reported ones in terms of common network parameters such as average number of hops, throughput, time delay, and network power function. Through the analysis, the performance of ABS topology was proven to be superior to the existing ones. To decrease the amount of hardware required for implementing ABS system, we also proposed a new WDM channel sharing scheme. For (2, 3) ShuffleNet topology system, the number of wavelengths needed in the system can be reduced dramatically from 96 to 4 by using new scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.325-338
• /
• 2012

In this paper, a radio resource allocation scheme for a multi-hop relay transmission in cognitive radio (CR) system is proposed to support the employment of relay nodes in IEEE 802.22 standard for wireless regional area network (WRAN). An optimization problem is formulated to maximize the number of serving secondary users (SUs) under system constraints such as time-divided frame structure for multiplexing and a single resource-unit to every relay-hop. However, due to mathematical complexity, the optimization problem is solved with a sub-optimal manner instead, which takes three steps in the order of user selection, relay/path selection, and frequency selection. In the numerical analysis, this proposed solution is evaluated in terms of service rate denoting as the ratio of the number of serving SUs to the number of service-requesting SUs. Simulation results show the condition of adopting multi-hop relay and the optimum number of relaying hops by comparing with the performance of 1-hop system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9A
• /
• pp.853-866
• /
• 2008

In this paper, a multi-hop relaying transmission scheme is analyzed regarding its feasibility and potentiality in the IEEE 802.22-based cognitive radio (CR) environment. Shortly, basic design issues are addressed such as relay station (RS) deployment and a frame structure of physical channel to escape inter-hop interference. This paper mainly develops a radio resource management scheme based on spectrum sensing results aggregated from CR secondary nodes and improves the opportunistic spectrum sharing efficiency. In particular, a decision rule about a channel availability is made using a distributed sensing method. Subsequently, spectrum allocation and routing path decision procedures are proposed to establish a link from source to destination with a hop-by-hop manner. Simulation results show that the proposed multi-hop relaying scheme is substantially profitable in CR environments if the number of hops and RS deployment are designed in such a way that the spectrum sharing gain is larger than spectrum division loss which is inherently induced in multi-hop relaying systems.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.2
• /
• pp.373-384
• /
• 2014

The social network service is the bidirectional media that many users can build relations not only friends but also other people. However, a process to approach in the social network is so simple that untrustable information, which malignant users make, is spreaded rapidly in many the social network uses. This causes many users to suffer material or psychological damages. Because of openness in the social network, there will be higher risk of the privacy invasion. Therefore, sensitive information should be transferred or provided only to reliable users. In general, because many users exchange among one hops, many researches have focused on one hop's trust evaluation. However, exchanges between users happen not only one joint bridege but also far nodes more than two nodes on account of dense network and openness. In this paper we propose the efficient scheme combining transitivity and composability for remote users.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.339-350
• /
• 2010

Despite lots of efforts to obtain an accurate picture of structure at the level of individual ASes, there is a few application works using the AS-level Internet topology. In this paper, we show that the power-law fits the number of down-stream customer ASes very well and also present the distributions of AS links with the "public view" from UCLA IRL laboratory. Moreover, we obtain the distributions of source-destination pairs of routing hops for two sites in Korea and the United States, and then we propose a new method to decide the randomness of Internet traffic using the obtained distributions and the BGP valley-free routing policy. The randomness of traffic must be a portent of outbreak of the distributed denial-of-service attacks.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.2
• /
• pp.213-218
• /
• 2006

In this paper, we evaluate and compare performance between position-based and non-position-based routing protocols in a vehicular ad-hoc network. The protocols evaluated in this paper for many performance evaluation aspects are a position-based routing protocol, GPSR (Greedy Perimeter Stateless Routing), and the non-position-based such as AODV (Ad-hoc On-Demand Distance Vector) and DSR (Dynamic Source Routing) protocols. The three protocol characteristics such as Packet Delivery Ratio, Latency of first packet per connection, and Average number of hops depending on distance are compared and evaluated. As the result of simulation, the AODV performed better than the DSR. However, due to the high mobility characteristic of a vehicular ad-hoc network, GPSR, the position-based routing performs better than the non-position-based routing protocols such as AODV and DSR in a vehicular ad-hoc network environment.