• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.458-464
• /
• 2014

In the future, an increasing number of heterogeneous networks will be connected with each other. Each of them has its own interest. Existing systems lack good incentive mechanisms to attract more networks to participate in cooperations. In this paper, we design an auction-based incentive mechanism for routing protocols applied in heterogeneous networking which is computationally efficient, individually rational, profitable, and truthful. Through several simulations, we evaluate the performance and validate the properties of our mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

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

In this paper defined UID management, profile management, and they are also implemented and tested for interoperability in testbed including heterogeneous wireless networks environment. Also Architecture and roles of UID, Streaming Service Provider, information flows, unified profiles are studied, designed and implemented to be test. The study result include the functional architectures, requirements and main information flows of UID and Streaming Service Provider during roaming to heterogeneous wireless networks.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.634-644
• /
• 2009

A diversity of wireless networks, with rapidly evolving wireless technology, are currently in service. Due to their innate physical layer vulnerability, wireless networks require enhanced security components. WLAN, WiBro, and UMTS have defined proper security components that meet standard security requirements. Extensive research has been conducted to enhance the security of individual wireless platforms, and we now have meaningful results at hand. However, with the advent of ubiquitous service, new horizontal platform service models with vertical crosslayer security are expected to be proposed. Research on synchronized security service and interoperability in a heterogeneous environment must be conducted. In heterogeneous environments, to design the balanced security components, quantitative evaluation model of security policy in wireless networks is required. To design appropriate evaluation method of security policies in heterogeneous wireless networks, we formalize the security properties in wireless networks. As the benefit of security protocols is indicated by the quality of protection (QoP), we improve the QoP model and evaluate hybrid security policy in heterogeneous wireless networks by applying to the QoP model. Deriving relative indicators from the positive impact of security points, and using these indicators to quantify a total reward function, this paper will help to assure the appropriate benchmark for combined security components in wireless networks.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.4
• /
• pp.625-634
• /
• 2014

Tactical networks is being operated in configuration that consisting of a variety of characteristics communication equipments and heterogeneous networks. In this configurations, end-to-end communication can be achieved using interworking gateway for converting the data format of the network and using encryption algorithm of the networks. The use of mechanism results in a problem that secure data cannot be transferred directly, reprocessing and processing delay of communication in heterogeneous tactical networks. That is, for encoding and decoding of data, the decryption of encrypted data and re-encryption processing must be required at the gateway between different networks. In this paper proposes to mechanism for end-to-end secure communication in heterogeneous tactical networks. Using the proposed method, end-to-end secure communication between heterogeneous tactical networks(PSTN-UHF networks) which removes the necessity of a gateway for converting data into data formats suitable for network to remove a transmission delay factor and enable real-time voice and data communication and achieve end-to-end security for heterogeneous tactical networks. we propose a novel mechanism for end-to-end secure communication over PSTN and UHF networks and evaluate against the performance of conventional mechanism. Our proposal is confirmed removal of security vulnerabilities, end-to-end secure communication in heterogeneous tactical networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1249-1272
• /
• 2016

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.101-104
• /
• 2007

Efficient Query processing and optimization are critical for reducing network traffic and decreasing latency of query when accessing and manipulating sensor data of large-scale sensor networks. Currently it has been studied in sensor database projects. These works have mainly focused on in-network query processing for sensor networks and assumes homogeneous sensor networks, where each sensor network has same hardware and software configuration. In this paper, we present a framework for efficient query processing over heterogeneous sensor networks. Our proposed framework introduces query processing paradigm considering two heterogeneous characteristics of sensor networks: (1) data dissemination approach such as push, pull, and hybrid; (2) query processing capability of sensor networks if they may support in-network aggregation, spatial, periodic and conditional operators. Additionally, we propose multi-query optimization strategies supporting cross-translation between data acquisition query and data stream query to minimize total cost of multiple queries. It has been implemented in WSN middleware, COSMOS, developed by ETRI.

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

Owing to the increase in consumption of multimedia content and the improvement of device capacity, user demand for high-quality content has increased. However, it is difficult to transport such large amounts of content over the existing broadcasting network with limited bandwidth. To provide high-definition broadcasting, some studies suggest methods of transporting multimedia over heterogeneous networks after encoding content hierarchically. MPEG Media Transport (MMT), standardized by Moving Picture Experts Group (MPEG), is a solution that enables large-volume media transport over heterogeneous networks such as digital broadcasting networks and packet-switched networks. In the case of delivering a scalable encoded video over different networks, synchronization of each stream is an important issue. MMT defines a synchronization scheme, but does not contain sufficient functions to implement it. In this paper, we propose a synchronization scheme for media streams that are encoded hierarchically, divided into layers, and transported over heterogeneous networks. We implement our scheme using MMT and HTTP, and experimented using three encapsulated video streams with different durations. As a result, we show that the proposed scheme can reduce the waiting time to display high-quality video, relative to Dynamic Adaptive Streaming over HTTP-Scalable Video Coding (DASH-SVC) by requesting segments of enhanced layers after calculating the transmission time. Additionally, we find out that the selection of durations have a relation to the characteristics of the video.

• ETRI Journal
• /
• v.32 no.2
• /
• pp.292-301
• /
• 2010

Increasing convergence among heterogeneous radio networks is expected to be a key feature of future ubiquitous services. The convergence of radio networks in combination with dynamic spectrum allocation (DSA) could be a beneficial means to solve the growing demand for radio spectrum. DSA might enhance the spectrum utilization of involved radio networks to comply with user requirements for high-quality multimedia services. This paper proposes a simple spectrum allocation algorithm and presents an analytical model of dynamic spectrum resource allocation between two networks using a 4-D Markov chain. We argue that there may exist a break-even point for choosing whether or not to adopt DSA in a system. We point out certain circumstances where DSA is not a viable alternative. We also discuss the performance of DSA against the degree of resource sharing using the proposed analytical model and simulations. The presented analytical model is not restricted to DSA, and can be applied to a general resource sharing study.

• ETRI Journal
• /
• v.30 no.5
• /
• pp.696-706
• /
• 2008

With the increasing need for intelligent environment monitoring applications and the decreasing cost of manufacturing sensor devices, it is likely that a wide variety of sensor networks will be deployed in the near future. In this environment, the way to access heterogeneous sensor networks and the way to integrate various sensor data are very important. This paper proposes the common system for middleware of sensor networks (COSMOS), which provides integrated data processing over multiple heterogeneous sensor networks based on sensor network abstraction called the sensor network common interface. Specifically, this paper introduces the sensor network common interface which defines a standardized communication protocol and message formats used between the COSMOS and sensor networks.