• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3470-3493
• /
• 2019

IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.295-302
• /
• 2013

In the network coding, throughput can be increased by allowing the transformation of the received data at the intermediate nodes. However, the adversary can obtain more information at the intermediate nodes and make troubles for decoding of transmitted data at the sink nodes by modifying transmitted data at the compromised nodes. In order to resist the adversary activities, various information theoretic or cryptographic secure network coding schemes are proposed. Recently, a secure network coding based on the cryptographic hash function can be used at the random network coding. However, because of the computational resource requirement for cryptographic hash functions, networks with limited computational resources such as sensor nodes have difficulties to use the cryptographic solution. In this paper, we propose a new secure network coding scheme which uses linear transformations and table lookup and safely transmits n-1 packets at the random network coding under the assumption that the adversary can eavesdrop at most n-1 nodes. It is shown that the proposed scheme is an all-or-nothing transform (AONT) and weakly secure network coding in the information theory.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3028-3030
• /
• 2000

In general. a speech coding is dedicated to the compression performance or the speech quality. But. the speech coding in this paper is focused on the performance of flexible transmission to the, network speed. For this. the subbanding coding is needed. which is used the wavelet packet concept in the signal analysis. The extraction of each frequency-band is difficult to general signal analysis methods, after coding each band, the reconstruction of these is also a difficult problem. But. with the wavelet packet concept(perfect reconstruction) and its fast computation algorithm. the extraction of each band and the reconstruction are more natural. Also, this paper describes a direct solution of the voice transmission on network and implement this algorithm at the TCP/IP network environment of PC.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.797-804
• /
• 2011

Network coding has recently emerged as an effective solution for multicast and broadcast communications in wireless ad hoc networks. In this paper, we propose a throughput performance model for IEEE 802.11 wireless networks with network coding. Specifically, we consider IEEE 802.11 DCF protocol and linear topology in which traffic sources are located at both ends and intermediate nodes act as relays performing network coding. The proposed analytic model has the form of nonlinear equations in terms of throughput of each node. The solution of the nonliear equations thus correspond to the end-to-end throughput. Extensive simulation experiments have been performed to validate accuracy of the proposed model. Numerical results show that the results of the proposed analytic model agree fairly well with the corresponding simulation results.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.130-137
• /
• 2015

With the rapid increase of energy consumption and environmental problems, the need for green techniques is increasing. Network coding can provide a solution by reducing unnecessary data transmission and by estimating traffic patterns. In addition, it can amplify the synergy with the cognitive radio network (CR) since the CR has recognition and optimal decision functionalities. In this paper, we propose a network coding based green cognitive radio network. With the simulations, we show that the proposed scheme is up to 25% better than the previous work.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.493-501
• /
• 2016

In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.

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

A major challenge in network service providers is to provide adequate resources in service level agreements based on forecasts of future demands. In this paper, we address the problem of capacity provisioning in a network subject to demand uncertainty such that a network coded multicast is applied as the data delivery mechanism with limited budget to purchase extra capacity. We address some particular type of uncertainty sets that obtain a tractable constrained capacity provisioning problem. For this reason, we first formulate a mathematical model for the problem under uncertain demand. Then, a robust optimization model is proposed for the problem to optimize the worst-case system performance. The robustness and effectiveness of the developed model are demonstrated by numerical results. The robust solution achieves more than 10% reduction and is better than the deterministic solution in the worst case.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2427-2445
• /
• 2016

In contrast to traditional "store-and-forward" routing mechanisms, network coding offers an elegant solution for achieving maximum network throughput. The core idea is that intermediate network nodes linearly combine received data packets so that the destination nodes can decode original files from some authenticated packets. Although network coding has many advantages, especially in wireless sensor network and peer-to-peer network, the encoding mechanism of intermediate nodes also results in some additional security issues. For a powerful adversary who can control arbitrary number of malicious network nodes and can eavesdrop on the entire network, cryptographic signature schemes provide undeniable authentication mechanisms for network nodes. However, with the development of quantum technologies, some existing network coding signature schemes based on some traditional number-theoretic primitives vulnerable to quantum cryptanalysis. In this paper we first present an efficient network coding signature scheme in the standard model using lattice theory, which can be viewed as the most promising tool for designing post-quantum cryptographic protocols. In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols. Our scheme has many advantages, such as supporting multi-source networks, low computational complexity and low communication overhead.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1995.06a
• /
• pp.97-100
• /
• 1995

In transmission of image sequences over ATM networks, the packet loss problem and channel sharing efficiency are important. As a possible solution two-layer video coding methods have been proposed. These methods transmit video information over the network with different levels of protection with respect to packets loss. In this paper, a two-layer coding method using pyramid structure is proposed and several realizations of two-layer video coding methods are presented and their performances are compared.