• Journal of the Korean association of regional geographers
• /
• v.20 no.1
• /
• pp.30-48
• /
• 2014

Relying on the interaction indices - dominance index, relative strength index and entropy index, this paper analyzes the structural features of urban network in the Seoul metropolitan area with the flows of commuting, business, and freight. Analytical results show that the Seoul metropolitan urban system is vertical, size-dependent, one-way, and the highest city-dominant network rather than horizontal, size-neutral, two-way, complementary one. The network of freight flow is a little bit more symmetrical than the networks of commuting and business. However, the interaction with Seoul is still determinant in all aspects of hierarchical structure, relative strength, and symmetry of flow.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.11
• /
• pp.1365-1372
• /
• 2001

We have suggested three learning rules and implemented an experimental system that automatically restructures hypertext networks according to their user browsing behavior. The system applies link weights to the hypertext networks and updates these weights according to the learning rules. The learning rules are based on how often a particular hyperlink is being traversed and operate on strictly local information of link traversals. Changes in network structure are fed back to users by dynamic link ordering according to descending link weight. This approach is used collaborative filtering and navigation support techniques. The system has been investigation to be able to structure random hypertext networks into valid representations of their user browsing preferences in experiments.

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

Wireless sensor networks is composed of many similar sensor nodes with limited resources. They are randomly scattered over a specific area and self-organize the network. For guarantee of network life time, load balancing and scalability in sensor networks, sensor networks needs the clustering algorithm which distribute the networks to a local cluster. In existing clustering algorithms, the cluster head selection method has two problems. One is additional communication cost for finding location and energy of nodes. Another is unequal clustering. To solve them, this paper proposes a novel cluster head selection algorithm revised previous clustering algorithm, LEACH. The simulation results show that the energy compared with the previous clustering method is reduced.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1679-1686
• /
• 2007

Clustering is a topology control approach often used in wireless ad hoc networks to improve scalability and prolong network lifetime. Furthermore, it is also employed to provide semi-management functionalities and capacity enhancement. The usage of clustering topology control technique can also be applied to multi-radio wireless mesh network. This would utilize the advantages of the multi-radio implementation in the network. The aggregation would result to a more stable, connected, scalable and energy-efficient network. On this paper, we design a clustering algorithm for multi-radio wireless mesh network that would use these advantages and would take into consideration both mobility and heterogeneity of the network entities. We also show that the algorithm terminates at a definite time t and the message control overhead complexity is of constant order of O(1) per node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1A
• /
• pp.24-35
• /
• 2008

We propose a tree-based integrated network of infrastructure network and mobile ad hoc network to effectively support Mobile IP for mobile ad hoc networks and also proposed a network management protocol for formation and management of the integrated network and a tree-based routing protocol suitable for the integrated network. The integrated network has fixed gateways(IGs) that connect two hybrid networks and the mobile nodes in the network form a small sized trees based on the mobile nodes that are in the communication distance with a IG. A new node joins an arbitrary tree and is registered with its HA and FA along tree path. In addition, the proposed protocol establishes a route efficiently by using the tree information managed in every node. We examined the effectiveness of the tree-based integrated network for some possible network deployment scenarios and compared our routing protocol against the Mobile IP supported AODV protocol.

• The Magazine of the IEIE
• /
• v.39 no.11
• /
• pp.27-38
• /
• 2012

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.70-71
• /
• 2007

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2011.11a
• /
• pp.17-18
• /
• 2011

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.1
• /
• pp.63-78
• /
• 1999

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.10
• /
• pp.1101-1108
• /
• 2015

In this paper, to provide a method and system for providing a network separation virtual machine environment. How to provide this virtual machine environment include phase generating necessary virtual resource requirement for the perform of virtual function and transfer to network changing protocol about request of registration virtual resource. For this reason, Registration procedure is to use a virtual machine for a virtual computing resource allocation and separation combined network any time, it became possible between servers and clients, or mobile phone. At any time, it is possible to process the work in the same environment as in a computer to access the Internet.