• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2595-2618
• /
• 2018

In this paper, we investigate secure communication with the presence of multiple eavesdroppers (Eves) in a two-tier downlink dense heterogeneous network, wherein there is a macrocell base station (MBS) and multiple femtocell base stations (FBSs). Each base station (BS) has multiple users. And Eves attempt to wiretap a macrocell user (MU). To keep Eves ignorant of the confidential message, we propose a physical-layer security scheme based on cross-layer cooperation to exploit interference in the considered network. Under the constraints on the quality of service (QoS) of other legitimate users and transmit power, the secrecy rate of system can be maximized through jointly optimizing the beamforming vectors of MBS and cooperative FBSs. We explore the problem of maximizing secrecy rate in both non-colluding and colluding Eves scenarios, respectively. Firstly, in non-colluding Eves scenario, we approximate the original non-convex problem into a few semi-definite programs (SDPs) by employing the semi-definite relaxation (SDR) technique and conservative convex approximation under perfect channel state information (CSI) case. Furthermore, we extend the frame to imperfect CSI case and use the Lagrangian dual theory to cope with uncertain constraints on CSI. Secondly, in colluding Eves scenario, we transform the original problem into a two-tier optimization problem equivalently. Among them, the outer layer problem is a single variable optimization problem and can be solved by one-dimensional linear search. While the inner-layer optimization problem is transformed into a convex SDP problem with SDR technique and Charnes-Cooper transformation. In the perfect CSI case of both non-colluding and colluding Eves scenarios, we prove that the relaxation of SDR is tight and analyze the complexity of proposed algorithms. Finally, simulation results validate the effectiveness and robustness of proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.2967-2981
• /
• 2014

Device-to-Device (D2D) communication is a technology component for long-term evolution-advanced (LTE-A). In D2D communication, users in close proximity to each other can communicate directly without going through a base station; such direct communication can improve spectral efficiency. Although D2D communication brings improvement in spectral efficiency, it also causes interference to the cellular network as a result of spectrum sharing. In particularly, D2D communication can generate interference for each D2D pair when the common wireless medium in a co-located limited area is accessed. Even though the interference management for between the D2D pair and cellular networks has been proposed, the interference reducing methods have still not been fully studied for the D2D pairs. In this paper, we investigate the problem of D2D pair coexistence in which interference is considered between D2D pairs. Using a signal to interference model for a target D2D pair, we provide an analysis of the aggregated throughput of a dense D2D network. For a target D2D pair, we assume that the desired signal and interference signals obey multipath fading and shadow fading. Through analysis, we demonstrate the effect of cluster size such as the number of D2D pairs and the size of the considered area on the network performance. The analytical results are compared with computer simulations. Our work can be used for a rough guideline for controlling the system throughput in a dense D2D network environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.343-364
• /
• 2021

In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.67-78
• /
• 2003

As optical network technology advances and high bandwidth Internet is demanded for the exponential growth of internet traffic volumes, the Dense-Wavelength Division Multiplexing (DWDM) networks have been widely accepted as a promising approach to the Next Generation Optical Internet (NGOI) backbone networks for nation wide or global coverage. Important issues in the NGOI based on DWDM networks are the Routing and Wavelength Assignment(RWA) problem and survivability. Especially, fault/attack detection, localization and recovery schemes in All Optical Transport Network(AOTN) is one of the most important issues because a short service disruption in DWDM networks carrying extremely high data rates causes loss of vast traffic volumes. In this paper, we suggest a fault/attack management model for NGOI through analyzing fault/attack vulnerability of various optical backbone network devices and propose fault/attack recovery procedure considering Extended-LMP(Link Management Protocol) and RSVP-TE+(Resource Reservation Protocol-Traffic Engineering) as control protocols in IP/GMPLS over DWDM.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.227-242
• /
• 2012

Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.

• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.234-240
• /
• 2006

We study the dynamic burst assembly based on traffic prediction and offset and delay differentiation in optical burst switching network. To improve existing burst assembly mechanism and build an adaptive flexible optical burst switching network, an approach called quality of service (QoS) based adaptive dynamic assembly (QADA) is proposed in this paper. QADA method takes into account current arrival traffic in prediction time adequately and performs adaptive dynamic assembly in limited burst assembly time (BAT) range. By the simulation of burst length error, the QADA method is proved better than the existing method and can achieve the small enough predictive error for real scenarios. Then the different dynamic ranges of BAT for four traffic classes are introduced to make delay differentiation. According to the limitation of BAT range, the burst assembly is classified into one-dimension limit and two-dimension limit. We draw a comparison between one-dimension and two-dimension limit with different prediction time under QoS based offset time and find that the one-dimensional approach offers better network performance, while the two-dimensional approach provides strict inter-class differentiation. Furthermore, the final simulation results in our network condition show that QADA can execute adaptive flexible burst assembly with dynamic BAT and achieve a latency reduction, delay fairness, and offset time QoS guarantee for different traffic classes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.83-89
• /
• 2016

In this paper, we apply the complementation principle of five prime substances to reduce the phase interference. The transmitter and receiver match the concepts of co-operative and conflict to the direct and indirect signals. The result shows we investigate the proposed network topology such as 5 prime substances (5 user networks). The key observation is that optimal symmetric degree of freedom (DoF) can be achieved for 5 user network with different channel coherence times by adaptively selecting the interference alignment scheme via controlling the alignment feasibility of the transmitted signals. Theoretical results demonstrate the effectiveness of the proposed 5 user networks are well matched to the wireless mobile channel environment to achieve the symmetric DoF for different channel coherence times which ensures that the proposed networks are applicable for dense wireless network applications. Modulo 3 functionality in 5 user network topology makes it easier for the transmitter cooperation to achieve the DoF of 2/3 with the help of the interference alignment schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.929-935
• /
• 2017

All sensor nodes generally determine their positions using anchor nodes that are located in underwater sensor networks. This paper proposes a Tabu search algorithm to determine the minimum number of anchor nodes for the location of all sensor nodes in underwater sensor networks. As the number of the sensor nodes increases in the network, the amount of calculation that determines the number of anchor nodes would be too much increased. In this paper, we propose a Tabu search algorithm that determines the minimum number of anchor nodes within a reasonable computation time in a high dense network, and propose an efficient neighborhood generating operation of the Tabu search algorithm for efficient search. The proposed algorithm evaluates those performances through some experiments in terms of the minimum number of anchor nodes and execution time. The proposed algorithm shows 5-10% better performance than the conventional algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.247-268
• /
• 2011

Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting interval varies according to the type of application. Such considerations require an application-specific, parameter tuning paradigm allowing us to maximize energy conservation prolonging the operational network lifetime. In this paper, we propose a reporting interval adaptive, sensor control platform for energy-saving data gathering in wireless sensor networks. The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to application-dependent or time-varying, reporting interval requirements. The proposed sensor control platform is based upon a two phase clustering (TPC) scheme which constructs two types of links within each cluster - namely, direct link and relay link. The direct links are used for control and time-critical, sensed data forwarding while the relay links are used only for multi-hop data reporting. Sensors opportunistically use the energy-saving relay link depending on the user reporting, interval constraint. We present factors that should be considered in deciding the total number of relay links and how sensors are scheduled for sensed data forwarding within a cluster for a given reporting interval and link quality. Simulation and implementation studies demonstrate that the proposed sensor control platform can help individual sensors save a significant amount of energy in reporting data, particularly in dense sensor networks. Such saving can be realized by the adaptability of the sensor to the reporting interval requirements.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.658-668
• /
• 2011

Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.