• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.313-324
• /
• 2015

In this paper, in order to support the construction of a smart home environment of low power consumption, we propose a heterogeneous interface determination engine and architecture. Technology of "smart home" is in the spotlight according to the development of IT technology nowadays. Smart homes are configured with multiple sub-networks, and each sub-network is formed by the smart devices using various communication interfaces. Thus, in the smart home environment, interlocking technology between heterogeneous interfaces is essentially required for supporting communication between different networks. Further, each communication interface is a difference in power consumption, and home smart devices are often operated in 24 hours, especially smart phones and other wireless devices are sensitive to power consumption. Therefore, in order to build a energy efficient home network, It is important to select the appropriate interface to handle traffic depending on the situation. In this paper, we propose "The Heterogeneous Interface Decision Engine and Architecture for constructing of Low Power Home Network," and analyze the performance of the proposed method and verify the validity through experiments on the test bed.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.11-15
• /
• 2018

The application of Wireless Sensor Networks requires a wise utilization of limited energy resources. Therefore, a wide range of routing protocols with a motivation to prolong the lifetime of a network has been proposed in recent years. Hierarchical clustering based protocols have become an object of a large number of studies that aim to efficiently utilize the limited energy of network components. In this paper, the effect of mismatch in parameter estimation is discussed to evaluate the robustness of a distanced based algorithm called distributed clustering protocol in homogeneous and heterogeneous environment. For quantitative analysis, performance simulations for this protocol are carried out in terms of the network lifetime which is the main criteria of efficiency for the energy limited system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.288-289
• /
• 2013

An integrated security mechanism is one of the key challenges in the open wireless network architecture because of the diversity of the wireless network in open wireless network and the unique security mechanism used in each one of these networks. Optimized security protocols and mechanisms are employed for the high performance and security. Finally, a challenge in the near future will converge the integration of Open Ubiquitous Sensor Network (OUSN) with security protocols for applying the their applications. We analysed unique network-centric features and security mechanism of various heterogeneous wireless networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4293-4304
• /
• 2014

In order to ensure the wireless connectivity and seamless service to mobile users, the next generation network system will be an integration of multiple wireless access networks. In a heterogeneous wireless access system, bandwidth allocation becomes crucial for load balancing to avoid network congestion and improve system utilization efficiency. In this article, we propose a new dynamic bandwidth allocation scheme for hierarchical wireless network systems. First, we derive a multi-objective decision criterion for each access point. Second, a bargaining strategy selection algorithm is developed for the dynamic bandwidth re-allocation. Based on the intervenient Stackelberg game model, the proposed scheme effectively formulates the competitive interaction situation between several access points. The system performance of proposed scheme is evaluated by using extensive simulations. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse network environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.550-565
• /
• 2018

Cognitive radio technology is still the key technology of future mobile communication systems. Previous studies have focused on improving spectrum utilization and less energy consumption. In this paper, we propose an Overhead Reduced Scheme (ORS) for green cooperative spectrum sensing. Compared to traditional cooperative sensing scheme, ORS scheme divides the sensing time into three time slots and selects the best multi-mode user to report decisions. In consideration of reporting channel deviation, we derive closed-form expressions for detection probability and false alarm probability of ORS scheme based on Rayleigh fading channel. Simulation results show that ORS scheme can improve the perception accuracy while reducing the perceived delay and energy consumption in the process of perception, so as to realize the green communication.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.20-28
• /
• 2005

TCP(Transmission Control Protocol) is one of the most important Internet protocols, which is widely used in wireless networks as well as wired networks. However, when TCP is deployed for wireless networks, it takes severe performance degradation because TCP was designed for wired network. To overcome this drawback, a number of TCP variants have been proposed in the literature. However, most previous schemes did not consider TCP enhancement over heterogeneous networks. In heterogeneous networks, an mobile node (MN) may move from one access network to another(i.e., vertical handover). In the case of vertical handover, an MN experiences a TCP performance degradation caused by the packet loss and the sudden change of link characteristics between two different access networks. In this work, we investigate the TCP performance degradation occurred in vortical handover across heterogeneous networks. First, we have conducted the measurement study over GPRS-WLAN testbed. In the measurement study. we observed the TCP performance degradation in the case of handover from WLAN to GPRS. In order to study more different TCP behaviors during vertical handover, we performed comprehensive simulations using a network simulator 2(ns-2). Based on measurement and simulation results, we investigated how to improve TCP performance in vertical handover and we concluded that the existing mechanisms cannot be perfect solutions and new mechanisms are strongly required.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.8
• /
• pp.49-58
• /
• 2016

In designing heterogeneous architecture based application-specific network-on-chips (NoCs), the opportunities of performance improvement would be expanded when applying asynchronous on-chip communication protocol. This is because the wire latency can be configured independently considering the wirelength of each link. In this paper, we develop the delay model of link-wire-length in asynchronous NoC and propose simulated annealing (SA) based floorplan-aware topology generation algorithm to optimize link-wirelengths. Incorporating the generated topology and the associated latency values across all links, we evaluate the performance using the floorplan-annotated sdf (standard delay format) file and RTL-synthesized gate-level netlist. Compared to TopGen, one of general topology generation algorithms, the experimental results show the reduction in latency by 13.7% and in execution time by 11.8% in average with regards to four applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• 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.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.100-109
• /
• 2015

Mobile phone carriers face challenges from three synergistic dimensions: Wireless, social, and mobile. Despite significant advances that have been made about social networks and human mobility, respectively, our knowledge about the interplay between two layers remains largely limited, partly due to the difficulty in obtaining large-scale datasets that could offer at the same time social and mobile information across a substantial population over an extended period of time. In this paper, we take advantage of a massive, longitudinal mobile phone dataset that consists of human mobility and social network information simultaneously, allowing us to explore the impact of human mobility patterns on the underlying social network. We find that human mobility plays an important role in shaping both local and global structural properties of social network. In contrast to the lack of scale in social networks and human movements, we discovered a characteristic distance in physical space between 10 and 20 km that impacts both local clustering and modular structure in social network. We also find a surprising distinction in trajectory overlap that segments social ties into two categories. Our results are of fundamental relevance to quantitative studies of human behavior, and could serve as the basis of anchoring potential theoretical models of human behavior and building and developing new applications using social and mobile technologies.