Abstract
In this paper, we propose one hop, optimal and suboptimal routing protocols for Wireless Sensor Networks (WSNs). The WSN is organized in L hops and N branches between the source S and the destination D. One hop routing activates the best relay in each hop. Optimal routing selects the best path among all $$N^L$$ paths. Suboptimal routing decomposes the network in K subnetworks and activates the best path in each subnetworks. We derive the outage probability of the three studied routing protocols and compare them to simulation results.
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.
