• ETRI Journal
• /
• v.31 no.4
• /
• pp.408-418
• /
• 2009

Adopting an encryption function in voice over Wi-Fi service incurs problems such as additional power consumption and degradation of communication quality. To overcome these problems, a partial encryption (PE) algorithm for compressed speech was recently introduced. However, from the security point of view, the partial encryption sets (PESs) of the conventional PE algorithm still have much room for improvement. This paper proposes a new selection method for finding a smaller PES while maintaining the security level of encrypted speech. The proposed PES selection method employs the perceptual evaluation of the speech quality (PESQ) algorithm to objectively measure the distortion of speech. The proposed method is applied to the ITU-T G.729 speech codec, and content protection capability is verified by a range of tests and a reconstruction attack. The experimental results show that encrypting only 20% of the compressed bitstream is sufficient to effectively hide the entire content of speech.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3151-3168
• /
• 2021

Internet of Things (IoT) connects several objects with embedded sensors and they are capable of exchanging information between devices to create a smart environment. IoT smart devices have limited resources, such as batteries, computing power, and bandwidth, but comprehensive sensing causes severe energy restrictions, lowering data quality. The main objective of the proposal is to build a hybrid protocol which provides high data quality and reduced energy consumption in IoT sensor network. The hybrid protocol gives a flexible and complete solution for sensor selection problem. It selects a subset of active sensor nodes in the network which will increase the data quality and optimize the energy consumption. Since the unused sensor nodes switch off during the sensing phase, the energy consumption is greatly reduced. The hybrid protocol uses Dijkstra's algorithm for determining the shortest path for sensing data and Ant colony inspired variable path selection algorithm for selecting active nodes in the network. The missing data due to inactive sensor nodes is reconstructed using enhanced belief propagation algorithm. The proposed hybrid method is evaluated using real sensor data and the demonstrated results show significant improvement in energy consumption, data utility and data reconstruction rate compared to other existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.657-667
• /
• 2012

In the MPR selection algorithm of Optimized Link State Routing (OLSR), each node selects own MPRs independently, so most of nodes are selected to MPR at least once. To cope with this problem, the MPR candidate selection algorithm was proposed. The MPR candidate selection algorithm can reduce the number of MPRs, but the efficiencies of route and connectivity decline due to decreased number of MPRs. So, in this paper, we propose the Significant Multi-Point Relay (S-MPR) selection algorithm which can enhance the performance of ad hoc network by improving the MPR selection algorithm of OLSR. In proposed S-MPR selection algorithm, each node selects the most important node to S-MPR to guarantee the connectivity then selects remaining MPRs in MPR candidates. So proposed S-MPR selection algorithm can reduce the overhead of many MPRs without decline of routing performance. To show the performance gain of proposed S-MPR selection algorithm, we simulate the proposed S-MPR selection algorithm by using OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.673-684
• /
• 2007

In this paper, we introduce an FARNS (Flooding algorithm with Adaptive Retransmission Nodes Selection). It is an efficient cross layer-based flooding technique to solve broadcast storm problem that is produced by simple flooding of nodes in wireless sensor network. FARNS can decrease waste of unnecessary energy by preventing retransmission action of whole network node by deciding retransmission candidate nodes that are selected by identification in MAC and distance with neighborhood node through received signal strength information in PHY. In simulation part, we show the results that FARNS has excellent performance than the other flooding schemes in terms of broadcast forwarding ratio, broadcast delivery ratio, number of redundancy packets and overhead. And FARNS can adjust of node ratio for retransmission operation, it can solve broadcast storm problem as well as meet the requirements of various network environments.

• Journal of information and communication convergence engineering
• /
• v.22 no.1
• /
• pp.1-6
• /
• 2024

Energy efficiency in wireless sensor networks (WSNs) is a critical issue because batteries are used for operation and communication. In terms of scalability, energy efficiency, data integration, and resilience, WSN-cluster-based routing algorithms often outperform routing algorithms without clustering. Low-energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol with a high transmission efficiency to the base station. In this paper, we propose an energy consumption model for LEACH and compare it with the existing LEACH, advanced LEACH (ALEACH), and power-efficient gathering in sensor information systems (PEGASIS) algorithms in terms of network lifetime. The energy consumption model comprises energy-sensitive cluster formation and a cluster head selection technique. The setup and steady-state phases of the proposed model are discussed based on the cluster head selection. The simulation results demonstrated that a low-energy-consumption network was introduced, modeled, and validated for LEACH.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.163-172
• /
• 2009

Various terminals equipped with multiple interfaces may receive services from wireless networks when they pass through the overlaid heterogeneous networks, and thus the vertical handovers across the wireless networks increases, which will become a big problem in the network resource management. This problem can be efficiently solved by common radio resource management (CRRM). In this paper, we propose two operation algorithms based on network selection jointly with vertical handover as the key CRRM strategies. When a new user tries to get services, the CRRM can choose the best target network according to the proposed Integrated Network Selection Algorithm. When the network cannot satisfy the request from the new users, the proposed Integrated Vertical Handover Algorithm moves existing users to neighborhood networks to accommodate new users. The performance of the proposed algorithms has been validated through extensive simulations.

• Convergence Security Journal
• /
• v.19 no.4
• /
• pp.87-96
• /
• 2019

Recently, with the rapid development of video equipment and technology, tremendous video information is produced and utilized in military domain to acquire battlefield information or for effective command control. Note that the video playback devices currently used in the military domain ranges from low-performance tactical multi-functional terminals (TMFT) to high-performance video servers and the networks where the video information is transmitted also range from the low speed tactical information and communication network (TICN) to ultra-high speed defense broadband converged networks such as M-BcN. Therefore, there is a need for an efficient streaming technique that can efficiently transmit defense video information in heterogeneous communication equipment and network environments. To solve the problem, this paper proposes a Scalable Video Coding (SVC) and balanced selection algorithm based Peer-to-Peer (P2P) streaming technique and the feasibility of the proposed technique is verified by simulations. The simulation results based on our BitTorrent simulator show that the proposed balanced selection scheme outperforms the sequential or rarest selection algorithm.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.116-120
• /
• 2008

The conventional channel selection method for a ZigBee communication network basically detects the energy values in all channels. In the ISM band, no license is required to use channels in this band, so there may exist various interference factors in this band. It is well known that WLAN is the major interference factor degrading the performance of ZigBee in the ISM band. In this paper, we propose an efficient channel selection algorithm which uses the pattern of WLAN channel uses as the a priori information. By using the proposed algorithm, we may save the time required to select channels for the ZigBee communications.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.6
• /
• pp.306-314
• /
• 2005

In this paper, a new approach that is based on EEAC & only with network solutions for CS&S in the transient stability assessment is developed. The proposed CS&S algorithm in conjunction with EEAC to include the capability of performing on-line TSA without TDS is used to calculate the critical clearing time for stability index. In this algorithm, all generators are represented by classical models and all loads are represented by constant impedance load models. The accelerating & synchronizing power coefficient as an index is determined at its disturbance through solving network equation directly. As mentioned above, a new index for generator is generally used to determine the critical generators group. The generator rotor angle is fixed for non-critical generators group, but has equal angle increments for critical generators group. Finally, the critical clearing time is calculated from the power-angle relationship of equivalent OMIB system. The proposed CS&S algorithm currently being implemented is applied to the KEPCO system. The CS&S result was remarkably similar to TSAT program and SIME. Therefore, it was found to be suitable for a fast & highly efficient CS&S algorithm in TSA. The time of CS&S for the 139 contingencies using proposed CS&S algorithm takes less than 3 seconds on Pentium 4, 3GHz Desktop.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.2042-2048
• /
• 2014

In medium voltage electrical distribution networks, reforming the loss reduction is important, and in line with this, the issue of system engineering and use of proper equipment Expansion of distribution systems results in higher system losses and poor voltage regulation. Therefore, an efficient and effective distribution system has become more important. So, proper selection of conductors in the distribution system is crucial as it determines the current density and the resistance of the line. Evaluation of aging conductors for losses and costs imposed in addition to the careful planning of technical and economic networks can be identified in the network design. In this paper the use of imperialist competitive algorithm; genetic algorithm; is proposed to optimal branch conductor selection and reconstruction in radial distribution systems planning. The objective is to minimize the overall cost of annual energy losses and depreciation on the cost of conductors to improve productivity given the maximum current carrying capacity and acceptable voltage levels. Simulations are carried out on 69-bus radial distribution network using genetic algorithm approaches to show the accuracy as well as the efficiency of the proposed solution technique.