In the wind energy storage procedures, fluctuating nature of wind is problematic for stand-alone operation. Different efforts have been done to stabilize the wind source; boost converter with controller, bidirectional converter with controller, and energy storage devices need to be used for stabilizing the wind source. During the boost operation, the voltage parameter is boosted only in the output while power is constant, therefore, maintaining the constant power is required. One of the important aspects for maintaining the constant power is considering the speed of wind. This concept is applicable for both boost DC-DC Converter and Bidirectional DC-DC Converter (BDC). Estimation of battery State of Charge (SOC) is an important task for maintaining the effective operation as well as protecting the battery from deteriorating. Charging and discharging the battery is a cyclic process; which requires to be effective. Several methods have been used for estimating SOC of the battery; the coulomb counting method is an effective method for the battery charging and discharging operations. This paper proposes consideration of battery SOC and wind speed for an effective wind harnessing operation. The proposed system is designed in MATLAB/Simulink, and validates the system in hardware prototype model in order to SOC balancing control.

Due to real-time nature of multimedia data, the 802. 11ac standard applies the EDCA method to prioritize different types of traffics. The EDCA method supports four different access categories each with its own queue so that the highest priority is assigned to voice packets. However, the EDCA method only works well when the amount of voice packets is small compared to other types of traffics. As the density of the voice packets increases, the collision among them increases which results in delay and loss ratio increasing. This in turn can highly degrade the quality of the VoIP service. To address this EDCA issue, a new dynamic model called D-EDCA is proposed in this work. The new D-EDCA model provides a deterministic QoS by continually monitoring the voice packets and their corresponding queue to dynamically adjust the corresponding parameters when the density of the voice packets is above a threshold. The D-EDCA model is designed and implemented using NS3 simulator tool. Furthermore, in order to validate and compare the performance of the proposed D-EDCA with the conventional EDCA, a learning-based framework is designed that operates in three phases in the uplink mode of 802. 11ac network. The results prove that the D-EDCA model can highly improve VoIP communication compared to the conventional EDCA in terms of network metrics.

IEEE 802.11e standard is proposed to support Quality of Service (QoS) in wireless local area networks (WLANs). The distributed access method of 802.11e, Enhanced Distributed Channel Access (EDCA), prioritizes traffic generated by delay-sensitive applications by increasing probability to access medium for this type of traffic. EDCA resets the Contention Window (CW) of mobile stations to a minimum value after each successful transmission. This static behavior is not adapted to dynamic conditions of wireless network as it degrades network performance when channel access requests increases. Several mechanisms focusing on network adaptation have been proposed to improve the performance of IEEE 802.11e standard. The main limitation for these approaches is slow adaptation to the network state when the channel experiences bursty traffic.In this paper, we propose a new dynamic approach for contention window adjustement for each Access Category (AC) according to the traffic and network conditions. We compare our proposal with the IEEE 802.11e EDCA standard as well as some other mechanisms in the literature.Simulation results show that our proposed approach outperforms EDCA of 802.11e as well as some other enhancement to the standard present in the literature.

IEEE 802. 11e is standardized to enhance real-time multimedia applications’ Quality of Service. This standard introduces four access categories for different types of applications. Each access category has four adjustable parameters: Arbitrary Inter-Frame Space Number, minimum Size of Contention Window, maximum size of Contention Window, and a Transmission Opportunity limit. A Transmission Opportunity limit is the time interval, in which a wireless station can transmit a number of frames consecutively, without releasing the channel and any further contention with other wireless stations. Transmission Opportunity improves network throughput as well as service differentiation. Proper Transmission Opportunity adjustment can lead to better bandwidth utilization and Quality of Service provisioning. This paper studies the dynamic adjustment of Transmission Opportunity in IEEE 802. 11e using a game-theory based approach called Game Theory Based Dynamic Transmission Opportunity. Based on the proposed method, each wireless node chooses its appropriate Transmission Opportunity according to its queue length and media access delay. Simulation results indicate that the proposed approach improves channel utilization, while preserving efficiency in WLANs and minimizing selfishness behaviors of stations in a distributed environment.

The type of the applications for which Internet is being used has changed over the years. Multimedia applications, Real-time applications and Game playing require Quality of service. IEEE has proposed IEEE 802.11e, a quality of service extension to the wireless LAN standard IEEE 802.11. In this paper service differentiation ability of 802.11e is evaluated. Identical traffic is considered for all Access categories to quantitatively differentiate different Access categories. The results indicate, 802.11e achieves service differentiation with some limitations. NS-2.26 is used for simulation.

To date, many vehicular ad hoc network unicast routing protocols have been proposed to support efficient packet transmission between vehicles in urban environments. However, when there is insufficient vehicle density during non-rush hour times, the vehicular ad hoc network is often intermittently connected. These unicast routing protocols, therefore, perform poorly when forwarding packets over this vehicular disruption tolerant network. This paper adopts the controlled replication approach, in a proposed IG-Ferry routing protocol, to spray a limited number of packet copies, denoted by packet token values, to relay vehicles in a vehicular disruption tolerant network. We then identify three kinds of relay vehicle, i.e. direct buses, non-direct buses and private cars according to their travel itineraries. Based on the proposed delay evaluation function for the three types of intermediate vehicle, the IG-Ferry packet spraying mechanism, instead of that of traditional binary spraying, can efficiently spray appropriate packet tokens to vehicles. Finally, intensive NS2 simulations are conducted using the realistic Shanghai city vehicle traffic trace, IEEE 802.11p protocol, with EDCA and the Nakagami radio propagation model, to show that IG-Ferry outperforms three well-known VDTN routing protocols, in terms of average packet delivery ratios, end-to-end transmission delays and packet replication overheads, with respect to various combinations of five communication parameters.