• Journal of Electrical Engineering and information Science
• /
• 제1권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.

• Journal of Communications and Networks
• /
• 제18권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.

• 정보보호학회논문지
• /
• 제14권5호
• /
• pp.3-10
• /
• 2004

무선 랜은 액세스 포인트를 경유하여 인터넷을 사용할 수 있기 때문에 접근 제어의 중요성을 가지고 있다. 또한 무선 랜을 이용하기 위해서는 EAP의 인증과정을 거치게 된다. 이러한 액세스 포인트 접근과 인증 과정에 대한 치명적인 공격 중의 하나가 DoS(Denial of Service) 공격이다. 즉 악의적인 공격자가 액세스 포인트의 접근을 막거나 또는 인증 과정에서 서버의 메모리 및 중앙처리장치의 계산 능력 등을 강제적으로 소비시킴으로써 합법적인 사용자가 서비스를 받지 못하게 한다. 본 논문에서는 무선 랜에 대한 DoS 공격을 접근 제어, 자원의 할당, 인증프로토콜 상에서의 공격으로 나누어 각 공격에 대한 방어법을 제시하였다. 액세스 포인트 접근에 대한 문제는 사전 검증 단계 및 보안 수준 변수에 의해, 자원의 할당에 대한 공격은 부분적인 stateless 프로토콜에 의해, 프로토콜상의 약점은 타임스템프와 접근 제한 변수에 의해 개선하였다.

• 한국컴퓨터정보학회논문지
• /
• 제15권1호
• /
• pp.167-175
• /
• 2010

임무분리(Separation of Duty: 이하 SoD)는 위임(delegation)과 더불어 접근제어 분야에서 중요한 보안 정책 중의 하나이다. 기존의 역할 기반 접근제어 모델을 기반으로 한 과거 임무분리모델은 역할기반 접근제어 모델의 여러 제한적인 구성 요소(역할계층, 역할계승 등)에 의해 조직 내에서 관리하는 정보의 무결성 침해 가능성에 대한 최소화를 충분히 해결하지 못하고 있다. 본 논문에서는 관리적 역할기반 접근제어 모델인 OS-RBAC 모델과 임무분리 정책을 통합한 조직 구조 기반의 임무분리 관리모델(OS-SoDAM)을 제시한다. OS-SoDAM은 분산 기업 환경의 관리 행위의 범위 기준을 역할 계층과는 구별된 조직 구조로 정의하고 있어 역할계층 및 역할계승에 제한적인 임무분리의 한계를 극복하고 자유롭게 임무분리 정책을 접근제어 모델에 적용할 수 있는 유연성을 제공한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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.

• Journal of Communications and Networks
• /
• 제7권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.

• 대한산업공학회지
• /
• 제33권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.

• 한국통신학회논문지
• /
• 제30권6B호
• /
• pp.338-348
• /
• 2005

최근 IEEE 802.11 무선랜은 광대역 무선접속 네트워크(Broadband Wireless Access Network)를 지원하기 위한 가장 대중화된 통신 프로토콜로 자리매김 하고 있다. 하지만 기존 IEEE 802.11은 다양한 이동환경을 고려해 설계되지 않았기 때문에 핸드오프 과정에서 충분한 서비스의 향상을 가져오기 힘들다. 따라서 본 논문에서는 이러한 IEEE 802.11 무선랜의 핸드오프(Handoff) 과정 중, 주변 AP(Access Point) 탐색 단계에서 새로운 핸드오프 메시지 교환을 통해 최고의 성능을 보장하는 AP를 선택하는 핸드오프 알고리즘을 제안한다. 기존의 AP 탐색과정에서 여러 가지 AS들 중에서 하나를 선택하는 가장 중요한 척도는 신호의 세기였다. 하지만 IEEE 802.11은 공통의 매체를 공유함으로써 채널을 획득하기 위해 경쟁하는 CSMA/CA(Carrier Sensing Multiple Access with Collision Avoidance)를 이용한 다중매체접속방식을 사용하기 때문에, 네트워크의 성능은 신호의 세기와는 별도로 네트워크에 참여하는 노드들의 경쟁 혹은 혼잡에 의해 큰 영향을 받는다. 따라서 이러한 네트워크 수준에서의 정보들을 AP 선택 과정에 반영시킴으로써, 보다 향상된 네트워크 성능을 보장하는 AP를 결정할 수가 있다. 본 논문에서는 이러한 과정들을 포함시킨 핸드오프 알고리즘이 보다 더 좋은 성능을 보여준다는 사실을 실험하고 증명하고자 한다.

• Journal of Korean Neurosurgical Society
• /
• 제60권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.

• 한국경영과학회지
• /
• 제28권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.