AASCIT - Journal - All Issues

ISSN Print: 2381-1137 ISSN Online: 2381-1145

International Journal of Wireless Communications, Networking and Mobile Computing

The Journal

Manuscript Information

Data Placement Strategy for Hadoop Clusters

International Journal of Wireless Communications, Networking and Mobile Computing
Vol.3 , No. 3, Publication Date: Aug. 18, 2016, Page: 29-35

1709 Views Since August 18, 2016, 795 Downloads Since Aug. 18, 2016

Paper in PDF (2298K)

Paper in Html

Follow on

Authors

[1]	Mohammed I. Alghamdi, College of Comp. Science and Information Technology, Albaha University, Albaha, Kingdom of Saudi Arabia.

Abstract

Wireless technology has become very widely used; and an array of security measures, such as authentication, confidentiality strategies, and 802.11 wireless communication protocol based security schemas have been proposed and applied to real-time wireless networks. However, most of the measures only consider security issues in static mode, in which security levels are all configured when wireless network systems are built. In real-time applications such as a stock quoting and trading system, users may need flexible quality of security that can be, e.g. measured in security levels. For example, the data of a current stock’s price may require higher security than the data of the same stock ten years earlier. Thus flexible security mechanisms for real time applications transmitting packets through wireless networks would be highly desirable. In this paper, we propose a novel security-aware packet scheduling strategy for a real time wireless link where the wireless networks can dynamically set security levels according to different user requests.

Keywords

Information Security, Information System, Wireless Networks

Reference

[01]	"Gavin Donoho, “Building a Web Service to Provide Real-Time Stock Quotes,” MCAD. Net, February, 2004.
[02]	Tom Karygiannis, Les Owens, “Wireless Network Security 802.11, Bluetooth and Handheld Devices”, chapter 2, http://csrc.nist.gov/publications/nistpubs/800-48/NIST_SP_800-48.pdf
[03]	White Paper of Cisco, Building the Mobile Business with a Unified Wireless Network http://epsfiles.intermec.com/eps_files/eps_wp/
[04]	C. Chang, J. Chang, K. Chen and M. You, “Guaranteed quality-of-service wireless access to ATM,”IEEE JSAC, 1997.
[05]	S. Lu, V. Bharghavan and R. Srikant, “Fair Scheduling in wireless packet networks,” IEEE Trans. Networking, August 1999.
[06]	V. Bharghavan, “A new protocol for medium Access in wireless packet networks,” online document, 1999.
[07]	J. C. R. Bennett and H. Zhang, “WF2Q: Worst-case fair weighted fair queuing,” IEEE INFOCOM’96, 1996.
[08]	T. S. Ng, I. Stoica and H. Zhang, “Packet fair Queueing algorithms for wireless networks with location dependent errors,” IEEE INFOCOM’98, March 1998.
[09]	T. Nandagopal, T. Kim, X. Gao and V. Bharghavan, “Achieving MAC Layer Fairness in Wireless Packet Networks,” ACM MOBICOM’00, Boston, MA, August 2000.
[10]	Badamas M. A (2001). Mobile Computing Systems – Security Considerations, Information Management and Security 2001, 134-136.
[11]	Gupta V and Gupta S (2001). Securing the Wireless Internet, IEEE communications Magazine, Dec 2001, 68-74.
[12]	Owens M, Karygiannis S (2000). Wireless Network Security. NIST Special Publication 800 -48.
[13]	Siau K., Lim E. P. & Shen Z. (2001). Mobile Commerce: Promises, Challenges and Research Agenda, Journal of Database Management, July – Sept 2001 Vol. 12, 4-19.
[14]	Xiaomei Yu; Hoang, D. B.; Dagan Feng; “A QoS, control protocol for rate-adaptive video traffic”, Networks, 2001. Proceedings. Ninth IEEE International Conference on 10-12 Oct. 2001 Page (s): 434–438.
[15]	X. Qin, and H. Jiang, “Dynamic, Reliability-Driven Scheduling of Parallel Real-time Jobs In Heterogeneous Systems,” Proc. Int’l Conf. On Parallel Processing, Valencia, Spain, pp. 113-122, 2001.
[16]	X. Qin, H. Jiang, D. R. Swanson, ""An Efficient Fault-tolerant Scheduling Algorithm for Real-time Tasks with Precedence Constraints in Heterogeneous Systems,"" Proc. Int’l Conf. on Parallel Processing, British Columbia, Canada, pp. 360-368, Aug. 2002.
[17]	J. C. Palencia, and H. M. Gonzalez, “Schedulability, analysis for tasks with static and dynamic offsets,” Proc. the 19th IEEE Real-Time Systems Symp., 1998, pp. 26-37.
[18]	T. F. Abdelzaher and K. G. Shin, “Combined Task and Message Scheduling in Distributed Real-Time Systems,” IEEE Trans. Parallel and Distributed Systems, Vol. 10, No. 11, Nov. 1999.
[19]	M. A. Palis, “Online Real-Time Job Scheduling with Rate of Progress Guarantees,"" Proc. the 6th Int’l Symp. Parallel Architectures, Algorithms, and Networks, 2002, pp. 65-70.
[20]	G. Manimaran and C. S. R Murthy, “An Efficient Dynamic Scheduling Algorithm for Multimachine Real-Time Systems,” IEEE Trans. Parallel and Distributed Systems, Vol. 9, No. 3, 1998, pp. 312-319."