• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1593-1608
• /
• 2009

If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

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

Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.87-92
• /
• 2015

In this Paper, we proposed optimization of system performance, optimal splitting factor ${\alpha}$ applied to power splitting protocol with relay protocol with decode and forward undergo co-channel interference. We can possible to optimize and maximize the channel capacity of the receive performance and the efficiency of the network through optimal factor of splitting protocol. We verified BER performance and Channel capacity and Outage probability for the proposed scheme over Rayleigh fading through Monte-Carlo simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4529-4548
• /
• 2016

DDoS attacks have had a devastating effect on the Internet, which can cause millions of dollars of damage within hours or even minutes. In this paper we propose a practical dynamic defense approach that overcomes the shortage of static defense mechanisms. Our approach employs a group of SDN-based proxy switches to relay data flow between users and servers. By substituting backup proxy switches for attacked ones and reassigning suspect users onto the new proxy switches, innocent users are isolated and saved from malicious attackers through a sequence of remapping process. In order to improve the speed of attacker segregation, we have designed and implemented an efficient greedy algorithm which has been demonstrated to have little influence on legitimate traffic. Simulations, which were then performed with the open source controller Ryu, show that our approach is effective in alleviating DDoS attacks and quarantining the attackers by numerable remapping process. The simulations also demonstrate that our dynamic defense imposes little effect on legitimate users, and the overhead introduced by remapping procedure is acceptable.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.290-296
• /
• 2007

We propose new routing scheme, Cooperative Diversity-based Routing (CDR) which utilizes the cooperative space diversity for power saving and performance enhancement of wireless ad-hoc networks. The improved performance is compared with Multi-hop Relay Routing (NRR) by analytical methods. When the required outage probability is $1\times10^{-3}$ at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 15.5 dB in average, by using our proposed CDR compared to MRR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.475-483
• /
• 2007

Recently, consumers demand high-quality wireless multimedia services via terrestrial and satellite network. And the interest for new services to sustain its successful commercial deployment grows tremendously. So, the MIMO schemes, such as STCs, MRC, has been used for realizing high reliability. However, MIMO schemes has some limitations. MIMO scheme needs more size, cost, and hardware complexity to employ additional antennas. Moreover, sufficient spaces between antennas are required to guarantee the independence of each channel and the devices which use multiple antennas should be enlarged. A cooperative transmission technique which is detect and forward type applying virtual MIMO with STBC matrix in DVB-RCT(Digital Video Broadcasting with Return Channel via Terrestrial) system based on OFDMA is also proposed.

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

A distributed zero-beamforming based cooperative jamming technique is useless when an eavesdropper detects the sharing seed. In addition, the currently alternatives are very limited when the eavesdropper is located nearby a source for wiretapping. This letter presents a solution to this extreme case. Relay randomly generates and transmits a binary jamming message to both source and destination in the first phase. When these two receivers securely and correctly decode the message, the source creates and transmits another message based on the use of exclusive-or for its information message and the decoded message. Consequently, the next transmission can avoid the eavesdropping.

• KIEE International Transactions on Power Engineering
• /
• v.3A no.4
• /
• pp.198-205
• /
• 2003

This paper proposes the adaptive relaying of protective devices applied in the neighboring distribution feeders for reliable and efficient operations of a wind farm interconnected with distribution networks by dedicated lines. A wind farm connected to an electric power network is one of the greatest alternative energy sources. However, the wind turbine generators are influenced by abnormal grid conditions such as disturbances occurring in the neighboring distribution feeders as well as the dedicated power. Particularly, in cases of a fault happening in the neighboring distribution feeders, a wind farm might be accelerated until protective devices clear the fault. Therefore, the delayed operation time of protective devices for satisfying the coordination might overly expose the interconnected wind turbine generators to the fault and cause damage to them. This paper describes the proper delayed operation time of protective relay satisfying the coordination of the distribution networks as well as reducing damage on the interconnected wind farm. The simulation results for the Hoenggye substation model composed of five feeders and one dedicated line using PSCAD/EMTDC showed that the proper delayed time of protective devices reflecting the fault condition and the power output of the wind farm could improve the operational reliability, efficiency, and stability of the wind farm.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.193-195
• /
• 2002

In this paper, a communication module is proposed to be applied to communication between over current relay (OCR) agents in multi agent protection system. A multi agent system can achieve a global goal beyond the ability of each individual agent by working together, in which it is the prerequisite for each agent to be able to exchange or share information or processing status with other agent. The proposed communication module is purposed to enable not only each agent to bring about its own goal, but also the whole protective system to provide much improved coordinated protection. It is applied to a self adaptive protection system for a distribution network using multi agent concept to show its effectiveness.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.3
• /
• pp.115-122
• /
• 2017

In this paper, we propose an adaptive data aggregation and compression scheme for wireless sensor networks with energy-harvesting nodes, which increases the amount of data arrived at the sink node by efficient use of the harvested energy. In energy-harvesting wireless sensor networks, sensor nodes can have more than necessary energy because they harvest energy from environments continuously. In the proposed scheme, when a node judges that there is surplus energy by estimating its residual energy, the node compresses and transmits the aggregated data so far. Conversely, if the residual energy is estimated to be depleted, the node turns off its transceiver and collects only its own sensory data to reduce its energy consumption. As a result, this scheme increases the amount of data collected at the sink node by preventing the blackout of relay nodes and facilitating data transmission. Through simulation, we show that the proposed scheme suppresses the occurrence of blackout nodes and collect the largest amount of data at the sink node compared to previous schemes.