• Title/Summary/Keyword: Universal Network

Search Result 349, Processing Time 0.031 seconds

A Framework for Universal Cross Layer Networks

  • Khalid, Murad;Sankar, Ravi;Joo, Young-Hoon;Ra, In-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.4
    • /
    • pp.239-247
    • /
    • 2008
  • In a resource-limited wireless communication environment, various approaches to meet the ever growing application requirements in an efficient and transparent manner, are being researched and developed. Amongst many approaches, cross layer technique is by far one of the significant contributions that has undoubtedly revolutionized the way conventional layered architecture is perceived. In this paper, we propose a Universal Cross Layer Framework based on vertical layer architecture. The primary contribution of this paper is the functional architecture of the vertical layer which is primarily responsible for cross layer interaction management and optimization. The second contribution is the use of optimization cycle that comprises awareness parameters collection, mapping, classification and the analysis phases. The third contribution of the paper is the decomposition of the parameters into local and global network perspective for opportunistic optimization. Finally, we have shown through simulations how parameters' variations can represent local and global views of the network and how we can set local and global thresholds to perform opportunistic optimization.

Management of Neighbor Cell Lists and Physical Cell Identifiers in Self-Organizing Heterogeneous Networks

  • Lim, Jae-Chan;Hong, Dae-Hyoung
    • Journal of Communications and Networks
    • /
    • v.13 no.4
    • /
    • pp.367-376
    • /
    • 2011
  • In this paper, we propose self-organizing schemes for the initial configuration of the neighbor cell list (NCL), maintenance of the NCL, and physical cell identifier (PCI) allocation in heterogeneous networks such as long term evolution systems where lower transmission power nodes are additionally deployed in macrocell networks. Accurate NCL maintenance is required for efficient PCI allocation and for avoiding handover delay and redundantly increased system overhead. Proposed self-organizing schemes for the initial NCL configuration and PCI allocation are based on evolved universal terrestrial radio access network NodeB (eNB) scanning that measures reference signal to interference and noise ratio and reference symbol received power, respectively, transmitted from adjacent eNBs. On the other hand, the maintenance of the NCL is managed by adding or removing cells based on periodic user equipment measurements. We provide performance analysis of the proposed schemes under various scenarios in the respects of NCL detection probability, NCL false alarm rate, handover delay area ratio, PCI conflict ratio, etc.

Space-Stretch Tradeoff Optimization for Routing in Internet-Like Graphs

  • Tang, Mingdong;Zhang, Guoqiang;Liu, Jianxun
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.546-553
    • /
    • 2012
  • Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. However, it is generally believed that specialized compact routing schemes for peculiar network topologies can have better performance than universal ones. Studies on complex networks have uncovered that most real-world networks exhibit power-law degree distributions, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play the crucial role of hubs in communication and inter-networking. Based on this fact, we propose two highest-degree landmark based compact routing schemes, namely HDLR and $HDLR^+$. Theoretical analysis on random power-law graphs shows that the two schemes can achieve better space-stretch trade-offs than previous compact routing schemes. Simulations conducted on random power-law graphs and real-world AS-level Internet graph validate the effectiveness of our schemes.

Real-Time Frequency Interference Analysis System for Performance Degradation Analysis of MIMO-OFDM WLAN Due to WPAN Interferer (WPAN 간섭원에 의한 MIMO-OFDM WLAN의 성능 열화 분석을 위한 실시간 주파수 간섭 분석 시스템)

  • Yoon, Hyungoo;Park, Jin-Soo;Jang, Byung-Jun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.27 no.1
    • /
    • pp.88-91
    • /
    • 2016
  • In this paper, we have proposed the frequency interference analysis system using both LabVIEW and Universal Software Radio Peripheral(USRP) for performance degradation analysis of Multi Input Multi Output-Orthogonal Frequency Division Multiplexing(MIMO-OFDM) Wireless Local Area Network(WLAN) due to Wireless Local Area Network(WPAN) interferer. The proposed system consists of three part, i.e., victim, channel, and interferer. Both victim and interferer are implemented by LaBVIEW and a USRP board. Then interfering signal and additive white Gaussian noise are combined with the wanted signals of a victim. Measured Bit Error Rate(BER) at the victim receiver is compared with theoretical BER according to various signal to interference plus noise power ratio (SINR) values. Measured and theoretical BER curves show good agreement.

An Imbedded System for Time Synchronization in Distributed Environment based on the Internet (인터넷 기반 분산 환경에서 시각 동기를 위한 임베디드 시스템)

  • Hwang So-Young;Yu Dong-Hui;Li Ki-Joune
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.3
    • /
    • pp.216-223
    • /
    • 2005
  • A computer clock has limits in accuracy and precision affected by its inherent instability, the environment elements, the modification of users, and errors of the system. So the computer clock needs to be synchronized with a standard clock if the computer system requires the precise time processing. The purpose of synchronizing clocks is to provide a global time base throughout a distributed system. Once this time base exists, transactions among members of distributed system can be controlled based on time. This paper discusses the integrated approach to clock synchronization. An embedded system is considered for time synchronization based on the GPS(Global Positioning System) referenced time distribution model. The system uses GPS as standard reference time source and offers UTC(Universal Time Coordinated) through NTP(Network Time Protocol). A clock model is designed and adapted to keep stable time and to provide accurate standard time with precise resolution. Private MIB(Management Information Base) is defined for network management. Implementation results and performance analysis are also presented.

ST Reliability and Connectivity of VANETs for Different Mobility Environments

  • Saajid, Hussain;DI, WU;Memon, Sheeba;Bux, Naadiya Khuda
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2338-2356
    • /
    • 2019
  • Vehicular ad-hoc network (VANET) is the name of technology, which uses 'mobile internet' to facilitate communication between vehicles. The aim is to ensure road safety and achieve secure communication. Therefore, the reliability of this type of networks is a serious concern. The reliability of VANET is dependent upon proper communication between vehicles within a given amount of time. Therefore a new formula is introduced, the terms of the new formula correspond 1 by 1 to a class special ST route (SRORT). The new formula terms are much lesser than the Inclusion-Exclusion principle. An algorithm for the Source-to-Terminal reliability was presented, the algorithm produced Source-to-Terminal reliability or computed a Source-to-Terminal reliability expression by calculating a class of special networks of the given network. Since the architecture of this class of networks which need to be computed was comparatively trivial, the performance of the new algorithm was superior to the Inclusion-Exclusion principle. Also, we introduce a mobility metric called universal speed factor (USF) which is the extension of the existing speed factor, that suppose same speed of all vehicles at every time. The USF describes an exact relation between the relative speed of consecutive vehicles and the headway distance. The connectivity of vehicles in different mobile situations is analyzed using USF i.e., slow mobility connectivity, static connectivity, and high mobility connectivity. It is observed that $p_c$ probability of connectivity is directly proportional to the mean speed ${\mu}_{\nu}$ till specified threshold ${\mu}_{\tau}$, and decreases after ${\mu}_{\tau}$. Finally, the congested network is connected strongly as compared to the sparse network as shown in the simulation results.

Extending the Home Network using UPnP+ (UPnP+를 이용한 홈 네트워크 확장)

  • Kim, Hyun-Sik;Park, Yong-Suk;Koo, Sung Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.540-542
    • /
    • 2014
  • The Universal Plug and Play (UPnP) specification permits networked devices to discover each other and to provide diverse services in the home network environment. Recently, new paradigms such as mobile connected computing, cloud-based service delivery, smart device content sharing, and Internet of Things (IoT) have emerged, but the home network based UPnP shows functional limitations in supporting such paradigms. To support them, the UPnP Forum has recently extended the capabilities of the existing UPnP, calling it UPnP+. In this paper, the UPnP Device Architecture V2.0 (UDA 2.0), which forms the basis of UPnP+, is presented. We present how UDA 2.0 enables the expansion of the home network to wide-area networks and non-IP device domains.

  • PDF

Optimal Power Allocation and Outage Analysis for Cognitive MIMO Full Duplex Relay Network Based on Orthogonal Space-Time Block Codes

  • Liu, Jia;Kang, GuiXia;Zhu, Ying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.924-944
    • /
    • 2014
  • This paper investigates the power allocation and outage performance of MIMO full-duplex relaying (MFDR), based on orthogonal space-time block codes (OSTBC), in cognitive radio systems. OSTBC transmission is used as a simple means to achieve multi-antenna diversity gain. Cognitive MFDR systems not only have the advantage of increasing spectral efficiency through spectrum sharing, but they can also extend coverage through the use of relays. In cognitive MFDR systems, the primary user experiences interference from the secondary source and relay simultaneously, owing to full duplexing. It is therefore necessary to optimize the transmission powers at the secondary source and relay. In this paper, we propose an optimal power allocation (OPA) scheme based on minimizing the outage probability in cognitive MFDR systems. We also analyse the outage probability of the secondary user in noise-limited and interference-limited environments in Nakagami-m fading channels. Simulation results show that the proposed schemes achieve performance improvements in terms of reducing outage probability.

Power Allocation Schemes For Downlink Cognitive Radio Networks With Opportunistic Sub-channel Access

  • Xu, Ding;Feng, Zhiyong;Zhang, Ping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1777-1791
    • /
    • 2012
  • This paper considers a downlink cognitive radio (CR) network where one secondary user (SU) and one primary user (PU) share the same base station (BS). The spectrum of interest is divided into a set of independent, orthogonal subchannels. The communication of the PU is of high priority and the quality of service (QoS) is guaranteed by the minimum rate constraint. On the other hand, the communication of the SU is of low priority and the SU opportunistically accesses the subchannels that were previously discarded by the PU during power allocation. The BS assigns fractions ?? and 1 ?? of the total available transmit power to the PU and the SU respectively. Two power allocation schemes with opportunistic subchannel access are proposed, in which the optimal values of ??'s are also obtained. The objective of one scheme is to maximize the rate of the SU, and the objective of the other scheme is to maximize the sum rate of the SU and the PU, both under the PU minimum rate constraint and the total transmit power constraint. Extensive simulation results are obtained to verify the effectiveness of the proposed schemes.

Super Resolution Fusion Scheme for General- and Face Dataset (범용 데이터 셋과 얼굴 데이터 셋에 대한 초해상도 융합 기법)

  • Mun, Jun Won;Kim, Jae Seok
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.11
    • /
    • pp.1242-1250
    • /
    • 2019
  • Super resolution technique aims to convert a low-resolution image with coarse details to a corresponding high-resolution image with refined details. In the past decades, the performance is greatly improved due to progress of deep learning models. However, universal solution for various objects is a still challenging issue. We observe that learning super resolution with a general dataset has poor performance on faces. In this paper, we propose a super resolution fusion scheme that works well for both general- and face datasets to achieve more universal solution. In addition, object-specific feature extractor is employed for better reconstruction performance. In our experiments, we compare our fusion image and super-resolved images from one- of the state-of-the-art deep learning models trained with DIV2K and FFHQ datasets. Quantitative and qualitative evaluates show that our fusion scheme successfully works well for both datasets. We expect our fusion scheme to be effective on other objects with poor performance and this will lead to universal solutions.