• Title/Summary/Keyword: 802.11a

Search Result 1,337, Processing Time 0.031 seconds

CRP-CMAC: A Priority-Differentiated Cooperative MAC Protocol with Contention Resolution for Multihop Wireless Networks

  • Li, Yayan;Liu, Kai;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2636-2656
    • /
    • 2013
  • To improve the cooperative efficiency of node cooperation and multiple access performance for multihop wireless networks, a priority-differentiated cooperative medium access control protocol with contention resolution (CRP-CMAC) is proposed. In the protocol, the helper selection process is divided into the priority differentiation phase and the contention resolution phase for the helpers with the same priority. A higher priority helper can choose an earlier minislot in the priority differentiation phase to send a busy tone. As a result, the protocol promptly selects all the highest priority helpers. The contention resolution phase of the same priority helpers consists of k round contention resolution procedures. The helpers that had sent the first busy tone and are now sending the longest busy tone can continue to the next round, and then the other helpers that sense the busy tone withdraw from the contention. Therefore, it can select the unique best helper from the highest priority helpers with high probability. A packet piggyback mechanism is also adopted to make the high data rate helper with packet to send transmit its data packets to its recipient without reservation. It can significantly decrease the reservation overhead and effectively improve the cooperation efficiency and channel utilization. Simulation results show that the maximum throughput of CRP-CMAC is 74%, 36.1% and 15% higher than those of the 802.11 DCF, CoopMACA and 2rcMAC protocols in a wireless local area network (WLAN) environment, and 82.6%, 37.6% and 46.3% higher in an ad hoc network environment, respectively.

A Solution for Congestion and Performance Enhancement using Dynamic Packet Bursting in Mobile Ad Hoc Networks (모바일 애드 혹 네트워크에서 패킷 버스팅을 이용한 혼잡 해결 및 성능향상 기법)

  • Kim, Young-Duk;Yang, Yeon-Mo;Lee, Dong-Ha
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.409-414
    • /
    • 2008
  • In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

Contents Routing in the OpenFlow-based Wireless Mesh Network Environment (OpenFlow기반 무선 메쉬 네트워크 환경에서의 컨텐츠 라우팅)

  • Kim, Won-Suk;Chung, Sang-Hwa;Choi, Hyun-Suk;Do, Mi-Rim
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.810-823
    • /
    • 2014
  • The wireless mesh network based on IEEE 802.11s provides a routing based on a destination address as it inherits legacy internet architecture. However, this architecture interested in not 'what' which is originally the users goal but 'where'. Futhermore, because of the rapid increase of the number of mobile devices recently, the mobile traffic increases geometrically. It reduces the network effectiveness as increasing many packets which have same payload in the situation of many users access to the same contents. In this paper, we propose an OpenFlow-based contents routing for the wireless mesh network(WMN) to solve this problem. We implement contents layer to the legacy network layer which mesh network uses and the routing technique based on contents identifier for efficient contents routing. In addition we provide flexibility as we use OpenFlow. By using this, we implement caching technique to improve effectiveness of network as decreasing the packet which has same payload in WSN. We measure the network usage to compare the flooding technique, we measure the delay to compare environment using caching and non caching. As a result of delay measure it shows 20% of performance improve, and controller message decrease maximum 89%.

Modeling End-to-End Throughput of Multiple Flows and Efficient Route Selection in Wireless Mesh Networks (무선 메쉬 네트워크에서의 다중 트래픽 흐름을 위한 종단간 처리량 모델링 및 효율적인 라우팅 경로 선택 기법)

  • Wang, Xiaofei;Kwon, Ted Tae-Kyoung;Choi, Yang-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.272-283
    • /
    • 2010
  • Wireless Mesh Networks (WMNs) have gained a lot of attention recently. Based on the characteristic of WMNs as a highly connected wireless infrastructure, many efforts from research organizations are made in order to improve the performance of the flow throughput in WMNs. Therefore, it is very critical issue to establish efficient routing paths for multiple concurrent ongoing flows. In this paper, we propose a general modeling methodology to analyze the end-to-end throughput of multiple concurrent flows by analytical calculation taking into account the carrier sensing behaviors, interference and the IEEE 802.11 Distributed Coordination Function mechanism. After the comparison of the average service time for each successful transmission at each node, we analyze the bottlenecks of flows, and hence obtain the maximum end-to-end throughput of them. By using our proposed model, it is possible to predicate the throughput of several candidate routing paths for multiple concurrent ongoing data flows, so we can select the most efficient route that can achieve the highest throughput. We carry out simulations with various traffic patterns of multiple flows in WMNs to validate our modeling and our efficient route selection mechanism.

Radix-4 Trellis Parallel Architecture and Trace Back Viterbi Decoder with Backward State Transition Control (Radix-4 트렐리스 병렬구조 및 역방향 상태천이의 제어에 의한 역추적 비터비 디코더)

  • 정차근
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.5
    • /
    • pp.397-409
    • /
    • 2003
  • This paper describes an implementation of radix-4 trellis parallel architecture and backward state transition control trace back Viterbi decoder, and presents the application results to high speed wireless LAN. The radix-4 parallelized architecture Vietrbi decoder can not only improve the throughput with simple structure, but also have small processing delay time and overhead circuit compared to M-step trellis architecture one. Based on these features, this paper addresses a novel Viterbi decoder which is composed of branch metric computation, architecture of ACS and trace back decoding by sequential control of backward state transition for the implementation of radix-4 trellis parallelized structure. With the proposed architecture, the decoding of variable code rate due to puncturing the base code can easily be implemented by the unified Viterbi decoder. Moreover, any additional circuit and/or peripheral control logic are not required in the proposed decoder architecture. The trace back decoding scheme with backward state transition control can carry out the sequential decoding according to ACS cycle clock without additional circuit for survivor memory control. In order to evaluate the usefulness, the proposed method is applied to channel CODEC of the IEEE 802.11a high speed wireless LAN, and HDL coding simulation results are presented.

Adaptive Power Saving Mechanism of Low Power Wake-up Receivers against Battery Draining Attack (배터리 소모 공격에 대응하는 저전력 웨이크업 리시버의 적응형 파워 세이빙 메커니즘)

  • So-Yeon Kim;Seong-Won Yoon;Il-Gu Lee
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.3
    • /
    • pp.393-401
    • /
    • 2024
  • Recently, the Internet of Things (IoT) has been widely used in industries and daily life that directly affect human safety, life, and assets. However, IoT devices, which need to meet low-cost, lightweight, and low-power requirements, face a significant problem of shortened battery lifetime due to battery draining attacks and interference. To solve this problem, the 802.11ba standard for the Wake-up Receiver (WuR) has emerged, this feature is playing a crucial role in minimizing energy consumption. However, the WuR protocol did not consider security mechanisms in order to reduce latency and overhead. Therefore, in this study, anAdaptive Power Saving Mechanism (APSM) is proposed for low-power WuR to counter battery draining attacks. APSM can minimize abnormally occurring power consumption by exponentially increasing power-saving time in environments prone to attacks. According to experimental results, the proposed APSM improved energy consumption efficiency by a minimum of 13.77% compared to the traditional Legacy Power Saving Mechanism (LPSM) when attack traffic ratio is 10% or more of the total traffic.

An SDN-based Bandwidth Control Scheme considering Traffic Variation in the Virtualized WLAN Environment (가상화된 WLAN 환경에서 트래픽 변화를 고려한 SDN 기반 대역폭 제어 기법)

  • Moon, Jaewon;Chung, Sanghwa
    • Journal of KIISE
    • /
    • v.43 no.11
    • /
    • pp.1223-1232
    • /
    • 2016
  • A virtual network technology can provide a network reflecting the requirements of various services. The virtual network can distribute resources of the physical network to each virtual slice. An efficient resource distribution technique is needed to reflect the requirements of various services. Existing bandwidth distribution techniques can only control downlink traffic without taking traffic conditions on the network into account. Downlink and uplink share the same resources in a wireless network. The existing bandwidth distribution techniques assumed that all stations generate saturated traffic. Therefore, the existing bandwidth distribution technique cannot make traffic isolation in a virtual wireless network. In this paper, we proposed a traffic-based bandwidth control techniques to solve these problems. We applied Software-Defined Networking(SDN) to the virtual wireless network, monitored the traffic at each station, and searched for stations that generated unsaturated traffic. We also controlled both uplink and downlink traffics dynamically based on monitoring information. Our system can be implemented with legasy 802.11 clients and SDN-enabled APs. After the actual test bed configuration, it was compared to existing techniques. As a result, the distribution performance of the proposed technique was improved by 14% in maximum.

Preparation, Structure, and Property of Re(Nar)$(PR_3)_2Cl_3$, $(PR_3 = PMe_3, PEt_3, P(Ome)_3;Ar = C_6H_5, 2,6-i-Pr_2-C_6H_3)$

  • 박병규;최남선;이순우
    • Bulletin of the Korean Chemical Society
    • /
    • v.20 no.3
    • /
    • pp.314-320
    • /
    • 1999
  • Several bisphosphine- and bisphosphite-substituted Re-imido complexes have been prepared from Re(NPh)(PPh3)2Cl3, 1, and Re(N-C6H3-i-Pr2)2Cl3(py), 4. Compound 1 reacted with trimethyl phosphate (P(OMe)3) to give a mixture of two isomers,mer,trans-Re(NPh)(P(OMe)3)2Cl3, 2, and fac,cis-Re(NPh)(P(OMe)3)2Cl3, 2a. In this reaction, the mer,trans-isomer is a major product. Complex 1 also reacted with triethylphosphine (PEt3) to exclusively give mertrans-Re(NPh)(PEt3)2Cl3, 3. Compound 4 reacted with trimethylphosphine (PMe3) to give mer,trans-Re(N-C6H3-i-Pr2)(PMe3)2Cl3, 5, which was converted to mer-Re(N-C6H3-i-Pr2)(PMe)(OPMe3)Cl3, 6, on exposure to air. Crystallographic data for 2: monoclinic space group P21/n, a = 8.870(2) Å, b = 14.393(3) Å, c = 17.114(4) Å, β = 101.43(2)°, Z = 4, R(wR2) = 0.0521(0.1293). Crystallographic data for 5: orthorhombic space group P212121, a = 11.307(l) Å, b = 11.802(l) Å, c = 19.193(2) Å, Z = 4, R(wR2) = 0.0250(0.0593). Crystallographic data for 6: orthorhombic space group P212121, a = 14.036(4) Å, b = 16.486(5) Å, c = 11.397(3) Å, Z = 4, R(wR2) = 0.0261(0.0630).

Throughput Performance analysis of AMC based on New SNR Estimation Algorithm using Preamble (프리앰블을 이용한 새로운 SNR 추정 알고리즘 기반의 AMC 기법의 전송률 성능 분석)

  • Seo, Chang-Woo;Portugal, Sherlie;Hwang, In-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.4
    • /
    • pp.6-14
    • /
    • 2011
  • The fast growing of the number of users requires the development of reliable communication systems able to provide higher data rates. In order to meet those requirements, techniques such as Multiple Input Multiple Out (MIMO) and Orthogonal Frequency Division multiplexing (OFDM) have been developed in the recent years. In order to combine the benefits of both techniques, the research activity is currently focused on MIMO-OFDM systems. In addition, for a fast wireless channel environment, the data rate and reliability can be optimized by setting the modulation and coding adaptively according to the channel conditions; and using sub-carrier frequency, and power allocation techniques. Depending on how accurate the feedback-based system obtain the channel state information (CSI) and feed it back to the transmitter without delay, the overall system performance would be poor or optimal. In this paper, we propose a Signal to Noise Ratio (SNR) estimation algorithm where the preamble is known for both sides of the transciever. Through simulations made over several channel environments, we prove that our proposed SNR estimation algorithm is more accurate compared with the traditional SNR estimation. Also, We applied AMC on several channel environments using the parameters of IEEE 802.11n, and compared the Throughput performance when using each of the different SNR Estimation Algorithms. The results obtained in the simulation confirm that the proposed algorithm produces the highest Throughput performance.

A Study on Secure Encoding for Visible Light Communication Without Performance Degradation (가시광 통신에서 성능 저하 없는 보안 인코딩 연구)

  • Kim, Minchul;Suh, Taeweon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.1
    • /
    • pp.35-42
    • /
    • 2022
  • Visible light communication (VLC) is a method of transmitting data through LED blinking and is vulnerable to eavesdropping because the illumination affects the wide range of area. IEEE standard 802.15.7 defines On-Off Keying (OOK), Variable Pulse Position Modulation (VPPM), and Color Shift Keying (CSK) as modulation. In this paper, we propose an encryption method in VPPM for secure communication. The VPPM uses an encoding method called 4B6B where 16 different outputs are represented with 6-bit. This paper extends the number of outputs to 20, to add complexity while not violating the 4B6B generation conditions. Then each entry in the extended 4B6B table is scrambled using vigenère cipher. The probability of decrypting each 6-bit data is $\frac{1}{20}$. Eavesdropper should perform $\sum\limits_{k=1}^{n}20^k$ number of different trials to decrypt the message if the number of keys is n. The proposed method can be applied to OOK of PHY II and CSK of PHY III. We further discuss the secure encoding that can be used in OOK and CSK without performance degradation.