• Journal of Internet Computing and Services
• /
• v.22 no.4
• /
• pp.123-134
• /
• 2021

This paper suggests that the Internet is not free through analysis of U.S. Internet history and lawsuits related to the Charter merger in 2016. Generally speaking, the players in internet connectivity market agree to Non-Disclosure Agreement, when connecting their facilities and networks each other. So, I adopted the case study & analysis as research methodologies due to limitation of collecting the transaction data between them. The former finds that Internet access has never been free in U.S Internet history. As we know, some including Content Providers(CPs) argue that the Internet is a free network and there are many cases to use the internet for free, so they came to conclusion that ISPs have no right to charge the users like CPs. This study refutes these arguments in two ways. One is that using the internet has never been free. From ARPANET, known as the beginning of the U.S. Internet, to the commercialization of backbone, no Internet has been considered or implemented for free since the early Internet network was devised. Also, the U.S government was paying subsidies or institutions were paying fees to secure network operations for the NSFNET backbone. the other is that "free peering" refers to barter transactions between ISPs, not to free access to counterpart internet networks. Second, this study analyze the FCC' executive order of conditioned merger approval and the court's related ruling and verify that using the internet is not free. According to the analysis, this study finds that it's real situation to make paid settlements between ISP-CPs (including OTTs) in the US Internet market at the moment. This study concludes that the Internet has never been free in terms of its technical characteristics, network structure, network operation, and system. Also it proposes how to improve the domestic settlement system between ISPs-CPs in terms of policy and regulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2663-2674
• /
• 2014

For cognitive radio sensor networks (CRSNs) that use underlay-based spectrum access, the location of the primary user (PU) plays an important role in the power control of the secondary users (SUs), because the SUs must keep the minimum interference level required by the PU. Received signal strength (RSS)-based localization schemes provide low-cost implementation and low complexity, thus it is suitable for the PU localization in CRSNs. However, the RSS-based localization schemes have a high localization error because they use an inexact path loss exponent (PLE). Thus, applying a RSS-based localization scheme into the PU localization would cause a high interference to the PU. In order to reduce the localization error and improve the channel reuse rate, we propose a RSS-based PU localization scheme that uses distance calibration for CRSNs using underlay model-based spectrum access. Through the simulation results, it is shown that the proposed scheme can provide less localization error as well as more spectrum utilization than the RSS-based PU localization using the mean and the maximum likelihood calibration.

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

A multi-channel access problem based on hypergraph model in ultra-dense small cell networks is studied in this paper. Due to the hyper-dense deployment of samll cells and the low-powered equipment, cumulative interference becomes an important problem besides the direct interference. The traditional binary interference model cannot capture the complicated interference relationship. In order to overcome this shortcoming, we use the hypergraph model to describe the cumulative interference relation among small cells. We formulate the multi-channel access problem based on hypergraph as two local altruistic games. The first game aims at minimizing the protocol MAC layer interference, which requires less information exchange and can converge faster. The second game aims at minimizing the physical layer interference. It needs more information interaction and converges slower, obtaining better performance. The two modeled games are both proved to be exact potential games, which admit at least one pure Nash Equilibrium (NE). To provide information exchange and reduce convergecne time, a cloud-based centralized-distributed algorithm is designed. Simulation results show that the proposed hypergraph models are both superior to the existing binary models and show the pros and cons of the two methods in different aspects.

• International journal of advanced smart convergence
• /
• v.10 no.1
• /
• pp.75-81
• /
• 2021

As the number of connected smart devices and applications increases explosively, the existing orthogonal multiple access (OMA) techniques have become insufficient to accommodate mobile traffic, such as artificial intelligence (AI) and the internet of things (IoT). Fortunately, non-orthogonal multiple access (NOMA) in the fifth generation (5G) mobile networks has been regarded as a promising solution, owing to increased spectral efficiency and massive connectivity. In this paper, we investigate the achievable data rate for non-orthogonal multiple access (NOMA) with negatively-correlated information sources (CIS). For this, based on the linear transformation of independent random variables (RV), we derive the closed-form expressions for the achievable data rates of NOMA with negatively-CIS. Then it is shown that the achievable data rate of the negatively-CIS NOMA increases for the stronger channel user, whereas the achievable data rate of the negatively-CIS NOMA decreases for the weaker channel user, compared to that of the positively-CIS NOMA for the stronger or weaker channel users, respectively. We also show that the sum rate of the negatively-CIS NOMA is larger than that of the positively-CIS NOMA. As a result, the negatively-CIS could be more efficient than the positively-CIS, when we transmit CIS over 5G NOMA networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.175-182
• /
• 2018

As Internet of things with a large number of nodes emerges, wireless-power communication networks (WPCN) based on a random access protocol needs to be investigated. In the random access-based WPCN, a terminal accessing later in given random access (RA) slots can harvest more energy before transmission and thus can transmit data with higher power and achieve higher throughput if the access is successful. On the basis of this property, the proposed random access control protocol gives the terminals priority and distinguishes the RA slots according to the priority level, so that a near terminal with access point allows to access preferentially other than a remote terminal. This operation decreases the throughput of near terminal and increases the throughput of remote terminal, and then, the doubly near-far problem in WPCN is resolved and the user fairness is improved. Results show that the proposed random access control improves both channel throughput and user fairness according to the priority level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2323-2340
• /
• 2012

Recent advances in cognitive radio technology have drawn immense attention to higher layer protocols above medium access control, such as transmission control protocol (TCP). Most proposals to improve the TCP performance in cognitive radio (CR) networks have assumed that either all nodes are in CR networks or the TCP sender side is in CR links. In those proposals, lower layer information such as the CR link status could be easily exploited to adjust the congestion window and improve throughput. In this paper, we consider a TCP network in which the TCP sender is located remotely over the Internet while the TCP receiver is connected by a CR link. This topology is more realistic than the earlier proposals, but the lower layer information cannot be exploited. Under this assumption, we propose an enhanced TCP protocol for CR networks called TCP for cognitive radio (TCP-CR) to improve the existing TCP by (1) detection of primary user (PU) interference by a remote sender without support from lower layers, (2) delayed congestion control (DCC) based on PU detection when the retransmission timeout (RTO) expires, and (3) exploitation of two separate scales of the congestion window adapted for PU activity. Performance evaluation demonstrated that the proposed TCP-CR achieves up to 255% improvement of the end-to-end throughput. Furthermore, we verified that the proposed TCP does not deteriorate the fairness of existing TCP flows and does not cause congestions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1535-1554
• /
• 2016

This paper proposes a novel channel assignment scheme called multi-cluster based dynamic channel assignment (MC-DCA) to improve system performance for the downlink of dense femtocell networks (DFNs) based on orthogonal frequency division multiple access (OFDMA) and frequency division duplexing (FDD). In order to dynamically assign channels for femtocell access points (FAPs), the MC-DCA scheme uses a heuristic method that consists of two steps: one is a multiple cluster assignment step to group FAPs using graph coloring algorithm with some extensions, while the other is a dynamic subchannel assignment step to allocate subchannels for maximizing the system capacity. Through simulations, we first find optimum parameters of the multiple FAP clustering to maximize the system capacity and then evaluate system performance in terms of the mean FAP capacity, unsatisfied femtocell user equipment (FUE) probability, and mean FAP power consumption for data transmission based on a given FUE traffic load. As a result, the MC-DCA scheme outperforms other schemes in two different DFN environments for commercial and office buildings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1805-1824
• /
• 2013

Recently, the use of wireless body area networks (WBAN) has been increasing rapidly in medical healthcare applications. WBANs consist of smart nodes that can be used to sense and transmit vital data such as heart rate, temperature and ECG from a human body to a medical centre. WBANs depend on limited resources such as energy and bandwidth. In order to utilise these resources efficiently, a very well organized medium access control (MAC) protocol must be considered. In this paper, a new, adaptive and energy-efficient MAC protocol, entitled isMAC, is proposed for WBANs. The proposed MAC is based on multi-channel communication and aims to prolong the network lifetime by effectively employing (i) a collision prevention mechanism, (ii) a coordinator node (WCN) selection algorithm and (iii) a transmission power adjustment approach. The isMAC protocol has been developed and modelled, by using OPNET Modeler simulation software. It is based on a networking scenario that requires especially high data rates such as ECG, for performance evaluation purposes. Packet delay, network throughput and energy consumption have been chosen as performance metrics. The comparison between the simulation results of isMAC and classical IEEE 802.15.4 (ZigBee) protocol shows that isMAC significantly outperforms IEEE 802.15.4 in terms of packet delay, throughput and energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4295-4316
• /
• 2018

In this paper, the performance of non-orthogonal multiple access (NOMA) dual-hop (DH) amplify-and-forward (AF) relaying networks is investigated, where Nakagami-m fading channel is considered. In order to cover more details, in our analysis, the transceiver hardware impairments at source, relay and destination nodes are comprehensively considered. To characterize the effects of hardware impairments brought in NOMA DH AF relaying networks, the analytical closed-form expressions for the exact outage probability and approximate ergodic sum rate are derived. In addition, the asymptotic analysis of the outage probability and ergodic sum rate at high signal-to-noise ratio (SNR) regime are carried out in order to further reveal the insights of the parameters for hardware impairments on the network performance. Simulation results indicate the performance of asymptotic ergodic sum rate are limited by levels of distortion noise.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.116-116
• /
• 2000

This paper describes an experimental embedded tiny web server system that monitors the processing of manufacture using the Internet. The object of this study is developing of an embedded tiny web server that connects the stand-alone machines in factory to the Internet. Using the World Wide Web (WWW), we proffer user-friendly environments to users. Anyone with a web browser may easily access the processing of manufacture in the factory. Through connecting different network system, our web server extends the private networks to the Internet, the global networks. Our embedded tiny web server is ideal for process control, building and facility management system, factory automation and even home automation.