Abstract
In this paper we model and analyse the radio frequency (RF) transmission in wireless sensor networks using Generalized Stochastic Petri Nets (GSPN). In our model two types of priority requests are considered. In the first type, high priority requests are queued and served according to FIFO discipline. In the second type (case of blocking) low priority requests join the orbit before retrying the request until they find the server free. We consider the preemptive priority to the requests. Indeed, in this study, we highlight the impact of the presence of priority requests on network performances via GSPN formalism. Firstly, we study the case where the high priority requests have non-preemptive priority over lower ones. While, in the second case, we apply the preemptive discipline to the high priority requests. Finally, some numerical examples are given to illustrate our analysis.
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.
