• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1357-1372
• /
• 2017

Energy harvesting techniques, particularly radio frequency energy harvesting (RF-EH) techniques, which are known to provide feasible solutions to enhance the performance of energy constrained wireless communication systems, have gained increasing attention. In this paper, we consider a wireless-powered cooperative communication network (WPCCN) for transferring energy in the downlink and forwarding signals in the uplink. The objective is to maximize the average transmission rate of the system, subject to the total network power constraint. We formulate such a problem as a form of wireless energy transmission based on resource allocation that searches for the joint subcarrier pairing and the time and power allocation, and this can be solved by using a dual approach. Simulation results show that the proposed joint optimal scheme can efficiently improve system performance with an increase in the number of subcarriers and relays.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1330-1347
• /
• 2018

Mobile Ad hoc Network (MANET) is a collection of nodes or communication devices that wish to communicate without any fixed infrastructure and predetermined organization of available links. The effort has been made by proposing a scheme to overcome the critical security issue in MANET. The insufficiency of security considerations in the design of Ad hoc On-Demand Distance Vector protocol makes it vulnerable to the threats of collaborative black hole attacks, where hacker nodes attack the data packets and drop them instead of forwarding. To secure mobile ad hoc networks from collaborative black hole attacks, we implement our scheme and considered sensor's energy as a key feature with a better packet delivery ratio, less delay time and high throughput. The proposed scheme has offered an improved solution to diminish collaborative black hole attacks with high performance and benchmark results as compared to the existing schemes EDRIAODV and DRIAODV respectively. This paper has shown that throughput and packet delivery ratio increase while the end to end delay decreases as compared to existing schemes. It also reduces the overall energy consumption and network traffic by maintaining accuracy and high detection rate which is more safe and reliable for future work.

• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.27-37
• /
• 2002

This paper analyzes problems of existing Mobile IP and redesigns component functions, and proposes handover method using LRS and BCS for handover performance improvement. When mobile node moves another domain, the proposed BCS recognizes its mobility. So, BCS manages mobile node's binding information and serves micro mobility. When handover occurs among domains, micro mobility enables using LRS, As BCS and LRS have buffering function, they can reduce packet loss by forwarding the buffered datagram. It's designed component is implemented in LINUX environment. And then, handover performance was evaluated by simulation. The results of proposed handover method are better than existing method in both transmission delay time and packet loss.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.233-239
• /
• 1999

With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.744-747
• /
• 2017

The Internet of things (IoT) needs to be an event-driven approach for efficient real time response and processing. An IoT gateway is sometimes employed to provide the connection and translation between devices and the cloud. Storing data in the local database, and then forwarding it on the cloud is a task to be relegated to a gateway device In this paper, we propose the design of the IoT gateway with Fog computing for storing data from sensors into a local database. In the procedure of designing storing tasks, we propose to use the interfacing software known as Ardulink MQTT bridge. MQTT is a protocol for sensors to publish data to the clients. When it comes to needing historical data, MQTT connector can push MQTT data into SQL database. We write an MQTT client and based on the message topic insert the values into a SQL Database The design of IoT gateway with Fog computing adds value because it provides processing of the data across multiple devices before it sends to the cloud.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3675-3683
• /
• 2000

The Handoff is the core technical factor that is required when mobile host moves from one area to another, while transmitting and receiving data. The existing works try to minimize the loss of pockets by forwarding packets to the Cell which a mobile host will move to. However, though the loss quantity is little, the accumulated loss can del(rade the performance of the TCP, and can be a serious problem if data is sensitive to the loss of packets. In this paper, we can reduce a memory requesting in FA by restricting the mobile host to move within at most 2 movable cells and design the improved handoff protocol for Mil to receive packets seamlessly in spite of handoff. We can evaluate that the suggested method is superior to the previous method, as a result of comparing with it.

• Journal of Fashion Business
• /
• v.12 no.1
• /
• pp.1-15
• /
• 2008

This study aims to consolidate the qualitative growth of knit design thru the creation of high value-added brand and design, in the state of active trend for competitive promotion of professional knit brand, by collapsing the border line between the knitwear market and the woven one. In accordance with the market situation of increasing a demand of knitwear products, I wish to awaken the importance of knit design thru this study, to survey domestic knit brand products and their planning directions and to plan for the high value-added knitwear products, thru presenting the problems of knit industry and developing knitwear design. This study is focused on showing process of planning and items developed personally by me in charge of developing products practically at the job site of knit industry. From the stage of planning for goods, I suggested the 2007 s/s goods of M company as a strategy of distinctiveness caused by the problems with rival companies, and also proposed a method conducted by the actual business. Setting up M company's s/s concept of the year 2007, I suggested a plan of quantity, time of forwarding, color, fabrics, etc. as well as the process and schedule thru order, and based on the above result, I made a planning for 2007 s/s knitwear for middle-aged women.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1922-1940
• /
• 2019

IP address lookup is a function to determine nexthop for a given destination IP address. It takes an important role in modern routers because of its computation time and increasing Internet traffic. TCAM-based IP lookup approaches can exploit the capability of parallel searching but have a limitation of its size due to latency, power consumption, updatability, and cost. On the other hand, multibit trie-based approaches use SRAM which has relatively low power consumption and cost. They reduce the number of memory accesses required for each lookup, but it still needs several accesses. Moreover, the memory efficiency and updatability are proportional to the number of memory accesses. In this paper, we propose a novel architecture using an Indexed Multibit Trie (IMT) which is based on combined TCAM and SRAM. In the proposed architecture, each lookup takes at most two memory accesses. We present how the IMT is constructed so as to be memory-efficient and fast updatable. Experiment results with real-world forwarding tables show that our scheme achieves good memory efficiency as well as fast updatability.

• Journal of Internet Computing and Services
• /
• v.22 no.5
• /
• pp.27-33
• /
• 2021

With the broad adoption of the Internet of Things (IoT) in a variety of scenarios and application services, management and orchestration entities require upgrading the traditional architecture and develop intelligent models with ultra-reliable methods. In a heterogeneous network environment, mission-critical IoT applications are significant to consider. With erroneous priorities and high failure rates, catastrophic losses in terms of human lives, great business assets, and privacy leakage will occur in emergent scenarios. In this paper, an efficient resource slicing scheme for optimizing federated learning in software-defined IoT (SDIoT) is proposed. The decentralized support vector regression (SVR) based controllers predict the IoT slices via packet inspection data during peak hour central congestion to achieve a time-sensitive condition. In off-peak hour intervals, a centralized deep neural networks (DNN) model is used within computation-intensive aspects on fine-grained slicing and remodified decentralized controller outputs. With known slice and prioritization, federated learning communications iteratively process through the adjusted resources by virtual network functions forwarding graph (VNFFG) descriptor set up in software-defined networking (SDN) and network functions virtualization (NFV) enabled architecture. To demonstrate the theoretical approach, Mininet emulator was conducted to evaluate between reference and proposed schemes by capturing the key Quality of Service (QoS) performance metrics.

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.