19 research outputs found
Evaluation of HTTP/DASH Adaptation Algorithms on Vehicular Networks
Video streaming currently accounts for the majority of Internet traffic. One
factor that enables video streaming is HTTP Adaptive Streaming (HAS), that
allows the users to stream video using a bit rate that closely matches the
available bandwidth from the server to the client. MPEG Dynamic Adaptive
Streaming over HTTP (DASH) is a widely used standard, that allows the clients
to select the resolution to download based on their own estimations. The
algorithm for determining the next segment in a DASH stream is not partof the
standard, but it is an important factor in the resulting playback quality.
Nowadays vehicles are increasingly equipped with mobile communication devices,
and in-vehicle multimedia entertainment systems. In this paper, we evaluate the
performance of various DASH adaptation algorithms over a vehicular network. We
present detailed simulation results highlighting the advantages and
disadvantages of various adaptation algorithms in delivering video content to
vehicular users, and we show how the different adaptation algorithms perform in
terms of throughput, playback interruption time, and number of interruptions
A Load Balancing Algorithm for Resource Allocation in IEEE 802.15.4e Networks
The recently created IETF 6TiSCH working group combines the high reliability
and low-energy consumption of IEEE 802.15.4e Time Slotted Channel Hopping with
IPv6 for industrial Internet of Things. We propose a distributed link
scheduling algorithm, called Local Voting, for 6TiSCH networks that adapts the
schedule to the network conditions. The algorithm tries to equalize the link
load (defined as the ratio of the queue length over the number of allocated
cells) through cell reallocation. Local Voting calculates the number of cells
to be added or released by the 6TiSCH Operation Sublayer (6top). Compared to a
representative algorithm from the literature, Local Voting provides
simultaneously high reliability and low end-to-end latency while consuming
significantly less energy. Its performance has been examined and compared to
On-the-fly algorithm in 6TiSCH simulator by modeling an industrial environment
with 50 sensors
Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting
In a multihop wireless network, it is crucial but challenging to schedule
transmissions in an efficient and fair manner. In this paper, a novel
distributed node scheduling algorithm, called Local Voting, is proposed. This
algorithm tries to semi-equalize the load (defined as the ratio of the queue
length over the number of allocated slots) through slot reallocation based on
local information exchange. The algorithm stems from the finding that the
shortest delivery time or delay is obtained when the load is semi-equalized
throughout the network. In addition, we prove that, with Local Voting, the
network system converges asymptotically towards the optimal scheduling.
Moreover, through extensive simulations, the performance of Local Voting is
further investigated in comparison with several representative scheduling
algorithms from the literature. Simulation results show that the proposed
algorithm achieves better performance than the other distributed algorithms in
terms of average delay, maximum delay, and fairness. Despite being distributed,
the performance of Local Voting is also found to be very close to a centralized
algorithm that is deemed to have the optimal performance
A survey of TDMA scheduling schemes in wireless multihop networks
One of the major problems in wireless multihop networks is the scheduling of transmissions in a fair and efficient manner. Time Division Multiple Access (TDMA) seems to be one of the dominant solutions to achieve this goal since it is a simple scheme and can prolong the devices’ lifetime by allowing them to transmit only a portion of the time during conversation. For that reason, several TDMA scheduling algorithms may be found in the literature. The scope of this article is to classify the existing TDMA scheduling algorithms based on several factors, such as the entity that is scheduled, the network topology information that is needed to produce or maintain the schedule, and the entity or entities that perform the computation that produces and maintains the schedules, and to discuss the advantages and disadvantages of each category.</jats:p
The Advantage of the 5G Network for Enhancing the Internet of Things and the Evolution of the 6G Network
The Internet of Things (IoT) is what we have as a great breakthrough in the 5G network. Although the 5G network can support several Internet of Everything (IoE) services, 6G is the network to fully support that. This paper is a survey research presenting the 5G and IoT technology and the challenges coming, with the 6G network being the new alternative network coming to solve these issues and limitations we are facing with 5G. A reference to the Control Plane and User Plane Separation (CUPS) is made with IPv4 and IPv6, addressing which is the foundation of the network slicing for the 5G core network. In comparison to other related papers, we provide in-depth information on how the IoT is going to affect our lives and how this technology is handled as the IoE in the 6G network. Finally, a full reference is made to the 6G network, with its challenges compared to the 5G network