• Title/Summary/Keyword: store and forward

Search Result 77, Processing Time 0.036 seconds

A Review of Contemporary Teleaudiology: Literature Review, Technology, and Considerations for Practicing

  • Kim, Jinsook;Jeon, Seungik;Kim, Dokyun;Shin, Yerim
    • Journal of Audiology & Otology
    • /
    • v.25 no.1
    • /
    • pp.1-7
    • /
    • 2021
  • The scope of teleaudiology has been noted with telehealth due to Coronavirus disease (COVID-19) recently. As the notion has been around us for more than 20 years ever since 1999, it is necessary to perceive the knowledge accurately and prepare for the successful implementation of it. Therefore, the literature review including screening and diagnostic audiometry, cochlear implants and hearing aids, and aural rehabilitation, telecommunications technology regarding several fields of teleaudiology, and considerations for practicing were identified. Although overall internet-based audiological services showed benefits in terms of outcome and accessibility, uncertainties of cost-effectiveness, the optimal level of support, and a need for further studies of many aspects for teleaudiology has arisen. In the view of technology, the store-and-forward (asynchronous/hybrid) and a real-time (synchronous) methods were introduced with one applied and nine registered patents recorded from 2004 to 2020 for the invention of teleaudiology in the United States. Also, 10 checklists were suggested for planning teleaudiology practice from prior experience in hosting the teleaudiology program. Conclusively, it is hoped that this review sheds light on recognizing and improving the existing teleaudiology services and helps overcome the challenges faced in the era of pandemic and untact world to come.

Enhancing VANET Security: Efficient Communication and Wormhole Attack Detection using VDTN Protocol and TD3 Algorithm

  • Vamshi Krishna. K;Ganesh Reddy K
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.1
    • /
    • pp.233-262
    • /
    • 2024
  • Due to the rapid evolution of vehicular ad hoc networks (VANETs), effective communication and security are now essential components in providing secure and reliable vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. However, due to their dynamic nature and potential threats, VANETs need to have strong security mechanisms. This paper presents a novel approach to improve VANET security by combining the Vehicular Delay-Tolerant Network (VDTN) protocol with the Deep Reinforcement Learning (DRL) technique known as the Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm. A store-carry-forward method is used by the VDTN protocol to resolve the problems caused by inconsistent connectivity and disturbances in VANETs. The TD3 algorithm is employed for capturing and detecting Worm Hole Attack (WHA) behaviors in VANETs, thereby enhancing security measures. By combining these components, it is possible to create trustworthy and effective communication channels as well as successfully detect and stop rushing attacks inside the VANET. Extensive evaluations and simulations demonstrate the effectiveness of the proposed approach, enhancing both security and communication efficiency.

PRI: A Practical Reputation-based Incentive Scheme for Delay Tolerant Networks

  • Zhang, Xi;Wang, Xiaofei;Liu, Anna;Zhang, Quan;Tang, Chaojing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.973-988
    • /
    • 2012
  • Delay tolerant networks (DTNs) characterized by the lack of guaranteed end-to-end paths exploit opportunistic data forwarding mechanism, which depends on the hypothesis that nodes are willing to store, carry, and forward the in-transit messages in an opportunistic way. However, this hypothesis might easily be violated by the presence of selfish nodes constrained with energy, bandwidth, and processing power. To address this problem, we propose a practical reputation-based incentive scheme, named PRI, to stimulate honest forwarding and discipline selfish behavior. A novel concept of successful forwarding credential and an observation protocol are presented to cope with the detection of nodes' behavior, and a reputation model is proposed to determine egoistic individuals. The simulation results demonstrate the effectiveness and practicality of our proposal.

Case and value on the Prada's fashion communications through art marketing (아트마케팅을 기반으로 한 프라다의 패션커뮤니케이션 유형과 가치)

  • Kim, Sun Young
    • The Research Journal of the Costume Culture
    • /
    • v.22 no.2
    • /
    • pp.258-272
    • /
    • 2014
  • This study aims at comprehending the characteristics of fashion communications through case study about an art marketing that Prada develops in the field of modern fashion and providing theoretical materials on creativity-based art marketing and communication spread as expression strategy for brand philosophy and personality. For its research method, theoretical study was reviewed about art marketing and Prada's fashion philosophy and then cases on Prada's art marketing were analyzed according to their types. Prada's types in their art marketing are classified into several groups: support of art foundation and artists, differentiation via flagship store, application of image fashion, exhibition project, and cooperative work with different realms. From the above marketing strategies, we can find the values in that the brand image imbedded in enterprises with culture and art was contributable to set up the brand identity, that they were much beneficial to continuous activation for fashion culture and art fields, and that fashion communications of artistic emotion based on challenge and innovation were proposed. This fashion communication in Prada via way of art marketing is not just expression of Prada's luxury fashion brand but willingness to make their unique style from different facades. This also suggests the orientation that modern fashion should look forward to in finding a new way through cooperative relationship with other fields.

An Efficient Context-aware Opportunistic Routing Protocol (효율적인 상황 인지 기회적 라우팅 프로토콜)

  • Seo, Dong Yeong;Chung, Yun Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2218-2224
    • /
    • 2016
  • Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

OTP: An Overlay Transport Protocol for End-to-end Congestion and Flow Control in Overlay Networks

  • Kim, Kyung-Hoe;Kim, Pyoung-Yun;Youm, Sung-Kwan;Seok, Seung-Joon;Kang, Chul-Hee
    • Journal of IKEEE
    • /
    • v.11 no.4
    • /
    • pp.331-339
    • /
    • 2007
  • The problem of architecting a reliable transport system across an overlay network using split TCP connections as the transport primitive is mainly considered. The considered overlay network uses the application-level switch in each intermediate host. We first argue that natural designs based on store-and-forward principles that are maintained by split TCP connections of hop-by-hop approaches. These approaches in overlay networks do not concern end-to-end TCP semantics. Then, a new transport protocol-Overlay Transport Protocol (OTP)-that manages the end-to-end connection and is responsible for the congestion/flow control between source host and destination host is proposed. The proposed network model for the congestion and flow control mechanisms uses a new window size-Ownd-and a new timer in the source host and destination host. We validate our analytical findings and evaluate the performance of our OTP using a prototype implementation via simulation.

  • PDF

A Channel Allocation and Data Delivery Scheme Considering Channel Overlapping in Wireless Tactical Networks (군 전술망의 무선 이동 통신 체계의 통신 범위 중첩을 고려한 채널 할당 기법과 데이터 전달 기법)

  • Shin, Hyun-Sup;Chae, Sung-Yoon;Kang, Kyung-Ran;Cho, Young-Jong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.3
    • /
    • pp.501-508
    • /
    • 2011
  • In this paper, we propose a channel allocation algorithm of MSAP(Mobile Subscriber Access Point) and data delivery scheme exploiting the symbol level network coding. The network is comprised of TS(Tactical Switch) as a backbone node, MSAPs, and TMFTs(Tactical Multi-Function Terminal). The TS performs the channel allocation considering the communication range overlapping between the neighboring MSAPs and applies the symbol level network coding, if necessary, depending on the position of the TMFTs. Assuming the number of available antennas of TMFT and MSAP will be extended to two from one, we propose two schemes: single mode and dual mode. Through the simulation, we show that the proposed delivery scheme provides higher delivery ratio and lower delivery delay compared with the legacy store-and-forward scheme.

OQMCAR: An enhanced network coding-aware routing algorithm based on queue state and local topology

  • Lu, Cunbo;Xiao, Song;Miao, Yinbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2875-2893
    • /
    • 2015
  • Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

FARS: A Fairness-aware Routing Strategy for Mobile Opportunistic Networks

  • Ma, Huahong;Wu, Honghai;Zheng, Guoqiang;Ji, Baofeng;Li, Jishun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.1992-2008
    • /
    • 2018
  • Mobile opportunistic network is a kind of ad hoc networks, which implements the multi-hop routing communication with the help of contact opportunity brought about by the mobility of the nodes. It always uses opportunistic data transmission mode based on store-carry-forward to solve intermittent connect problem of link. Although many routing schemes have been proposed, most of them adopt the greedy transmission mode to pursue a higher delivery efficient, which result in unfairness extremely among nodes. While, this issue has not been paid enough attention up to now. In this paper, we analyzed the main factors that reflect fairness among nodes, modeled routing selection as a multiple attribute decision making problem, and proposed our Fairness-aware Routing Strategy, named FARS. To evaluate the performance of our FARS, extensive simulations and analysis have been done based on a real-life dataset and a synthetic dataset, respectively. The results show that, compared with other existing protocols, our FARS can greatly improve the fairness of the nodes when ensuring the overall delivery performance of the network.

Performance Evaluation for a Unicast Vehicular Delay Tolerant Routing Protocol Networks

  • Abdalla, Ahmed Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.167-174
    • /
    • 2022
  • Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.