Journal articles on the topic 'Retransmissionl'
To see the other types of publications on this topic, follow the link: Retransmissionl.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Retransmissionl.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Cai, Shao Bin, Ping Zhao, Nian Min Yao, and Zhen Guo Gao. "Wireless Broadcasting Retransmission Strategy of most Lost Packets Priority Based on Network Coding." Applied Mechanics and Materials 427-429 (September 2013): 2344–48. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2344.
Full textAbstract:
Combining network coding, a wireless broadcasting retransmission strategyMost Lost Packets Priority is proposed to decrease the number of retransmissions, preferentially consider nodes which have most lost packets, choose the suitable packets to be encoded and retransmission in order to reduce the number of retransmissions, increase network efficiency in wireless network. It is showed in experiment that compared with BENEFIT, MLPP can reduce the average number of retransmissions, and make the average number of retransmissions closer to the preferential number of retransmission and improve the transmission efficiency.
2
Lim, Chansook. "Improving Congestion Control of TCP for Constrained IoT Networks." Sensors 20, no. 17 (August 24, 2020): 4774. http://dx.doi.org/10.3390/s20174774.
Full textAbstract:
For smooth integration with middleboxes on the Internet, TCP (Transmission Control Protocol) is favorably considered as a transport-layer protocol for IoT (Internet of Things) networks. In constrained networks, TCP tends to perform well with a small window size. For example, the uIP (micro IP) TCP/IP stack sets the TCP window size to one segment by default. In such a case, managing the retransmission timer is a primary approach to congestion control. In this paper, we examine the congestion control mechanism of TCP in the uIP stack using grid topology networks. In the preliminary test using the Cooja network simulator, the results show that the original uIP TCP causes lots of retransmissions when a radio duty cycling mechanism such as ContikiMAC is used. One main reason is that, once retransmission is deemed to be necessary, the original uIP TCP sets the retransmission timer based on the fixed RTO (retransmission timeout) before performing a retransmission. Since ContikiMAC may cause large RTT (round-trip time) variations due to the hidden terminal problem, the retransmission timer based on the fixed RTO value may cause lots of retransmissions. To address the problem, we propose a new scheme for managing the retransmission timer which adopts the notion of weak RTT estimation of CoCoA, exponential backoffs with variable limits, and dithering. Simulation results show that our proposed scheme reduces retransmissions while enhancing throughput and fairness when an RDC (radio duty cycling) mechanism is used.
3
Henna, Shagufta, and Muhammad Awais Sarwar. "An Adaptive Backoff Mechanism for IEEE 802.15.4 Beacon-Enabled Wireless Body Area Networks." Wireless Communications and Mobile Computing 2018 (June 26, 2018): 1–15. http://dx.doi.org/10.1155/2018/9782605.
Full textAbstract:
Carrier sense multiple access mechanism with collision avoidance (CSMA/CA) in IEEE 802.15.4-based wireless body area networks (WBANs) may impair the transmission reliability of emergency traffic under high traffic loads, which may result in loss of high valued medical information. Majority of the recent proposals recommend an early retransmission of failed frame while ignoring the history of past failed transmissions. More importantly, these proposals do not consider the number of failed transmissions experienced by each sensor node, thereby affecting the reliability of retransmissions. In this paper, we propose a dynamic retransmission adaptive intelligent MAC (RAI-MAC) scheme. In our proposed scheme retransmission class of each sensor node is decided by the coordinator according to the number of failed transmissions of each node as observed by the coordinator during the last superframe. Based on the retransmission class received from the coordinator, each node adjusts its next backoff value. The proposed scheme increases the probability of successful frame retransmissions without incurring extra overhead. The simulation results prove that the proposed scheme based on its adaptive retransmission mechanism achieves higher average throughput and average end-to-end delay, while not compromising on energy efficiency as compared to the IEEE 802.15.4 and Block Acknowledgment (Block Ack). Moreover, our scheme appears more stable in terms of average throughput, end-to-end delay, and energy efficiency under different values of beacon order (BO) and superframe order (SO).
4
McClellan, Stan, Wuxu Peng, and Ed Gonzalez. "Improving Throughput in SCTP via Dynamic Optimization of Retransmission Bounds." Network Protocols and Algorithms 7, no. 3 (November 30, 2015): 89. http://dx.doi.org/10.5296/npa.v7i3.8228.
Full textAbstract:
The Stream Control Transmission Proto-col (SCTP) is a relatively new transport protocol. Ithas several underlying mechanisms that are similar tothe Transmission Control Protocol (TCP), as well asseveral improvements that are important in certainclasses of applications. The timeout scheme of SCTP,however, is almost identical to that used in TCP.With the dynamics of today’s Internet, that timeoutscheme may be too passive. This paper presents an al-gorithm which dynamically adjusts the overall contextof the retransmission timeout process without chang-ing the fundamental retransmission mechanisms. Thisapproach manages the impact of fast retransmissionsand timeouts to significantly improve the throughputof SCTP applications. The algorithm has been im-plemented and tested in real network environments.Experimental results show that the algorithm avoidsspurious retransmissions and provides better through-put by intelligently managing RTO boundaries andallowing conventional timeout schemes to participatemore actively in the retransmission process.
5
Kasimsetti, Sai Prasanthi, and Asdaque Hussain. "Enhanced packet reordering procedure to improve TCP communication." International Journal of Pervasive Computing and Communications 18, no. 1 (October 24, 2021): 98–113. http://dx.doi.org/10.1108/ijpcc-05-2021-0116.
Full textAbstract:
Purpose The research work is attained by Spurious Transmission–based Enhanced Packet Reordering Method (ST-EPRM). The packet reordering necessity is evaded by presenting random linear network coding process on wireless network physical layer which function on basis of sequence numbers. The spurious retransmission happening over wireless network is obtained by presenting monitoring concept for reducing number of spurious retransmissions because it might need more than three DUPACKs for triggering fast retransmit. This monitoring node performs as centralized node as well variation amid buffer length and number of packets being sent can be predicted. This information helps in differentiating spurious retransmission from the packet loss. Design/methodology/approach Based on transmission detection, action is accomplished whether to retransmit or evade transmission. Monitoring node selection is achieved by presenting improved cuckoo search algorithm. The modified support vector machine algorithm is greatly used for variation-based spurious transmission. Findings The research work which is attained by ST-EPRM. The packet reordering necessity is evaded by presenting random linear network coding process on wireless network physical layer which function on basis of sequence numbers. The spurious retransmission happening over wireless network is obtained by presenting monitoring concept for reducing number of spurious retransmissions because it might need more than three DUPACKs for triggering fast retransmit. This monitoring node performs as centralized node as well variation amid buffer length and number of packets being sent can be predicted. This information helps in differentiating spurious retransmission from the packet loss. Originality/value Based on transmission detection, action is accomplished whether to retransmit or evade transmission. Monitoring node selection is achieved by presenting improved cuckoo search algorithm. The modified support vector machine algorithm is greatly used for variation-based spurious transmission.
6
AbuZeid, Mohamed S., Yasmine A. Fahmy, and Magdy S. El-Soudani. "Adaptive Combined Channel-Network Coding for Cooperative Relay Aided Cognitive Radio Networks." Information 12, no. 8 (August 9, 2021): 320. http://dx.doi.org/10.3390/info12080320.
Full textAbstract:
Cognitive radio (CR) is one of the emerging technologies for 4G/5G applications. Cooperative relay communications and network coding are some techniques that helped in enhancing the CR applications. This paper considers a primary broadcasting system for multimedia video streaming applications that broadcasts data to the primary users and to an aiding cooperative relay CR secondary system. The cooperative overlay secondary system can use many error control coding techniques for point-to-point data retransmissions such as channel coding, network coding, and combined coding techniques to enhance the system performance under variable channel conditions. This work proposes a novel adaptive combined channel network coding (AC2NC) technique for data retransmissions. The new AC2NC first analyses the channel feedback information and then selects the best retransmission coding technique based on the targeted bandwidth or transmission time optimization. This is instead of using a single static channel or network coding technique with dynamic channel conditions. The proposed AC2NC improves the system throughput, decreases the retransmission time, and avails more spectrum access opportunities for the secondary system’s own data transmissions. The AC2NC relative bandwidth and time saving opportunities for CR users can exceed 90% under certain channel conditions versus some static coding techniques.
7
Kundaeli, Herald N. "The analysis of truncated ARQ and HARQ schemes using transition diagrams." International Journal of Engineering, Science and Technology 12, no. 2 (June 1, 2020): 35–51. http://dx.doi.org/10.4314/ijest.v12i2.5.
Full textAbstract:
In digital communication systems, ARQ and HARQ schemes are employed in order to ensure efficient transmission of information and utilisation of the channel by retransmitting information that has not being received correctly at the receiver. In some applications, however, such as real-time services, the quality of information is degraded if too many retransmission trials are employed for each unit of erroneously received information. The retransmissions are therefore limited leading to truncated ARQ and HARQ schemes. In this study we develop a new method for deriving the expressions for the throughput efficiencies of truncated ARQ and HARQ schemes and investigate how the efficiencies vary with the number of allowed retransmissions.
Keywords: ARQ, HARQ, Throughput Efficiency, Truncated ARQ.
8
Jelenković, Predrag R., and Evangelia D. Skiani. "Distribution of the Number of Retransmissions of Bounded Documents." Advances in Applied Probability 47, no. 2 (June 2015): 425–49. http://dx.doi.org/10.1239/aap/1435236982.
Full textAbstract:
Retransmission-based failure recovery represents a primary approach in existing communication networks that guarantees data delivery in the presence of channel failures. Recent work has shown that, when data sizes have infinite support, retransmissions can cause long (-tailed) delays even if all traffic and network characteristics are light-tailed. In this paper we investigate the practically important case of bounded data units 0 ≤ Lb ≤ b under the condition that the hazard functions of the distributions of data sizes and channel statistics are proportional. To this end, we provide an explicit and uniform characterization of the entire body of the retransmission distribution ℙ[Nb > n] in both n and b. Our main discovery is that this distribution can be represented as the product of a power law and gamma distribution. This rigorous approximation clearly demonstrates the coupling of a power law distribution, dominating the main body, and the gamma distribution, determining the exponential tail. Our results are validated via simulation experiments and can be useful for designing retransmission-based systems with the required performance characteristics. From a broader perspective, this study applies to any other system, e.g. computing, where restart mechanisms are employed after a job processing failure.
9
Vien, Quoc-Tuan, Le-Nam Tran, and Huan X. Nguyen. "Efficient ARQ Retransmission Schemes for Two-Way Relay Networks." Journal of Communications Software and Systems 7, no. 1 (March 22, 2011): 9. http://dx.doi.org/10.24138/jcomss.v7i1.182.
Full textAbstract:
In this paper1, we investigate different practical automatic repeat request (ARQ) retransmission protocols for twowaywireless relay networks based on network coding (NC). Theidea of NC is applied to increase the achievable throughput for the exchange of information between two terminals through one relay. Using NC, throughput efficiency is significantly improved due to the reduction of the number of retransmissions. Particularly, two improved NC-based ARQ schemes are designed based on go-back-N and selective-repeat (SR) protocols. The analysis of throughput efficiency is then carried out to find the best retransmission strategy for different scenarios. It is shown that the combination of improved NC-based SR ARQ scheme in the broadcast phase and the traditional SR ARQ scheme in themultiple access phase achieves the highest throughput efficiency compared to the other combinations of ARQ schemes. Finally, simulation results are provided to verify the theoretical analysis.
10
Hakimi, Walid, and Ammar Mahmoud. "Performance Evaluation of Space-Time and Harq Diversity in MIMO HSDPA." International Journal of Mobile Computing and Multimedia Communications 4, no. 3 (July 2012): 71–86. http://dx.doi.org/10.4018/jmcmc.2012070105.
Full textAbstract:
Multi-antenna techniques can be used to achieve improved system performance, including improved system capacity (more users per cell) and improved coverage (possibility for larger cells), as well as improved service provisioning, for example, higher per-user data rates. This study provides an overview of space-time diversity technique using Alamouti codes applied to the 3G evolution. The delays introduced by HARQ retransmission decrease the performance of the HSDPA system. Multi-antenna techniques are specifically applied to HSDPA to avoid HARQ retransmissions. The authors demonstrate that space-time Rake detector in MIMO 2x2 based on Alamouti code without HARQ process could give better performances than MIMO 2x1 taking into account the HARQ context. In the case of MIMO 2x2,they also observed that the limit of retransmissions affects the system performance and efficiency. Using the generalized Alamouti coding technique in MIMO 4x4 with Multipath Parallel Interference Canceller (MPIC) detector, we achieve notable improvement of performance under the same channel and signal to-Noise Ratio (SNR) conditions.
11
Al-Bahadili, Hussein, and Alia Sabri. "A Novel Dynamic Noise-Dependent Probabilistic Algorithm for Route Discovery in MANETs." International Journal of Business Data Communications and Networking 7, no. 1 (January 2011): 52–67. http://dx.doi.org/10.4018/jbdcn.2011010103.
Full textAbstract:
In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and other network services. The most widely used broadcasting algorithm is simple flooding, which aggravates a high number of redundant packet retransmissions, causing contention and collisions. Proper use of dynamic probabilistic algorithm significantly reduces the number of retransmissions, which reduces the chance of contention and collisions. In current dynamic probabilistic algorithm, the retransmission probability (pt) is formulated as a linear/non-linear function of a single variable, the number of first-hop neighbors (k). However, such algorithm is suffers in the presence of noise due to increasing packet-loss. In this paper, the authors propose a new dynamic probabilistic algorithm in which pt is determined locally by the retransmitting nodes considering both k and the noise-level. This algorithm is referred to as the dynamic noise-dependent probabilistic (DNDP) algorithm. The performance of the DNDP algorithm is evaluated through simulations using the MANET simulator (MANSim). The simulation results show that the DNDP algorithm presents higher network reachability than the dynamic probabilistic algorithm at a reasonable increase in the number of retransmissions for a wide range of noise-level. The effects of nodes densities and nodes speeds on the performance of the DNDP algorithm are also investigated.
12
Jelenković, Predrag R., and Evangelia D. Skiani. "Distribution of the Number of Retransmissions of Bounded Documents." Advances in Applied Probability 47, no. 02 (June 2015): 425–49. http://dx.doi.org/10.1017/s0001867800007928.
Full textAbstract:
Retransmission-based failure recovery represents a primary approach in existing communication networks that guarantees data delivery in the presence of channel failures. Recent work has shown that, when data sizes have infinite support, retransmissions can cause long (-tailed) delays even if all traffic and network characteristics are light-tailed. In this paper we investigate the practically important case of bounded data units 0 ≤ L b ≤ b under the condition that the hazard functions of the distributions of data sizes and channel statistics are proportional. To this end, we provide an explicit and uniform characterization of the entire body of the retransmission distribution ℙ[N b > n] in both n and b. Our main discovery is that this distribution can be represented as the product of a power law and gamma distribution. This rigorous approximation clearly demonstrates the coupling of a power law distribution, dominating the main body, and the gamma distribution, determining the exponential tail. Our results are validated via simulation experiments and can be useful for designing retransmission-based systems with the required performance characteristics. From a broader perspective, this study applies to any other system, e.g. computing, where restart mechanisms are employed after a job processing failure.
13
Li, Zhiyuan, Panpan Wu, and Yue Song. "A Fast Reroute Algorithm for Infotainment Service in Internet of Vehicles." International Journal of Distributed Systems and Technologies 7, no. 3 (July 2016): 63–77. http://dx.doi.org/10.4018/ijdst.2016070104.
Full textAbstract:
Failure recovery in Internet of Vehicles (IoVs) is critical to high quality service provisioning. The main challenge is how to achieve fast rerouting without introducing high complexity and resource usage due to the dynamic topology and the constraints on bandwidth. In this paper, we propose a traffic prediction-based fast reroute algorithm for use among the vehicles in IoVs. The proposed algorithm uses the Wavelet Neural Network (WNN) model to predict a vehicle's network traffic. When the predicted value is greater than the predefined network traffic threshold, both Adaptive Retransmission Trigger (ART) that contributes to switch to a better alternate path in advance and trigger efficient retransmission behaviors are enabled successively. Performance comparison of our proposed algorithm with Ant-based Delay-Sensitive Vehicular Routing (AntVehiNet) shows that WNNPFR can: (a) maximize the service data delivery rate by load balancing, (b) provide high quality of service delivery for multimedia streams by switching to a better path towards a target node in advance, (c) reduce useless data retransmissions when various network failures occur, and (d) maintain lower routing overhead.
14
Mahmud, Imtiaz, Geon-Hwan Kim, Tabassum Lubna, and You-Ze Cho. "BBR-ACD: BBR with Advanced Congestion Detection." Electronics 9, no. 1 (January 10, 2020): 136. http://dx.doi.org/10.3390/electronics9010136.
Full textAbstract:
With the aim of improved throughput with reduced delay, Google proposed the bottleneck bandwidth and round-trip time (BBR) congestion control algorithm in 2016. Contrasting with the traditional loss-based congestion control algorithms, it operates without bottleneck queue formation and packet losses. However, we find unexpected behaviour in BBR during testbed experiments and network simulator 3 (NS-3) simulations. We observe huge packet losses, retransmissions, and large queue formation in the bottleneck in a congested network scenario. We believe this is because of BBR’s nature of sending extra data during the bandwidth probing without considering the network conditions, and the lack of a proper recovery mechanism. In a congested network, the sent extra data creates a large queue in the bottleneck, which is sustained due to insufficient drain time. BBR lacks a proper mechanism to detect such large bottleneck queues, cannot comply with the critical congestion situation properly, and results in excessive retransmission problems. Based on these observations, we propose a derivative of BBR, called “BBR with advanced congestion detection (BBR-ACD)”, that reduces the excessive retransmissions without losing the merits. We propose a novel method to determine an actual congestion situation by considering the packet loss and delay-gradient of round-trip time, and implement a proper recovery mechanism to handle such a congestion situation. Through extensive test and NS-3 simulations, we confirmed that the proposed BBR-ACD could reduce the retransmissions by about 50% while improving the total goodput of the network.
15
Mahmood, Rehan, Zulin Wang, and Qin Huang. "Efficient Quantization with Linear Index Coding for Deep-Space Images." Wireless Communications and Mobile Computing 2018 (October 11, 2018): 1–13. http://dx.doi.org/10.1155/2018/6387214.
Full textAbstract:
Due to inevitable propagation delay involved in deep-space communication systems, very high cost is associated with the retransmission of erroneous segments. Quantization with linear index coding (QLIC) scheme is known to provide compression along with robust transmission of deep-space images, and thus the likelihood of retransmissions is significantly reduced. This paper aims to improve its spectral efficiency as well as robustness. First, multiple quantization refinement levels per transmitted source block of QLIC are proposed to increase spectral efficiency. Then, iterative multipass decoding is introduced to jointly decode the subsource symbol-planes. It achieves better PSNR of the reconstructed image as compared to the baseline one-pass decoding approach of QLIC.
16
ZHANG, YING, and MARKUS FROMHERZ. "A ROBUST AND EFFICIENT FLOODING-BASED ROUTING FOR WIRELESS SENSOR NETWORKS." Journal of Interconnection Networks 07, no. 04 (December 2006): 549–68. http://dx.doi.org/10.1142/s0219265906001855.
Full textAbstract:
Flooding protocols for wireless networks in general have been shown to be very inefficient and therefore are mainly used in network initialization or route discovery and maintenance. In this paper, we propose a framework of constrained flooding protocols. The framework incorporates a reinforcement learning kernel, a differential delay mechanism, and a constrained and probabilistic retransmission policy. This type of protocol takes the advantages of robustness from flooding, but maintains energy efficiency by constraining retransmissions. Without the use of any control packets, such a protocol adapts to the specific routing requirements of the task and the dynamic changes of the network. We analyze this framework in simulation using some real-world applications in sensor networks.
17
Ramezanipour, Iran, Hirley Alves, Pedro H. J. Nardelli, and Ari Pouttu. "A Throughput and Energy Efficiency Scheme for Unlicensed Massive Machine Type Communications †." Sensors 20, no. 8 (April 21, 2020): 2357. http://dx.doi.org/10.3390/s20082357.
Full textAbstract:
In this paper, the throughput and energy efficiency of an unlicensed machine type communications network is studied. If an outage event happens in the network, there is a possibility for packet retransmission in order to obtain a lower error probability. The concept of spectrum sharing is used here for modeling the network, which allows the two types of licensed and unlicensed users to share the same uplink channel allocated to the licensed users. However, it is done in a way that no harm is done to the licensed nodes’ transmission for sharing the same channel with the unlicensed users, while licensed nodes’ transmission causes interference on the unlicensed network. Poisson point process is used here to model the location of the nodes and the effect of interference on the network. We study how different factors such as the number of retransmissions, SIR threshold and outage can affect the throughput and energy efficiency of the network. Throughput and energy efficiency are also both studied in constrained optimization problems where the constraints are the SIR threshold and the number of retransmission attempts. We also show why it is important to use limited transmissions and what are the benefits.
18
Zafar, S., and U. Ejaz. "SCTP-aware Link Layer Retransmission Mechanism for Smart-grid Communication Network." Engineering, Technology & Applied Science Research 6, no. 4 (August 26, 2016): 1093–98. http://dx.doi.org/10.48084/etasr.685.
Full textAbstract:
The smart grid delivers electricity from suppliers to consumers and uses bidirectional communication to exchange real-time information between supply system and smart meters at the user end. With a combined communication infrastructure, smart grid manages the operation of all associated components to provide reliable and supportable electricity supply. The Neighborhood Area Network (NAN) of smart grid supports bi-directional data transfer between smart meters (installed at customer premises) and control center of the utility company through an aggregator. This communication suffers low throughput and excessive delays due to the Head of Line (HOL) blocking when the Transmission Control Protocol (TCP) is implemented for reliability. In this paper we propose SCTP-aware Link Layer Retransmission mechanism (SCTP-LLR) which augments the Stream Control Transmission Protocol (SCTP) with Link Layer Retransmissions at the aggregator. SCTP-LLR uses the multi-streaming feature offered by SCTP and implements link layer retransmissions at the aggregator to mitigate the effect of HOL blocking. We carried out simulations using Network Simulator and compared the performance of SCTP-LLR against TCP and SCTP. Our results show that SCTP-LLR outperforms both TCP and SCTP in terms of throughput and packet delays and is a promising protocol to be implemented in smart grid NAN for reliable and efficient communication.
19
Ma, Ruiping, Liudong Xing, and Yujie Wang. "Performance Analysis of Reed-Solomon Codes for Effective Use in Survivable Wireless Sensor Networks." International Journal of Mathematical, Engineering and Management Sciences 5, no. 1 (November 1, 2019): 13–28. http://dx.doi.org/10.33889/ijmems.2020.5.1.002.
Full textAbstract:
In wireless sensor networks, data transmitted over wireless channels can get corrupted or lost due to channel noises and interferences. Error control coding is a technique that enables reliable delivery of digital data over unreliable communication channels. By adding redundancy to the transmitted data, error control codes allow the decoder to recover the original data based on partial data information received. The codes allow the receiver to recover errors or data loss without retransmission, thus making them suitable for applications where retransmissions are costly or impossible. Due to the stringent energy constraint of battery-powered sensor nodes, it is vital to use the energy-efficient error control scheme. In this paper, we evaluate the performance of Reed-Solomon (RS) codes with the objective to optimize their design factors, leading to optimal bit error performance over both Additive White Gaussian Noise (AWGN) channels and Rayleigh fading channels.
20
Anwar, Khola, Taj Rahman, Asim Zeb, Inayat Khan, Mahdi Zareei, and Cesar Vargas-Rosales. "RM-ADR: Resource Management Adaptive Data Rate for Mobile Application in LoRaWAN." Sensors 21, no. 23 (November 30, 2021): 7980. http://dx.doi.org/10.3390/s21237980.
Full textAbstract:
LoRaWAN is renowned and a mostly supported technology for the Internet of Things, using an energy-efficient Adaptive Data Rate (ADR) to allocate resources (e.g., Spreading Factor (SF)) and Transmit Power (TP) to a large number of End Devices (EDs). When these EDs are mobile, the fixed SF allocation is not efficient owing to the sudden changes caused in the link conditions between the ED and the gateway. As a result of this situation, significant packet loss occurs, increasing the retransmissions from EDs. Therefore, we propose a Resource Management ADR (RM-ADR) at both ED and Network Sides (NS) by considering the packet transmission information and received power to address this issue. Through simulation results, RM-ADR showed improved performance compared to the state-of-the-art ADR techniques. The findings indicate a faster convergence time by minimizing packet loss ratio and retransmission in a mobile LoRaWAN network environment.
21
Samano-Robles, Ramiro, and Atilio Gameiro. "Stability Properties of Network Diversity Multiple Access with Multiple-Antenna Reception and Imperfect Collision Multiplicity Estimation." Journal of Computer Networks and Communications 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/984956.
Full textAbstract:
In NDMA (network diversity multiple access), protocol-controlled retransmissions are used to create a virtual MIMO (multiple-input multiple-output) system, where collisions can be resolved via source separation. By using this retransmission diversity approach for collision resolution, NDMA is the family of random access protocols with the highest potential throughput. However, several issues remain open today in the modeling and design of this type of protocol, particularly in terms of dynamic stable performance and backlog delay. This paper attempts to partially fill this gap by proposing a Markov model for the study of the dynamic-stable performance of a symmetrical and non-blind NDMA protocol assisted by a multiple-antenna receiver. The model is useful in the study of stability aspects in terms of the backlog-user distribution and average backlog delay. It also allows for the investigation of the different states of the system and the transition probabilities between them. Unlike previous works, the proposed approach considers the imperfect estimation of the collision multiplicity, which is a crucial process to the performance of NDMA. The results suggest that NDMA improves not only the throughput performance over previous solutions, but also the average number of backlogged users, the average backlog delay and, in general, the stability of random access protocols. It is also shown that when multiuser detection conditions degrade, ALOHA-type backlog retransmission becomes relevant to the stable operation of NDMA.
22
Fanari, Lorenzo, Eneko Iradier, Iñigo Bilbao, Rufino Cabrera, Jon Montalban, and Pablo Angueira. "Comparison between Different Channel Coding Techniques for IEEE 802.11be within Factory Automation Scenarios." Sensors 21, no. 21 (October 29, 2021): 7209. http://dx.doi.org/10.3390/s21217209.
Full textAbstract:
This paper presents improvements in the physical layer reliability of the IEEE 802.11be standard. Most wireless system proposals do not fulfill the stringent requirements of Factory Automation use cases. The harsh propagation features of industrial environments usually require time retransmission techniques to guarantee link reliability. At the same time, retransmissions compromise latency. IEEE 802.11be, the upcoming WLAN standard, is being considered for Factory Automation (FA) communications. 802.11be addresses specifically latency and reliability difficulties, typical in the previous 802.11 standards. This paper evaluates different channel coding techniques potentially applicable in IEEE 802.11be. The methods suggested here are the following: WLAN LDPC, WLAN Convolutional Codes (CC), New Radio (NR) Polar, and Long Term Evolution (LTE)-based Turbo Codes. The tests consider an IEEE 802.11be prototype under the Additive White Gaussian Noise (AWGN) channel and industrial channel models. The results suggest that the best performing codes in factory automation cases are the WLAN LDPCs and New Radio Polar Codes.
23
Bhavadharini, R. M., S. Karthik, N. Karthikeyan, and Anand Paul. "Wireless Networking Performance in IoT Using Adaptive Contention Window." Wireless Communications and Mobile Computing 2018 (July 3, 2018): 1–9. http://dx.doi.org/10.1155/2018/7248040.
Full textAbstract:
Internet of Things (IoT) network contains heterogeneous resource-constrained computing devices which has its unique reputation in IoT environments. In spite of its distinctiveness, the network performance deteriorates by the distributed contention of the nodes for the shared wireless medium in IoT. In IoT network, the Medium Access Control (MAC) layer contention impacts the level of congestion at the transport layer. Further, the increasing node contention at the MAC layer increases link layer frame drops resulting in timeouts at the transport layer segments and the performance of TCP degrades. In addition to that, the expiration of maximum retransmission attempts and the high contentions drive the MAC retransmissions and the associated overheads to reduce the link level throughput and the packet delivery ratio. In order to deal with aforementioned problems, the Adaptive Contention Window (ACW) is proposed, which aims to reduce the MAC overhead and retransmissions by determining active queue size at the contending nodes and the energy level of the nodes to improve TCP performance. Further, the MAC contention window is adjusted according to the node’s active queue size and the residual energy and TCP congestion window is dynamically adjusted based on the MAC contention window. Hence, by adjusting the MAC Adaptive Contention Window, the proposed model effectively distributes the access to medium and assures improved network throughput. Finally, the simulation study implemented through ns-2 is compared with an existing methodology such as Cross-Layer Congestion Control and dynamic window adaptation (CC-BADWA); the proposed model enhances the network throughput with the minimal collisions.
24
Mothku, Sai Krishna, and Rashmi Ranjan Rout. "Adaptive Fuzzy-Based Energy and Delay-Aware Routing Protocol for a Heterogeneous Sensor Network." Journal of Computer Networks and Communications 2019 (January 2, 2019): 1–11. http://dx.doi.org/10.1155/2019/3237623.
Full textAbstract:
In a heterogeneous sensor actor network, packet loss may occur due to bad link quality, overflow of buffer, and low energy levels. Retransmission of the lost packets leads to more energy consumption and delay. Ensuring data reliability and minimum delay requirement while improving energy efficiency are challenging issues in a resource-constrained heterogeneous sensor actor network. In this paper, a fuzzy-based delay and energy-aware intelligent routing mechanism has been proposed to select efficient routes. In the proposed mechanism, routing decisions are taken using a fuzzy logic system by considering network resources, such as residual energy, quality of link, available buffer size, and distance (proximity). In a network, a node with higher residual energy, higher free available buffer, good link quality, and close distance (proximity) gets opportunity to become a next hop node in a routing path. Furthermore, network performance has been analyzed with various network states. Simulation has been carried out using Network Simulator 3 by considering performance metrics, such as delay, number of retransmissions, energy consumption, lifetime, and network stability of the network.
25
Abilov, A. V., A. V. Chunaev, A. I. Nistyuk, and I. A. Kaisina. "Data Transmission Model with Lost Fragments Recovery Based on Application Layer ARQ." Vestnik IzhGTU imeni M.T. Kalashnikova 24, no. 3 (2021): 104–11. http://dx.doi.org/10.22213/2413-1172-2021-3-104-111.
Full textAbstract:
Wireless networks in difficult conditions of signal receiving are characterized by a high level of burst data losses, at which a large number of data fragments can be lost in a row. In this case, to recover the lost data, the use of forward error correction methods (FEC) in most cases does not give a sufficient effect. The use of standard data loss recovery methods based on automatic retransmission request (ARQ) at the data link and transport layers of the OSI model can lead to significant delays, which is often unacceptable for real-time streaming services. In such a case, it may be preferable to skip the piece of data rather than delay waiting for the piece to be delivered on retransmissions. The use of ARQ-based techniques on application layer of OSI model for data streaming allows for a more efficient recovery of lost data chunks in wireless networks with a high level of burst losses. The known models of a discrete channel for wireless networks allow for analytically assessing the probability of data loss, however, they do not take into account cases with retransmission of lost data. The study proposes a mathematical model of data transmission in a wireless communication channel based on the Gilbert model, which takes into account the loss recovery by the ARQ method and allows you to calculate the data loss ratio. To check the adequacy of the proposed model, a software was developed that ensures the transmission of data streaming in a wireless communication network with recovery of fragment losses at the application level, and a corresponding experimental study was carried out. It is shown that the mathematical model takes into account the burstiness of transmitted data losses and their recovery by the ARQ method.
26
Sreekumari, Prasanthi, and Meejeong Lee. "Adjusting the TCP Sending Rate and Retransmissions after Retransmission Timeouts Based on One-Way Queuing Delay in Wireless Mesh Network." Wireless Personal Communications 77, no. 3 (January 31, 2014): 1999–2018. http://dx.doi.org/10.1007/s11277-014-1621-6.
Full text
27
Liu, Hang, Jie Li, and Guang Chen. "High Loss Improved Broadcasting Retransmission Approach Based on Network Coding." Advanced Materials Research 1021 (August 2014): 261–65. http://dx.doi.org/10.4028/www.scientific.net/amr.1021.261.
Full textAbstract:
When the packet loss rate is high in the wireless networks, the performance of network coding wireless broadcasting retransmission scheme becomes worse. Aiming at the problem of network coding wireless broadcasting retransmission scheme, high loss improved broadcasting retransmission approach based on network coding is proposed. Simulation results demonstrate that compared with the traditional wireless broadcasting retransmission scheme and the network coding wireless broadcasting retransmission scheme, high loss improved broadcasting retransmission approach based on network coding can ensure the ensure the reliability and effectiveness of the transmission in wireless broadcasting network.
28
Cho, Hyunchong, Sangdae Kim, Seungmin Oh, Euisin Lee, and Sang-Ha Kim. "Energy-Efficient and Reliable Face-Routing Scheme in Wireless Networks." Sensors 21, no. 8 (April 13, 2021): 2746. http://dx.doi.org/10.3390/s21082746.
Full textAbstract:
Face-routing is one of the reliable recovery schemes when geographic routing fails to transmit data packets. Although studies on face-routing can overcome the failure of the data transmission, they lead to much energy consumption due to frequent data transmissions between adjacent nodes for carrying out the rule of face-routing. To avoid the frequent data transmissions, several face-routing schemes have been recently proposed to transmit data packets to the farthest-neighbor node. However, they happen with many data retransmissions because the farthest-neighbor node has a relatively low transmission success ratio. To solve this problem, we propose a new face-routing scheme that determines the most appropriate neighbor node to balance the trade-off between energy efficiency and transmission reliability with two viewpoints. The first viewpoint focuses on how to increase the distance progress of the data delivery in one-hop range to enhance energy efficiency. After that, the second viewpoint focuses on how to increase the success ratio of the data delivery to enhance the transmission reliability. As a result of the simulation, it was confirmed that the proposed method achieves better performance in terms of energy efficiency than existing face-routing research, and it is better than recent face-routing research in terms of reliability and retransmission.
29
Farhad, Arshad, Dae-Ho Kim, and Jae-Young Pyun. "Resource Allocation to Massive Internet of Things in LoRaWANs." Sensors 20, no. 9 (May 6, 2020): 2645. http://dx.doi.org/10.3390/s20092645.
Full textAbstract:
A long-range wide area network (LoRaWAN) adapts the ALOHA network concept for channel access, resulting in packet collisions caused by intra- and inter-spreading factor (SF) interference. This leads to a high packet loss ratio. In LoRaWAN, each end device (ED) increments the SF after every two consecutive failed retransmissions, thus forcing the EDs to use a high SF. When numerous EDs switch to the highest SF, the network loses its advantage of orthogonality. Thus, the collision probability of the ED packets increases drastically. In this study, we propose two SF allocation schemes to enhance the packet success ratio by lowering the impact of interference. The first scheme, called the channel-adaptive SF recovery algorithm, increments or decrements the SF based on the retransmission of the ED packets, indicating the channel status in the network. The second approach allocates SF to EDs based on ED sensitivity during the initial deployment. These schemes are validated through extensive simulations by considering the channel interference in both confirmed and unconfirmed modes of LoRaWAN. Through simulation results, we show that the SFs have been adaptively applied to each ED, and the proposed schemes enhance the packet success delivery ratio as compared to the typical SF allocation schemes.
30
Matos Mascarenhas, Dalbert, and Igor Monteiro Moraes. "PIF and ReCiF: Efficient Interest-Packet Forwarding Mechanisms for Named-Data Wireless Mesh Networks." Information 9, no. 10 (September 29, 2018): 243. http://dx.doi.org/10.3390/info9100243.
Full textAbstract:
In this paper, we propose three mechanisms to reduce the broadcast storm problem in wireless mesh networks based on the Named-Data Network (NDN) architecture. The goal of our mechanisms is to reduce the number of content requests forwarded by nodes and consequently, increase the network efficiency. The first proposed mechanism, called Probabilistic Interest Forwarding (PIF), randomly forwards content requests. The second mechanism, called Retransmission-Counter-based Forwarding (ReCIF), decides to forward content requests based on the number of retransmissions by adding a counter to the header of requests. The third mechanism, called ReCIF+PIF, combines the features of PIF and ReCIF to suppress content requests. We compare the performance of our mechanisms with both the NDN default forwarding mechanism and the Listen First Broadcast Later (LFBL) mechanism. Our proposals outperform the default NDN forwarding mechanism by up to 21% regarding the data delivery rate in dense networks and provide a 25% lower delivery delay than the default NDN. Our mechanisms accomplish this performance by only reducing the number of content requests forwarded by nodes. One of our mechanisms, PIF, outperforms LFBL regarding the data delivery rate and delivery delay by up to 263% and 55%, respectively, for high network contention levels.
31
Zhi, Wen, and Zhi Hua Hu. "An Improved Adaptive Retransmission of RLP." Advanced Materials Research 791-793 (September 2013): 2062–65. http://dx.doi.org/10.4028/www.scientific.net/amr.791-793.2062.
Full textAbstract:
In this article we focus on SIP session setup delay .It bases on adaptive RLP retransmission mechanism in the previous paper.It proposes a way used RLP retransmission strategy combined with the performance of wireless channels, that i s to say in different chain Road conditions use different RLP retransmission strategy approach. This method not only can complete the RLP adaptive retransmission of SIP messages at the link layer, and can select the appropriate link status of the different RLP retransmission strategy, thus effectively shortening the SIP session establishment delay, end to end QoS for IMS performance improvement. After a simulation experiment, the effectiveness of the proposed algorithm is tested.
32
Khan, Faisal Raisham, and Dr Muhammad Khalil Shahid. "Truncated ARQ Based Cooperative Transmission Initialization." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 13, no. 2 (April 16, 2014): 4183–90. http://dx.doi.org/10.24297/ijct.v13i2.2901.
Full textAbstract:
A communication is energy efficient when the communicating peers are near to each other or where the separating distances are short and the LOS component is a dominant one. The channel conditions in wireless communication vary with respect to time and distance. Let us consider a scenario where a terminal X is communicating to another terminal Y in a shadowed fading environment through an access point (AP) or a base station (BS). Supposing that the terminal X is at the border of the transmission range of BS, any slight movement of the terminal X may result in either degradation of the wireless channel between terminal X and BS or totally getting out of transmission radius of BS. The MAC layer of BS fails to receive the error-free packet as a result. The BS does not send back the ACK packet to the source terminal X. After waiting for a time specified, the source starts retransmitting the packet. If the source terminal does not receive the ACK packet even after a threshold number of retransmissions (RetryLimit), the source discards the packet. An efficient and reliable scheme of retransmission is proposed in this paper by using STBC based relay transmission system. MATLAB is used for simulation purpose and the results generated for direct and cooperative transmissions are compared in terms of the link layer parameter PER.
33
Song, Yeong-Jun, Geon-Hwan Kim, and You-Ze Cho. "BBR-CWS: Improving the Inter-Protocol Fairness of BBR." Electronics 9, no. 5 (May 22, 2020): 862. http://dx.doi.org/10.3390/electronics9050862.
Full textAbstract:
TCP congestion control adjusts the sending rate in order to protect Internet from the continuous traffic and ensure fair coexistence among multiple flows. Especially, loss-based congestion control algorithms were mainly used, which worked relatively well for past Internet with low bandwidth and small bottleneck buffer size. However, the modern Internet uses considerably more sophisticated network equipment and advanced transmission technologies, and loss-based congestion control can cause performance degradation due to excessive queueing delay and packet loss. Therefore, Google introduced a new congestion control in 2016, Bottleneck Bandwidth Round-trip propagation time (BBR). In contrast with traditional congestion control, BBR tries to operate at the Kleinrock’s optimal operating point, where delivery rate is maximized and latency is minimized. However, when BBR and loss-based congestion control algorithms coexist on the same bottleneck link, most of bottleneck bandwidth is occupied by flows that use a particular algorithm, and excessive packet retransmission can occur. Therefore, this paper proposes a BBR congestion window scaling (BBR-CWS) scheme to improve BBR’s inter-protocol fairness with a loss-based congestion control algorithm. Through Mininet experiment results, we confirmed that fairness between BBR-CWS and CUBIC improved up to 73% and has the value of 0.9 or higher in most bottleneck buffer environments. Moreover, the number of packet retransmissions was reduced by up to 96%, compared to the original BBR.
34
Alfouzan, Faisal, Alireza Shahrabi, Seyed Ghoreyshi, and Tuleen Boutaleb. "An Efficient Scalable Scheduling MAC Protocol for Underwater Sensor Networks." Sensors 18, no. 9 (August 25, 2018): 2806. http://dx.doi.org/10.3390/s18092806.
Full textAbstract:
Underwater Sensor Networks (UWSNs) utilise acoustic waves with comparatively lower loss and longer range than those of electromagnetic waves. However, energy remains a challenging issue in addition to long latency, high bit error rate, and limited bandwidth. Thus, collision and retransmission should be efficiently handled at Medium Access Control (MAC) layer in order to reduce the energy cost and also to improve the throughput and fairness across the network. In this paper, we propose a new reservation-based distributed MAC protocol called ED-MAC, which employs a duty cycle mechanism to address the spatial-temporal uncertainty and the hidden node problem to effectively avoid collisions and retransmissions. ED-MAC is a conflict-free protocol, where each sensor schedules itself independently using local information. Hence, ED-MAC can guarantee conflict-free transmissions and receptions of data packets. Compared with other conflict-free MAC protocols, ED-MAC is distributed and more reliable, i.e., it schedules according to the priority of sensor nodes which based on their depth in the network. We then evaluate design choices and protocol performance through extensive simulation to study the load effects and network scalability in each protocol. The results show that ED-MAC outperforms the contention-based MAC protocols and achieves a significant improvement in terms of successful delivery ratio, throughput, energy consumption, and fairness under varying offered traffic and number of nodes.
35
Tiglao, Nestor Michael C., and António M. Grilo. "Caching Based Transport Optimization for Wireless Multimedia Sensor Networks." International Journal of Adaptive, Resilient and Autonomic Systems 5, no. 1 (January 2014): 30–48. http://dx.doi.org/10.4018/ijaras.2014010103.
Full textAbstract:
Traditional transport layer protocols have been designed to perform end-to-end error control transparently to the intermediate nodes (e.g., TCP). To address the severe resource constraints featured by Wireless Sensor Networks (WSN), new paradigms have been developed such as intermediate caching where intermediate nodes are able to cache packets and if possible retransmit them on-demand to avoid incurring costly end-to-end retransmissions. Lately, Wireless Multimedia Sensor Network (WMSN) has been considered as a new research area whereby WSNs are targeted for the delivery of multimedia traffic. In this paper, we propose a NACK-based repair mechanism coupled with an adaptive MAC layer retransmission scheme in order to improve the performance of caching-based WMSN transport protocols. Specifically, our goal is to be able to reduce real-time end-to-end delay while maintaining reliability and energy efficiency in the presence of high channel error rates. Our simulation results show that the ensemble of both mechanisms provides better good put performance while simultaneously improving energy efficiency. Furthermore, the improved protocol also achieves lower deadline miss ratios making it suitable for multimedia transport. While we demonstrate the effectiveness of the mechanisms by incorporating them into the basic Distributed Transport for Sensor Networks (DTSN) protocol, they are generic enough to be applicable to other WSN and WMSN transport protocols.
36
Sun, Wei, Geng Xin Zhang, and Liang Gou. "Network-Coding-Based Broadcasting Retransmission Approach in Satellite Communications." Advanced Materials Research 546-547 (July 2012): 1302–7. http://dx.doi.org/10.4028/www.scientific.net/amr.546-547.1302.
Full textAbstract:
In satellite communications, it is often necessary to broadcast large data to terrestrial users. Because the satellite channel is a typical fading channel, packets can’t be correctly received. Therefore, retransmission is necessary. This paper proposes a network-coding-based broadcasting retransmission approach, whose key idea is to combine different lost packets with network coding to achieve minimum number of retransmission. Simulation results indicate that compared with existing approaches, network-coding-based broadcasting retransmission approach can effectively reduce average number of transmissions.
37
Ryu, Won-Jae, Jae-Woo Kim, Soo-Young Shin, and Dong-Seong Kim. "On the Performance Evaluations of Cooperative Retransmission Scheme for Cell-Edge Users of URLLC in Multi-Carrier Downlink NOMA Systems." Sensors 21, no. 21 (October 24, 2021): 7052. http://dx.doi.org/10.3390/s21217052.
Full textAbstract:
Non-orthogonal multiple access (NOMA) has a key feature that the cell-center user (CCU) has prior information about the messages of the cell-edge user (CEU) in the same user-pair. It means that CCU can be used for retransmission when the CEU requests retransmission. As ultra-reliability and low-latency communication (URLLC) requires high-reliability constraints (e.g., 99.999%), using CCU for retransmission can be useful to satisfy the reliability constraint. In this study, to ensure the reliability of CEU, cooperative retransmission (CR) scheme for downlink NOMA systems is proposed. And the CR scheme is evaluated with Block error rate (BLER) considering reliability and with packet loss rate (PLR) in terms of reliability and latency constraints. And the evaluation results showed that the proposed CR scheme can satisfy the target BLER for URLLC low SNR compared to the conventional retransmission scheme, and showed the improved PLR compared to the conventional retransmission scheme in low SNRs.
38
Chua, Alton Y. K., Cheng-Ying Tee, Augustine Pang, and Ee-Peng Lim. "The Retransmission of Rumor and Rumor Correction Messages on Twitter." American Behavioral Scientist 61, no. 7 (June 2017): 707–23. http://dx.doi.org/10.1177/0002764217717561.
Full textAbstract:
This article seeks to examine the relationships among source credibility, message plausibility, message type (rumor or rumor correction) and retransmission of tweets in a rumoring situation. From a total of 5,885 tweets related to the rumored death of the founding father of Singapore Lee Kuan Yew, 357 original tweets without an “RT” prefix were selected and analyzed using negative binomial regression analysis. The results show that source credibility and message plausibility are correlated with retransmission. Also, rumor correction tweets are retweeted more than rumor tweets. Moreover, message type moderates the relationship between source credibility and retransmission as well as that between message plausibility and retransmission. By highlighting some implications for theory and practice, this article concludes with some limitations and suggestions for further research.
39
Sutton, Jeannette, C. Ben Gibson, Nolan Edward Phillips, Emma S. Spiro, Cedar League, Britta Johnson, Sean M. Fitzhugh, and Carter T. Butts. "A cross-hazard analysis of terse message retransmission on Twitter." Proceedings of the National Academy of Sciences 112, no. 48 (November 16, 2015): 14793–98. http://dx.doi.org/10.1073/pnas.1508916112.
Full textAbstract:
For decades, public warning messages have been relayed via broadcast information channels, including radio and television; more recently, risk communication channels have expanded to include social media sites, where messages can be easily amplified by user retransmission. This research examines the factors that predict the extent of retransmission for official hazard communications disseminated via Twitter. Using data from events involving five different hazards, we identity three types of attributes—local network properties, message content, and message style—that jointly amplify and/or attenuate the retransmission of official communications under imminent threat. We find that the use of an agreed-upon hashtag and the number of users following an official account positively influence message retransmission, as does message content describing hazard impacts or emphasizing cohesion among users. By contrast, messages directed at individuals, expressing gratitude, or including a URL were less widely disseminated than similar messages without these features. Our findings suggest that some measures commonly taken to convey additional information to the public (e.g., URL inclusion) may come at a cost in terms of message amplification; on the other hand, some types of content not traditionally emphasized in guidance on hazard communication may enhance retransmission rates.
40
Chua, Alton, and Xiaoyu Chen. "Rumor Retransmission on Twitter: Message Characteristics, user Characteristics and Retransmission Outcomes." Journal of Digital Information Management 18, no. 1 (February 1, 2019): 21. http://dx.doi.org/10.6025/jdim/2020/18/1/21-32.
Full text
41
Laurindo, Suelen, Ricardo Moraes, Carlos Montez, and Francisco Vasques. "Combining Network Coding and Retransmission Techniques to Improve the Communication Reliability of Wireless Sensor Network." Information 12, no. 5 (April 24, 2021): 184. http://dx.doi.org/10.3390/info12050184.
Full textAbstract:
This paper addresses the use of network coding algorithms combined with adequate retransmission techniques to improve the communication reliability of Wireless Sensor Networks (WSN). Basically, we assess the recently proposed Optimized Relay Selection Technique (ORST) operating together with four different retransmission techniques, three of them applying network coding algorithms. The target of this assessment is to analyze the impact upon the communication reliability from each of the proposed retransmission techniques for WSN applications. In addition, this paper presents an extensive state-of-the-art study in what concerns the use of network coding techniques in the WSN context. The initial assumption of this research work was that the ORST operating together network coding would improve the communication reliability of WNS. However, the simulation assessment highlighted that, when using the ORST technique, retransmission without network coding is the better solution.
42
Nassar, Badr Oulad, and Takuji Tachibana. "Physical Impairment Aware Virtual Optical Network Construction Algorithm with Service Differentiation in Elastic Optical Networks." International Journal of Sensors, Wireless Communications and Control 9, no. 4 (September 17, 2019): 468–79. http://dx.doi.org/10.2174/2210327909666190207154346.
Full textAbstract:
Background: Elastic optical networks can support high data bit rates efficiently with its flexible wavelength grid, and with virtual optical networks, network resources can be managed simply. However, the signal may be deteriorated by the physical impairments. Therefore, service differentiation techniques have to consider the physical impairments. Objective: We propose a novel virtual optical network construction algorithm that provides service differentiation. Moreover, the effect of physical impairments is considered before constructing a virtual optical network. The goal of the proposed algorithm is to provide service differentiation in terms of the rejection rate of virtual optical network requests. Here, we consider the on-line scenario where the traffic is not known in advance. Methods: In the proposed method, each virtual optical network comprises two nodes and a lightpath between the two nodes. In our proposed method, service differentiation is provided by giving a higher (lower) acceptance rate for high (low) priority users. This method consists of four mechanisms; signaling mechanism, physical impairment estimation mechanism, resource check mechanism, and retransmission mechanism. Numerical Results: We evaluate by simulation the performance of the proposed method in NSFNET and European topologies. Analysis of the rejection rate as function of network load, impact of the network load on the number of retransmissions, and impact of network topology were discussed. Numerical results show that our method not only provides service differentiation but also reduces the overall rejection rate. Conclusion: We can conclude that our method is efficient compared to the conventional methods considering the scenario and topologies analyzed.
43
Ma, Naji, and Ming Diao. "CoFi: Coding-Assisted File Distribution over a Wireless LAN." Symmetry 11, no. 1 (January 10, 2019): 71. http://dx.doi.org/10.3390/sym11010071.
Full textAbstract:
The wireless channel is volatile in nature, due to various signal attenuation factors including path-loss, shadowing, and multipath fading. Existing media access control (MAC) protocols, such as the widely adopted 802.11 wireless fidelity (Wi-Fi) family, advocate masking harsh channel conditions with persistent retransmission and backoff, in order to provide a packet-level best-effort service. However, the asymmetry of the network environment of client nodes in space is not fully considered in the method, which leads to the decline of the transmission efficiency of the good ones. In this paper, we propose CoFi, a coding-assisted file distribution protocol for 802.11 based wireless local area networks (LANs). CoFi groups data into batches and transmits a random linear combination of packets within each batch, thereby reducing redundant packet and acknowledgement (ACK) retransmissions when the channel is lossy. In addition, CoFi adopts a MAC layer caching scheme that allows clients to store the overheard coded packets and use such cached packets to assist nearby peers. With this measure, it further improves the effective throughput and shortens the buffering delay when running applications such as bulk data transmission and video streaming. Our trace based simulation demonstrates that CoFi can maintain a similar level of packet delay to 802.11, but increases the throughput performance by a significant margin in a lossy wireless LAN. Furthermore, we perform a reverse-engineering on CoFi and 802.11 using a simple analytical framework, proving that they asymptotically approach different fairness measures, thus resulting in a disparate performance.
44
Jelenković, Predrag R., and Evangelia D. Skiani. "Retransmissions over correlated channels." ACM SIGMETRICS Performance Evaluation Review 41, no. 2 (August 27, 2013): 15–25. http://dx.doi.org/10.1145/2518025.2518028.
Full text
45
Lu, Mei-Hsuan, Peter Steenkiste, and Tsuhan Chen. "Opportunistic Retransmission in WLANs." IEEE Transactions on Mobile Computing 11, no. 12 (December 2012): 1953–69. http://dx.doi.org/10.1109/tmc.2011.227.
Full text
46
Ludwig, R., and K. Sklower. "The Eifel retransmission timer." ACM SIGCOMM Computer Communication Review 30, no. 3 (July 2000): 17–27. http://dx.doi.org/10.1145/382179.383014.
Full text
47
Yun, Sangki, Hyogon Kim, and Kun Tan. "Towards Zero Retransmission Overhead: A Symbol Level Network Coding Approach to Retransmission." IEEE Transactions on Mobile Computing 10, no. 8 (August 2011): 1083–95. http://dx.doi.org/10.1109/tmc.2010.248.
Full text
48
Shin, Sangung, Jin-Ku Kang, and Yongwoo Kim. "A Design and Implementation of MIPI A-PHY Retransmission(RTS) Layer." Journal of the Institute of Electronics and Information Engineers 59, no. 6 (June 30, 2022): 81–88. http://dx.doi.org/10.5573/ieie.2022.59.6.81.
Full text
49
Sámano-Robles, Ramiro. "A Space-Time Correlation Model for MRC Receivers in Rayleigh Fading Channels." Technologies 8, no. 3 (July 22, 2020): 41. http://dx.doi.org/10.3390/technologies8030041.
Full textAbstract:
This paper presents a statistical model for maximum ratio combining (MRC) receivers in Rayleigh fading channels enabled with a temporal combining process. This means that the receiver effectively combines spatial and temporal branch components. Therefore, the signals that will be processed by the MRC receiver are collected not only across different antennas (space), but also at different instants of time. This suggests the use of a retransmission, repetition or space-time coding algorithm that forces the receiver to store signals in memory at different instants of time. Eventually, these stored signals are combined after a predefined or dynamically optimized number of time-slots or retransmissions. The model includes temporal correlation features in addition to the space correlation between the signals of the different components or branches of the MRC receiver. The derivation uses a frequency domain approach (using the characteristic function of the random variables) to obtain closed-form expressions of the statistics of the post-processing signal-to-noise ratio (SNR) under the assumption of equivalent correlation in time and equivalent correlation in space. The described methodology paves the way for the reformulation of other statistical functions as a frequency-domain polynomial root analysis problem. This is opposed to the infinite series approach that is used in the conventional methodology using directly the probability density function (PDF). The results suggest that temporal diversity is a good complement to receivers with limited spatial diversity capabilities. It is also shown that this additional operation could be maximized when the temporal diversity is adaptive (i.e., activated by thresholds of SNR), thus leading to a better resource utilization.
50
Send, Uwe, Lloyd Regier, and Brent Jones. "Use of Underwater Gliders for Acoustic Data Retrieval from Subsurface Oceanographic Instrumentation and Bidirectional Communication in the Deep Ocean." Journal of Atmospheric and Oceanic Technology 30, no. 5 (May 1, 2012): 984–98. http://dx.doi.org/10.1175/jtech-d-11-00169.1.
Full textAbstract:
Abstract Many fixed oceanographic instruments and observing systems are deployed in the water column or on the seafloor for extended periods of time without any expression at the sea surface. To routinely communicate with such subsurface instruments in the deep ocean, here a system is presented that uses underwater gliders and commercially available acoustic modems for this task and its use is demonstrated with subsurface moorings and inverted echo sounders plus bottom pressure sensor (PIES). One recent glider mission spent 31 days in data retrieval dives, capturing 2 MB of error-free subsurface data. To acquire this volume, a total of 2.65 MB (including all retransmissions) were sent, with a success rate of 75%. A model for the energy usage of each phase of modem function was derived from laboratory measurements. While the model predicts that the glider would expend 0.21 J to acquire each data byte, the actual consumption of the glider in the field is 0.49 J byte−1. The inefficiency is due to overhead associated with establishment of the acoustic link and with the resending of data that is received with errors. Including all the time for negotiating the acoustic link and for the retransmission of erroneous data, the net data throughput are around 3 bytes s−1 in spite of the modem operating at 140 to 600 baud. Even with these limitations, the technique has shown to be useful and is being utilized routinely in a research project in the California Current to obtain data from horizontal distances up to 7 km from an instrument at depths up to 4000 m, transferring on average 6 kB of data in a day of acoustic communications.