共查询到20条相似文献,搜索用时 15 毫秒
1.
In wireless multicast, some users may fail to receive data as a result of bad channel conditions. The throughput of traditional
multicast strategy is constrained by the node with the worst channel condition. In this paper, we propose a distributed cooperative
multicast scheduling strategy, in which, every user which has successfully received data can decide whether to retransmit
data by sensing MNACK packets. The proposed scheme can achieve good throughput by exploiting multi-channel diversity across
multiple users’ cooperation. In addition, the constraint of power consumption is also considered. Simulation results show
that our scheme can provide good throughput and fairness performance with the constraint of average system power consumption. 相似文献
2.
In IEEE 802.11, the rate of a station (STA) is dynamically determined by link adaptation. Low-rate STAs tend to hog more channel time than high-rate STAs due to fair characteristics of carrier sense multiple access/collision avoidance, leading to overall throughput degradation. It can be improved by limiting the transmission opportunities of low-rate STAs by backoff parameters. This, however, may cause unfair transmission opportunities to low-rate STAs. In an attempt to increase overall throughput by volunteer high-rate relay STAs while maintaining fairness, we propose a new cooperative medium access control (MAC) protocol, relay-volunteered multi-rate cooperative MAC (RM-CMAC) based on ready to send/clear to send in multi-rate IEEE 802.11. In the RM-CMAC protocol, we show that the effect of hogging channel time by low-rate STAs can be remedied by controlling the initial backoff window size of low-rate STAs and the reduced transmission opportunity of low-rate STAs can be compensated by the help of volunteer high-rate relay STAs. We analyze the performance of RM-CMAC, i.e., throughput and MAC delay, by a multi-rate embedded Markov chain model. We demonstrate that our analysis is accurate and the RM-CMAC protocol enhances the network throughput and MAC delay while maintaining the fairness of low-rate STAs. 相似文献
3.
4.
The performance of wireless local area networks (WLANs) is based on the performance of the corresponding access points (APs). Nowadays, network engineers tend to manually assign data channels (frequencies) for each AP. They only use channels 1, 6, and 11 because no interference exists between these channels. But it will be far more efficient if all 11 channels are used. Therefore, the channel allocation problem becomes a major challenge when deploying WLANs. In this paper, we assume that the location of each AP is known. Our objective is to optimally assign a frequency for each AP such that the throughput is maximized and the interference between the various APs is minimized. We also consider a realistic scenario where the APs are not in line of sight of each other, but on the other hand there are different barriers that separate them. We formulate the problem using integer linear programming (ILP) in order to obtain the optimal frequency assignment (OFA). Then, we propose two efficient heuristic algorithms to achieve the same results. Finally, we evaluate the performance of all techniques and make a comparison between them. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
5.
Xi Yong Huang Qingyan Wei Jibo Zhao Haitao 《电子科学学刊(英文版)》2007,24(3):289-295
In this paper, a rate adaptive protocol AMARF (Adaptive Multirate Auto Rate Fallback) for multirate IEEE 802.11 networks is proposed. In AMARF, each data rate is assigned a unique success threshold, which is a criterion to judge when to switch a rate to the next higher one, and the success thresholds can be adjusted dynamically in an adaptive manner according to the running conditions, such as packet length and channel parameters. Moreover, the proposed protocol can be implemented by software without any change to the current IEEE 802.11 standards. Simulation result shows that AMARF yields significantly higher throughput than other existing schemes including ARF and its variants, in various running conditions. 相似文献
6.
For IEEE 802.11 DCF networks in ad-hoc mode, how to achieve the maximum throughput in a distributed manner draws much attention in previous studies. The problem becomes challenging for partially-saturated heterogeneous networks with multiple groups, as the optimal access parameters not only depend on the group size of saturated groups but also the aggregate input rate of all the unsaturated groups, both of which are hard to obtain without a central controller. In this paper, a novel distributive scheme is proposed for partially-saturated heterogeneous IEEE 802.11 DCF networks to achieve the maximum network throughput. With the proposed scheme, each saturated transmitter can obtain the optimal initial backoff window size distributively by two estimation rounds. In each estimation round, each saturated transmitter only needs to count the number of busy intervals and ACK frames on the channel. For fully-saturated networks, only one estimation round is needed. It is shown by extensive simulations that the proposed scheme can achieve the maximum network throughput in a distributive manner. 相似文献
7.
Popularity of IEEE 802.11 networks has increased dramatically over the past number of years. Nowadays audio/video conferencing, gaming and other quality of service (QoS) sensitive services are being delivered to the end users over wireless. Commonly probability for a packet to overstay a specific timeout serves as a QoS metric, and obtaining media access control layer packet delay distribution is highly important for this QoS prediction. Usually wireless devices are equipped with energy supplies of limited capacity, and accurate estimation of their energy expenditure is essential from the network design point of view. Meanwhile, as packets of longer delay normally have higher energy transmission cost, there is a certain dependency between the two metrics. This paper considers internal structure of the metrics and proposes a mathematical model that allows obtaining their individual distributions together with the joint distribution. The model presents a random sum, where the summand formation is determined by a Terminating Markov Process. The model has been validated through comparison with results of NS3 simulation. 相似文献
8.
9.
Yun‐Sheng Yen Ruay‐Shiung Chang Chuan‐Yung Wu 《Wireless Communications and Mobile Computing》2013,13(2):157-169
The advance of computer network technologies such as IEEE 802.11 wireless local area network has made it possible for users to connect to Internet almost anywhere. A mobile node (MN) is likely to move between different base stations while running applications. The IETF has defined the Mobile IP (MIP) to allow MNs to maintain their communication uninterrupted while roaming across different IP subnets. However, the mechanisms defined in MIP may cause undesired connection disruptions or packet losses, which will significantly degrade the quality of real‐time applications. It is an important and challenging issue to support seamless handoff management. To achieve seamless handoff, we propose a unified scheme to address application quality degradation. Our main contribution is the concept and implementation of utilising buffering and resending method to eliminate the packet losses while keeping the end‐to‐end delay of real‐time traffic flow in an acceptable value. The NS‐2 simulation results show that our proposed scheme can significantly maintain application quality during layer‐2 and ‐3 handoffs. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
10.
Qiang Ni 《IEEE network》2005,19(4):21-27
The IEEE 802.11 WLAN legacy standard cannot provide QoS support for multimedia applications. Thus, considerable research efforts have been carried out to enhance QoS support for 802.11. Among them, 802.11e is the upcoming QoS-enhanced standard proposed by the IEEE working group. This article describes in detail the new QoS features of 802.11e based on the latest version of the standard draft. We investigate the performance of 802.11e through computer simulations. Using simple examples, we show the effectiveness of adaptive schemes under the 802.11e framework. 相似文献
11.
In IEEE 802.11 networks, many access points (APs) are required to cover a large area due to the limited coverage range of APs, and frequent handoffs may occur while a station (STA) is moving in an area covered by several APs. However, traditional handoff mechanisms employed at STAs introduce a few hundred milliseconds delay, which is far longer than what can be tolerated by some multimedia streams such as voice over Internet protocol (VoIP), it is a challenging issue for supporting seamless handoff service in IEEE 802.11 networks. In this paper, we propose a pre-scan based fast handoff scheme within an IEEE 802.11 enterprise wireless local area network (EWLAN) environment. The proposed scheme can help STA obtain the best alternative AP in advance after the pre-scan process, and when the handoff is actually triggered, STA can perform the authentication and reassociation process toward the alternative AP directly. Furthermore, we adopt Kalman filter to minimize the fluctuation of received signal strength (RSS), thus reducing the unnecessary pre-scan process and handoffs. We performed simulations to evaluate performance, and the simulation results show that the proposed scheme can effectively reduce the handoff delay. 相似文献
12.
A scheduling algorithm for QoS support in IEEE802.11 networks 总被引:2,自引:0,他引:2
This article presents a scheduling algorithm for the IEEE 802.11e hybrid coordination function under definition by the IEEE 802.11e task group. HCF can be used to provide IP quality of service guarantees in IEEE802.11e infrastructure WLANs. The enhanced distributed coordination function is mainly used for data transmission without QoS guarantees, but can also be used to decrease the transmission delay of QoS-sensitive traffic. Scheduling of queued packets follows a delay-earliest-due-date algorithm. The proposed algorithm is compatible with the link adaptation mechanisms implemented in commercial WLANs, as it limits the amount of time during which the stations control the wireless medium. The performance of the algorithm is evaluated through computer simulation and compared with the reference scheduler presented by the IEEE 802.11e task group. 相似文献
13.
This paper addresses the problem of route selection in IEEE 802.11 based Wireless Mesh Networks (WMNs). Traditional routing protocols choose the shortest path between two routers. However, recent research reveals that there can be enormous differences between links in terms of quality (link loss ratio, interference, noise etc) and therefore selecting the shortest path (hop count metric) is a poor choice. We propose a novel routing metric—Expected Link Performance (ELP) metric for wireless mesh networks which takes into consideration multiple factors pertaining to quality (link loss ratio, link capacity and link interference) to select the best end-to-end route. Simulation based performance evaluation of ELP against contemporary routing metrics shows an improvement in terms of throughput and delay. Moreover, we propose an extension of the metric called ELP-Gateway Selection (ELP-GS) which is an extension meant for traffic specifically oriented towards the gateway nodes in the mesh network. We also propose a gateway discovery protocol which facilitates the dissemination of ELP-GS in the network. Simulation results for ELP-GS show substantial improvement in performance. 相似文献
14.
Originally, Wireless Local Area Networks served only small indoor areas. Nevertheless, the idea of employing IEEE 802.11 networks in large outdoor environments is
a very attractive possibility. IEEE 802.11 technology offers several advantages: the low cost of equipment, its operation
in the unlicensed spectrum and its higher data rates. Since the advent of the first IEEE 802.11 standard, a great deal of
research has been carried out. So-called Wifi-based Long Distance networks are currently being deployed. In this paper, we study the suitability of employing IEEE 802.11 networks in large
outdoor environments without modifying the standard working procedure. In such scenarios, IEEE 802.11 networks should offer
coverage ranges of several kilometer, which leads to high propagation delay values. Thus, we analyze the influence of increasing
propagation delay in the IEEE 802.11 MAC protocol. To carry out our analysis we present a mathematical model and simulation
results. We provide an operating range in which IEEE 802.11 performance is feasible and establish a throughput threshold according
to the propagation delay. 相似文献
15.
J. Alonso-ZárateAuthor Vitae C. CrespoAuthor VitaeCh. SkianisAuthor Vitae L. AlonsoAuthor VitaeCh. VerikoukisAuthor Vitae 《Ad hoc Networks》2012,10(3):536-551
The Distributed Point Coordination Function (DPCF) is presented in this paper as a novel Medium Access Control Protocol (MAC) for wireless ad hoc networks. DPCF extends the operation of the Point Coordination Function (PCF) defined in the IEEE 802.11 Standard to operate over wireless networks without infrastructure. In PCF, a central point coordinator polls the users to get access to the channel and data collisions are completely avoided, thus yielding high performance. In order to extend its high performance to networks without infrastructure, the DPCF is proposed in this paper as a combination of the Distributed Coordination Function (DCF) and the PCF. The general idea is to combine a dynamic, temporary, and spontaneous clustering mechanism based on DCF with the execution of PCF within each cluster. The backwards compatibility of DPCF with legacy 802.11 networks is also assessed in this paper. Comprehensive computer-based simulations demonstrate the high performance of this new protocol in both single-hop and multi-hop networks. 相似文献
16.
Based on the IEEE 802.11n standard, frame aggregation is considered one of the major factors to improve system performance
of wireless local area networks (WLANs) from the medium access control (MAC) perspective. In order to fulfill the requirements
of high throughput performance, feasible design of automatic repeat request (ARQ) mechanisms becomes important for providing
reliable data transmission. In this paper, two MAC-defined ARQ schemes are proposed to consider the effect of frame aggregation
for the enhancement of network throughput. An aggregated selective repeat ARQ (ASR-ARQ) algorithm is proposed, which incorporates
the conventional selective repeat ARQ scheme with the consideration of frame aggregation. On the other hand, the aggregated
hybrid ARQ (AH-ARQ) protocol is proposed to further enhance throughput performance by adopting the Reed-Solomon block code
as the forward error correction (FEC) scheme. Novel analytical models based on the signal flow graph are established in order
to realize the retransmission behaviors of both schemes. Simulations are conducted to validate and compare the proposed ARQ
mechanisms with existing schemes based on service time distribution. Numerical results show that the proposed AH-ARQ protocol
outperforms the other retransmission schemes owing to its effective utilization of FEC mechanism. 相似文献
17.
Chien‐Min Wu Ting‐Chao Hou Maw‐Lin Leou Yi‐Ching Liaw Ming‐Chieh Chan 《International Journal of Communication Systems》2010,23(12):1632-1650
The performance of backoff scheme plays an important role in designing efficient Medium Access Protocols for ad hoc networks. In this paper, we propose an adaptive backoff scheme and evaluate the performance of the proposed scheme for ad hoc networks. The backoff mechanism devised by us grants a node access to the channel based on its probability of collision for a transmitted frame in comparison to the nodes in the two‐hop contention area. We use both an analytical model and simulation experiments to evaluate the performance of our adaptive backoff mechanism in an ad hoc network. The results show that our protocol exhibits a significant improvement in power saving, end‐to‐end goodput, packet delivery ratio, and hop‐put, compared with the existing IEEE 802.11 DCF. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
18.
As a result of the fast growing scale of IEEE 802.11 networks, problems such as low signal‐to‐noise ratio, collision, and small‐scale fading have seriously impacted the performance of IEEE 802.11 networks. In this work, we describe a novel cross‐layer analysis method, using the combination of received channel power sampling at the physical (PHY) layer and information at the medium access control (MAC) layer. The proposed method analyzes the causes of error frames by recording samples of received channel power at the physical layer on a small time scale (5 μs) and employs the particle filter‐based joint likelihood ratio method in order to detect changes in the received channel power and to isolate models of the changes within the time domain. At the same time, it determines the source and the destination addresses of the error frames by decoding packet physical addresses at the MAC layer and then locates the error source. On the basis of the proposed method, optimizations are possible both at the MAC layer and the PHY layer. The simulation and the experimental validation were both carried out for the proposed method. The simulation validation was carried out in order to validate the accuracy of the particle filter‐based joint likelihood ratio method for fault detection and for model isolation using the proposed method. We compared the performance of the extended Kalman filter and the particle filter‐based likelihood ratio method using the non‐Gaussian situation for the proposed method. We then performed several experiments in order to validate the accuracy of the proposed method for error source diagnosis. We also show the applications of the proposed method. The experiments under actual scene showed that different optimizations can be made to optimize the actual wireless local area network by determining the three different causes of the errors. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
19.
20.
Shaoen Wu Saâd Biaz Honggang Wang 《International Journal of Communication Systems》2012,25(4):515-528
Rate adaptation in wireless networking aims to seek the optimal data transmission rate most appropriate for current wireless channel conditions to make full use of the channel potentials. It is important in wireless networks because (1) most of them support multiple data rates, and (2) wireless channel is unstable with fast changes on which a single rate thereby may not be proper for long. Based on a comprehensive survey of the rate adaptation for IEEE 802.1 networks in literature, this work proposes a rate adaptation scheme, dubbed effective rate adaptation (ERA), for IEEE 802.11 networks. ERA takes advantage of the fragmentation technique in IEEE 802.11 standard and utilizes the lowest rate retransmission in diagnosing frame loss cause (collision or channel degradation), diffusing collision, and promptly recovering frame losses. It also adopts an adaptive rate increase threshold concept to exploit channel potentials. Different from other rate adaptation schemes, ERA effectively addresses two challenges in rate adaptation on IEEE 802.11 networks: (1) it does not require RTS/CTS for loss diagnosis purpose; the use of RTS/CTS that are optional in IEEE standard results in inefficiency on channel utilization; (2) it promptly responds to frame failure due to channel degradation, unlike others waiting till the end of a transmission window or cycle. With extensive simulation, ERA shows its unique strength in different lossy environments, especially in collision‐prone environments. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献