• KIISE Transactions on Computing Practices
• /
• v.23 no.2
• /
• pp.122-127
• /
• 2017

The data link layer operates reliable internode communication in the OSI reference model. Generally, the forward error correction (FEC) method is used in the data link layer of the wireless sensor network (WSN) environment that has a high frequency of errors. However, the FEC method consumes a significant amount of energy due to its high error correction rate, which negatively affects the networks' lifespan. In contrast with battery-based technology, energy is regularly recharged in the solar-powered WSN to meet higher energy needs than required for basic operation of existing nodes. By efficiently utilizing this surplus energy, the proposed energy-aware FEC method can reduce the data loss rate with no decrement of the network lifetime. The method employs a trade-off relationship between the energy and data loss rate by adjusting the parity length in the FEC method to the energy state in each node. The performance of the proposed scheme was verified through a simulation.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.6-10
• /
• 2015

RF energy harvesting technology is a promising technology for generating the electrical power from ambient RF signal to operate low-power consumption devices(eg. sensor) in wireless communication networks. This paper, motivated by this and building upon existing CR(Cognitive Radio) network model, proposes a optimal control policy for RF energy harvesting CR networks model where secondary users that have low power consumption harvest ambient RF energy from transmission by nearby active primary users, while periodically sensing and opportunistically accessing the licensed spectrum to the primary user's network. We consider that primary users and secondary users are distributed as Poisson point processes and contact with their intended receivers at fixed distances. Finally we can derive the optimal frame duration, transmission power and density of secondary user from the proposed model that can maximize the secondary users's throughput under the given several conditions and suggest future directions of research.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.1-7
• /
• 2010

Network Centric Warfare(NCW) is becoming a prominent concept in the current trend of warfare. To support high quality communication between strategic/tactical units in the concept of NCW, Tactical Airborne Networks are likely to be constructed in the near future to take part in the NCW. In these Tactical Airborne Networks with dynamic topology variations due to very high mobility of participants nodes, more efficient and reliable neighbor discovery protocols are needed. This paper presents the adaptive HELLO message scheduling algorithm for Tactical Airborne Network using directional antennas. The purposed algorithm can reduce the overhead of periodic HELLO message transfer, while guaranteeing successful data transmission. We concluded a mathematical analysis and simulation studies using Qualnet 4.5 for evaluation the performance and efficiency of the proposed scheme.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.603-614
• /
• 2005

The wireless LAN environment using Mobile IP is constructed and managed to be connected with Ethernet based wired networks. However, there have been many problems with wireless networks using Mobile IP. Some important facts on network performance have not been considered when introducing wireless LAN by Mobile IP to wired networks. In this paper, we suggest schemes which can solve problems on Handover latency caused by the asymmetrical connectivity of the Access Router at applying the HMIPv6 and on binding updates due to the MN frequent movement. Our proposed schemes can reduce network latency by using the HMIPv6 architecture with a virtual router layer, and reduce communication overhead by interchanging information of the MN movement between routers. Our schemes are expected to assist in constructing a more real and effective wireless LAN environment based on the HMIPv6 and FMIP.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.2178-2184
• /
• 2015

With the development of wireless network technologies, mobile users may use various networks easily and expect more advanced services. On the other hand, it may bring on some problems with network resource management that should lead the service provider to improve the current service quality and manage the network resource efficiently. This paper proposes the optimized radio resource management (RRM) scheme that integrates the Grey Relational Analysis (GRA) and game theory. The first applies the GRA to determine the Grey Relation Coefficient (GRC) factors that represent the network preference, and the network provider then selects the requested service that provide maximum payoff through Nash Equilibrium. Six requested services that have one application service among four different types of service classes were considered and the game was played repeatedly. In WiMAX, WLAN 1 and WLAN 2 game, the maximum payoff of each players was 93, 90.6 and 92.8 respectively. The experimental results show that every requested service can be selected by the network provider. Consequently, the proposed radio resource management mechanism is more effective in heterogeneous wireless networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.506-512
• /
• 2016

Recently, energy harvesting technology is considered as a tool to improve the lifetime of sensor networks by mitigating the battery capacity limitation problem. However, the previous work on energy harvesting has failed to provide practical information since it has assumed an ideal channel knowledge model with perfect channel state information at transmitter (CSIT). This paper proposes an energy efficient resource allocation scheme that takes account of the channel estimation process and the corresponding estimation error. Based on the optimization tools, we provide information on efficient scheduling and power allocation as the functions of channel estimation accuracy, harvested energy, and data rate. The simulation results confirm that the proposed scheme outperforms the conventional energy harvesting networks without considering channel estimation error in terms of energy efficiency. Furthermore, with taking account of channel estimation error, the results provides a new way for allocating resources and scheduling devices.

• The Journal of the Korea Contents Association
• /
• v.17 no.1
• /
• pp.662-672
• /
• 2017

Recently, with the development of mobile devices and near field communication, mobile P2P networks have been actively studied to improve the limits of the existing centralized processing system. A peer has limited components such as batteries, memory and storage spaces in mobile P2P networks. The trust of a peer should be discriminated in order to share reliable contents in mobile P2P networks. In this paper, we propose a trust discrimination scheme considering limited resources in mobile P2P environments. The proposed scheme discriminates the trust of a peer by direct rating values using the rating information of the peer and indirect rating values by the other peers. The recent update time is included in the rating information. The proposed scheme reduces the redundant rating information by comparing the recent update times of the rating information. It is shown through performance evaluation that the proposed scheme reduces the number of messages and improves the accuracy of trust over the existing scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1931-1938
• /
• 2012

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.900-910
• /
• 2004

Route failure is mainly caused by mobility of mobile host in ad hoc networks. Route failure, which may lead to sudden packet losses and delays, is losing the route from source to destination. In this situation, TCP assumes that congestion has occurred within the network and also initiates the congestion control procedures. Congestion control algorithm provides the means for the source to deal with lost packets. TCP performance in ad hoc environments will be degraded as TCP source cannot distinguish congestion from route failure. In this paper, we propose TCP-P as pre-detection approach to deal with route failure. TCP-P freezes TCP through pre-detection of route failure. Route failure information of the proposed mechanism is obtained not by routing protocol but by MAC protocol. The intermediated node, obtaining route failure information by its MAC layer, relays the information to TCP source and lets TCP source stop the congestion control algorithm. Results reveal that TCP-P responding with proactive manner outperforms other approaches in terms of communication throughput under the presence of node mobility.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.82-91
• /
• 2010

Data compression technique is traditional and effective to reduce network traffic. Generally, sensor data exhibit strong correlation in both space and time. Many algorithms have been proposed to utilize these characteristics. However, each sensor just utilizes neighboring information, because its communication range is restrained. Information that includes the distribution and characteristics of whole sensor data provide other opportunities to enhance the compression technique. In this paper, we propose an orthogonal approach for compression algorithm based on a novel feedback diffusion algorithm in sensor networks. The base station or a super node generates the Huffman code for compression of sensor data and broadcasts it into sensor networks. Every sensor that receives the information compresses their sensor data and transmits them to the base station. We define this approach as feedback-diffusion. In order to show the superiority of our approach, we compare it with the existing aggregation algorithms in terms of the lifetime of the sensor network. As a result, our experimental results show that the whole network lifetime was prolonged by about 30%.