• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4B
• /
• pp.281-290
• /
• 2002

In this paper, we propose an efficient packet forwarding method for an IP-based wireless Internet access network. Packets are forwarded along with a flow, that is a kind of connection-oriented connection and established before delivering packets. For this purpose, we also propose a flow resolution method and a modified IPv6 header for delivering packet in the wireless Internet access network. In addition, the method to support the mobility of mobile stations is explained, and the implementation issues are discussed. In order to estimate the performance of the proposed method, we analyzed the delay time to deliver packets in the wireless Internet access network. The numerical results show that the proposed method is very efficient, in the view point of delay.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1646-1649
• /
• 2002

This paper introduces a simulation design decision support system to support the development process of the pipeline network and provide decision support to the operations of the gas pipelines. The system has been implemented on Flash5, which has a multimedia capabilities environment for designing and delivering low- bandwidth animations, presentations, and web sites. It also offers scripting capabilities and server-side connectivity fur creating applications and web interfaces. Hence a user can interact with the system on the World Wide Web.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2021

The subject of navigation has drawn a large interest in the last few years. Navigation problem (or path planning) finds the path between two points, source location and destination location. In smart cities, solving navigation problem is essential to all residents and visitors of such cities to guide them to move easily between locations. Also, the navigation problem is very important in case of moving robots that move around the city or part of it to get some certain tasks done such as delivering packages, delivering food, etc. In either case, solution to the navigation is essential. The core to navigation systems is the navigation algorithms they employ. Navigation algorithms can be classified into navigation algorithms that depend on maps and navigation without the use of maps. The map contains all available routes and its directions. In this proposal, we consider the first class. In this paper, we are interested in getting path planning solutions very fast. In doing so, we employ a parallel platform, Reconfigurable mesh (R-Mesh), to compute the path from source location to destination location. R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents two algorithms for path planning. The first assumes maps with linear streets. The second considers maps with branching streets. In both algorithms, the quality of the path is evaluated in terms of the length of the path and the number of turns in the path.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.2
• /
• pp.61-72
• /
• 2007

With the increasing growth of Internet and wireless IP networks, Multimedia systems need to be envisaged as information resources where users can access anywhere and anytime. However, efficient services in these multimedia systems are open and challenging research problem due to user mobility, limited resources in wireless devices and expensive radio bandwidth. To implement multimedia services over heterogeneous network, the IP header compression scheme can be used for saving bandwidth. In this paper, we present an efficient solution for header compression, which is modified form of ECRTP. It shows an architectural framework adopting modified ECRTP when IP tunneling network using GRE over IPSec is implemented. We have conducted simulations in order to analyze the effects of different header compression techniques while delivering real-time services to the wireless access network through secured IP Network. The impacts on performance have been investigated through a series of experiments.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.101-104
• /
• 2001

Over the last few years, streaming audio and video content on Internet sites has increased at unprecedented rates. The predominant method of delivering video over the current Internet is video streaming such as SureStream or Intelligent Stream. Since each method provides the client with only one data stream from one server, it often suffers from poor qualify of pictures in the case of network link congestion. In this paper, we propose a novel method of delivering video stream based on wavelet to a client by utilizing multi-threaded parallel connections from the client to multiple servers and to provides a better way to address the scalability functionalities. The experimental results show that the video quality delivered by the proposed multithreaded stream could significantly be improved over the conventional single video stream methods.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.647-656
• /
• 2001

Video delivery from a server to a client across a network system is an important part of many multimedia applications. Usually, the network system has constraint in both the amount of network bandwidth and the buffer size in the client. While delivering a video stream across such a constrained network system, loss of frames may be unavoidable. The system resources consumed by the dropped frames are wasted, and the losses of frames would result in discontinuous display at the client. In this paper, for delivering hierarchically encoded video stream, we introduce the notion of selective layer discard algorithm at the server which not only preemptively discards data at the server but also drops less important part of a frame instead of the entire frame. By the simulation, we compare the proposed selective layer discard algorithm and the existing selective frame discard algorithm. The simulation results show that the proposed algorithm may improve the quality of decoded video, and decrease the replay discontinuity at the client.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1021-1033
• /
• 2008

In recent years, the growing interest in wireless sensor network has resulted in thousands of publications. Most of this research is concerned with delivering raw data such as temperature, pressure, or humidity. Recently, the focus of sensor network paradigm is changing for delivering multimedia contents. However, most existing routing protocols are not very practical for transmitting multimedia contents in resource constrained sensor networks. In this paper, we propose an optimized node-disjoint multi-path routing protocol for throughput enhancement and load balancing. We focused on how to allocate traffic to independent multiple end-to-end routes. Decentralized transmission using our node-disjoint multi-path routing scheme results in bandwidth aggregation and throughput enhancement. In addition, our scheme provides ways to remove link-joint routes for decreasing routing overhead.

• Journal of KIISE
• /
• v.42 no.7
• /
• pp.929-938
• /
• 2015

In opportunistic networks, each message is delivered to the destination by repeating, storing, carrying, and forwarding the message. Recently, with the vitalization of social networks, a large number of existing articles have shown performance improvement when delivering the message and considering its social relational networks. However, these works only deliver messages when they find nodes, assuming that every node cooperates with each other unconditionally. Moreover, they only consider the number of short-term contacts and local social relations, but have not considered each node's average relation with the destination node. In this paper, we propose novel message sending techniques for opportunistic networks using nodes' social network characteristics. In this scheme, each message is delivered to the destination node with fewer copies by delivering it mostly through nodes that have high intimacy with the destination node. We are showing that our proposed scheme presents a 20% performance increase compared to existing schemes.

• Korean Journal of Social Welfare
• /
• v.49
• /
• pp.190-224
• /
• 2002

The purpose of this study was to find out the characteristics of the direct workers and the organizations delivering services to the children in low-income families, and to identify major factors that affect the number and degree centrality of service network. The research sample was 141 organizations. and the data were collected by a survey questionnaire and analyzed by UCINET V and multiple regression. The results show that the classification of organizations, the work-autonomy, the license of social welfare have a significant effect on the number of network organization, and the license of social welfare, the subjective body of organizations, the number of children in charge have a significant effect on the degree centrality of service network, among the independent variables. Based on the research results, implications for the future practice are discussed.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.315-318
• /
• 2005

Lots of researches have been focusing on ubiquitous computing which means wherever, whenever, whatever the required information must be accessible. In ubiquitous computing environment, ubiquitous sensor network (USN) is the basis technology for gathering and transferring the required information. However sensor network characteristically has more severe vulnerability than the existing networks do. The paper presents operation of secure protocols for delivering information in secure in ubiquitous computing environment and show improvement of the secure transferring protocol.