Search

Data aggregation plays an important role to improve the transmission efficiency in wireless body area networks (WBANs); however, it inherently induces additional aggregation delay. Therefore, the effect of packet aggregation on WBAN applications, which are vulnerable to delay, must be analyzed rigorously. In this paper, we analyze the packet aggregation delay for multisource sensor data with an on-off traffic pattern in WBANs. Considering two operational parameters of the aggregation threshold and aggregation timer, we calculate the probability that a packet aggregation occurs during a unit time and then derive the average aggregation delay in closed-form. The analysis results show that the aggregation delay increases as the aggregation timer or aggregation threshold increases, but is bounded below a certain level according to the number of active sensors and their on-off traffic attribute. This implies that the data aggregation technique can maximize the transmission efficiency while satisfying a given delay requirement in the WBAN system. [ABSTRACT FROM AUTHOR]

Integrated fiber-wireless (FiWi) should be regarded as a promising access network architecture in future 5G networks, and beyond; this due to its seamless combination of flexibility, ubiquity, mobility of the wireless mesh network (WMN) frontend with a large capacity, high bandwidth, strong robustness in time, and a wavelength-division multiplexed passive optical network (TWDM-PON) backhaul. However, the key issue in both traditional human-to-human (H2H) traffic and emerging Tactile Internet is the energy conservation network operation. Therefore, a power-saving method should be instrumental in the wireless retransmission-enabled architecture design. Toward this end, this paper firstly proposes a novel energy-supply paradigm of the FiWi converged network infrastructure, i.e., the emerging power over fiber (PoF) technology instead of an external power supply. Then, the existing time-division multiplexing access (TDMA) scheme and PoF technology are leveraged to carry out joint dynamic bandwidth allocation (DBA) and provide enough power for the sleep schedule in each integrated optical network unit mesh portal point (ONU-MPP) branch. Additionally, the correlation between the transmitted optical power of the optical line terminal (OLT) and the quality of experience (QoE) guarantee caused by multiple hops in the wireless frontend is taken into consideration in detail. The research results prove that the envisioned paradigm can significantly reduce the energy consumption of the whole FiWi system while satisfying the average delay constraints, thus providing enough survivability for multimode optical fiber. [ABSTRACT FROM AUTHOR]

WirelessHART is a wireless sensor network that is widely used in real-time demand analyses. A key challenge faced by WirelessHART is to ensure the character of real-time data transmission in the network. Identifying a priority assignment strategy that reduces the delay in flow transmission is crucial in ensuring real-time network performance and the schedulability of real-time network flows. We study the priority assignment of real-time flows in WirelessHART on the basis of the multi-channel time division multiple access (TDMA) protocol to reduce the delay and improve the ratio of scheduled. We provide three kinds of methods: (1) worst fit, (2) best fit, and (3) first fit and choose the most suitable one, namely the worst-fit method for allocating flows to each channel. More importantly, we propose two heuristic algorithms—a priority assignment algorithm based on the greedy strategy for C (WF-C) and a priority assignment algorithm based on the greedy strategy for U(WF-U)—for assigning priorities to the flows in each channel, whose time complexity is O (m a x (N ∗ m ∗ l o g (m) , (N − m) 2)) . We then build a new simulation model to simulate the transmission of real-time flows in WirelessHART. Finally, we compare our two algorithms with WF-D and HLS algorithms in terms of the average value of the total end-to-end delay of flow sets, the ratio of schedulable flow sets, and the calculation time of the schedulability analysis. The optimal algorithm WF-C reduces the delay by up to 44.18 % and increases the schedulability ratio by up to 70.7 % , and it reduces the calculation time compared with the HLS algorithm. [ABSTRACT FROM AUTHOR]