• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.261-269
• /
• 2016

In this paper, the impact of energy constraints on a two-hop network with a source, a relay and a destination under random medium access is studied. A collision channel with erasures is considered, and the source and the relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. Additionally, the source and the relay node have external traffic arrivals and the relay forwards a fraction of the source node's traffic to the destination; the cooperation is performed at the network level. An inner and an outer bound of the stability region for a given transmission probability vector are obtained. Then, the closure of the inner and the outer bound is obtained separately and they turn out to be identical. This work is not only a step in connecting information theory and networking, by studying the maximum stable throughput region metric but also it taps the relatively unexplored and important domain of energy harvesting and assesses the effect of that on this important measure.

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

Information Centric Networking (ICN) has recently attracted great attention. It names the content decoupling from the location and introduces network caching, making the content to be cached anywhere within the network. The benefits of such design are obvious, however, many challenges still need to be solved. Among them, the local caching policy is widely discussed and it can be further divided into two parts, namely the cache permission policy and the cache replacement policy. The former is used to decide whether an incoming content should be cached while the latter is used to evict a cached content if required. The Internet is a user-oriented network and popular contents always have much more requests than unpopular ones. Caching such popular contents closer to the user's location can improve the network performance, and consequently, the local caching policy is required to identify popular contents. However, considering the line speed requirement of ICN routers, the local caching policy whose complexity is larger than O(1) cannot be applied. In terms of the replacement policy, Least Recently Used (LRU) is selected as the default one for ICN because of its low complexity, although its ability to identify the popular content is poor. Hence, the identification of popular contents should be completed by the cache permission policy. In this paper, a cache permission policy called Cache-Filter, whose complexity is O(1), is proposed, aiming to store popular contents closer to users. Cache-Filter takes the content popularity into account and achieves the goal through the collaboration of on-path nodes. Extensive simulations are conducted to evaluate the performance of Cache-Filter. Leave Copy Down (LCD), Move Copy Down (MCD), Betw, ProbCache, ProbCache⁺, Prob(p) and Probabilistic Caching with Secondary List (PCSL) are also implemented for comparison. The results show that Cache-Filter performs well. For example, in terms of the distance to access to contents, compared with Leave Copy Everywhere (LCE) used by Named Data Networking (NDN) as the permission policy, Cache-Filter saves over 17% number of hops.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.301-306
• /
• 2010

We propose the control channel access scheme for multi-interface multi-hop cognitive radio (CR) environment having a cluster structure. Due to the difficulty of obtaining common channels across the entire CR network, most multi-interface multi-hop CR networks put the control channel outside the CR bandwidth and dedicate one network interface to it in order to exchange the control information such as the activation of licensed users. However, this will be the waste of the network interface. Our focus is how to alternate between the control and the data channel without multichannel hidden node problem under the cluster structure where CR nodes connect with neighbors through multiple data channels. By using simulation, we evaluate the performance of the proposed scheme. The results show that the proposed scheme achieves higher network throughput than the dedicated scheme where one network interface card should dedicate to the control channel and cannot be used for data transmission.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.11-20
• /
• 2008

An inevitable trend in the next generation wireless network environments is coexistence of different wireless access networks in a complementary, manner. In addition, mobile devices equipped with multiple air interfaces simultaneously executing diverse applications have been emerging, In such network environment, It is required that a solution for mobile users to seamlessly roam between different access networks as well as to satisfy QoS requirements of each application by efficiently utilizing coexisting various wireless access networks. In this paper, therefore, we propose a mobility management platform based on per-application end-to-end mobility management and cross-layer handover controls. Four core functional modules composing the proposed platform for end user devices are defined: Monitoring Agents, Profile Database, Decision Engine, and IP Agent. We show through simulations that the presented platform provides an improved QoS as it selectively utilizes the best available networks.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.471-480
• /
• 2009

One of the principal impediments to the achievement of a scalable access control for a large number of subscribers in a public broadcast is to distribute key update messages reliably to all stateless receivers. However, in a public broadcast, the rekeying messages can be dropped or compromised during the transmission over an insecure broadcast channel, or transmitted to the receivers while it was off-line. In this study, we propose a novel group key management scheme that features a mechanism that allows the legitimate receivers to recover the current group key even if they lose key update messages for long-term sessions using short hint messages and member computation. The performance analysis result shows that the proposed scheme has advantages of the scalable and efficient rekeying compared with the previous reliable group key distribution schemes. The proposed key management scheme targets a conditional access system in a media broadcast where there is no feedback channel from receivers to the broadcasting station.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.603-614
• /
• 2005

The wireless LAN environment using Mobile IP is constructed and managed to be connected with Ethernet based wired networks. However, there have been many problems with wireless networks using Mobile IP. Some important facts on network performance have not been considered when introducing wireless LAN by Mobile IP to wired networks. In this paper, we suggest schemes which can solve problems on Handover latency caused by the asymmetrical connectivity of the Access Router at applying the HMIPv6 and on binding updates due to the MN frequent movement. Our proposed schemes can reduce network latency by using the HMIPv6 architecture with a virtual router layer, and reduce communication overhead by interchanging information of the MN movement between routers. Our schemes are expected to assist in constructing a more real and effective wireless LAN environment based on the HMIPv6 and FMIP.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.525-532
• /
• 2007

Recently, broadband access networks have been competitively deployed all over the world with the development of various multimedia services for such a network. ETRI(Electronics and Telecommunications Research Institute) built the FTTH(Fiber-to-the-Home) service center to develop a next-generation equipment and a high-quality service/platform as well as to promote domestic industry in the field of optical communication. The FTTH service center has a variety of test equipments such as FTTH standard testbed for a BMT(Bench Mark Test), a network operation center, and IPTV service equipments. Also, ETRI deployed a new type of commercial optical access networks cooperating with ISP(Internet service provider). In this paper, we analyzed the quality degradation appeared in QoE(Quality of Experience), when IP data broadcasted from the FTTH service center is transmitted to subscribers through the commercial optical access network. Moreover, we proposed a noble solution to address this problem.

• The KIPS Transactions:PartC
• /
• v.18C no.3
• /
• pp.187-194
• /
• 2011

IEEE 802.11 wireless LAN has become the center of attention for one of the most dominant wireless networking technologies nowadays. In densely deployed wireless LANs, mobile stations are exposed to a number of AP, thus it is needed to select the best AP to associate with. The most common approach is to select the AP with the highest received signal strength. However it does not consider traffic load imposed to each AP so that it may cause the poor network performance. Therefore, in this paper, we propose a throughput estimation scheme for neighboring APs by sniffing the traffic within 802.11 networks. We devise a tool, named "VirtFrame", which is to estimate the station's capable throughput from neighbor APs based on the channel access time by virtually combining the sniffed frames. Simulation results show that our proposed scheme well matches that there exists correlation between the channel access time and the actual throughput of the APs.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.360-368
• /
• 2009

Recently, broadband access networks have been competitively deployed all over the world with the development of various multimedia services for such a network. ETRI(Electronics and Telecommunications Research Institute) built the FTTH(Fiber-To-the-Home) service center to develop a next-generation equipment and a high-quality service/platform as well as to promote domestic industry in the field of optical communication. The FTTH service center has a variety of test equipments such as FTTH standard testbed for a BMT(bench mark test), a network operation center, and IPTV service equipments. Also, ETRI deployed a new type of commercial optical access networks cooperating with ISP(Internet Service Provider). This paper presents the performance evaluation of FTTH E-PON(Ethernet Passive Optical Network) system as a platform for TPS(Triple Play Service) based on QoS(Quality of Service) and QoE(Quality of Expericence) issues. This FTTH E-PON system is successfully demonstrated as an optical access network system by commercial network service provider and the FTTH service center of ETRI.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.138-148
• /
• 2000

In the mobile computing environment, in order to make copies of important files available when being disconnected the mobile host(client) must store them in its local cache while the connection is maintained. In this paper, we propose the prefetching mechanism for the client to save files which may be accessed in the near future. Our mechanism utilizes analyzer, prefetch-list producer, and prefetch manager. The analyzer records file access patterns of the user in a FAP(File Access Patterns) profile. Using the profile, the prefetch-list producer creates the prefetch-list. The prefetch manager requests a file server to return this list. We set the parameter TRP(Threshold of Reference Probability) to ensure that only reasonably related files can be prefetched. The prefetch-list producer adds the files to a prefetch-list if their reference probability is greater than the TRP. We also use the parameter TACP(Threshold of Access Counter Probability) to reduce the hoarding size required to store a prefetch-list. Finally, we measure the metrics such as the cache hit ratio, the number of files referenced by the client after disconnection and the hoarding size. The simulation results show that the performance of our mechanism is superior to that of the LRU caching mechanism. Our results also show that prefetching with the TACP can reduce the hoard size while maintaining similar performance of prefetching without TACP.