Improving Security of Real-Time Wireless Networks Through Packet Scheduling [Transactions Letters]

Modern real-time wireless networks require high security level to assure confidentiality of information stored in packages delivered through wireless links. However, most existing algorithms for scheduling independent packets in real-time wireless networks ignore various security requirements of the packets. Therefore, in this paper we remedy this problem by proposing a novel dynamic security-aware packet-scheduling algorithm, which is capable of achieving high quality of security for realtime packets while making the best effort to guarantee realtime requirements (e.g., deadlines) of those packets. We conduct extensive simulation experiments to evaluate the performance of our algorithm. Experimental results show that compared with two baseline algorithms, the proposed algorithm can substantially improve both quality of security and real-time packet guarantee ratio under a wide range of workload characteristics.

[1]  Jin-Fu Chang,et al.  Guaranteed quality-of-service wireless access to atm , 1996 .

[2]  Xiao Qin,et al.  An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems , 2002, Proceedings International Conference on Parallel Processing.

[3]  Michael González Harbour,et al.  Schedulability analysis for tasks with static and dynamic offsets , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[4]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[5]  Michael A. Palis,et al.  Online real-time job scheduling with rate of progress guarantees , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[6]  Kang G. Shin,et al.  Combined Task and Message Scheduling in Distributed Real-Time Systems , 1999, IEEE Trans. Parallel Distributed Syst..

[7]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  C. Siva Ram Murthy,et al.  An Efficient Dynamic Scheduling Algorithm For Multiprocessor Real-Time Systems , 1998, IEEE Trans. Parallel Distributed Syst..

[9]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[10]  Doan B. Hoang,et al.  A QoS control protocol for rate-adaptive video traffic , 2001, Proceedings. Ninth IEEE International Conference on Networks, ICON 2001..

[11]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[12]  Ding-Zhu Du,et al.  Wireless Network Security , 2009, EURASIP J. Wirel. Commun. Netw..

[13]  Ramesh R. Rao,et al.  A switch model for improving throughput and power fairness in Bluetooth piconets , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[14]  Muhammed A. Badamas Mobile computer systems - security considerations , 2001, Inf. Manag. Comput. Secur..

[15]  Xiao Qin,et al.  Dynamic, reliability-driven scheduling of parallel real-time jobs in heterogeneous systems , 2001, International Conference on Parallel Processing, 2001..

[16]  A T Karygiannis,et al.  Wireless Network Security: 802.11, Bluetooth and Handheld Devices , 2002 .

[17]  Keng Siau,et al.  Mobile Commerce: Promises, Challenges and Research Agenda , 2001, J. Database Manag..

[18]  V. Gupta,et al.  Securing the wireless internet , 2001, IEEE Commun. Mag..

[19]  Vaduvur Bharghavan,et al.  Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.