• Title/Summary/Keyword: Access networks

Search Result 2,033, Processing Time 0.027 seconds

An MIB Access Control Modeling for the Secure Management of Large Networks (대규모 망의 안전한 관리를 위한 관리 정보베이스의 접근 제어 모형화)

  • Seo, Jae-Hyeon;Lee, Chang-Jin;No, Bong-Nam
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.4
    • /
    • pp.581-591
    • /
    • 1995
  • An MIB is the heart of a network management system and it stores all information that is necessary for network management. To operate networks safely, it is essential to control accesses to managed objects. This paper provides three-level architecture of managers so as to perform network management more efficiently in large networks. Moreover, mandatory access control(MAC) policy and role-based access control policy are adopted to ensure the secure access to the MIB. These policies are modeled by using the active object-oriented data model, which makes easy to map these access control models into the active object-oriented database.

  • PDF

p-Persistent MAC Protocol for WDM Ring Networks

  • So, Won-Ho;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9B
    • /
    • pp.589-597
    • /
    • 2007
  • In this paper, a WDM metro ring consisting of access nodes with $FT-FR^n$ (Fixed Transmitter - n Fixed Receivers) is considered. A trade-off exists between node throughput and transmission fairness because the access nodes share wavelength channels. In order to eliminate the transmission unfairness and to increase throughput, the p-persistent medium access control (MAC) protocol is proposed: each node uses an empty optical slot to transmit a packet and make it available with the extraction of a transferred packet at the source access node, called source-stripping. The local empty slot can be used to transfer a head-of-line packet in the local buffer with probability p or it is used for the next downstream nodes with 1-p. The proposed MAC protocol provides better node throughput than the non-persistent protocol and exhibits better fairness index than the 1-persistent protocol in WDM ring networks. In addition, numerical analysis shows that the proposed MAC protocol maximizes the node throughput under uniform traffic conditions. For more detailed results, we use the network simulation under Poisson and self-similar traffic. Furthermore, unpredictable traffic constructed by the combination of the former and the latter is also considered. The reasonable probability of the p-persistent protocol for a given architecture can be determined through simulation.

Stochastic MAC-layer Interference Model for Opportunistic Spectrum Access: A Weighted Graphical Game Approach

  • Zhao, Qian;Shen, Liang;Ding, Cheng
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.411-419
    • /
    • 2016
  • This article investigates the problem of distributed channel selection in opportunistic spectrum access networks from a perspective of interference minimization. The traditional physical (PHY)-layer interference model is for information theoretic analysis. When practical multiple access mechanisms are considered, the recently developed binary medium access control (MAC)-layer interference model in the previous work is more useful, in which the experienced interference of a user is defined as the number of competing users. However, the binary model is not accurate in mathematics analysis with poor achievable performance. Therefore, we propose a real-valued one called stochastic MAC-layer interference model, where the utility of a player is defined as a function of the aggregate weight of the stochastic interference of competing neighbors. Then, the distributed channel selection problem in the stochastic MAC-layer interference model is formulated as a weighted stochastic MAC-layer interference minimization game and we proved that the game is an exact potential game which exists one pure strategy Nash equilibrium point at least. By using the proposed stochastic learning-automata based uncoupled algorithm with heterogeneous learning parameter (SLA-H), we can achieve suboptimal convergence averagely and this result can be verified in the simulation. Moreover, the simulated results also prove that the proposed stochastic model can achieve higher throughput performance and faster convergence behavior than the binary one.

Dynamic Opportunistic Interference Alignment for Random-Access Small-Cell Networks (랜덤 엑세스 스몰셀 무선망에서의 실시간 기회적 간섭정렬 기법 연구)

  • Jeon, Sang-Woon;Shin, Won-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.11
    • /
    • pp.675-681
    • /
    • 2014
  • As the recently soaring wireless traffic, small-cell techniques have been actively studied in order to support such a wireless demand for cellular wireless networks. This paper studies interference mitigation methods for random-access small-cell networks. Although inter-cell interference between small random-access cells is one of the main factors to degrade overall performance, most of the previous works focused on interference mitigation between users in each cell. To address such limitation, dynamic opportunistic interference alignment is proposed exploiting statistical characteristics of random-access. It is demonstrated by simulation that the proposed scheme outperforms the previous approach as the number of cells or the number of users in each cell increases.

Slotted ALOHA-based Random Access Protocol for Wireless-Powered Sensor Networks (무선전력 센서 네트워크를 위한 Slotted ALOHA 기반의 랜덤 접속 프로토콜)

  • Choi, Hyun-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.603-606
    • /
    • 2019
  • In this paper, we propose a slotted-ALOHA-based random access protocol and derive the optimal number of random slots that maximize channel throughput when multiple energy harvesting sensor devices perform random access in wireless-powered sensor networks (WPSN). Throughput numerical analysis, we prove that the throughput has a concavity with respect to the number of random slots and obtain the optimal number of slots. Simulation results show that the throughput of the proposed slotted ALOHA-based random access protocol is maximize when the derived optimal number of slots is employed in the considered WPSN.

  • PDF

Wireless Access Network Architecture and Virtualization Scenarios for Next-Generation Mobile Communication Networks (차세대 이동통신 네트워크를 위한 무선 액세스 망 구조 및 가상화 시나리오)

  • Kim, Myunghwan;Kim, Su Min;Jung, Bang Chul;Park, Yeoun-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.10
    • /
    • pp.2150-2162
    • /
    • 2012
  • In accordance with evolution of next-generation mobile Internet, 2G, 3G, 4G, and B4G mobile communication wireless access networks will be co-existed and service providers will be merged as an integrated service provider. In addition, multiple virtual service operators will appear. In order to provide complicated unified-services, in the future Internet, wireless network virtualization where network resource is shared by various service operators is necessary. Therefore, in this paper, we investigate network architectures and virtualization scenarios for wireless access network virtualization where various wireless access technologies are flexibly operated by multiple service providers over next-generation wireless access networks. We expect that the virtualization scenario and network architecture yielded from this study can play a role as a basis for development of wireless access network virtualization algorithms.

A Tabu Search Algorithm for Network Design Problem in Wireless Mesh Networks (무선 메쉬 네트워크에서 네트워크 설계 문제를 위한 타부 서치 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.6
    • /
    • pp.778-785
    • /
    • 2020
  • Wireless mesh networks consist of mesh clients, mesh routers and mesh access points. The mesh router connects wireless network services to the mesh client, and the mesh access point connects to the backbone network using a wired link and provides Internet access to the mesh client. In this paper, a limited number of mesh routers and mesh access points are used to propose optimization algorithms for network design for wireless mesh networks. The optimization algorithm in this paper has been applied with a sub-subscription algorithm, which is one of the meta-heuristic methods, and is designed to minimize the transmission delay for the placement of mesh routers and mesh access points, and produce optimal results within a reasonable time. The proposed algorithm was evaluated in terms of transmission delay and time to perform the algorithm for the placement of mesh routers and mesh access points, and the performance evaluation results showed superior performance compared to the previous meta-heuristic methods.

An Efficient Downlink MAC Protocol for Multi-User MIMO WLANs

  • Liu, Kui;Li, Changle;Guo, Chao;Chen, Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4242-4263
    • /
    • 2017
  • Multi-User Multiple-Input Multiple-Output (MU-MIMO) technology has recently attracted significant attention from academia and industry because of it is increasingly important role in improving networks' capacity and data rate. Moreover, MU-MIMO systems for the Fifth Generation (5G) have already been researched. High Quality of Service (QoS) and efficient operations at the Medium Access Control (MAC) layer have become key requirements. In this paper, we propose a downlink MU-MIMO MAC protocol based on adaptive Channel State Information (CSI) feedback (called MMM-A) for Wireless Local Area Networks (WLANs). A modified CSMA/CA mechanism using new frame formats is adopted in the proposed protocol. Specifically, the CSI is exchanged between stations (STAs) in an adaptive way, and a packet selection strategy which can guarantee a fairer QoS for scenarios with differentiated traffic is also included in the MMM-A protocol. We then derive the expressions of the throughput and access delay, and analyze the performance of the protocol. It is easy to find that the MMM-A protocol outperforms the commonly used protocols in terms of the saturated throughput and access delay through simulation and analysis results.

A Quantitative Analysis of System-Level Performance of the Wireless LAN in Digital Home Environments

  • Son, Byoung-Hee;Kim, Hag-Bae
    • Journal of Ubiquitous Convergence Technology
    • /
    • v.2 no.1
    • /
    • pp.51-55
    • /
    • 2008
  • A digital home is a ubiquitous environment that is expected to be realized in the near future. All information appliances in a house are connected to each other through wired and/or wireless home networks. Authenticated user can access the various services provided by the digital home, and the access is not restricted by equipment, time, or location. The technologies that form the digital home can be grouped into two categories: wired networking technologies and wireless networking technologies. For the purpose of ubiquitous environments, wireless-networks offer suitable and seamless high-quality services. A wireless LAN can be created simply by equipping a single access point. For that reason, the cost of establishing such a network is low and using it is easy. Of course, there is an exciting new wireless technology. It is the Ultra Wide Band (UWB). However, it is not enough to bring wireless convenience, although offering a broad range of high-speed data transfer capabilities, Because of unstable. Thus, of the wireless-networking systems, we focus on the wireless LAN. We quantitatively analyze its capabilities. The dynamic and adaptive wireless LAN provides a foundation for the evolution toward the next generation of wireless and adaptive networks. The difference between wired LAN and wireless LAN in upload and download rates is small. Although the wireless LAN experiences a greater loss rate than the wired LAN, the difference is minimal. We conclude that a wireless LAN is suitable for use in an apartment environment.

  • PDF

Slotted ALOHA Based Greedy Relay Selection in Large-scale Wireless Networks

  • Ouyang, Fengchen;Ge, Jianhua;Gong, Fengkui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3945-3964
    • /
    • 2015
  • Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.