Abstract
Deadline constrained packet scheduling and transmission are important in real-time multimedia applications. This is because packets missing their deadlines would become useless and are frequently dropped, which seriously degrade the quality of service (QoS). As the utilization of Internet of Things has become mature, multimedia data transmission is a key component to promote the QoS of citizens. To fulfill the QoS requirement in wireless sensor networks (WSNs) with multimedia content, the combination of multiple transmission methods is encouraged for packet forwarding, including conventional network coding, analog network coding, plain routing, and direct transmission (i.e., no-relaying, NR). The diversity of transmission method is helpful to lower packet dropping probability, while complicating the packet transmitting and scheduling process instead. Therefore, we first introduce an exhaustive search method to obtain the optimal scheduling sequence and corresponding transmission method for deadline constrained multimedia transmissions in WSNs. With the objective of promoting computing efficiency for the formulated problem, we then propose two heuristic methods based on the Markov chain approximation and the dynamic graph, respectively. Simulation results illustrate that our methods can effectively reduce packet dropping probability and simulation time, so that QoS of individuals can be promoted.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
