• Title/Summary/Keyword: electronic communication networks

Search Result 673, Processing Time 0.029 seconds

Achievable Sum Rate Enhancement by Sectorization for Dirty Paper Coding Aided Multihop Cellular Networks (Dirty Paper Coding을 이용한 다중 도약 셀룰러 네트워크에서 Sectorization을 통한 전송률 향상)

  • Park, Sung-Soo;Song, Hyung-Joon;Lim, Sung-Mook;You, Cheol-Woo;Hong, Dae-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.241-242
    • /
    • 2008
  • This paper proposes a sectorization and exclusive subcarrier allocation technique for dirty paper coding (DPC) aided orthogonal frequency division multiple access (OFDMA) multihop cellular networks. Simulation result shows that the proposed technique significantly increases the achievable sum rate compared to the conventional mobile station selection approach.

  • PDF

Interference Mitigation Scheme by Antenna Selection in Device-to-Device Communication Underlaying Cellular Networks

  • Wang, Yuyang;Jin, Shi;Ni, Yiyang;Wong, Kai-Kit
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.429-438
    • /
    • 2016
  • In this paper, we investigate an interference mitigation scheme by antenna selection in device-to-device (D2D) communication underlaying downlink cellular networks. We first present the closed-form expression of the system achievable rate and its asymptotic behaviors at high signal-to-noise ratio (SNR) and the large antenna number scenarios. It is shown that the high SNR approximation increases with more antennas and higher ratio between the transmit SNR at the base station (BS) and the D2D transmitter. In addition, a tight approximation is derived for the rate and we reveal two thresholds for both the distance of the D2D link and the transmit SNR at the BS above which the underlaid D2D communication will degrade the system rate. We then particularize on the small cell setting where all users are closely located. In the small cell scenario, we show that the relationship between the distance of the D2D transmitting link and that of the D2D interfering link to the cellular user determines whether the D2D communication can enhance the system achievable rate. Numerical results are provided to verify these results.

An Efficient Anonymous Authentication Scheme with Secure Communication in Intelligent Vehicular Ad-hoc Networks

  • Zhang, Xiaojun;Mu, Liming;Zhao, Jie;Xu, Chunxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3280-3298
    • /
    • 2019
  • Vehicular ad-hoc networks (VANETs) have become increasingly significant in intelligent transportation systems, they play a great role in improving traffic safety and efficiency. In the deployment of intelligent VANETs, intelligent vehicles can efficiently exchange important or urgent traffic information and make driving decisions. Meanwhile, secure data communication and vehicle's identity privacy have been highlighted. To cope with these security issues, in this paper, we construct an efficient anonymous authentication scheme with secure communication in intelligent VANETs. Combing the ElGamal encryption technique with a modified Schnorr signature technique, the proposed scheme provides secure anonymous authentication process for encrypted message in the vehicle-to-infrastructure communication model, and achieves identity privacy, forward security, and reply attack resistance simultaneously. Moreover, except the trusted authority (TA), any outside entity cannot trace the real identity of an intelligent vehicle. The proposed scheme is designed on an identity-based system, which can remove the costs of establishing public key infrastructure (PKI) and certificates management. Compared with existing authentication schemes, the proposed scheme is much more practical in intelligent VANETs.

Content-Aware D2D Caching for Reducing Visiting Latency in Virtualized Cellular Networks

  • Sun, Guolin;Al-Ward, Hisham;Boateng, Gordon Owusu;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.514-535
    • /
    • 2019
  • Information-centric networks operate under the assumption that all network components have built-in caching capabilities. Integrating the caching strategies of information centric networking (ICN) with wireless virtualization improves the gain of virtual infrastructure content caching. In this paper, we propose a framework for software-defined information centric virtualized wireless device-to-device (D2D) networks. Enabling D2D communications in virtualized ICN increases the spectral efficiency due to reuse and proximity gains while the software-defined network (SDN) as a platform also simplifies the computational overhead. In this framework, we propose a joint virtual resource and cache allocation solution for latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we design low-complexity heuristic algorithms which are intuitive and efficient. In our proposed framework, different services can share a pool of infrastructure items. We evaluate our proposed framework and algorithm through extensive simulations. The results demonstrate significant improvements in terms of visiting latency, end user QoE, InP resource utilization and MVNO utility gain.

Implementation and Measurement of Spectrum Sensing for Cognitive Radio Networks Based on LoRa and GNU Radio

  • Tendeng, Rene;Lee, YoungDoo;Koo, Insoo
    • International journal of advanced smart convergence
    • /
    • v.7 no.3
    • /
    • pp.23-36
    • /
    • 2018
  • In wireless communication, efficient spectrum usage is an issue that has been an attractive research area for many technologies. Recently new technologies innovations allow compact radios to transmit with power efficient communication over very long distances. For example, Low-Power Wide Area Networks (LPWANs) are an attractive emerging platform to connect the Internet-of-Things (IoT). Especially, LoRa is one of LPWAN technologies and considered as an infrastructure solution for IoT. End-devices use LoRa protocol across a single wireless hop to communicate to gateway(s) connected to the internet which acts as a bridge and relays message between these LoRa end-devices to a central network server. The use of the (ISM) spectrum sharing for such long-range networking motivates us to implement spectrum sensing testbed for cognitive radio network based on LoRa and GNU radio. In cognitive radio (CR), secondary users (SUs) are able to sense and use this information to opportunistically access the licensed spectrum band in absence of the primary users (PUs). In general, PUs have not been very receptive of the idea of opportunistic spectrum sharing. That is, CR will harmfully interfere with operations of PUs. Subsequently, there is a need for experimenting with different techniques in a real system. In this paper, we implemented spectrum sensing for cognitive radio networks based on LoRa and GNU Radio, and further analyzed corresponding performances of the implemented systems. The implementation is done using Microchip LoRa evolution kits, USRPs, and GNU radio.

Generation of Dummy Messages Depending Upon the Location Privacy Level in Sensor Networks (센서 네트워크에서 위치 기밀 수준에 따른 더미 메시지 생성)

  • Tscha, Yeong-Hwan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.9
    • /
    • pp.861-868
    • /
    • 2016
  • Dummy messages are usually generated for faking in preserving the location privacy of a sink or source against the global eavesdropping in wireless networks. In this paper, we propose a new method in which a certain number of nodes determined by considering the required privacy level are made to transit to the dormant state doing nothing so that the total number of dummy messages is reduced, while the paths from the sink to the sources are ensured. Through simulation we verify the success ratio of path establishments between the sink and a set of sources and the location privacy level of them.

Ultra-broadband Optical Amplifier for WDM Optical Transmission Networks (파장분할다중 방식 광전송망을 위한 초광대역 광증폭기)

  • Lee, Young-Sun;Jung, Jae-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.3 no.4
    • /
    • pp.289-294
    • /
    • 2008
  • Affordable traffic capacity of each node in networks is expected to reach in Tb/s range in proportion to the rapid growth of Internet users. To transmit more than Tb/s per fiber pair, WDM should be used as well as existing TDM. To increase the capacity of transmission in WDM networks, there are two ways, increasing channel speed or channel quantity. To increase the channel quantity, there are two ways, narrow spacing or expanding transmission bandwidth. To expand bandwidth, ultra-broadband optical amplifier technology is necessary. In this paper, we introduce EDFA in effect at C/L band, FRA, and some optical amplifiers in effect at S band, and analyze the development trend of various amplification technologies.

  • PDF

Traffic Estimation Method for Visual Sensor Networks (비쥬얼 센서 네트워크에서 트래픽 예측 방법)

  • Park, Sang-Hyun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.11
    • /
    • pp.1069-1076
    • /
    • 2016
  • Recent development in visual sensor technologies has encouraged various researches on adding imaging capabilities to sensor networks. Video data are bigger than other sensor data, so it is essential to manage the amount of image data efficiently. In this paper, a new method of video traffic estimation is proposed for efficient traffic management of visual sensor networks. In the proposed method, a first order autoregressive model is used for modeling the traffic with the consideration of the characteristics of video traffics acquired from visual sensors, and a Kalman filter algorithm is used to estimate the amount of video traffics. The proposed method is computationally simple, so it is proper to be applied to sensor nodes. It is shown by experimental results that the proposed method is simple but estimate the video traffics exactly by less than 1% of the average.

Managing Flow Transfers in Enterprise Datacenter Networks with Flow Chasing

  • Ren, Cheng;Wang, Sheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1519-1534
    • /
    • 2016
  • In this paper, we study how to optimize the data shuffle phase by leveraging the flow relationship in datacenter networks (DCNs). In most of the clustering computer frameworks, the completion of a transfer (a group of flows that can enable a computation stage to start or complete) is determined by the flow completing last, so that limiting the rate of other flows (not the last one) appropriately can save bandwidth without impacting the performance of any transfer. Furthermore, for the flows enter network late, more bandwidth can be assigned to them to accelerate the completion of the entire transfer. Based on these characteristics, we propose the flow chasing algorithm (FCA) to optimize the completion of the entire transfer. We implement FCA on a real testbed. By evaluation, we find that FCA can not only reduce the completion time of data transfer by 6.24% on average, but also accelerate the completion of data shuffle phase and entire job.