• Journal of IKEEE
• /
• v.12 no.1
• /
• pp.18-26
• /
• 2008

With the advent of Ubiquitous environment, wired-wireless combination network is being studied very actively in which mobile nodes having multi-hop communication capability connect wired internet network easily, and shares the information. The study of wired and wireless combination network between MANET(Mobile Ad Hoc Network) and wired network is being focused only on the configuration of heterogeneous network interface. The proposed algorithm establishes independent multi-paths between source node and destination node to prevent data loss when errors happen in route. As the result, it shows that the reliability of the combination network can be improved by making data transmit continuously on the route error.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.67-72
• /
• 2014

In this paper, an energy harvesting scheme is applied in the cooperative communication. The proposed scheme uses an energy harvesting relay in which the relay harvests the energy from the source node and transfers to the power form in forwarding the received data to the destination node. The well-known maximal ratio combining (MRC) technique is applied to increase the diversity gain at the destination. Therefore, with applying the proposed energy harvesting scheme, the limited power at the relay is solved, and the operation efficiency of the network and the mobile devices is improved. Finally, performance of the proposed protocol is analyzed in terms of bit error rate, outage probability, power collection efficiency.

• Smart Media Journal
• /
• v.9 no.3
• /
• pp.71-79
• /
• 2020

Mobile network is used by many users worldwide for diverse services, including phone-call, messaging and data transfer over the Internet. However, this network may experience massive damage if it is exposed to cyber-attacks or denial-of-service attacks via wireless communication interference. Because the mobile network is also used as an emergency network in cases of disaster, evaluation or verification for security and safety is necessary as an important nation-wide asset. However, it is not easy to analyze the mobile core network because it's built and serviced by private service providers, exclusively operated, and there is even no separate network for testing. Thus, in this paper, a virtual mobile network is built using OpenAirInterface, which is implemented based on 3GPP standards and provided as an open source software, and the structure and protocols of the core network are analyzed. In particular, the S1AP protocol messages captured on S1-MME, the interface between the base station eNodeB and the mobility manager MME, are analyzed to identify potential security threats by evaluating the effect of the messages sent from the user terminal UE to the mobile core network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2972-2991
• /
• 2016

WLAN is the best choice in the place where complex network is hard to set up. Intelligent terminals are more and more assembled in some areas now. However, according to IEEE 802.11n/802.11ac, the access-point (AP) can only serve one user at a single frequency channel. The spectrum efficiency urgently needs to be improved. In theory, AP with multi-antenna can serve multiple users if these users do not interfere with each other. In this paper, we propose a user clustering scheme that could achieve multi-user selection through the mutual cooperation among users. We focus on two points, one is to achieve multi-user communication with multiple antennas technique at a single frequency channel, and the other one is to use a way of distributed users' collaboration to determine the multi-user selection for user clustering. Firstly, we use the CSMA/CA protocol to select the first user, and then we set this user as a source node using users' cooperation to search other proper users. With the help of the users' broadcast cooperation, we can search and select other appropriate user (while the number of access users is limited by the number of antennas in AP) to access AP with the first user simultaneously. In the network node searching, we propose a maximum degree energy routing searching algorithm, which uses the shortest time and traverses as many users as possible. We carried out the necessary analysis and simulation to prove the feasibility of the scheme. We hope this work may provide a new idea for the solution of the multiple access problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.1035-1044
• /
• 1998

A new multi-channel access scheme and the associated network architecture for a single-hop WDM local area network is proposed in this paper. The proposed architecture has Central Scheduling Node (CSN) for the transmission coordination among many users, which is one of the key issues in single-hop WDM networks. The data channels, source nodes, and destination nodes are selected at CSN in very simple menner. Our scheme can relive the control processing overhead at all nodes in the network which is caused in existing distributed scheduling algorithms. CSN is simple in the architecture can be implemented easily. in respect to the network performance, the maximum obtainable throughput is up to that of the ideal output queuing because of collision free scheduling. We use the MQMS (multi-queue multi-server) model for performance analaysis.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.653-661
• /
• 2012

High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.876-884
• /
• 2012

This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.815-818
• /
• 2015

AODV routing protocol, one of the most studied routing protocols for the Mobile Ad hoc Network (MANET), uses the number of hops as the metric to choose a path from a source node to a destination node. If the path is deteriorated, it will cause many problems to the communication. In order to improve the performance of the network, we propose AuM-AODV routing protocol that contains an auxiliary metric besides the number of hops. Nodes using AuM-AODV use control packets such as Route Request (RREQ), Route Reply (RREP), and HELLO to exchange information about network topology like AODV routing protocol. AuM-AODV routing protocol is implemented in NS-3 for performance evaluation. We use three performance metrics, that is to say, throughput, packet delivery ratio, and average end-to-end delay. According to numerical results, the new AuM-AODV routing protocol has better performance over three performance metrics than AODV routing protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2C
• /
• pp.105-111
• /
• 2011

In this paper, we propose a novel Alamouti space-time transmission scheme for orthogonal frequency division multiplexing (OFDM) based asynchronous cooperative communication systems with low relay complexity. The conventional scheme requires an additional operation likes time-reversal at the relay nodes besides the simple multiplications at the relay nodes, which result in increasing the complexity of relay nodes. Unlike the conventional scheme, exploiting the simple combination of the symbols at the source node and the simple multiplications at the relay nodes, the proposed scheme achieves the second order diversity gain by obtaining the Alamouti code structure at the destination node. Simulation results show that the proposed scheme achieves the second order diversity gain and has the same bit error rate performance as the conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1395-1404
• /
• 2000

In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.