• Title/Summary/Keyword: channel list

Search Result 48, Processing Time 0.022 seconds

On Routing Protocol and Metric for Multiradio Multichannel WMNs: Survey and Design Considerations (Multiradio Multichannel WMNs의 라우팅 프로토콜 및 메트릭: 연구 및 설계 고려 사항)

  • Gao, Hui;Lee, Hyung-Ok;Nam, Ji-Seung
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2012.01a
    • /
    • pp.105-108
    • /
    • 2012
  • Wireless mesh networks are considered a promising solution to last mile broadband. The unique characteristics of WMN impose unique requirements on designing routing protocols and metrics for WMN. However, existing routing schemes that are designed for single-channel multi-hop wireless networks may lead to inefficient routing paths in multichannel. This paper focuses on the routing problem for multi-radio multichannel WMNs. We list the challenges in designing routing algorithms for multi-radio multichannel WMNs. Then we examine the requirements and considerations for designing routing metrics according to the characteristics of multi-radio multichannel WMNs. Finally we survey and investigate the existing routing metrics in terms of their ability to satisfy these requirements.

  • PDF

Improved MSI Based Scheduling and Admission Control Algorithm for IEEE 802.l1e Wireless LAN (IEEE 802.l1e 무선랜에서 MSI를 이용한 개선된 스케줄링 및 수락제어 알고리즘)

  • Yang, Geun-Hyuk;Ok, Chi-Young;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.99-109
    • /
    • 2007
  • IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

A Herbological Study on the Plants of Boraginaceae in Korea (한국산 지치과 식물에 관한 본초학적 연구)

  • Lee, Soong-In;Jeon, Ui-Sang;Jeong, Jong-Gil
    • The Korea Journal of Herbology
    • /
    • v.35 no.6
    • /
    • pp.1-9
    • /
    • 2020
  • Objective : For the purpose of developing Boraginaceae plants recorded in Korean Herbology in Korea, the literatures of the successive generations have been thoroughly investigated to prepare this article. Methods : Books and research papers about Herbology which published at Korea and other countries were examined. Results : A list was made about Boraginaceae plant which were cultivated or grew naturally in Korea, after investigated the data on domestic and foreign Boraginaceae plants. Boraginaceae(grew in Korea) were divided into 14 classes with 24 species. Out of those, 6 classes with 9 species were found serviceable which indicates 37.5% of all. Out of all 24 species of Boraginaceae family, Trigonotis genus were found 5 species, which were shown the most. Among 3 genus of Lithospermum species, medicinal plants were all one species each. Out of all serviceable parts in Boraginaceae, Herb·Radix·Fructus parts took first place as 3 species. There are 2 species toxic, the survey said. 3 Classifying medicinal plants among the Borginaceae plants by part, whole herbs, roots, and fruits are found to be 3 separate species each. When it comes to the nature of taste, 5 kinds of taste without action and seven kinds of bitter taste are the most common. For channel tropism, liver channel has the largest number of 5 types. Conclusion : There were totaled to 14 genera and 24 species in Boraginaceae in Korea and among them medicinal plants are 6 genera, 9 species, some 37.5% in total.

A Herbological Study on the plants of Convolvulaceae in the Korean (한국산 메꽃과 식물에 관한 본초학적 연구)

  • Jeong, Jae-Hoon;Jeong, Jong-Gil
    • The Korea Journal of Herbology
    • /
    • v.36 no.5
    • /
    • pp.47-57
    • /
    • 2021
  • Objective : For the purpose of developing Convoivulaceae plants recorded in Korean Herbology in Korea, the literatures of the successive generations have been thoroughly investigated to prepare this article. Methods : Books and research papers about Herbology which published at Korea and other countries were examined. Results : A list was made about Convoivulaceae plant which were cultivated or grew naturally in Korea, after investigated the data on domestic and foreign Convoivulaceae plants. Convoivulaceae(grew in Korea) were divided into 6 classes with 18 species. Out of those, 6 classes with 13 species were found serviceable which indicates approximately 72% of all. Out of all 18 species of Convoivulaceae family, Calystegia genus were found 6 species, which were shown the most. Among 4 genus of Calystegia species, medicinal plants were all one species each. Out of all serviceable parts in Convoivulaceae, Herb·Radix·Tuber·Semen·Flower·Stem and Folium parts took first place as 8 species. There are 2 species toxic, the survey said. 6 Classifying medicinal plants among the Convoivulaceae plants by part, whole Herbs are found to be 8 separate species each. When it comes to the nature of taste, 10 kinds of taste without action and 7 kinds of sweet taste are the most common. For channel tropism, kidney channel has the largest number of 7 types. Conclusion : A total of 6 genera and 18 species of Convoivulaceae was found in the Korean among which 6 genera and 13 species(approximately 72%) were medicinal plants. Two species toxic drugs were detected.

Fully parallel low-density parity-check code-based polar decoder architecture for 5G wireless communications

  • Dinesh Kumar Devadoss;Shantha Selvakumari Ramapackiam
    • ETRI Journal
    • /
    • v.46 no.3
    • /
    • pp.485-500
    • /
    • 2024
  • A hardware architecture is presented to decode (N, K) polar codes based on a low-density parity-check code-like decoding method. By applying suitable pruning techniques to the dense graph of the polar code, the decoder architectures are optimized using fewer check nodes (CN) and variable nodes (VN). Pipelining is introduced in the CN and VN architectures, reducing the critical path delay. Latency is reduced further by a fully parallelized, single-stage architecture compared with the log N stages in the conventional belief propagation (BP) decoder. The designed decoder for short-to-intermediate code lengths was implemented using the Virtex-7 field-programmable gate array (FPGA). It achieved a throughput of 2.44 Gbps, which is four times and 1.4 times higher than those of the fast-simplified successive cancellation and combinational decoders, respectively. The proposed decoder for the (1024, 512) polar code yielded a negligible bit error rate of 10-4 at 2.7 Eb/No (dB). It converged faster than the BP decoding scheme on a dense parity-check matrix. Moreover, the proposed decoder is also implemented using the Xilinx ultra-scale FPGA and verified with the fifth generation new radio physical downlink control channel specification. The superior error-correcting performance and better hardware efficiency makes our decoder a suitable alternative to the successive cancellation list decoders used in 5G wireless communication.

Development of Documentation System in Hospital-based Home Health - in one general hospital in the U.S.A. - (병원중심 가정간호 기관의 기록체계개발 - 미국 일개 종합병원을 대상으로 -)

  • Kang Chang-Hee
    • Journal of Korean Public Health Nursing
    • /
    • v.6 no.2
    • /
    • pp.58-69
    • /
    • 1992
  • The purposes of this study were 1) to assess the currunt documentation system 2) to identify the problems in communication regarding to documentation 3) to develop new documentation system 4) to suggest effective communication channel using new documentation system Research was conducted by direct observation, chart review, staffs interview and servey. Results were as follows: 1) nursing care plans were not used in ongoing care 2) documentation format was primarily narrative and charting was time consuming 3) documentation did not reflect the nursing process 4) patient records were not used as effective communication tool between case manager and part time nurse 5) difficult access to patient record for nurse manager created inefficiency in coordinating 6) documentation of patient education did not describe the precise contents of education, and the responses of the patients and evaluation To solve these problems, new documentation format was developed. With new formats nurses : 1) use standardized care plan which contains nursing diagnosis, ecpected outcome, time frame for evaluation, flow sheet for updating the plans 2) leave one copy of care plan at patient home for mutual agreement with patent and communication among nursing staffs 3) carry one copy of care plan for updating 4) document and evaluate the patient education using education check list keeping in patient's home 5) document nursing process in focus charting visit report 6) carry one copy of visit report 7) have one copy of visit report which was deligated to part time nurses 8) use documentation in direct communication with part time nurse 9) use beeper and memo to promote communication

  • PDF

Fast Group Scanning Scheme in IEEE 802.16e Networks (IEEE 802.16e에서 그룹 기반의 빠른 스캐닝 기법)

  • Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6A
    • /
    • pp.624-634
    • /
    • 2008
  • The mobile station which is about to do handover in IEEE 802.16e networks scans its neighboring base station channels to decide its next target base station. However, due to the lack of location information of its subscribers, the serving base station cannot provide any reliable candidate channel which is actually attachable by the scanning mobile stations, which makes the mobile station suffer from the long scanning time. Sometimes, long scanning time may cause the degradation of quality of service due to repeatable scan-duration or failure to start the handover procedure in time. To overcome these problems, in this paper, we propose a new protocol so called fast group scanning scheme, in which multiple mobile stations form a group to scan their neighboring base station channels simultaneously. Main contribution of this proposal is to find and decide a reliable target base station within a short scanning time. The fast group scanning scheme can be deployed to the cell network of the serving base station with a dynamic neighboring base station list management.

PR-Management and Branding of Media Channels with the Application of Social Networks

  • Shalman, Tatiana;Dobrianska, Viktoriia;Kokhan, Marianna;Pletsan, Khrystyna;Humenchuk, Anatolii
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.70-76
    • /
    • 2021
  • The relevance of intelligence involves the definition of such communication systems of PR-management and branding of media channels with the use of social networks, which are already implemented in practice by modern representatives of professional PR product. The purpose of the investigation is to determine the system of implementation of technologies of PR-management and branding of media channels with the use of social networks based on a survey of PR and brand of different media channels on the basis of a survey of brand managers and PR. 980 respondents from Ukraine took part in the survey. The survey was conducted on the Google-forms platform. The results outline a list of the most popular social networks and messengers for the implementation of PR management and branding technologies, including Facebook, Twitter, Google, LinkedIn, Tumblr; Telegram, WhatsApp, Viber, Skype. It is determined that the criteria of branding analysis are informativeness, centralization/distribution, content, feedback intensity. Identified 2 prospects for the development of branding in an interactive media environment (creation of a presentation system; integration of websites of social media and companies in universal centers). The criteria of general importance of the factors influencing the behavioral intention of consumers to use social media channels are presented (satisfaction, accessibility, perceived usefulness, trust, ease of use, attitude, social influence, self-efficacy). The meaning of the content of social media channels (public, informational and communication) is indicated. The practical significance of the study was to present the links between the criteria, development prospects and the values of branding factors.

Multiple Node Flip Fast-SSC Decoding Algorithm for Polar Codes Based on Node Reliability

  • Rui, Guo;Pei, Yang;Na, Ying;Lixin, Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.2
    • /
    • pp.658-675
    • /
    • 2022
  • This paper presents a fast-simplified successive cancellation (SC) flipping (Fast-SSC-Flip) decoding algorithm for polar code. Firstly, by researching the probability distribution of the number of error bits in a node caused by channel noise in simplified-SC (SSC) decoder, a measurement criterion of node reliability is proposed. Under the guidance of the criterion, the most unreliable nodes are firstly located, then the unreliable bits are selected for flipping, so as to realize Fast-SSC-Flip decoding algorithm based on node reliability (NR-Fast-SSC-Flip). Secondly, we extended the proposed NR-Fast-SSC-Flip to multiple node (NR-Fast-SSC-Flip-ω) by considering dynamic update to measure node reliability, where ω is the order of flip-nodes set. The extended algorithm can correct the error bits in multiple nodes, and get good performance at medium and high signal-to-noise (SNR) region. Simulation results show that the proposed NR-Fast-SSC-Flip decoder can obtain 0.27dB and 0.17dB gains, respectively, compared with the traditional Fast-SSC-Flip [14] and the newly proposed two-bit-flipping Fast-SSC (Fast-SSC-2Flip-E2) [18] under the same conditions. Compared with the newly proposed partitioned Fast-SSC-Flip (PA-Fast-SSC-Flip) (s=4) [18], the proposed NR-Fast-SSC-Flip-ω (ω=2) decoder can obtain about 0.21dB gain, and the FER performance exceeds the cyclic-redundancy-check (CRC) aided SC-list (CRC-SCL) decoder (L=4).

A Study on the Improvement of Archival Content Services in the Museum of Performing Arts of the National Theater of Korea through Comparisons and Analyses of UK and US Performing Arts Archives (영미권 공연예술아카이브 비교·분석을 통한 국립극장 공연예술박물관 기록정보콘텐츠 개선 방안 연구)

  • Kyunghan, Oh;Geon Kim
    • Journal of Korean Society of Archives and Records Management
    • /
    • v.23 no.4
    • /
    • pp.1-24
    • /
    • 2023
  • At present, domestic archives within the realm of performing arts predominantly focus on recording through videos, yet they often lack comprehensive documentation of crucial production processes and content services. Recognizing the contemporary significance of archival content services, this study analyzes the archival content within the national performing arts archives websites of the United Kingdom and the United States, serving as international benchmarks. The findings extrapolate insights and implications to propose enhancements for the Museum of Performing Arts in the National Theater of Korea. The analysis focused mainly on the missions and visions on the websites, examining 107 contents from the UK National Theater, 27 from the United States, and 9 from Korea. The suggested improvements encompass clarifying target users and execution tasks in the mission and vision statements, fostering expert collaborations, incorporating preview features, curating content with a single theme, and organizing a comprehensive list on the National Theater's YouTube channel.