• Title/Summary/Keyword: multi-channel MAC

Search Result 92, Processing Time 0.028 seconds

A Multi-Dimensional Node Pairing Scheme for NOMA in Underwater Acoustic Sensor Networks (수중 음향 센서 네트워크에서 비직교 다중 접속을 위한 다차원 노드 페어링 기법)

  • Cheon, Jinyong;Cho, Ho-Shin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.6
    • /
    • pp.1-10
    • /
    • 2021
  • The interest in underwater acoustic sensor networks (UWASNs), along with the rapid development of underwater industries, has increased. To operate UWASNs efficiently, it is important to adopt well-designed medium access control (MAC) protocols that prevent collisions and allow the sharing of resources between nodes efficiently. On the other hand, underwater channels suffer from a narrow bandwidth, long propagation delay, and low data rate, so existing terrestrial node pairing schemes for non orthogonal multiple access (NOMA) cannot be applied directly to underwater environments. Therefore, a multi-dimensional node pairing scheme is proposed to consider the unique underwater channel in UWASNs. Conventional NOMA schemes have considered the channel quality only in node pairing. Unlike previous schemes, the proposed scheme considers the channel gain and many other features, such as node fairness, traffic load, and the age of data packets to find the best node-pair. In addition, the sender employs a list of candidates for node-pairs rather than path loss to reduce the computational complexity. The simulation results showed that the proposed scheme outperforms the conventional scheme by considering the fairness factor with 23.8% increases in throughput, 28% decreases in latency, and 5.7% improvements in fairness at best.

Reconfigurable FIR Filter for Dynamic Variation of Filter Order and Filter Coefficients

  • Meher, Pramod Kumar;Park, Sang Yoon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.3
    • /
    • pp.261-273
    • /
    • 2016
  • Reconfigurable finite impulse response (FIR) filters whose filter coefficients and filter order change dynamically during run-time play an important role in the software defined radio (SDR) systems, multi-channel filters, and digital up/down converters. However, there are not many reports on such reconfigurable designs which can support dynamic variation of filter order and filter coefficients. The purpose of this paper is to provide an architectural solution for the FIR filters to support run-time variation of the filter order and filter coefficients. First, two straightforward designs, namely, (i) single-MAC based design and (ii) full-parallel design are presented. For large variation of the filter order, two designs based on (iii) folded structure and (iv) fast FIR algorithm are presented. Finally, we propose (v) high throughput design which provides significant advantage in terms of hardware and/or time complexities over the other designs. We compare complexities of all the five structures, and provide the synthesis results for verification.

Performance Evaluation of Network Coding in MANETs for Bidirectional Traffic (MANETs에서 양방향 트래픽에 대한 네트워크 코딩기법의 성능 평가)

  • Kim, Kwan-Woong;Kim, Yong-Kab;Bae, Sung-Hwan;Kim, Dae-Ik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.3
    • /
    • pp.491-497
    • /
    • 2012
  • Network coding is that the nodes can combine and mix the packets rather than merely forward them. Therefore, network coding is expected to improve throughput and channel efficiency in the wireless network. Relevant researches have been carried out to adapt network coding to wireless multi-hop network. In this paper, we designed the network coding for bidirectional traffic service in routing layer and IP layer of Ad-hoc network. From the simulation result, the traffic load and the end to end distance effect the performance of the network coding. As end to end distance and the traffic load become larger, the gain of network coding become more increased.

A Dynamic Queue Management for Network Coding in Mobile Ad-hoc Network

  • Kim, Byun-Gon;Kim, Kwan-Woong;Huang, Wei;Yu, C.;Kim, Yong K.
    • International journal of advanced smart convergence
    • /
    • v.2 no.1
    • /
    • pp.6-11
    • /
    • 2013
  • Network Coding (NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. NC has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Many researches have been carried out to employ network coding to wireless ad-hoc network. In this paper, we proposed a dynamic queue management to improve coding opportunistic to enhance efficiency of NC. In our design, intermediate nodes are buffering incoming packets to encode queue. We expect that the proposed algorithm shall improve encoding rate of network coded packet and also reduce end to end latency. From the simulation, the proposed algorithm achieved better performance in terms of coding gain and packet delivery rate than static queue management scheme.

A Design of Voice Over Sensor Network (VoSN) Base Station with Multi-Channel Support (다중 채널을 지원하는 Voice over Sensor Network(VoSN) Base Station 설계)

  • Lee, Hoon Jae;Lee, Jae Hyoung;Kang, Min Soo;Cho, Sung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.1
    • /
    • pp.90-96
    • /
    • 2014
  • IEEE802.15.4 that is a standard for sensor networks is mainly used the wireless personal area networks such as ZigBee networks and it features low-power, low-speed data communication. However, recently research for interworking sensor network based voice communication and Session Initiation Protocol (SIP) for long-range, multi-user support has been actively conducted. In this paper, we designed a integrated base station based existing systems for interworking sensor networks based voice communication and SIP. We measured number of packet and delay according to increase the number of users to evaluate the performance of designed Base Station.

TCP Fairness Improvement Scheme using Adaptive Contention Window in Wireless Mesh Networks (무선 메쉬 네트워크에서 적응적 경쟁 윈도우를 이용한 TCP Fairness 개선 방안)

  • Jang, In Sik;Min, Seok Hong;Kim, Bong Gyu;Choi, Hyung Suk;Lee, Jong Sung;Kim, Byung Chul;Lee, Jae Yong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.3
    • /
    • pp.322-331
    • /
    • 2013
  • Wireless Mesh Networks(WMNs) is generally composed of radio nodes in the mesh topology. WMNs consists of mesh client, mesh router and gateway connected to a wired network. Each client and router relay messages to the gateway for communication. WMNs is widely used recently in many areas can provide extended coverage based on multi-hop communication and ubiquitous communication at any time and any location. However the competition and collision between each node to transmit data is inevitable when the same channel is used for transmission. The transmission opportunities and the throughput of nodes located far from gateway decrease more if the communication channel is accessed based on competitive CSMA/CA scheme using DCF(Distributed Coordination Function) provided by IEEE 802.11 MAC. In this paper, we improve the performance of the TCP fairness and throughput of the nodes with more than 2 hops by applying various algorithms for controlling contention window values. Also, we evaluate the performance using ns-2 simulator, According to the results, proposed scheme can enhance the fairness characteristic of each node irrespective of data to the gateway.

Exploiting Multi-Hop Relaying to Overcome Blockage in Directional mmWave Small Cells

  • Niu, Yong;Gao, Chuhan;Li, Yong;Su, Li;Jin, Depeng
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.364-374
    • /
    • 2016
  • With vast amounts of spectrum available in the millimeter wave (mmWave) band, small cells at mmWave frequencies densely deployed underlying the conventional homogeneous macrocell network have gained considerable interest from academia, industry, and standards bodies. Due to high propagation loss at higher frequencies, mmWave communications are inherently directional, and concurrent transmissions (spatial reuse) under low inter-link interference can be enabled to significantly improve network capacity. On the other hand, mmWave links are easily blocked by obstacles such as human body and furniture. In this paper, we develop a multi-hop relaying transmission (MHRT) scheme to steer blocked flows around obstacles by establishing multi-hop relay paths. In MHRT, a relay path selection algorithm is proposed to establish relay paths for blocked flows for better use of concurrent transmissions. After relay path selection, we use a multi-hop transmission scheduling algorithm to compute near-optimal schedules by fully exploiting the spatial reuse. Through extensive simulations under various traffic patterns and channel conditions, we demonstrate MHRT achieves superior performance in terms of network throughput and connection robustness compared with other existing protocols, especially under serious blockage conditions. The performance ofMHRT with different hop limitations is also simulated and analyzed for a better choice of the maximum hop number in practice.

Resource Allocation in Spectrum Sharing ad-hoc Cognitive Radio Networks Based on Game Theory: An Overview

  • Abdul-Ghafoor, Omar B.;Ismail, Mahamod;Nordin, Rosdiadee;El-Saleh, Ayman Abd
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.2957-2986
    • /
    • 2013
  • The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

Hierarchical Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

  • Ahn, Kye-Hyun;Han, Kyeong-Eun;Kim, Young-Chon
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.321-331
    • /
    • 2004
  • In this paper, we propose a new dynamic bandwidth allocation (DBA) algorithm for multimedia services over Ethernet PONs (passive optical networks). The proposed algorithm is composed of a low-level scheduler in the optical network unit (ONU) and a high-level scheduler in the optical line terminal (OLT). The hierarchical DBA algorithm can provide expansibility and efficient resource allocation in an Ethernet PON system in which the packet scheduler is separated from the queues. In the proposed DBA algorithm, the OLT allocates bandwidth to the ONUs in proportion to the weight associated with their class and queue length, while the ONU preferentially allocates its bandwidth to queues with a static priority order. The proposed algorithm provides an efficient resource utilization by reducing the unused remaining bandwidth caused by the variable length of the packets. We also define the service classes and present control message formats conforming to the multi-point control protocol (MPCP) over an Ethernet PON. In order to evaluate the performance, we designed an Ethernet PON system on the basis of IEEE 802.3ah "Ethernet in the first mile" (EFM) using OPNET and carried out simulations. The results are analyzed in terms of the channel utilization, queuing delay, and ratio of the unused remaining bandwidth.

  • PDF

A Reservation-based HWMP Routing Protocol Design Supporting E2E Bandwidth in TICN Combat Wireless Network (TICN 전투무선망에서의 종단간 대역폭을 보장하는 예약 기반 HWMP 라우팅 프로토콜 설계)

  • Jung, Whoi Jin;Min, Seok Hong;Kim, Bong Gyu;Choi, Hyung Suk;Lee, Jong Sung;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.2
    • /
    • pp.160-168
    • /
    • 2013
  • In tactical environment, tactical wireless networks are generally comprised of Tactical MANETs(T-MANETs) or Tactical WMNs(T-WMNs). The most important services in tactical network are voice and low rate data such as command control and situation awareness. These data should be forwarded via multi-hop in tactical wireless networks. Urgent and mission-critical data should be protected in this environment, so QoS(Quality of Service) must be guaranteed for specific type of traffic for satisfying the requirement of a user. In IEEE 802.11s, TDMA-based MAC protocol, MCCA(MCF Controlled Channel Access), has a function of resource reservation. But 802.11s protocol can not guarantee the end-to-end QoS, because it only supports reservation with neighbors. In this paper, we propose the routing protocol, R-HWMP(Reservation-based HWMP) which has the resource reservation to support the end-to-end QoS. The proposed protocol can reserve the channel slots and find optimal path in T-WMNs. We analyzed the performance of the proposed protocol and showed that end-to-end QoS is guaranteed using NS-2 simulation.