• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.032 seconds

Connectivity Analysis of Cognitive Radio Ad-hoc Networks with Shadow Fading

  • Dung, Le The;An, Beongku
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3335-3356
    • /
    • 2015
  • In this paper, we analyze the connectivity of cognitive radio ad-hoc networks in a log-normal shadow fading environment. Considering secondary user and primary user's locations and primary user's active state are randomly distributed according to a homogeneous Poisson process and taking into account the spectrum sensing efficiency of secondary user, we derive mathematical models to investigate the connectivity of cognitive radio ad-hoc networks in three aspects and compare with the connectivity of ad-hoc networks. First, from the viewpoint of a secondary user, we study the communication probability of that secondary user. Second, we examine the possibility that two secondary users can establish a direct communication link between them. Finally, we extend to the case of finding the probability that two arbitrary secondary users can communicate via multi-hop path. We verify the correctness of our analytical approach by comparing with simulations. The numerical results show that in cognitive radio ad-hoc networks, high fading variance helps to remarkably improve connectivity behavior in the same condition of secondary user's density and primary user's average active rate. Furthermore, the impact of shadowing on wireless connection probability dominates that of primary user's average active rate. Finally, the spectrum sensing efficiency of secondary user significantly impacts the connectivity features. The analysis in this paper provides an efficient way for system designers to characterize and optimize the connectivity of cognitive radio ad-hoc networks in practical wireless environment.

Advertisement Management System utilizing On-Line Music Services in Communication Networks (통신망에서 온라인 음악 서비스를 활용한 광고 관리시스템의 구현)

  • Kim, Seung-Cheon;Ro, Kwang-Hyun;Hwang, Ho-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.187-193
    • /
    • 2010
  • This paper introduces a new mobile advertisement management system (AMS) utilizing on-line music service in communication networks. The developed AMS delivers commercial advertisement through music service that is preferred in communication networks, which enable advertisers to perform a customer based advertisement and listeners to get a discount on their bills for music service. And eventually the proposed AMS can provide the effective commercial service to the advertisers and the effective clients recruit ways to music providers.

Generation of Dynamic Routing Information by using Balanced Howell Rotations (Balanced Howell Rotations를 이용한 동적 라우팅 정보 생성)

  • Kim, Joon-Mo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.14-20
    • /
    • 2011
  • In mobile ad hoc networks where the communication nodes are moving around, one may perform dynamic routing that can increase the total communication throughput of the network, by determining the ranks of pairs of nodes according to their communication throughput. The balanced Howell rotation is a tournament design scheme for bridge games. This paper explains that the balanced Howell rotation can be applied to enhance the overall communication throughput of mobile ad hoc networks, and proposes and proves the condition under which the balanced Howell rotations may exist.

Improved Compressed Network Coding Scheme for Energy-Efficient Data Communication in Wireless Sensor Networks

  • Zhou, Ying;Yang, Lihua;Yang, Longxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2946-2962
    • /
    • 2017
  • An improved energy-efficient compressed network coding method is proposed for the data communication in the wireless sensor networks (WSNs). In the method, the compressed sensing and network coding are jointly used to improve the energy efficiency, and the two-hop neighbor information is employed to choose the next hop to further reduce the number of the transmissions. Moreover, a new packet format is designed to facilitate the intermediate node selection. To theoretically verify the efficiency of the proposed method, the expressions for the number of the transmissions and receptions are derived. Simulation results show that, the proposed method has higher energy efficiency compared with the available schemes, and it only requires a few packets to reconstruct measurements with reasonable quality.

Effect of Chaos and Instability of Brillouin-Active Fiber Based on Optical Communication

  • Yeom, Keong-Tae;Kim, Kwan-Kyu;Kim, Ji-Hyoung;Kim, Yong-Kab
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.1 no.1
    • /
    • pp.61-66
    • /
    • 2008
  • In this paper the effect of instability and chaos in optical fiber networks based on the Internet is described. Nonlinear optical fiber effect especially Brillouin scattering in networks has emerged as the essential means for the construction of active optical devices used for all-optic in-line switching, channel selection, amplification, oscillation in optical communications and a host of other applications. The inherent optical feedback by the back-scattered Stokes wave in optical networks also leads to instabilities in the form of optical chaos. This paradigm of optical chaos in fiber Internet serves as a test for fundamental study of chaos and its suppression and exploitation in practical application in optical fiber communication. This paper attempts to present a survey and some of our research findings on the nature of Brillouin chaotic effect on Internet based optical communication.

  • PDF

Bandwidth Allocation Scheme for Real-Time Communication on MS/TP Protocol (MS/TP 프로토콜에서 실시간 통신을 위한 대역폭 할당 기법)

  • Song, Won-Seok;Hong, Seung Ho
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.11
    • /
    • pp.660-668
    • /
    • 2005
  • Digital communication networks have become a core technology in advanced building automation systems. BACnet (Building Automation and Control networks) is a standard data communication protocol designed specifically for building automation and control systems. BACnet adopts Master-Slave/Token-Passing (MS/TP) protocol as one of its field level networks. Tn this study, we introduce a method of implementing bandwidth allocation scheme in the MS/TP protocol. The bandwidth allocation scheme improves the capability of real-time communication of the original MS/TP protocol. The bandwidth allocation scheme introduced in this paper can be easily implemented in the existing MS/TP protocol with a slight modification. In this study, we examined the validity of bandwidth allocation scheme using simulation models. The results from the simulation experiment show that the proposed scheme satisfies the requirements of real-time communication.

Secure Group Communication with Dynamic Membership Change in Ad Hoc Networks

  • Kim, Hee-Youl
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.9
    • /
    • pp.1668-1683
    • /
    • 2011
  • The importance of secure communication between only legitimate group members in ad hoc networks has been growing in recent years. Due to the ad hoc nature the scalability on dynamic membership change is a major concern. However, the previous models require at least O(log n) communication cost for key update per each membership change, which imposes a heavy burden on the devices. In this paper we present a scalable model that supports communication-efficient membership change in ad hoc networks by exclusionary keys and RSA functions. The multicast cost for key update is extremely low, that is O(1) , and one-to-one communications occur mostly in neighboring devices.

Channel Sorting Based Transmission Scheme For D2D Caching Networks (채널 정렬을 활용한 D2D 캐싱 네트워크용 전송 기법)

  • Jeong, Moo-Woong;Ryu, Jong Yeol;Kim, Seong Hwan;Lee, Woongsup;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.11
    • /
    • pp.1511-1517
    • /
    • 2018
  • Mobile Device-to-Device (D2D) caching networks can transmit multimedia data to users directly without passing through any network infrastructure by storing popular multimedia contents in advance that are popular among many mobile users at caching server devices (CSDs) in distributed manners. Thus, mobile D2D caching networks can significantly reduce backhaul traffic in wired networks and service latency time of mobile users. In this paper, we propose an efficient transmission scheme that can enhance the transmission efficiency of mobile D2D caching networks by using multiple CSDs that are caching the contents that are popular among mobile users. By sorting the multiple CSDs that are caching a content that mobile users want to receive according to their channel gains, the proposed scheme can reduce the complexity of algorithm significantly, compared to an optimal scheme based on Brute-force searching, and can also obtain much higher network transmission efficiency than the existing Blanket and Opportunistic transmission schemes.

A Simple $N^{th}$ Best-Relay Selection Criterion for Opportunistic Two-Way Relay Networks under Outdated Channel State Information

  • Ou, Jinglan;Wu, Haowei;Wang, Qi;Zou, Yutao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3409-3422
    • /
    • 2014
  • The frequency spectrum available for the wireless communication is extremely crowded. In order to improve the spectral efficiency, the two-way relay networks have aroused great attention. A simple $N^{th}$ best-relay selection criterion for the opportunistic two-way relay networks is proposed, which can be implemented easily by extending the distributed timer technique in practice, since the proposed criterion is mainly based on the channel gains. The outage performance of the proposed relay selection scheme is analyzed under the outdated channel state information (CSI), and a tight closed-form lower bound and asymptotic value of the outage probability over Rayleigh fading channels are obtained. Simulation results demonstrate that the tight closed-form lower bound of the outage probability very closely matches with simulated ones in the whole SNR region, and the asymptotic results provide good tight approximations to the simulation ones, especially in the high SNR region.

Autonomous Unmanned Flying Robot Control for Reconfigurable Airborne Wireless Sensor Networks Using Adaptive Gradient Climbing Algorithm (에어노드 기반 무선센서네트워크 구축을 위한 적응형 오르막경사법 기반의 자율무인비행로봇제어)

  • Lee, Deok-Jin
    • The Journal of Korea Robotics Society
    • /
    • v.6 no.2
    • /
    • pp.97-107
    • /
    • 2011
  • This paper describes efficient flight control algorithms for building a reconfigurable ad-hoc wireless sensor networks between nodes on the ground and airborne nodes mounted on autonomous vehicles to increase the operational range of an aerial robot or the communication connectivity. Two autonomous flight control algorithms based on adaptive gradient climbing approach are developed to steer the aerial vehicles to reach optimal locations for the maximum communication throughputs in the airborne sensor networks. The first autonomous vehicle control algorithm is presented for seeking the source of a scalar signal by directly using the extremum-seeking based forward surge control approach with no position information of the aerial vehicle. The second flight control algorithm is developed with the angular rate command by integrating an adaptive gradient climbing technique which uses an on-line gradient estimator to identify the derivative of a performance cost function. They incorporate the network performance into the feedback path to mitigate interference and noise. A communication propagation model is used to predict the link quality of the communication connectivity between distributed nodes. Simulation study is conducted to evaluate the effectiveness of the proposed reconfigurable airborne wireless networking control algorithms.