Abstract
In this paper we propose a new routing algorithm for emergency bound based on multiple services for wireless sensor networks. In this routing algorithm channel conditions are associated with each time unit to provide overall fairness and maximize the total throughput of wireless sensor network. The proposed system model supports multiple users of each sensor, each user may have several service demands, every demand has different characteristics such as emergency bound, etc. How to guarantee the fairness for each user and the emergency bound for each service in wireless sensor network is the problem to be solved. In addition, we investigate the channel condition for each user and provide the maximum throughput for the single channel of each time unit.
Sign-in/Register to access full text options 
Free) 
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 call
