检索结果-内蒙古大学图书馆

Modeling and Analysis of the TXOPLimit Efficiency with the packet fragmentation in an IEEE 802.11e-EDCA Network Under Noise-Related Losses

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第2期95卷 1505-1530页

作者： Yazid, Mohand Aissani, Djamil Bouallouche-Medjkoune, Louiza Univ Bejaia Fac Exact Sci Res Unit LaMOS Modeling & Optimizat Syst Bejaia 06000 Algeria

Analytical modeling and performance study of the Enhanced Distributed Channel Access (EDCA) function of the IEEE 802.11e standard has been the topic of various works available in the literature. Nevertheless, the packet fragmentation (PF) conceived by the IEEE 802.11 work group for decreasing the effect of noise-related losses on the performances of IEEE 802.11 networks, has not at all been taken into account in the analytical models proposed for evaluating the performance of the Opportunity Transmission Limit (TXOPLimit), which is a key parameter of the EDCA function for a Differentiated Service in an IEEE 802.11e network. While, the PF can be employed with the TXOPLimit, in order to boost the efficiency of the Contention Free Burst of both Voice and Video streams under noise-related losses. In this paper, we aim at extending the Markov chain models proposed for the IEEE 802.11e-EDCA network, in order to especially model the TXOPLimit, the PF and the packet Error Rate. Besides, we elaborate a mathematical model to compute the saturation throughput of Access Categories, Voice, Video, Best Effort and Background. The achieved numerical results indicate, for the first time that, the PF permits boosting the TXOPLimit efficiency under noise-related losses. Thus, the saturation throughputs of both Voice and Video access categories are substantially enhanced.

关键词： IEEE 802.11e-EDCA network TXOPLimit packet fragmentation Noise-related losses Modeling Markov chains Throughput analysis

来源：评论

学校读者我要写书评

暂无评论

packet fragmentation and Reassembly in Molecular Communication

IEEE TRANSACTIONS ON NANOBIOSCIENCE

引用

IEEE TRANSACTIONS ON NANOBIOSCIENCE 2016年第3期15卷 284-288页

作者： Furubayashi, Taro Nakano, Tadashi Eckford, Andrew Okaie, Yutaka Yomo, Tetsuya Osaka Univ Grad Sch Frontier Biosci 2-2 Yamadaoka Suita Osaka 5650871 Japan York Univ Dept Elect Engn & Comp Sci Toronto ON M3J 1P3 Canada Osaka Univ Grad Sch Informat Sci & Technol 2-2 Yamadaoka Suita Osaka 5650871 Japan

This paper describes packet fragmentation and reassembly to achieve reliable molecular communication among bionanomachines. In the molecular communication described in this paper, a sender bionanomachine performs packet fragmentation, dividing a large molecular message into smaller pieces and embedding into smaller molecular packets, so that molecular packets have higher diffusivity to reach the receiver bionanomachine. The receiver bionanomachine then performs packet reassembly to retrieve the original molecular message from a set of molecular packets that it receives. To examine the effect of packet fragmentation and reassembly, we develop analytical models and conduct numerical experiments. Numerical results show that packet fragmentation and reassembly can improve the message delivery performance. Numerical results also indicate that packet fragmentation and reassembly may degrade the performance in the presence of drift in the environment.

关键词： Bionanomachine molecular communication packet fragmentation packet reassembly

来源：评论

学校读者我要写书评

暂无评论

Modeling and performance study of the packet fragmentation in an IEEE 802.11e-EDCA network over fading channel

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2015年第21期74卷 9507-9527页

作者： Yazid, Mohand Sahki, Nassim Bouallouche-Medjkoune, Louiza Aissani, Djamil Univ Bejaia Lab Modeling & Optimizat Syst LAMOS Bejaia 06000 Algeria

Mathematical modeling and performance analysis of the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) has been the subject of several research papers published in the literature. However, the packet fragmentation (PF) which has been proposed by the IEEE work group in the legacy IEEE 802.11 standard, has never been taken into account in the mathematical models available in the literature, in order to analyze the performance of the IEEE 802.11e-EDCA network under the influence of the packet Error Rate (PER). Yet, the packet fragmentation is the only existing solution since 1999, which allows reducing the influence of the PER on the performance of IEEE 802.11 networks. In this paper, we aim at showing for the first time, how the packet fragmentation developed in the legacy IEEE 802.11 standard can be used to enhance the current IEEE 802.11e Quality of Service (QoS). Therefore, we propose an extension of the existing Markov chain models of the IEEE 802.11e EDCA function, in order to take into account the packet Error Rate and packet fragmentation. Furthermore, we develop a mathematical model to derive the saturation throughput of a given Access Category (AC), namely: Voice (VO), Video (VI), Best Effort (BE) and Background (BK). The obtained analytical results show that, applying the packet fragmentation on the IEEE 802.11e-EDCA network, allows improving the utilization of the scarce wireless bandwidth under the impact of PER parameters, namely: Bit Error Rate (BER) and packet length.

关键词： IEEE 802.11e-EDCA network packet fragmentation Noisy channel Markov chains Modeling Throughput analysis

来源：评论

学校读者我要写书评

暂无评论

Full-Duplex Cognitive Radio with packet fragmentation

Full-Duplex Cognitive Radio with Packet Fragmentation

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Askari, Elaheh Aissa, Sonia Univ Quebec INRS EMT Montreal PQ Canada

ISBN: (纸本)9781479930838

A cognition scheme, whereby nodes are enabled with the full-duplex technology at the PHY layer in conjunction with packet fragmentation at the MAC layer, is proposed to increase the performance of cognitive radio networks. As full-duplex allows doubling the throughput by equipping secondary users (SUs) with the capability to sense and transmit simultaneously, it also enables them to inflict considerably less interference to primary users (PUs), and to discover spectrum holes for transmission opportunities more efficiently. On the other hand, fragmentation technique at the MAC layer provides better quality-of-service for the SUs by empowering the information forwarding in the unpredictable PUs' channels in a progressive manner. Selecting the effective data transfer, the successful packet transmission time and the energy efficiency as metrics, we assess the performance of this cognition scheme and demonstrate its overall merits in cognitive radio networks, in comparison with conventional schemes that use half-duplex and no packet fragmentation.

关键词： Cognitive Radio Energy Efficiency Full-Duplex Half-Duplex packet fragmentation MAC

来源：评论

学校读者我要写书评

暂无评论

Adaptive packet-size Control for Improved Throughput in Dynamic Access Networks

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2021年第3期24卷 1935-1944页

作者： Bany Salameh, Haythem Shamekh, Ayat Al Ain Univ Coll Engn Al Ain U Arab Emirates Yarmouk Univ Telecommun Engn Dept Irbid 21163 Jordan

Cognitive radio (CR) is a new intelligent wireless technology that aims at improving spectrum utilization by allowing opportunistic access to the underutilized licensed spectrum. Wireless CR operating environment is typically characterized by its unreliable and unpredictable channel conditions and time availability due to fading and the randomness of primary radio (PR) activities. In such environment, packet fragmentation is needed to enhance the probability of success/packet delivery and reduce the needed number of packet re-transmission attempts. Specifically, the quality and availability of the PR channels along with the data packet size should be considered when designing communication protocols for CR networks (CRNs) such that the packet success probability is improved. Based on the quality and availability of the PR channels, an optimal-packet size metric is derived, which is defined as the packet size that can be transmitted over a selected channel while guarantying a predefined probability of success. In this paper, we propose three fragmentation-based channel assignment algorithms: fixed-fragment size algorithm, first-fit algorithm and near-exact fit algorithm. The first algorithm divides the packet equally over the selected channels while the other algorithms use variable fragment size. The main objectives of the algorithms are to enhance network throughput, decrease the number of dropped packets and reduce the average number of retransmission attempts. This preserves more channels for potential future CR transmissions, resulting in higher network throughput with less energy consumption. Simulation results show that the proposed algorithms significantly outperform existing CRN channel assignment algorithms with no fragmentation.

关键词： Spectrum assignment packet fragmentation First-fit Cognitive networking

来源：评论

学校读者我要写书评

暂无评论

Overflow management with self-eliminations

引用

THEORETICAL COMPUTER SCIENCE 2023年第1期948卷

作者： Rabinowitz, Assaf Rawitz, Dror Bar Ilan Univ Fac Engn IL-52900 Ramat Gan Israel

We study admission control with packet redundancy, where large data items, called superpackets, exceed some Maximum Transmission Unit (MTU) and therefore are broken into several smaller packets. It is assumed that each superpacket is comprised of k packets, and that a superpacket is considered useful if at least (1 - beta)k of its packets arrive at the receiving end, for some redundancy parameter beta is an element of [0,1). Our goal is to maximize the total profit of useful superpackets, under an overloaded network, where we are forced to drop *** starting point is an algorithm, called PRIORITY, which is based on assigning a random priority to each superpacket. This algorithm was shown to perform well when beta = 0, with and without a buffer. However, the performance of PRIORITY deteriorates with the increase of beta, since it delivers too many packets for high priority superpackets. To tackle this issue, we propose an online algorithm which introduces randomized self-elimination of packets, called PSE. When there is no buffer, we show that the competitive ratio of PSE is better than the competitive ratio of PRIORITY, for the case where (1 - beta )3 middot rho max <= 1, where rho max is the maximal burst size-router capacity ratio. For real-world values (rho max <= 1.5), PSE outperforms PRIORITY for beta >= 0.14. We also present simulation results, with a buffer, that demonstrate the behavior of PSE in comparison with PRIORITY and TAIL-DROP. It is shown that PSE performs much better than PRIORITY when beta is large. In fact, it is shown that PSE behaves at least as good as both algorithms. (c) 2023 Elsevier B.V. All rights reserved.

关键词： Competitive analysis Online algorithms Randomized algorithms packet fragmentation packet drop

来源：评论

学校读者我要写书评

暂无评论

Wireless H.264 Video Quality Enhancement Through Optimal Prioritized packet fragmentation

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2012年第5期14卷 1480-1495页

作者： Kambhatla, Kashyap K. R. Kumar, Sunil Paluri, Seethal Cosman, Pamela C. San Diego State Univ Coll Engn San Diego CA 92182 USA Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA San Diego State Univ Dept Elect & Comp Engn San Diego CA 92182 USA San Diego State Univ Computat Sci Res Ctr San Diego CA 92182 USA

We introduce a cross-layer priority-aware packet fragmentation scheme at the MAC layer to enhance the quality of pre-encoded H.264/AVC compressed bitstreams over bit-rate limited error-prone links in wireless networks. The H.264 slices are classified in four priorities at the encoder based on their cumulative mean square error (CMSE) contribution towards the received video quality. The slices of a priority class in each frame are aggregated into video packets of corresponding priority. We derive the optimal fragment size for each priority class which achieves the maximum expected weighted goodput at different encoded video bit rates, slice sizes and bit error rates. Priority-aware packet fragmentation invokes slice discard in the buffer due to channel bit rate constraints on allocating fragment header bits. We propose a slice discard scheme using frame importance and slice CMSE contribution to control error propagation effects. packet fragmentation is extended to slice fragmentation by modifying the conventional H.264 decoder to handle partial slice decoding. Priority-aware slice fragmentation combined with the proposed slice discard scheme provides considerable PSNR and VQM gains as compared to priority-agnostic fragmentation.

关键词： H264 MAC layer packet fragmentation priority-aware PSNR real-time video compression video quality video slice video streaming VQM weighted goodput

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL packet fragmentation SCHEME FOR RELIABLE AND ENERGY-EFFICIENT packet DELIVERY IN 6LoWPAN

OPTIMAL PACKET FRAGMENTATION SCHEME FOR RELIABLE AND ENERGY-...

引用

2nd IEEE International Conference on Cloud Computing and Intelligent Systems (CCIS)

作者： Peng, Jing Chi, Kaikai Zhu, Yihua Wang, Jing Zhejiang Agr & Forestry Univ Sch Informat Engn Linan 311300 Peoples R China Zhejiang Univ Technol Sch Comp Sci & Technol Hangzhou 310023 Zhejiang Peoples R China Changan Univ Sch Informat Engn Xian 710064 Peoples R China

ISBN: (纸本)9781467318556;9781467318570

6LoWPAN is the protocol defined to deliver IPv6 packets over low-power wireless personal area networks (WPANs), in which each IPv6 packet is divided into multiple fragments suitable for being carried in an IEEE 802.15.4 frame. Route-over routing (ROR) and mesh-under routing (MUR) are the two schemes presented by 6LoWPAN working group. In this paper, the optimal fragmentation schemes are proposed to improve the end-to-end packet delivery rate (PDR) and reduce energy consumption in packet delivery for ROR and MUR. The proposed schemes are able to find the optimal number of fragments so that energy consumption is minimized while keeping PDR larger than a preset probability. Numerical results show that the proposed schemes are energy efficient while guaranteeing the preset PDR.

关键词： Wireless networks 6LoWPAN packet fragmentation Energy consumption packet delivery rate

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL packet fragmentation SCHEME FOR RELIABLE AND ENERGY-EFFICIENT packet DELIVERY IN 6LoWPAN

OPTIMAL PACKET FRAGMENTATION SCHEME FOR RELIABLE AND ENERGY-...

引用

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Jing Peng Kaikai Chi Yihua Zhu Jing Wang School of Information Engineering Zhejiang Agriculture and Forestry University School of Computer Science and Technology Zhejiang University of Technology School of Information Engineering Chang'an University

关键词： Wireless networks 6LoWPAN packet fragmentation Energy consumption packet delivery rate

来源：评论

学校读者我要写书评

暂无评论

Better bounds for online k-frame throughput maximization in network switches

引用

THEORETICAL COMPUTER SCIENCE 2017年第PartB期657卷 173-190页

作者： Kawahara, Jun Kobayashi, Koji M. Miyazaki, Shuichi Nara Inst Sci & Technol Grad Sch Informat Sci Ikoma Nara Japan Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan Kyoto Univ Acad Ctr Comp & Media Studies Kyoto 6068501 Japan

We consider a variant of the online buffer management problem in network switches, called the k-frame throughput maximization problem (k-FTM). This problem models the situation where a large frame is fragmented into k packets and transmitted through the Internet, and the receiver can reconstruct the frame only if he/she accepts all the k packets. Kesselman et al. introduced this problem and showed that its competitive ratio is unbounded even when k= 2. They also introduced an "order-respecting" variant of k-FTM, called k-OFTM, where inputs are restricted in some natural way. They proposed an online algorithm and showed that its competitive ratio is at most 2kB/left perpendicular B/k right perpendicular + k for any B >= k, where B is the size of the buffer. They also gave a lower bound of B/left perpendicular 2B/k right perpendicular for deterministic online algorithms when 2B >= k and k is a power of 2. In this paper, we improve upper and lower bounds on the competitive ratio of k-OFTM. Our main result is to improve an upper bound of 0 (k(2)) by Kesselman et al. to 5B+left perpendicular B/k right perpendicular-4/left perpendicular B/2k right perpendicular = 0 (k) for B >= 2k. Note that this upper bound is tight up to a multiplicative constant factor since the lower bound given by Kesselman et al. is Omega(k). We also give two lower bounds. First we give a lower bound of 2B/left perpendicular B/(k-1) right perpendicular +1 on the competitive ratio of deterministic online algorithms for any k >= 2 and any B >= k-1, which improves the previous lower bound of B/left perpendicular 2B/k right perpendicularby a factor of almost four. Next, we present the first nontrivial lower bound on the competitive ratio of randomized algorithms. Specifically, we give a lower bound of k-1 against an oblivious adversary for any k >= 3 and any B. Since a deterministic algorithm, as mentioned above, achieves an upper bound of about 10k, this indicates that randomization does not help too m

关键词： Buffer management Online problem Competitive analysis packet fragmentation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：