• Title/Summary/Keyword: Access Point Control

Search Result 280, Processing Time 0.035 seconds

Content-Based Indexing and Retrieval in Large Image Databases

  • Cha, Guang-Ho;Chung, Chin-Wan
    • Journal of Electrical Engineering and information Science
    • /
    • v.1 no.2
    • /
    • pp.134-144
    • /
    • 1996
  • In this paper, we propose a new access method, called the HG-tree, to support indexing and retrieval by image content in large image databases. Image content is represented by a point in a multidimensional feature space. The types of queries considered are the range query and the nearest-neighbor query, both in a multidimensional space. Our goals are twofold: increasing the storage utilization and decreasing the area covered by the directory regions of the index tree. The high storage utilization and the small directory area reduce the number of nodes that have to be touched during the query processing. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. The second goal is achieved by maintaining the area occupied by the directory region minimally on the directory nodes. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our access method and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed access method with the buddy-tree, which is one of the most successful point access methods for a multidimensional space. The results show the superiority of our method.

  • PDF

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.

DoS-Resistance Authentication Protocol for Wreless LAN (DoS 공격에 강한 무선 랜 인증 프로토콜)

  • 김민현;이재욱;최영근;김순자
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.5
    • /
    • pp.3-10
    • /
    • 2004
  • A Wireless Lan has an importance of access control, because we can use wireless Internet via AP(Access Point). Moreover, to use wireless LAN, we will go through authentication process of EAP. DoS(Denial of Service) attack is one of the fatal attack about these AP access and authentication process. That is, if malicious attacker keeps away access of AP or consumes memory of server and calculation ability of CPU and etc. compulsorily in authentication process, legal user can't get any services. In this paper, we presents the way of protection against the each attack that is classified into access control, allocation of resource, attack on authentication protocol. The first thing, attack to access control, is improved by pre-verification and the parameter of security level. The second, attack of allocation of resource, is done by partial stateless protocol. And the weak of protocol is done by time-stamp and parameter of access limitation.

An Integrated Management Model of OS-RBAC and Separation Of Duty Policy (OS-RBAC과 임무분리 정책의 통합 관리 모델)

  • Byun, Chang-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.1
    • /
    • pp.167-175
    • /
    • 2010
  • Like most large organizations, there are business rules such as 'separation of duty' and 'delegation' which should be considered in access control. From a SOD point of view, previous SOD models built on the (Administrative) Role-Based Access Control model cannot present the best solution to security problems such as information integrity by the limited constituent units such as role hierarchy and role inheritance. Thus, we propose a new integrated management model of administration role-based access control model and SOD policy, which is called the OS-SoDAM. The OS-SoDAM defines the authority range in an organizational structure that is separated from role hierarchy and supports a decentralized security officer-level SOD policy in which a local security officer can freely perform SOD policies within a security officer's authority range without the security officer's intervention.

A Three-way Handshaking Access Mechanism for Point to Multipoint In-band Full-duplex Wireless Networks

  • Zuo, Haiwei;Sun, Yanjing;Lin, Changlin;Li, Song;Xu, Hongli;Tan, Zefu;Wang, Yanfen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3131-3149
    • /
    • 2016
  • In-band Full-duplex (IBFD) wireless communication allows improved throughput for wireless networks. The current Half-duplex (HD) medium access mechanism Request to Send/Clear to Send (RTS/CTS) has been directly applied to IBFD wireless networks. However, this is only able to support a symmetric dual link, and does not provide the full advantages of IBFD. To increase network throughput in a superior way to the HD mechanism, a novel three-way handshaking access mechanism RTS/SRTS (Second Request to Send)/CTS is proposed for point to multipoint (PMP) IBFD wireless networks, which can support both symmetric dual link and asymmetric dual link communication. In this approach, IBFD wireless communication only requires one channel access for two-way simultaneous packet transmissions. We first describe the RTS/SRTS/CTS mechanism and the symmetric/asymmetric dual link transmission procedure and then provide a theoretical analysis of network throughput and delay using a Markov model. Using simulations, we demonstrate that the RTS/SRTS/CTS access mechanism shows improved performance relative to that of the RTS/CTS HD access mechanism.

Enhancements of the Modified PCF in IEEE 802.11 WLANs

  • Kanjanavapastit Apichan;Landfeldt Bjorn
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.313-324
    • /
    • 2005
  • The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

Efficient Polling Scheme for Multiple Direct Link Communication Between STAs in Infrastructure Mode IEEE 802.11 Wireless LANs (Infrastructure Mode IEEE 802.11 무선랜 시스템에서 단말간의 다중 직접 통신을 위한 효율적인 폴링 방식)

  • Choi, Woo-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.2
    • /
    • pp.237-245
    • /
    • 2007
  • In this paper, a modified PCF (Point Coordination Function) MAC (Medium Access Control) Protocol is proposed to support the multiple direct link communication between STAs (STAtions) in infrastructure mode IEEE 802.11 wireless LANs. By the proposed MAC protocol, the direct link communication between STAs, which are located within the communication range of each other, is allowed without the use of AP (Access Point) as a relay. Moreover, when multiple direct data communication between STAs can be simultaneously performed with a sufficiently small interference, multiple simultaneous direct link communication is allowed for the efficient use of radio bandwidth. AP polls STAs to grant the transmission opportunities using the direct link communication by transmitting the polling frames to STAs. An efficient polling method for granting the transmission opportunities to STAs is proposed to reduce the number of the polling frame transmissions and enhance the PCF MAC performance.

QoS-Oriented Handoff Algorithm in IEEE 802.11 Wireless LAN (IEEE 802.11 무선랜에서 서비스 질(QoS) 지향적인 핸드오프 알고리즘에 관한 연구)

  • Choi Haeng-Keol;Kim Il-Hwan;Seo Seung-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6B
    • /
    • pp.338-348
    • /
    • 2005
  • Currently, IEEE 802.11 Wireless LAN (WLAN) is rising as the most popular means for the broadband wireless access network. In this thesis, we propose a QoS(Quality of Service)-Oriented mechanism using handshaking method of scanning phase in IEEE 802.11 handoff. In conventional process for handoff, the major criterion to select the best AP(Access Point) among candidates is normally based on the RSS(Received Signal Strength), which does not always make the selected network guarantee the maximum achievable performance. Even though the link quality with a neighboring AP is excellent, the AP may not be a good candidate to handoff to simply because MAC(Medium Access Control) protocol of IEEE 802.11 standard is contention-based such as CSMA/CA. Therefore, if we apply network level information to AP selection criteria, we can achieve better handoff efficiency rather than before. The analysis and simulation results applied to our new mechanism show clearly better performance than AP selection based on traditional handoff method.

Pterional or Subfrontal Access for Proximal Vascular Control in Anterior Interhemispheric Approach for Ruptured Pericallosal Artery Aneurysms at Risk of Premature Rupture

  • Park, Jaechan
    • Journal of Korean Neurosurgical Society
    • /
    • v.60 no.2
    • /
    • pp.250-256
    • /
    • 2017
  • Objective : Cases of a ruptured pericallosal artery aneurysm with a high risk of intraoperative premature rupture and technical difficulties for proximal vascular control require a technique for the early and safe establishment of proximal vascular control. Methods : A combined pterional or subfrontal approach exposes the bilateral A1 segments or the origin of the ipsilateral A2 segment of the anterior cerebral artery (ACA) for proximal vascular control. Proximal control far from the ruptured aneurysm facilitates tentative clipping of the rupture point of the aneurysm without a catastrophic premature rupture. The proximal control is then switched to the pericallosal artery just proximal to the aneurysm and its intermittent clipping facilitates complete aneurysm dissection and neck clipping. Results : Three such cases are reported : a ruptured pericallosal artery aneurysm with a contained leak of the contrast from the proximal side of the aneurysm, a low-lying ruptured pericallosal artery aneurysm with irregularities on its proximal wall, and a multilobulated ruptured pericallosal artery aneurysm with the parasagittal bridging veins hindering surgical access to the proximal parent artery. In each case, the proposed combined pterional-interhemispheric or subfrontal-interhemispheric approach was successfully performed to establish proximal vascular control far from the ruptured aneurysm and facilitated aneurysm clipping via the interhemispheric approach. Conclusion : When using an anterior interhemispheric approach for a ruptured pericallosal artery aneurysm with a high risk of premature rupture, a pterional or subfrontal approach can be combined to establish early proximal vascular control at the bilateral A1 segments or the origin of the A2 segment.

Scheduling of Real-time and Nonreal-time Traffics in IEEE 802.11 Wireless LAN (무선랜에서의 실시간 및 비실시간 트래픽 스케줄링)

  • Lee, Ju-Hee;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.75-89
    • /
    • 2003
  • Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.