Volume-2 , Issue-2 , Feb - 2014 Go Back

The building sector accounts for 36% of total final energy consumption in the country, with 29% at the residential level and 7% at the tertiary level. Due to that, the building is considered as a potential of energy saving. Reliable and complete data on the energy consumptions of buildings are lacking in Morocco. Our work aims at contributing to cover these deficits and to optimize the energy consumptions of buildings in Morocco. The work presented in this article describes a representative simplified dynamic model of a building, established from the meteorological data and the thermo physical properties of the building materials the most used in Morocco. This model will serve to predetermine the energy consumption of the building. This model will be confronted with the experimental statements to validate and correct at the need to use it then in the optimization approaches.

Thermal Modeling; Simulation; Energy Consumption; Thermal Comfort

[1] Energie, changement climatique et b�timent en M�diterran�e : perspectives r�gionales, juin 2011, annexe 3. Available online:
http://planbleu.org/fr/publications/energie-changement-climatique-et-batiment-en-mediterranee-perspectives-regionales.
[2] Ky LE, " Gestion optimale des consommations d��nergie dans les b�timents ". Doctoral Thesis - Institut Polytechnique de Grenoble, July 10, 2008 Chapter 2.
[3] Rim MISSAOUI, Ghaith WARKOZEK, Shadi ABRAS, St�phane PLOIX, Seddik BACHA. "Simulation temps r�el pour la gestion des flux �nerg�tiques dans l�habitat". Published in "IBPSA, France (2010)"
[4] Ion Hazyuk, "Dynamical optimisation of renewable energy flux in buildings". Doctoral Thesis - Institut National des Sciences Appliqu�es of Lyon, Decembre 2011, chapter 2. Available at: http://theses.insa-lyon.fr/publication/2011ISAL0130/these.pdf.
[5] R�gles th-u pour les b�timents existants :
http://www.rtbatiment.fr/fileadmin/documents/RT_existant/globale/ThUEx_5%20fascicules .pdf
[6] Toke Rammer Nielsen, "Simple tool to evaluate energy demand and indoor environment in the early stages of building design", Solar Energy 78 (2005) 73�83.
[7] R. Guechchati, A. Mezrhab, L. Elfarh, " Optimisation �nerg�tique et thermique d�un habitat marocain", 9th Congress of Mechanics, FS Semlalia, Marrakech 2009.
[8] Babbah S., Draoui A., Menezo Ch., Yezou R., Ben abdelouahab J., " Evaluation Energ�tique des B�timents au Nord du Maroc ", 12th International Conference of Thermal 2005.
[9] RTBM, 2010 : Les �l�ments techniques du projet de la r�glementation thermique du b�timent au Maroc.
[10] Surface meteorology and Solar Energy: http://eosweb.larc.nasa.gov/sse/.

G. Touria, S. Abdallah, "Modeling of a Building With The Aim of The Evaluation of its Energy Consumption Application to a Typical Building in Morocco," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.1-5, 2014.

The focus of this Paper is the actual implementation of Network Router and verifies the functionality of the five port router for network on chip using the latest verification methodologies, Hardware Verification Languages(s) and EDA tools and qualifies the Design for Synthesis and implementation. This Router design contains Four output ports and one input port, it is packet based Protocol. This Design consists of Registers, FSM and FIFO�s. The Verification goes on it finds functional coverage of the Network Router by using System Verilog.

Systemverilog, Ficinalcoverage, Assertions, Randomizations, FIFO, FSM, Netwokonchip, Verification Methodologies, Registerblock

[1]. D.Chiou,�MEMOCODE2011Hardware/SoftwareCoDesignContest�,
ramp.ece.utexas.edu/redmine/Attachments/ esignContest.pdf
[2]. Xilinx,�ML605HardwareUserGu de�,
www.xilinx.com/support/documentation/boardsand its/ug534.pdf
[3]. Xilinx,�LogiCOREIPProcessor Local Bus (PLB) v4.6�,
www.xilinx.com/support/documentation/ip ocumentation/plb v46.pdf
[4]. �Application Note: Using the Router Interface to Communicate Motorola,
ANN91/D Rev. 1, 01/2001. Cisco Router OSPF: Design& Implementation Guide,
Publisher: McGraw-Hill
[5]. �LRM�, IEEE Standard Hardware Description Language Based on the
Verilog Hardware Description Language � IEEE STD 1364-199.

L.S. Bandaru, V.K. Sandepudi, C. Sindhuja, "Constraint Random Verification of Network Router for System on Chip Applications Using Advanced Verification Methodologies," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.6-10, 2014.

Network Security is the most vital component in data protection because it is responsible for protecting all information passed through computers containing network. Network Security refers to all hardware and software functions, characteristics, features, accountability, measures, access control, and administrative and management policy required to provide an acceptable level of protection for Hardware and Software, and information in a network. Here we are focusing on the technique of Quantum Cryptography which uses the law of quantum physics for unconditionally secure data communications. This is an improvement because the cryptography currently in use, known as conventional cryptography, is dependent entirely on the difficulty level of a mathematical equation. To write this paper we have studied about Network Security and methods of encoding and decoding in detail. Hereby we are presenting our work on the enhancement of cryptography using various encoding and decoding approaches. The proposed algorithm has a better speed compared with other encoding algorithm. Nevertheless, the proposed algorithm improves encoding security by inserting the symmetric layer. The proposed algorithm will be useful to the applications which require the same procedure of encoding and decoding. This paper makes a comparison between classical cryptography and quantum cryptography and outlines the increased security level provided by quantum cryptography.

Network security, Encoding, Decoding, Cryptography, Quantum Cryptography

[1] Dripto Chatterjee, Joyshree Nath, Suvadeep Dasgupta, Asoke Nath �A new Symmetric key Cryptography Algorithm using extended MSA method: DJSA symmetric key algorithm� published in 2011 International Conference on Communication Systems and Network Technologies, 978-0-7695-4437-3/11 $26.00 � 2011 IEEE.
[2] Simmonds, A; Sandilands, P; van Ekert, L (2004) Ontology for Network Security Attacks". Lecture Notes in Computer Science. Lecture Notes in Computer Science 3285, pp.317�323.
[3] A Role-Based Trusted Network Provides Pervasive Security and Compliance - interview with Jayshree Ullal, senior VP of Cisco.
[4] Dave Dietrich, Network monitoring/Intrusion Detection Systems (IDS), University of Washington.
[5] Sanchez-Avila, C. Sanchez-Reillol, R, ―The Rijndael block cipher (AES proposal): A comparison with DES‖, 35th International Conference on Security Technology 2001, IEEE.
[6] Symmetric key cryptography using random key generator,A.Nath, S.Ghosh, M.A.Mallik, Proceedings of International conference on SAM-2010 held at Las Vegas(USA) 12-15 July, 2010, Vol-2,P-239-244.
[7] By Klaus Felten �An Algorithm for Symmetric Cryptography with a wide range of scalability� published by 2nd International Workshop on Embedded Systems, Internet Programming and Industrial IT.

S. Kaur, R. Singh, S. Gagneja , "Network Security and Methods of Encoding and Decoding," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.11-15, 2014.

The speech is the most important and effective method in the Human Interaction. Speech signal is the basis of Human Computer Interaction and Human Communications Technology. Many Human Diseases like Parkinson Disease, Cerebellar Demyelization, Stroke and many Neurological Diseases are analyzed using the their speech patterns for diagnosing the disease. To analyze these pathological voice patterns algorithms are used. In this paper, various algorithms used to analyze the voice patterns are analyzed and also comparative study of Parkinson and Larynx Diseases are analyzed using the voice patterns.

Speech Patterns; Speech Algorithms; Speech Analysis; Speech Diagnosis

[1]. M. D. O. Rosa, J. C. Pereira, M. Grellet, �Adaptive Estimation of Residue Signal for Voice Pathology Diagnosis�, IEEE Trans. Biomedical Eng. Vol. 47, No. 1, Jan. 2000.
[2]. L. G. Ceballos, and H. L. Hansen, �Direct Speech Feature Estimation Using an Iterative EM Algoritm for Vocal Fold Pathology Detection�, IEEE Trans. Biomedical Eng. Vol. 43, No. 4, April. 1996.
[3]. D. Talkin, W. B. Klejin, and K. K. Paliwal, �A Robust Algorithm for Pitch Tracking�, Speech coding and synthesis, Elsevier, New York, 1995.
[4]. S. Young, D. Kershaw, J. Odell, D. Ollason V. Valtchev, P.Woodland, �The HTK book�, Microsoft Corporation, July 2000.
[5]. �Disorder Database Model 4337� Massachusetts Eye and Ear Infirmary Voice and Speech Lab, Boston, MA, Jan. 2002.
[6]. M. A. Little, P. E. McSharry, E. J. Hunter, J. Spielman, and L. O. Ramig,�Suitability of dysphonia measurements for telemonitoring of Parkinson�s disease,� IEEE Trans. Biomed. Eng., vol. 56, no. 4, pp. 1010�1022, Apr.2009.
[7]. National Collaborating Centre for Chronic Conditions, Parkinson�s Disease, London, U.K.: Royal College of Physicians, 2006.
[8]. L. Cunningham, S. Mason, C. Nugent, G. Moore, D. Finlay, and D. Craig, �Home-based monitoring and assessment of Parkinson�s disease,� IEEE Trans. Inf. Technol. Biomed., vol. 15, no. 1, pp. 47�53, Jan. 2011.
[9]. G. Rigas, A. Tzallas, M. Tsipouras, P. Bougia, E. Tripoliti, D. F. D. Baga, S. Tsouli, and S. Konitsiotis, �Assessment of Tremor activity in the Parkinson�s disease using a set of wearable sensors,� IEEE Trans. Inf. Technol.Biomed., vol. 16, no. 3, pp. 478�487, May 2012.
[10]. S. Marino, R. Ciurleo, G. Lorenzo, M. Barresi, S. De Salvo, S. Giacoppo, A. Bramanti, P. Lanzafame, and P. Bramanti, �Magnetic resonance imaging markers for early diagnosis of Parkinson�s disease,� Neural Regeneration Res., vol. 7, no. 8, pp. 611�619, 2012.
[11]. Z. Dastgheib, B. Lithgow, and Z. Moussavi, �Diagnosis of Parkinson�s disease using electrovestibulography,� Med. Biol. Eng. Comput., vol. 50, no. 3, pp. 483�491, 2012.
[12]. M. A. Little, P. E. McSharry, S. J. Roberts, D. A. E. Costello, and I. M. Moroz, �Exploiting nonlinear recurrence and fractal scaling properties for voice disorder detection,� Biomed. Eng. Online, vol. 6, no. 23, 2007, doi: 10.1186/1475-925X-6-23.
[13]. A. Tsanas, M. A. Little, P. E. McSharry, J. Spielman, and L. O. Ramig,�Novel speech signal processing algorithms for high-accuracy classification of Parkinson�s disease,� IEEE Trans. Biomed. Eng., vol. 59, no. 5, pp. 1264�1271, May 2012.
[14]. A. Tsanas, M. A. Little, P. E. McSharry, and L. O. Ramige,�Nonlinear speech analysis algorithms mapped to a standard metric achieve clinically useful quantification of average Parkinson�s disease symptom severity,� J. Royal Society Interface, vol. 8, pp. 842�855, 2011.
[15]. A Vibroacoustic Model of Selected Human Larynx Diseases, International Journal of Occupational Safety and Ergonomics (JOSE) , Vol. 13, No. 4, 367�379.

D. Karunanithi, P. Rodrigues, "Analysis of Speech Algorithms in Disease affected Voice Patterns," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.16-20, 2014.

GSM, UMTS, WIMAX, and WIFI are different wireless network types, which demands interoperability. Mobile WiMAX is the demanded technology for broadband wireless communication. The challenging aspect is to ensure service continuity for a mobile user when changing different access network. Due to the diversity of mobile networks and services offered by different operators, most users ask for better services without worrying about the technological constraints. Users must have the possibility to migrate from one area to another one without losing connection, knowing that these areas are using different technologies. Most of the Mobile users want quick and seamless service connection, and in mobile WiMAX network handover schemes, the authentication procedure takes long time to execute and thus producing delay in communication. This paper is the review of different handover mechanisms that has been proposed for reducing delay in communication between different users and providing fast and secure authentication schemes to meet the security requirement of users in the network. A pre-authentication based HO schemes for fast and secure HO, are shown to be vulnerable to Denial of Service attacks and Replay attacks. This paper discusses an EAP-based Authentication scheme, an EEP scheme and EAP-TTLS scheme which are proposed to optimize Handover Latency and to overcome above vulnerabilities with much less computational and communicational resources.

EAP, IEEE 802.16e and Handover

[1]. T. N. Nguyen and M. Ma, �An Pre-authentication Protocol With Symmetric Key For Secure Handover in Mobile WiMAX Network�. IEEE ICC-communication and information system security Symposium-2012.
[2]. A. Fu, S. Lan, B. Huang, Z. Zhu and Y. Zhang, �A Novel Group-Based Handover Authentication Scheme With Privacy Preservation for Mobile WiMAX Networks�. IEEE Communication letter, vol. 16, no. 11, November 2012.
[3]. M. Shurman, M. F. Al-Mistarihi and S. Naseer, �Hard Handover Optimization in Mobile WiMAX Networks�, presented at the 5th International Conference on Communications, Computers and Application, Istanbul, Turkey, Oct. 2012.
[4]. Caiyong Hao, Hongali Liu, Jie Zhan, �A velocity-Adaptive handover scheme for mobile WiMAX�, International Journal of Communication, Network and System Sciences, vol. 2, no. 9.
[5]. E. Ahmed, B. Askwith and M. Merabti, �Handover Optimization for Real-Time Application in Mobile WiMAX/IEEE 802.16e� UK. ISBN: 978-1-902560-24-3, 2010 pp. 2-3.
[6]. A. Pontes, D. Silva, J. Jailton., K. Dias, �Handover Management in Integrated WLAN And Mobile WiMAX Networks� IEEE Wireless Communications, October 2008, pp. 88-90.
[7]. T. Nguyen and M. Ma, �Enhanced EAP-Based Pre-Authentication for Fast and Secure Inter-ASN Handovers in Mobile WiMAX Networks�, IEEE Transactions on Wireless Communications, Vol. 11, No. 6, pp. 2173-2175, June 2012.
[8]. A. Taha, A. Hamid and S. Tahar, �Formal Analysis of the Handover Schemes in Mobile WiMAX Networks� 2009 � IEEE.978-1-4244-3474, pp. 2-4.
[9]. Y. Benkaouz, B. Angoma and M. Erradi, �Performance Analysis of WiFi/WiMAX Vertical Handover based on Media Independent Handover� in Networking and Distributed Systems Research Group, 2012 � IEEE. 978-1-4673-1520.
[10]. T. Issariyakul and E. Hossain, Introduction to Network Simulator NS2. New York: Springer, 2008.
[11]. J.Hur, H.Shim, P.Kim, H.Yoon and N-O.Song, �Security Considerations for Handover Schemes in Mobile WiMAX Networks,� Proc. of Int�l Conf. on Wireless Comm. And Networking, 2008.
[12]. S. More and D. K. Mishra, �4G Revolution: WiMAX Technology� in Department of Computer Science and Engineering, 2012 � IEEE. 978-1-473-2590.
[13]. Subhashini S., �Active EAP Protocol for Secure Inter ASN Handover in Mobile WiMAX Networks�, IJREAT International Journal of Research in Engineering & Advanced Technology, vol. 1, no. 2, April-May, 2013.
[14]. G. Zorn (2010, 09 December 2010). RADIUS Attributes for IEEE 802.16 Privacy Key Management Version 1(PKMv1) Protocol Support.[RFC 5904]. Available: http://www.rfc-editor.org/rfc/rfc5904.txt
[15]. Y. Ye, Q. Yi, and H. Sharif, �Performance analysis if IEEE 802.16e handover with RSA-based authentication�, in ICC 2010-2010 IEEE International Conference on Communications, 23-27 May 2010, Piscataway, NJ, USA, 2010, p.5 pp.
[16]. Lee D.H., Kyamekya K., Umondi J.P., �Fast Handover Algorithm for IEEE 802.16e Broadband Wireless Access System�, ISWPC 2006.
[17]. H-M.Sun, S-Y.Chang, Y-H.Lin and S-Y.Chiou, �Efficient Authentication Schemes for Handover in Mobile WiMAX,� Proc. of 8th Int�l Conf. on Syst. Design and Applications, 2008.

B.M. Nikhar, K.N. Hande, "A Survey on Secure Handover Optimization in Mobile WiMAX Network," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.21-27, 2014.

In a computer architecture Cache memory have been introduced to balance performance and cost of the system. To improve the performance of a cache memory in terms of hit ratio and good response time system needs to employ efficient cache replacement policy. Unified Buffer cache management, Program Counter-based Classification, Detection based Adaptive Replacement, Robust Adaptive buffer Cache management scheme and Block Pattern Based Buffer Cache Management are some of the existing policies. But they have some disadvantages like they were not able to exploit both recency and frequency information, some of them could not exploit all type of reference regularities, some of them have high memory overhead. So we require more advanced policies to improve the performance. In this work we are proposing the block access pattern based replacement policy which predicts future request of a block based on history of response time for respective data block. Block access pattern based replacement policy leads to effective improvement in buffer cache hit ratio and reduced response time.

Buffer Cache, Access Patterns, Cache Replacement Policies, Buffer Cache Management Techniques

[1] Hou Fang, zhao Yue-long, Hou fang, �A cache management algorithm based on page miss cost�, in proceedings of International conference on Information Engineering and computer science, ICIECS, ISBN: 978-1-4244-4994-1 pp. 1-4, 2009.
[2] Prof.P. K. Biswas, "Lecture series on digital computer organization," Internet: http://nptel.iitm.ac.in, Sep 2009.
[3] M. J. Bach, �Operating system the design of the UNIX�, Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1986.
[4] A. S. Tanenbaum, A. S.Woodhull, �Operating systems design and implementation�, Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1987.
[5] Donghee Lee, et.al.,.�On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies�,SIGMETRICS�99 Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 134-143, NY, USA, 1999.
[6]E. J. O�Neil, P. E. O�Neil, and G. Weikum., �The LRU-K Page Replacement Algorithm for Database Disk Buffering� , ACM Conference on SIGMOD, pg. no. 297�306, 1993.
[7] K. So and R. N. Rechtschaffen, �Cache operations by MRU change.� IEEE Trans. Computers, vol. 37, no. 6, pp. 700�709, 1988.
[8] L. A. Belady, �A study of replacement algorithms for a virtual-storage computer,� IBM Syst. J., vol. 5, no. 2, pp. 78-101, 1966.
[9] Alfred V. Aho, Jeffrey D. Ullman, et.al., �Principles of Optimal Page Replacement�, Journal of ACM, Vol 18, Issue 1, Pages 80-93,Jan 1971.
[10] R. Turner and H. Levy, �Segmented FIFO Page Replacement�, In Proceedings of SIGMETRICS ,1981.
[11] A. Dan and D. Towsley, �An Approximate Analysis of the LRU and FIFO Buffer Replacement Schemes�, in Proceedings of ACM SIGMETRICS, Boulder, Colorado, United States, pp. 143�152,1990.
[12] Y. Smaragdakis, S. Kaplan, and P. Wilson, �EELRU: simple and effective adaptive page replacement,� in Proceedings of ACM SIGMETRICS international conference on Measurement and modeling of computer systems, New York, USA, pg. no. 122�133, 1999.
[13] T. Johnson and D. Shasha, �2Q : A Low Overhead High Performance Buffer Management Replacement Algorithm� , In Proceedings of the 20th International Conference on VLDB, pg. no. 439�450, 1994.
[14] D. Lee, J. Choi, J. Kim, S. Noh, S. Min, Y. Cho, and C. Kim, �LRFU: A Spectrum of Policies that Subsumes the LRU and LFU Policies�, IEEE Transactions on Computers, vol. 50, Issue no. 12, pp.1352-1361, Dec. 2001
[15] N. Megiddo and D. S. Modha, �ARC: A self-tuning, low overhead replacement cache,� in Proceedings of the 2nd USENIX Conference on File and Storage Technologies (FAST), pg no. 115�130, Mar 2003.
[16] S. Jiang and X. Zhang, �LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance,� in Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pg. no. 31�42, June 2002.
[17] Seon-yeong Park, et.al., �CFLRU: A Replacement Algorithm for Flash Memory�, CASES`06, October 23�25, Seoul, Korea ,2006.
[18] LI Zhan-sheng, et.al.,�CRFP: A Novel Adaptive Replacement Policy Combined the LRU and LFU�, IEEE 8th International Conference on Computer and Information Technology Workshops, 2008.
[19] Andhi Janapsatya, Aleksandar Ignjatovi�c, et.al., �Dueling CLOCK: Adaptive Cache Replacement Policy Based on The CLOCK Algorithm�, 2010.
[20] T. Puzak, et.al,�Analysis of cache replacement algorithms,� Ph.D. dissertation, Dep. Elec. Comput. Eng., Univ. Massachusetts, Feb.1985.
[21] F. Zhou, R. von Behren, and E. Brewer, �AMP: Program context specific buffer caching,� in Proceedings of the USENIX Technical Conference, Apr. 2005
[22] C. Gniady, A. R. Butt, and Y. C. Hu, �Program-counter based pattern classification in buffer caching�, in Proceedings of 6th Symposium on Operating System Design and Implementation ,pg. no. 395�408, Dec. 2004.
[23] J. M. Kim, J. Choi, J. Kim, S. H. Noh, S. L.Min, Y. Cho, and C. S. Kim,�A low-overhead, high-performance unified buffer management scheme that exploits sequential and looping references,� in 4th Symposium on Operating System Design and Implementation ,pg. no. 119�134, Oct. 2000.
[24] Jongmoo Choiy, Sam H. Nohz, Sang LyulMiny, Yookun Cho, �An Adaptive Block Management Scheme Using On-Line Detection of Block Reference Patterns�, International Workshop on Multi-Media Database Management Systems, Proceedings , pg no. 172 � 179, Dayton, Aug 1998.
[25] Yifeng Zhu, Hong Jiang,�RACE: A Robust Adaptive Caching Strategy for Buffer Cache�, IEEE Transaction on computers, 2007.
[26] Urmila Shrawankar, Reetu Gupta, �Block Pattern Based Buffer Cache Management�, The 8th International Conference on Computer Science and Education, April 26-28, Colombo, 2013.
[27] Reetu Gupta, Urmila Shrawankar, �Managing Buffer Cache by Block Access Pattern�, IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 6, November 2012.
[28] P. Cao, et.al., �Implementation and performance of integrated application-controlled file caching, prefetching, and disk scheduling,� ACM Transactions on Computer Systems, vol. 14, Issue 4, pp. 311�343, 1996.
[29] R. H. Patterson, G. A. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka, �Informed prefetching and caching,� in Proceedings of the fifteenth ACM symposium on Operating systems principles (SOSP), New York, USA: ACM Press, 1995.
[30] A. Jaleel, C. Jean, S. C. Steely, �ShiP: Signature Based Hit Predictor for High Performance Caching�, ACM International symposium on Computer Architectur, pg 430-431, 2011.
[31] Zhiyang Ding,et.al., �An Automatic Prefetching and Caching System�, IEEE, 2010.
[32] Heung Seok Jeon, �Practical Buffer Cache Management Scheme based on Simple Prefetching�, IEEE Transactions on Consumer Electronics, Volume.- 52, Issue - 3, August 2006.
[33] G. Keramidas, P. Petoumenou, S. kaxiras, �Cache Replacement Based on Reuse Distance Prediction�, Computer Design IEEE International Conference, page no- 245-250, Oct 2007.
[34] G. Keramidas, P. Petoumenou, S. kaxiras, � Instruction Based Reuse Distance Prediction for Efficient Cache Management�, Pet International Symposium on System, Architecture, Modeling and Simulations, page no. 48-49, July 2009.

N. Dafre, U. Shrawankar, D. Kapgate, "Pattern Based Cache Management Policies," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.28-35, 2014.

Energy consumption is a primary concern in the Wireless Sensor Network. This leads to pursue the maximum energy saving at sensor nodes, where a relay is used to transfer the data packet. This leads to the increase in the data gathering latency due to low moving velocity of the mobile collector. In this paper we study the tradeoff between energy saving and data gathering latency in mobile data gathering by exploring a balance between the relay hop count of local data aggregation and the moving tour length of the mobile collector. In this we propose a polling based mobile gathering approach, which leads to optimization problem named bounded relay hop mobile data gathering (BHR - MDG). A subset of sensors are used for the polling points. Thus these are the two efficient algorithms for selecting polling points among sensors.

Wireless Sensor Networks, Mobile Data Gathering, Relay Hop Count, Polling Points, Moving Tour

[1] Bounded Relay Hop Mobile Data Gathering in Wireless Sensor Networks Miao Zhao, Member, IEEE, and Yuanyuan Yang, Fellow, IEEE 2012.
[2] Data Pre-Forwarding for Opportunistic Data Collection in Wireless Sensor Networks Xiuchao Wu, Kenneth N. Brown, and Cormack J. Sreenan Department of Computer Science, University College Cork, Ireland, 2010.
[3] Mobile Relay Configuration in Data-intensive Wireless Sensor Networks Fatme El-Moukaddem, Eric Torng, Guoliang Xing, 2010 .
[4] Analysis of Smartphone User Mobility Traces for Opportunistic Data Collection_Xiuchao Wu Kenneth N. Brown Cormac J. Sreenan Department of Computer Science, University College Cork, Ireland, 2012.
[5] Ubiquitous Data Collection for Mobile Users in Wireless Sensor Networks Zhenjiang Li��, Mo Li�, Jiliang Wang� and Zhichao Cao� �Department of Computer Science and Engineering, Hong Kong University of Science and Technology �School of Computer Engineering, Nanyang Technological University, 2010.
[6] TEEN: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks Arati Manjeshwar and Dharma P. Agrawal Center for Distributed and Mobile Computing, ECECS Department, University of Cincinnati, Cincinnati, OH 45221-0030, 2001.
[7] A Coordinated Data Collection Approach: Design, Evaluation, and Comparison William C. Cheng, Cheng-Fu Chou, Leana Golubchik, Member, IEEE, Samir Khuller, and Yung-Chun (Justin) Wan, journal 2004.
[8] A Mobile Embedded Networked Sensor Platform Richard Pon1,2, Maxim A. Batalin1,3, Jason Gordon1,2, Aman Kansal1,2, Duo Liu1,2, Mohammad Rahimi1,3, Lisa Shirachi1,2, Yan Yu1,4, Mark Hansen1,5, William J. Kaiser1,2 , journal 2005.
[9] Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks Jun Luo Jean-Pierre Hubaux School of Computer and Communication Sciences Ecole Polytechnique F&rale de Lausanne (EPFL) , CH-1015 Lausanne, Switzerland , journal 2005.
[10] Mobile Element Scheduling with Dynamic Deadlines Arun A. Somasundara, Aditya Ramamoorthy, Member, IEEE, and Mani B. Srivastava, Senior Member, IEEE, journal 2007.
[11] SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks Ming Ma, Student Member, IEEE, and Yuanyuan Yang, Senior Member, IEEE journal 2007.
[12] ASAP: An Adaptive Sampling Approach to Data Collection in Sensor Networks Bugra Gedik, Member, IEEE, Ling Liu, Senior Member, IEEE, and Philip S. Yu, Fellow, IEEE journal 2007.
[13] A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink Marios Gatzianas and Leonidas Georgiadis, Senior Member, IEEE journal 2008.
[14] Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks Xueyan Tang, Member, IEEE, and Jianliang Xu, Senior Member, IEEE journal 2008.
[15] Data Gathering in Wireless Sensor Networks with Mobile Collectors Ming Ma and Yuanyuan Yang Department of Electrical and Computer Engineering, State University of New York, Stony Brook, NY 11794, USA journal 2008.
[16] Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications Young Sang Yun, Student Member, IEEE, and Ye Xia, Member, IEEE journal 2010.
[17] Efficient Data Gathering with Mobile Collectors and Space-Division Multiple Access Technique in Wireless Sensor Networks Miao Zhao, Student Member, IEEE, Ming Ma, and Yuanyuan Yang, Fellow, IEEE journal 2011.
[18] Analysis on Data Collection with Multiple Mobile Elements in Wireless Sensor Networks Liang He1,2, Jianping Pan1, and Jingdong Xu2 1University of Victoria, Victoria, BC, Canada 2Nankai University, Tianjin, China journal 2011.
[19] Wireless Sensor Networks F. L. LEWIS Associate Director for Research Head, Advanced Controls, Sensors, and MEMS Group Automation and Robotics Research Institute The University of Texas at Arlington 7300 Jack Newell Blvd. S Ft. Worth, Texas 76118-7115 journal 2004.

R. Nathiya, S.G. Santhi, "Energy Efficient Routing with Mobile Collector in Wireless Sensor Networks (WSNs)," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.36-43, 2014.

The current widespread use of location-based services and Global Positioning System technologies has revived interest in very fast and scalable dynamic shortest path queries. We introduce a new shortest path query type in which dynamic constraints may be placed on the allowable set of edges that can appear on a valid forward recursion shortest path. Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. Our experimental results reveal the characteristics of different techniques, based on which we provide guidelines on selecting appropriate methods for various scenarios. Although the raw data about geography and roads may be more readily available today, computing forward shortest paths is still not trivial. Dynamic algorithm allows us to compute point-to-point dynamic shortest path queries on any road network in essentially linear time. . In a preprocessing stage, these heuristics compute some auxiliary data, such as additional edges (shortcuts) and labels or values associated with vertices or edges.

Dynamic Programming, Forward Recursion, Shortest Route, Stage i, State i, Minimum Paths, Backward Recursion

[1]. Hamdy A. Taha., Operation Research, Prentice Hall, Eighth Edition, 2011.
[2]. Bertsekas. D., Dynamic Programming: Deterministic and Stochastic Models, Prentice Hall, Upper Saddle River, NJ, 1987.
[3]. Denardo. E., Dynamic Programming theory and Applications, Prentice Hall, Upper Saddle River, NJ, 1982.
[4]. Dreyfus. S and A. Law., The Art and Theory of Dynamic Programming, Academic Press, New York, 1977.
[5]. Sntedovich. M., Dynamic Programming, Marcel Dekker, New York, 1991.
[6]. Taha H. (1997) Operations Research; An introduction, Second Edition Macmillan Publishing Co. inc New York

N. Karthikeyan, "Shortest Route Algorithm Using Dynamic Programming by Forward Recursion," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.44-48, 2014.

Powerful source management for a large-scale reasoning environment is a significant issue. Power consumption consists of a significant fraction of total operating price in information facilities. Resource allowance among sites/applications, dynamically adjusts the allowance to load changes and machines both in the number of physical machines and sites/applications. A method that determines an optimal remedy without considering memory restrictions and prove correctness and unity properties. Increase that method to provide an efficient heuristic remedy for the complete issue, which includes reducing the price for adjusting an allowance. The method consistently carries out on dynamic, local input and does not require global synchronization, the heuristic criteria to do. Utilizing available power storage space capability in information facilities to reduce electric bill under real-time electricity market. Lyapunov optimization technique is applied to design a criterion that accomplishes an precise compromise between price preserving and power storage space capacity.

Cloud Computing, Distributed Management, Resource Allocation, Lyapunov Optimization

[1]. R. Yanggratoke, F. Wuhib, and R. Stadler, �Gossip-based resource allocation for green computing in large clouds,� in 2011 International Conference on Network and Service Management.
[2]. OpenNebula Project Leads, http://www.opennebula.org/, Feb. 2012.
[3]. OpenStack LLC, http://www.openstack.org, Feb. 2012.
[4]. Eucalyptus Systems, Inc., http://www.eucalyptus.com/, Feb. 2012.
[5]. UC Santa Barbara, http://appscale.cs.ucsb.edu/, Feb. 2012.
[6]. �IBM WebSphere Application Server,� http://www.ibm.com/software/ webservers/appserv/extend/virtualenterprise/, Feb. 2012.
[7]. VMWare, http://www.cloudfoundry.com/, Feb. 2012.
[8]. Amazon Web Services LLC, http://aws.amazon.com/ec2/, Feb. 2012.
[9]. Google Inc., http://code.google.com/appengine/, Feb. 2012.
[10]. Y. Guo, Z. Ding, Y. Fang, and D. Wu, �Cutting Down Electricity Cost in Internet Data Centers by Using Energy Storage,� Proc. IEEE GLOBECOM �11, Dec. 2011.
[11]. M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, �A View of Cloud Computing,� Comm. ACM, vol. 53, no. 4, pp. 50-58, Apr. 2010.
[12]. A. Qureshi, R. Weber, H. Balakrishnan, J. Guttag, and B. Maggs, �Cutting the Electric Bill for Internet-Scale Systems,� ACM SIGCOMM Computer Comm. Rev., vol. 39, no. 4, pp. 123-134, Aug. 2009.

T. Therasa, V. Vasanth, M. Vidhya, "Resource Management in Large Cloud Environments Using Lyapunov and Heuristic Algorithm," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.49-51, 2014.

The cloud computing platform gives people the opportunity for sharing resources, services and. In the last few years, cloud computing has grown from being a promising business concept to one of the fast growing segments of the IT industry. But as more and more information on individuals and companies are placed in the cloud, concerns are beginning to grow about just how safe an environment it is. In this paper we have proposed new security architecture for cloud computing platform. This ensures secure communication system and hiding information from others. It aims at meeting all security requirements.

RSA, Trusted Third Party, Security Requirements

[1]. R.L. Rivest, A. Shamir, and L. Adleman, �A Method for Obtaining Digital Signatures and Public-Key Cryptosystems�, Laboratory for Computer Science, Massachusetts Institute of Technology, Cam-bridge, November, 1977
[2]. Burt Kaliski, The Mathematics of the RSA Public-Key Cryptosystem, RSA Laboratories
[3]. Joan Daemen, Vincent Rijmen, �AES Proposal: Rijndael�, 1999
[4]. Joan Daemen, Vincent Rijmen, �Announcing the ADVANCED ENCRYPTION STANDARD (AES)�, Federal Information Processing Standards Publication 197, November 26, 2001
[5]. Joshua Holden, Mohammad Musa, Edward Schaefer, and Stephen Wedig, �A Simplified AES Algorithm�, January 2010
[6]. Ronald Rivest, �MD5 Message-Digest Algorithm�, rfc 1321, April 1992
[7]. Neil M.Haller, �THE S/KEY ONE-TIME PASSWORD SYSTEM�, 1993.
[8]. Neil Haller, �A One-Time Password System�, October 23, 1995
[9]. Mell, P., Grance, T., (2009). The Nist Definition of Cloud Computing. Recommendations of the National Institute of Standards and Technology. NIST special publication, 2011 National Institute of standards and technology.
[10]. Vaquero, L.M., Rodero-Merino, L., Caceres, J., Lindner, M. (2009). A Break in the Clouds: Towards a Cloud Definition. ACM SIGCOMM Computer Communication Review, 39(1), 50-55.
[11]. Strickland, J. (2011) How cloud computing works. Howstuffworks.com. Available at: computer.howstuffworks.com/cloud-computing.htm
[12]. Vouk, MA. (2008) Cloud Computing - Issues, Research and Implementations. Journal of Computing and Information Technology, 16(4), 235-246.
[13]. Buyya (2009), Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility. Future Generation Computer Systems. 25(6) 599-616.
[14]. Velte, T., Velte, J., Elsenpeter, R. (2009). Cloud Computing: A Practical Approach. McGraw-Hill Osborne Media.

N. Thakur, V. Pandey, B. Singh, "An Innovational Approach to Security in Cloud Environment," International Journal of Computer Sciences and Engineering, Vol.2, Issue.2, pp.52-54, 2014.