• Title/Summary/Keyword: Cooperative Networks

Search Result 531, Processing Time 0.026 seconds

The impact of 5G multi-access edge computing cooperation announcement on the telecom operators' firm value

  • Nam, Sangjun
    • ETRI Journal
    • /
    • v.44 no.4
    • /
    • pp.588-598
    • /
    • 2022
  • Since multi-access edge computing (MEC) was established as a key enabler of 5G, MEC based on 5G networks (5G MEC) has been perceived as a new business opportunity for many industry players, including telecom operators. Numerous 5G MEC cooperation announcements among companies playing their respective roles in the MEC ecosystem have been recently released. However, because of cooperative and competitive relationships among key players in the MEC ecosystem and the uncertainty of 5G MEC, the announcement of 5G MEC cooperation can negatively affect the telecom operators' firm value. This study investigates the market reaction to announcements of 5G MEC cooperation for telecom operators using an event study methodology. The empirical results show that announcements of 5G MEC cooperation have a negative impact on the telecom operators' firm value. The results also show that the early deployment of 5G networks may reduce the negative impact of 5G MEC cooperation announcements by reducing uncertainty.

Spatial Chracteristics of the Inter-firm Networks in the Industrial Clusters in Seoul : Focus on Computer Industry (기업간 네트워크와 산업집적지의 성장특성 -한국 컴퓨터산업을 사례로-)

  • 김선배
    • Journal of the Korean Regional Science Association
    • /
    • v.13 no.2
    • /
    • pp.55-74
    • /
    • 1997
  • This paper investigates the spatial characteristics of networks, which arise as a firm's strategy to enhance its competitiveness to cope with the changing economic environments characterized by technological changes and increasing competitiveness. The theoretical framework in this study proposes that networks emerge as a firm's strategies to promote its competitiveness through the vertical/horizontal disintegration of the production system. Futhermore, regional industries of networks. The study examines the types of cooperation and the spatial boundary of the computer industry networks in Korea. Questionnaire survey was conducted on 1, 128 computer companies which had more than 10 employees, with 126 questionnaires being used for analysis. In addition, newpaper articles were used to supplement the foregoing work on network characteristics. The review of these articles covers the period from Jan. 1994 to June 1996. Major findings of this study are as follows: The spatial range of cooperative networks varies according to the specific characters of cooperation(R & D, production, and seles). Intralocal networks are being developed in Kangnam and Youido area, the computer industry agglomeration clusres of Seoul. There are the regional differnces in the agents and contents of cooperation. In intra-national R & D and production networks, regional differnces in agglomeratins and non-agglomerations are not detercted. Most networks of this type are found between large firms and small firms. In contrast, foregn R & D and production networks, which are operated mostly by large firms, are found in Kangnam, Youido, and CBD. Intra-national and foreign productino networks are also focused in Kangnam, Youido, and CBD. Small firms are playing an active role in making this type of cooperation possible. In the perspective of localization-globalization, Korean computer industry can be analyzed in two respects: industrial and regional. The localization of small firms and the localization-globalization of large firms' networks are being developed in industrial contexts, while the localization-globalization of agglomerations and the localization of non-agglomerations networks are being developed in regional contexts. As networks for the localization-globalization of industry are growing in agglomerations, interfirm networks could be related to trends in the formation or intensification of industrial agglomerations. industrial agglomeration areas function as a facilitator of localization through subcontracts, intraregional network and interregional network. They also facilitate globalization via foregn networks. In non-agglomeratin areas, localization networks, which are connected with agglomeration areas via subcontracting, interregional R & D. or production cooperation.

  • PDF

Analysis of Energy Consumption and Processing Delay of Wireless Sensor Networks according to the Characteristic of Applications (응용프로그램의 특성에 따른 무선센서 네트워크의 에너지 소모와 처리 지연 분석)

  • Park, Chong Myung;Han, Young Tak;Jeon, Soobin;Jung, Inbum
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.399-407
    • /
    • 2015
  • Wireless sensor networks are used for data collection and processing from the surrounding environment for various applications. Since wireless sensor nodes operate on low computing power, restrictive battery capacity, and low network bandwidth, their architecture model has greatly affected the performance of applications. If applications have high computation complexity or require the real-time processing, the centralized architecture in wireless sensor networks have a delay in data processing. Otherwise, if applications only performed simple data collection for long period, the distributed architecture wasted battery energy in wireless sensors. In this paper, the energy consumption and processing delay were analyzed in centralized and distributed sensor networks. In addition, we proposed a new hybrid architecture for wireless sensor networks. According to the characteristic of applications, the proposed method had the optimal number of wireless sensors in wireless sensor networks.

Hybrid FPMS: A New Fairness Protocol Management Scheme for Community Wireless Mesh Networks

  • Widanapathirana, Chathuranga H.;Sekercioglu, Y. Ahmet;Goi, Bok-Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1909-1928
    • /
    • 2011
  • Node cooperation during packet forwarding operations is critically important for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In a CoWMN, node cooperation is achieved by using fairness protocols specifically designed to detect and isolate malicious nodes, discourage unfair behavior, and encourage node participation in forwarding packets. In general, these protocols can be split into two groups: Incentive-based ones, which are managed centrally, and use credit allocation schemes. In contrast, reputation-based protocols that are decentralized, and rely on information exchange among neighboring nodes. Centrally managed protocols inevitably suffer from scalability problems. The decentralized, reputation-based protocols lacks in detection capability, suffer from false detections and error propagation compared to the centralized, incentive-based protocols. In this study, we present a new fairness protocol management scheme, called Hybrid FPMS that captures the superior detection capability of incentive-based fairness protocols without the scalability problems inherently expected from a centralized management scheme as a network's size and density grows. Simulation results show that Hybrid FPMS is more efficient than the current centralized approach and significantly reduces the network delays and overhead.

Delay Reduction by Providing Location Based Services using Hybrid Cache in peer to peer Networks

  • Krishnan, C. Gopala;Rengarajan, A.;Manikandan, R.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2078-2094
    • /
    • 2015
  • Now a days, Efficient processing of Broadcast Queries is of critical importance with the ever-increasing deployment and use of mobile technologies. BQs have certain unique characteristics that the traditional spatial query processing in centralized databases does not address. In novel query processing technique, by maintaining high scalability and accuracy, latency is reduced considerably in answering BQs. Novel approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: Cache Data, which caches the data, and Cache Path, which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach (Hybrid Cache), which can further improve the performance by taking advantage of Cache Data and Cache Path while avoiding their weaknesses. Cache replacement policies are also studied to further improve the performance. Simulation results show that the proposed schemes can significantly reduce the query delay and message complexity when compared to other caching schemes.

Game-Theoretic Analysis of Selfish Secondary Users in Cognitive Radio Networks

  • Kahsay, Halefom;Jembre, Yalew Zelalem;Choi, Young-June
    • Journal of Communications and Networks
    • /
    • v.17 no.4
    • /
    • pp.440-448
    • /
    • 2015
  • In this paper, we study the problem of selfish behavior of secondary users (SUs) based on cognitive radio (CR) with the presence of primary users (PUs). SUs are assumed to contend on a channel using the carrier sense multiple access with collision avoidance (CSMA/CA) and PUs do not consider transmission of SUs, where CSMA/CA protocols rely on the random deference of packets. SUs are vulnerable to selfish attacks by which selfish users could pick short random deference to obtain a larger share of the available bandwidth at the expense of other SUs. In this paper, game theory is used to study the systematic cheating of SUs in the presence of PUs in multichannel CR networks. We study two cases: A single cheater and multiple cheaters acting without any restraint. We identify the Pareto-optimal point of operation of a network with multiple cheaters and also derive the Nash equilibrium of the network. We use cooperative game theory to drive the Pareto optimality of selfish SUs without interfering with the activity of PUs. We show the influence of the activity of PUs in the equilibrium of the whole network.

ENC-MAC: Energy-efficient Non-overlapping Channel MAC for Cognitive Radio enabled Sensor Networks

  • Kim, Bosung;Kim, Kwangsoo;Roh, Byeong-hee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4367-4386
    • /
    • 2015
  • The concept of Internet of Things (IoT) has shed new light on WSN technologies. MAC protocol issues improving the network performance are important in WSNs because of the increase in demand for various applications to secure spectrum resources. Cognitive radio (CR) technology is regarded as a solution to the problems in this future wireless network. In recent years, energy efficiency has become an issue in CR networks. However, few relevant studies have been conducted. In this paper, an energy-efficient non-overlapping channel MAC (ENC-MAC) for CR-enabled sensor networks (CRSNs) is proposed. Applying the dedicated control channel approach, ENC-MAC allows the SUs to utilize channels in a non-overlapping manner, and thus spectrum efficiency is improved. Moreover, the cooperative spectrum sensing that allows an SU to use only two minislots in the sensing phase is addressed to en-hance energy efficiency. In addition, an analytical model for evaluating the performance, such as saturation throughput, average packet delay, and network lifetime, is developed. It is shown in our results that ENC-MAC remarkably outperforms existing MAC protocols.

The Performance of Multistage Cooperation in Relay Networks

  • Vardhe, Kanchan;Reynolds, Daryl
    • Journal of Communications and Networks
    • /
    • v.17 no.5
    • /
    • pp.499-505
    • /
    • 2015
  • We analyze the performance of multistage cooperation in decode-and-forward relay networks where the transmission between source and destination takes place in $T{\geq}2$ equal duration and orthogonal time phases with the help of relays. The source transmits only in the first time phase. All relays that can decode the source's transmission forward the source's message to the destination in the second time phase, using a space-time code. During subsequent time phases, the relays that have successfully decoded the source message using information from all previous transmitting relays, transmit the space-time coded symbols for the source's message. The non-decoding relays keep accumulating information and transmit in the later stages when they are able to decode. This process continues for T cooperation phases. We develop and analyze the outage probability of multistage cooperation protocol under orthogonal relaying. Through analytical results, we obtain the near-optimal placement strategy for relays that gives the best performance when compared with most other candidate relay location strategies of interest. For different relay network topologies, we also investigate an interesting tradeoff between an increased SNR and decreased spectral efficiency as the number of cooperation stages is increased. It is also shown that the largest multistage cooperation gain is obtained in the low and moderate SNR regime.

A Study on Fatigue Damage Modeling Using Neural Networks

  • Lee Dong-Woo;Hong Soon-Hyeok;Cho Seok-Swoo;Joo Won-Sik
    • Journal of Mechanical Science and Technology
    • /
    • v.19 no.7
    • /
    • pp.1393-1404
    • /
    • 2005
  • Fatigue crack growth and life have been estimated based on established empirical equations. In this paper, an alternative method using artificial neural network (ANN) -based model developed to predict fatigue damages simultaneously. To learn and generalize the ANN, fatigue crack growth rate and life data were built up using in-plane bending fatigue test results. Single fracture mechanical parameter or nondestructive parameter can't predict fatigue damage accurately but multiple fracture mechanical parameters or nondestructive parameters can. Existing fatigue damage modeling used this merit but limited real-time damage monitoring. Therefore, this study shows fatigue damage model using backpropagation neural networks on the basis of X -ray half breadth ratio B / $B_o$, fractal dimension $D_f$ and fracture mechanical parameters can estimate fatigue crack growth rate da/ dN and cycle ratio N / $N_f$ at the same time within engineering limit error ($5\%$).

Receiver-centric Buffer Blocking-aware Multipath Data Distribution in MPTCP-based Heterogeneous Wireless Networks

  • Cao, Yuanlong;Liu, Qinghua;Zuo, Yi;Ke, Fenfen;Wang, Hao;Huang, Minghe
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4642-4660
    • /
    • 2016
  • One major concern of applying Multipath TCP (MPTCP) to data delivery in heterogeneous wireless networks is that the utilization of asymmetric paths with diverse networking-related parameters may cause severe packet reordering and receive buffer blocking (RB2LOC). Although many efforts are devoting to addressing MPTCP's packet reordering problems, their sender-controlled solutions do not consider balancing overhead between an MPTCP sender and receiver, and their fully MPTCP mode cannot make MPTCP achieve a desired performance. This paper proposes a novel receiver-centric buffer blocking-aware data scheduling strategy for MPTCP (dubbed MPTCP-rec) necessitating the following aims: (1) alleviating MPTCP's packet reordering and RB2LOC problems, (2) improving the MPTCP performance, and (3) balancing load between the MPTCP sender and receiver. Simulation results show that the proposed MPTCP-rec solution outperforms the existing MPTCP solutions in terms of data delivery performance in heterogeneous wireless networks.