A QoS-aware Routing for Multi-Services in Wireless Sensor Networks

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.

[1]  Youngnam Han,et al.  A channel-based scheduling algorithm for cdma2000 1xEV-DO system , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[2]  Byeong Gi Lee,et al.  QoS Support by Using CDF-Based Wireless Packet Scheduling in Fading Channels , 2006, IEEE Trans. Commun..

[3]  Jonathan Ling,et al.  Jointly opportunistic beamforming and scheduling (JOBS) for downlink packet access , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[4]  S. Shamala,et al.  Enhanced TSWTCM to improve fairness DiffServ networks , 2005, 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic.

[5]  Eun Ho Choi,et al.  Throughput of the 1x EV-DO system with various scheduling algorithms , 2004, Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738).

[6]  Mohamed Othman,et al.  A New Fair Weighted Fair Queuing Scheduling Algorithm in Differentiated Services Network , 2006 .

[7]  Ness B. Shroff,et al.  Transmission scheduling for efficient wireless resource utilization with minimum-performance guarantees , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[8]  N.B. Shroff,et al.  Optimal opportunistic scheduling in wireless networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[9]  Edward W. Knightly,et al.  WCFQ: an opportunistic wireless scheduler with statistical fairness bounds , 2003, IEEE Trans. Wirel. Commun..

[10]  Seth Stovack Kessler.  Piezoelectric-based in-situ damage detection of composite materials for structural health monitoring systems , 2002 .

[11]  Vikram Krishnamurthy,et al.  Opportunistic scheduling for streaming users in high-speed downlink packet access (HSDPA) , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[12]  Zhigang Cao,et al.  Scheduling delay-sensitive and best-effort traffics in wireless networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[13]  Wang Ya-lan.  One novel multi-services scheduling algorithm in WCDMA system , 2008 .

[14]  Jemal H. Abawajy.  Job scheduling policy for high throughput computing environments , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..