• Title/Summary/Keyword: Distributed Research Networks

Search Result 273, Processing Time 0.027 seconds

Distributed Coordination Protocol for Ad Hoc Cognitive Radio Networks

  • Kim, Mi-Ryeong;Yoo, Sang-Jo
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.51-62
    • /
    • 2012
  • The exponential growth in wireless services has resulted in an overly crowded spectrum. The current state of spectrum allocation indicates that most usable frequencies have already been occupied. This makes one pessimistic about the feasibility of integrating emerging wireless services such as large-scale sensor networks into the existing communication infrastructure. Cognitive radio is an emerging dynamic spectrum access technology that can be used for flexibly and efficiently achieving open spectrum sharing. Cognitive radio is an intelligent wireless communication system that is aware of its radio environment and that is capable of adapting its operation to statistical variations of the radio frequency. In ad hoc cognitive radio networks, a common control channel (CCC) is usually used for supporting transmission coordination and spectrum-related information exchange. Determining a CCC in distributed networks is a challenging research issue because the spectrum availability at each ad hoc node is quite different and dynamic due to the interference between and coexistence of primary users. In this paper, we propose a novel CCC selection protocol that is implemented in a distributed way according to the appearance patterns of primary systems and connectivity among nodes. The proposed protocol minimizes the possibility of CCC disruption by primary user activities and maximizes node connectivity when the control channel is set up. It also facilitates adaptive recovery of the control channel when the primary user is detected on that channel.

Cross-Layer Resource Allocation in Multi-interface Multi-channel Wireless Multi-hop Networks

  • Feng, Wei;Feng, Suili;Zhang, Yongzhong;Xia, Xiaowei
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.960-967
    • /
    • 2014
  • In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

Utility Bounds of Joint Congestion and Medium Access Control for CSMA based Wireless Networks

  • Wang, Tao;Yao, Zheng;Zhang, Baoxian;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.193-214
    • /
    • 2017
  • In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

Semi-distributed dynamic inter-cell interference coordination scheme for interference avoidance in heterogeneous networks

  • Padmaloshani, Palanisamy;Nirmala, Sivaraj
    • ETRI Journal
    • /
    • v.42 no.2
    • /
    • pp.175-185
    • /
    • 2020
  • Inter-cell interference (ICI) is a major problem in heterogeneous networks, such as two-tier femtocell (FC) networks, because it leads to poor cell-edge throughput and system capacity. Dynamic ICI coordination (ICIC) schemes, which do not require prior frequency planning, must be employed for interference avoidance in such networks. In contrast to existing dynamic ICIC schemes that focus on homogeneous network scenarios, we propose a novel semi-distributed dynamic ICIC scheme to mitigate interference in heterogeneous network scenarios. With the goal of maximizing the utility of individual users, two separate algorithms, namely the FC base station (FBS)-level algorithm and FC management system (FMS)-level algorithm, are employed to restrict resource usage by dominant interference-creating cells. The distributed functionality of the FBS-level algorithm and low computational complexity of the FMS-level algorithm are the main advantages of the proposed scheme. Simulation results demonstrate improvement in cell-edge performance with no impact on system capacity or user fairness, which confirms the effectiveness of the proposed scheme compared to static and semi-static ICIC schemes.

The impact of Marketing Communication Content Distributed on Social Networks on Electronic Word-of-Mouth

  • VO, Minh Sang;HUYNH, Dung Quoc Vu;NGUYEN, Giang Huong;DANG, Giang Ha Nguyen;HUYNH, Duong Dai;LE, Bao Quang;DANG, Nhut Minh
    • Journal of Distribution Science
    • /
    • v.20 no.5
    • /
    • pp.65-74
    • /
    • 2022
  • Purpose: This paper evaluates which characteristics of marketing communication content distributed on social networks impact electronic word-of-mouth (e-WOM). Research design, data, and methodology: Quantitative research was carried out on 637 Vietnamese people aged from 18, who were exposed to marketing communication programs of fashion brands. Preliminary data were analyzed by the reliability of the scale, multivariate regression analysis, and analysis of variance. Results: The research findings have identified the four characteristics of social media content that positively impact e-WOM, including entertainment, interaction, trendiness, and customization. Participants aged 30 and under have a higher appreciation for media content and e-WOM than those from 31 and over. Conclusion: To promote e-WOM, marketing communication content distributed on social networks should focus on the following characteristics: (1) The entertainment of marketing communication content should involve positive emotions, fun, and enjoyment; (2) With interactive content, focus should be placed on discussion and exchange content, content that encourages sharing, and two-way interactive content; (3) For trending marketing communication content, marketers consider communicating brand-related latest information, up-to-date information, and hot discussion topics; and (4) When creating customized content, brands should be interesting, customized (information, product, price), and unique.

In-network Distributed Event Boundary Computation in Wireless Sensor Networks: Challenges, State of the art and Future Directions

  • Jabeen, Farhana;Nawaz, Sarfraz
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2804-2823
    • /
    • 2013
  • Wireless sensor network (WSN) is a promising technology for monitoring physical phenomena at fine-grained spatial and temporal resolution. However, the typical approach of sending each sensed measurement out of the network for detailed spatial analysis of transient physical phenomena may not be an efficient or scalable solution. This paper focuses on in-network physical phenomena detection schemes, particularly the distributed computation of the boundary of physical phenomena (i.e. event), to support energy efficient spatial analysis in wireless sensor networks. In-network processing approach reduces the amount of network traffic and thus achieves network scalability and lifetime longevity. This study investigates the recent advances in distributed event detection based on in-network processing and includes a concise comparison of various existing schemes. These boundary detection schemes identify not only those sensor nodes that lie on the boundary of the physical phenomena but also the interior nodes. This constitutes an event geometry which is a basic building block of many spatial queries. In this paper, we introduce the challenges and opportunities for research in the field of in-network distributed event geometry boundary detection as well as illustrate the current status of research in this field. We also present new areas where the event geometry boundary detection can be of significant importance.

Distributed Resource Allocation in Two-Hierarchy Networks

  • Liu, Shuhui;Chang, Yongyu;Wang, Guangde;Yang, Dacheng
    • ETRI Journal
    • /
    • v.34 no.2
    • /
    • pp.159-167
    • /
    • 2012
  • In this paper, a new distributed resource allocation algorithm is proposed to alleviate the cross-tier interference for orthogonal frequency division multiplexing access macrocell and femtocell overlay. Specifically, the resource allocation problem is modeled as a non-cooperative game. Based on game theory, we propose an iterative algorithm between subchannel and power allocation called distributed resource allocation which requires no coordination among the two-hierarchy networks. Finally, a macrocell link quality protection process is proposed to guarantee the macrocell UE's quality of service to avoid severe cross-tier interference from femtocells. Simulation results show that the proposed algorithm can achieve remarkable performance gains as compared to the pure waterfilling algorithm.

STRIDE-based threat modeling and DREAD evaluation for the distributed control system in the oil refinery

  • Kyoung Ho Kim;Kyounggon Kim;Huy Kang Kim
    • ETRI Journal
    • /
    • v.44 no.6
    • /
    • pp.991-1003
    • /
    • 2022
  • Industrial control systems (ICSs) used to be operated in closed networks, that is, separated physically from the Internet and corporate networks, and independent protocols were used for each manufacturer. Thus, their operation was relatively safe from cyberattacks. However, with advances in recent technologies, such as big data and internet of things, companies have been trying to use data generated from the ICS environment to improve production yield and minimize process downtime. Thus, ICSs are being connected to the internet or corporate networks. These changes have increased the frequency of attacks on ICSs. Despite this increased cybersecurity risk, research on ICS security remains insufficient. In this paper, we analyze threats in detail using STRIDE threat analysis modeling and DREAD evaluation for distributed control systems, a type of ICSs, based on our work experience as cybersecurity specialists at a refinery. Furthermore, we verify the validity of threats identified using STRIDE through case studies of major ICS cybersecurity incidents: Stuxnet, BlackEnergy 3, and Triton. Finally, we present countermeasures and strategies to improve risk assessment of identified threats.

Differential Game Theoretic Approach for Distributed Dynamic Cooperative Power Control in Cognitive Radio Ad Hoc Networks

  • Zhang, Long;Huang, Wei;Wu, Qiwu;Cao, Wenjing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3810-3830
    • /
    • 2015
  • In this paper, we investigate the differential game theoretic approach for distributed dynamic cooperative power control in cognitive radio ad hoc networks (CRANETs). First, a payoff function is defined by taking into consideration the tradeoff between the stock of accumulated power interference to the primary networks and the dynamic regulation of the transmit power of secondary users (SUs). Specifically, the payoff function not only reflects the tradeoff between the requirement for quickly finding the stable available spectrum opportunities and the need for better channel conditions, but also reveals the impact of the differentiated types of data traffic on the demand of transmission quality. Then the dynamic power control problem is modeled as a differential game model. Moreover, we convert the differential game model into a dynamic programming problem to obtain a set of optimal strategies of SUs under the condition of the grand coalition. A distributed dynamic cooperative power control algorithm is developed to dynamically adjust the transmit power of SUs under grand coalition. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithm for efficient power control in CRANETs.

An Influence Estimating Distributed Scheme in Delay-Tolerant Networks (Delay-Tolerant Networks에서 영향력 추정의 분산 기법)

  • Kim, Chan-Myung;Kim, Yong-hwan;Han, Youn-Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.765-768
    • /
    • 2012
  • 사회관계망에서 영향력 전파 문제는 네트워크에 가장 영향력을 끼칠 수 있는 노드들을 찾아 전체 네트워크에 영향력을 최대화 하는 것을 목적으로 한다. 본 논문에서는 Delay-Tolerant Networks에서 각 노드의 영향력을 측정하여 가장 영향력 있는 노드 집합을 선택하는 문제를 다룬다. 노드 간 연결성이 항시 보장되지 않는 Delay-Tolerant Networks 환경에서는 전체 네트워크 정보를 정확히 알 수 없기 때문에 노드의 영향력을 정확히 측정하는 것은 매우 어렵다. 본 논문에서는 Delay-Tolerant Networks 환경에서 분산 방식으로 각자 노드가 k-Clique 구조로 커뮤니티를 구성하여 국지적 정보 (Local Information)만을 활용하여 자신의 영향력을 추정하는 방법을 제시하고 실험을 통해 제안 기법으로 산출한 노드들의 영향력이 전체 네트워크 관점에서 산출한 노드들의 영향력에 근접함을 실험을 통해 증명한다.