Volume-2 , Issue-6 , Jun - 2014 Go Back

Signal transmission in Wireless Networks suffers considerably from much impairment, one of which is channel fading due to multipath propagation. Cooperative Communication is a technique which could be employed to mitigate the effects of channel fading by exploiting Diversity gain achieved via cooperation between nodes and relays. In this scenario, a network containing a sender, a destination and a relay is analyzed. Three cooperative communication schemes which include Amplify and Forward, Decode and Forward and Coded Cooperation are employed with different combining techniques are investigated. The idea behind Cooperative communication is to shows two mobile users communicating with the same destination. Each mobile has one antenna and cannot individually generate spatial diversity. However, it may be possible for one mobile to receive the others transmitting signal, in which case it can forward some version of �overheard� information of other users along with its own.

Cooperative communications, Amplify and forward protocol, Decode-and- forward protocol, Symbol error rate � Rayleigh fading � LDPC coding. Convolution coding

[1] Laneman, J. N., & Wornell, G. W. (2003). Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks. IEEE Transactions on Information Theory, 49, 2003, pp 2415� 2525.
[2] Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12),(2004), pp 3062�3080.
[3] A. . Sendonaris, E. Erkip, and B. Aazhang, �User Cooperation Diversity Part I and Part II,� IEEE Trans. Commun., vol. 51, no. 11, Nov. 2003, pp. 1927�48.
[5] H. Ochiai, P. Mitran, H. V. Poor, and V. Tarokh, �Collaborative beamforming for distributed wireless ad hoc sensor networks,� IEEE Trans. Signal Process., vol. 53, no. 11, Nov. 2005. pp 4110-4124.
[6] A. Nandi and S. Kundu, "Optimal Transmit Power and Packet Size in Wireless Sensor Networks in Shadowed Channel", International Journal of Sensor Networks (IJSNet), Vol. 11, No 2, 2012, pp. 81-89.
[7] A. Nandi and S. Kundu, "Energy Level Performance of Retransmission Schemes in Wireless Sensor Networks over Rayleigh Fading Channel", Proc. IEEE International Conference on Computational Intelligence and Communication Networks (CICN 2010), 2010, pp. 220-225.
[8] A. Nandi and S. Kundu, "Energy Level Performance of Packet Delivery Schemes in Wireless Sensor Networks in Shadowed Channel", Sensors & Transducers Journal (S & T), Vol 118, Issue 7, 2010, pp. 73 � 86.
[9] N.Ahmed, M. Khojastepour, A. Sabharwal, and B. Aazhang, �On power control with finite rate feedback for cooperative relay networks,� in Proc. Int. Symp. Inf. Theory Appl., Mar. 2004.

[10] Y Fan, J Thompson, MIMO configurations for relay channels: theory and practice. IEEE Trans. Wireless Commun 6(5), (20070 ,pp-1774�1786.
[11] A Nosratinia,, TE Hunter, Grouping and partner selection in cooperative wireless networks. IEEE J. Sel. Areas Commun 25(2), (2007),pp 369�378.
[12]J Huang, Z Han, M Chiang, HV Poor, Auction-based resource allocation for cooperative communications. IEEE J. Sel. Areas Commun, Vol. 26, Issue 7, 2008, pp. 1226�1237.
[13], T. M. Cover and A. A. El Gamal, Capacity theorems for the relay channel, IEEE Transactions on Information Theory, vol. 25, no. 5, September 1979, pp. 572-584.
[14] M. Jananiss et al., �Coded Cooperation in Wireless Communications:Space-Time Transmission and Iterative Decoding,� IEEE Trans. Sig. Proc., vol. 52, no. 2, Feb.2004, pp. 362�71.
[15] Y. Jiang, �A Practical Guide to Error-Control Coding Using MATLAB�,� Artech House, 2010
[16] R. Hamming, "Error detecting and error correcting codes," Bell System Technical Journal, Vol. 29, 1950, pp. 147 160.

A. Pandit, A. Nandi, "Performance of Co-operative Communication Networks using Error Control," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.1-6, 2014.

Segment based programming designing (CBSE) (otherwise called part based advancement (CBD)) is an extension of programming building that underscores the partition of concerns in admiration of the colossal usefulness accessible all through a given programming framework. It is a reuse-based strategy to portraying, realizing and making pretty nearly coupled free parts into structures free parts into frameworks. This practice expects to achieve a similarly boundless level of profits in both the fleeting and the long haul for the product itself and for associations that support such programming. Programming designers see parts as a major aspect of the beginning stage for administration introduction. Segments assume this part, for instance, in web benefits, and all the more as of late, in administration situated architectures (SOA), whereby a segment is changed over by the web administration into an administration and thusly inherits further aspects past that of a common part.

Software Component, Software component models, Component technologies, Software engineering

[1]. Asif Irshad Khan, Noor-Ul-Qayyum, Usman Ali khan �An improved model for component based development�, Software Engineering 2012, 2(4):PP. 138-146 DOI: 10.5923/J.SE.20120204.07.
[2]. Rajender Singh Chhillar, Parveen Kajla �A new - knot model for component based software development.� Ijcsi International Journal Of Computer Science Issues, Vol. 8, Issue 3, no. 2, May 2011.

P. Madeshia, D. Gupta, "Component Based Software Development," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.7-8, 2014.

Individuals dependably speak with one another through distinctive interpersonal interaction locales and this is the simplest approach to impart to the companion and relatives who are not around us. However we regularly see that we generally get the unwanted or unwelcome messages, messages and notices from the unwanted individuals which makes us uncomfortable and this is not acknowledged by anyone. We mark this sorts of undesirable messages "social spam "and recommended the groupings approaches to discover this spams. By perceiving and assessing of different characteristics of the social spam on the person to person communication administrations we have turned out with the potential indicates that can help us to separate the spammers with the authentic clients. We have additionally shed some light on the order of the spams and procedures which can help us to uproot the obstructions which regularly occurred while utilizing the informal communication administrations. The devices and systems likewise give wellbeing to different expert systems administration and organizations in viewpoint of classified data.

Spam,Social Spam,Clustering,Detection,Techniques

[1]Beate Krause Christoph Schmitz Andreas Hotho Gerd Stummehttp://www.kde.cs.uni-kassel.de
[2] Benjamin Markines Ciro Cattuto2 Filippo Menczer1;Complex Networks Lagrange Laboratory,
[3]Danesh Irani, SteveWebb, and Calton danesh, webb calton}@cc.gatech.edu
[4] Nitin Jindal and Bing Liunitin.jindal@gmail.com, liub@cs.uic.edu
[5] De Wang, Danesh Irani, and Calton Pu wang6, danesh, calton} @cc.gatech.edu
[6] Congrui Huang, Qiancheng Jiang, and Yan Zhang Key Laboratory of Machine Perception, Ministry of Education
[7]School of Electronics Engineering and Computer Science, PekingUniversityBeijinghcr@pku.edu.cn,{jiangqiancheng,zhy}@cis.pku.edu.cn.
[8]Gilad MishneInformatics Institute, University of Amsterdam Kruislaan 403, 1098SJ Amsterdam The Netherlandsgilad@science.uva.nl
[9] David Carmel, Ronny Lempel IBM Research Lab in Haifa Haifa 31905, Israel {carmel,rlempel}@il.ibm.com
[10]Benjamin Markines1;2Ciro Cattuto2 Filippo Menczer1;2 1School of Informatics, Indiana University, Bloomington, Indiana, USA 2Complex Networks Lagrange Laboratory, Institute

Shaziya, K. Hans, "The Social Media Spam," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.9-12, 2014.

Now a day�s internet is one of the best ways to access any information. If a person make fully optimized site then definitely they can achieve top first position of their site in Google page result. As you know Google provide top 10 result so if your site is not visible in top first page then whatever information you want to give for people it�s not obtain properly . This paper represents how any person that wants to make their own website can promote a site with the help of my SEO Methodology. This paper is fully based on keyword research it means if a person is able to optimize right keyword whatever keyword used currently then its sure that their site will be on top first page on Google page result. Today every person has their own website so it is very difficult to place the site in first position on Google page result. This paper will solve this problem.

Search Engine Optimization, keyword Research, on page optimization, off page optimization

[1]. Vinit, et al: Search Engine Optimization with Google, IJCSE, vol-9, issue-1, January 2012, pp. 206-214.
[2]. Belsare S. and Patil S., �Study and Evaluation of user�s Behavior in E-commerce Using Data�, Research Journal of Recent Sciences, vol-1, issue-7, 2012, pp. 375-387.
[3]. Cho J. And Roy S. �Impact of search engines on page popularity�, Proc. 13th International conference on World Wide Web, vol-1, issue-2 ,2004, pp. 20-29 .
[4]. Page L., Brin S., Motwani R. and Winograd T.�The PageRank Citation ranking: Bringing order to the web�, Technical Report, Stand ford Info. Lab, vol-1, issue-1, 1999 , pp. 20-27.
[5]. Knezeric B. and Vidas-Bubanja M.� Search Engine Marketing As Key Factor For Generating Quality Online Visitors�, MIPRO, Proc. 33rd International Convention, vol-2, issue-2, 2010, pp. 1193-1196.
[6]. Grzywaczewski, et al: E-Marketing Strategy for Businesses, IEEE, vol-2, issue-2, May 2010, pp. 201-207.
[7]. Kevin Potts, �Web Design and Marketing Solutions for Business Websites��, Springer-Verlag New York, Inc., NY, vol-1, issue-2, 2007, pp. 1-7.
[8]. Nima, �Common search engine principals�, IJREAS, vol-2, issue-2, February 2012, ISSN: 2249-3905, pp. 1529-1536.
[9]. (2011) Affordable SEO services website. [Online]. Available: http://www.affordable-seo services.com/on-page- optimization. html .
[10]. (2011) Affordable SEO services website. [Online]. Available: http://www.affordable-seo-services.com/off-page- optimization.html.

R. Shrivastva, S.L. Mewada, P. Sharma, "An Approach to Give First Rank for Website and Webpage Through SEO," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.13-17, 2014.

The objective of this paper is to utilize the features obtained by the artificial neural network rather than the original multispectral features of remote-sensing images for land cover classification. WT provides the spatial and spectral characteristics of a pixel along with its neighbors and hence, this can be utilized for an improved classification. And the combination of remote sensing and geographic ancillary data is believed to offer improved accuracy in land cover classification. This paper focuses on the Image Analysis of Remote Sensing Data Integrating Spectral and Spatial Features of Objects in the area of satellite image processing. Here multi-spectral remote sensing data is used to find the spectral signature of different objects.

Remote sensing, Spectral wavelength, Multi-spectral images, ANN

[1]. Saroj K. Meher, B.Uma Shankar, and Ashish Ghosh, 2007, "Wavelet Feature Based Classifiers for Multispectral Remote-Sensing Images", Indian Statistical Institute, Kolkata, India.
[2]. Pai-Hui Hsu Yi-Hsing Tseng, 2002, ―Feature Extraction of Hyperspectral Data Using the Best Wavelet Packet Basis‖ IEEE Page(s):1667-1669.
[3]. B.Uma Shankar, Saroj K Meher and Ashish Ghosh, 2007, ―Neuro- Wavelet Classifier for Remote Sensing Image Classification‖, Proceedings of the International Conference on Computing: Theory and Applications (ICCTA), Indian Statistical Institute, India.
[4]. Yikuan Zhang, Ke Lu, and Ning He and Peng Zhang, 2007, "Research on Land Use/Cover Classification Based on RS and GIS", Second International Symposium on Plant Growth Modeling, Simulation, Visualization and Applications, China.
[5]. Yan Guo, Lishan Kang, Fujiang Liu, Huashan Sun and Linlu Mei, 2007, ―Evolutionary Neural Networks Applied to Land-cover Classification in Zhaoyuan, China‖ Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, Page(s): 499-503.
[6]. Yoshikazu Iikura, 2007, ―Landcover Classification of Satellite Imagery with Tesselated Spatial Structure Model‖ IEEE, Page(s):1463-1467.
[7]. Idan FELDBERG, Nathan S. NETANYAHU and Maxim SHOSHANY, 2002, ―A Neural Network-Based Technique for Change Detection of Linear Features and Its Application to a Mediterranean Region‖ IEEE Page(s):1195-1197. W.Zou, Z.Chi and K.C.Lo, 2008, ―Improvement of image classification using wavelet coefficients with structured based neural network‖, International Joint Conference on Neural Networks Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada.
[8]. Chih-Cheng Hung, Youngsup Kim and Tommy L. Coleman, 2010, ―A Comparative Study of Radial Basis Function Neural Networks and Wavelet Neural Networks in Classification of Remotely Sensed Data‖, U.S.A.
[9]. Xia Jun, Liu Jinmei, Wang Guoyu, and Li Jizhong, 2011, "The Classification of Land Cover Derived from High Resolution Remote Sensing Imagery".

Kusum, Nisha, "COMPARATIVE ANALYSIS AND CLASSIFICATION OF MULTISPECTRAL REMOTE SENSING DATA," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.18-21, 2014.

The importance of reducing a chance of the Information being detected during the transmission is being an issue now days. Some solution to be discussed is how to pass information in a manner that the very existence of the message is unknown in order to repel attention of the potential attacker. Steganography comes from Greek and literally means �Covered writing�. Steganography is closely related to hidden channel scheme. It is the art and science of writing of hidden message in such a way that no one apart of intended recipients knows the existence of message. Steganography is often confused with cryptography because the two are almost similar in the way that they both are used to protect confidential information. The difference between the two is in the appearance in the processed output; the output of steganography operation is not apparently visible but in cryptography the output is scrambled so that it can draw attention. Applications of both are in the field of communication system, Steganography coding inside transport layer such as an MP3 file and in the defence system.

Steganography, Spatial Domain, Transform Domain: Steganography, Spatial Domain, Transform Domain

[1]. YambemJinaChanu, ThemrichonTuithung, Kh.Manglem Singh�short survey on image steganography and steganalysis techniques� ,978-1-4577-0748-3/ 2012 IEEE.
[2]. GeHuayong , Huang Mingsheng, Wang Qian, �Steganography and steganalysis based on digital images �978-1-4244-9306-7 2011IEEE conference on image and signal processing.
[3]. Vijay Kumar,Dinesh Kumar, �Performance evaluation of DWT based image steganography� 223-228 ,2010 IEEE 2nd international advance computing conference .
[4]. R.Amrittharajan,Sandeepkumarbehera,AbhilashSwarup, �Colour guided colour image steganography � universal journal of computer science and engineering technology 16-23,oct. 2010
[5]. Prabakran.G, Bhavani.R � A modified secure digital image steganography based on discrete wavelet transform�, 1096-1100, 2012 IEEE
[6]. Chi-Kwong Chan∗, L.M. Cheng �Hiding data in image by simple LSb substitution�, the journal of the pattern recognition society, pattern recognition 37(2004) 469-474
[7]. R.Amritharajan,r.akila,P.Deepikachowdavarapu,�A comparative analysis of image Steganography� international journal of computal applications (0975-8887) ,volume 2-No.3,May-2010.
[8]. W.Bender,D.Garhul,N.Morimoto,A.Lu,� Techniques for data hiding� IBM System journal VOL.35,NOS 3&4,199
[9]. Hide and seek: An introduction to steganography, 1540- 7993,2003 IEEE security and privacy
[10]. SANS institute infosec reading room :steganography : past, present ,future
[11]. MiroslavDobsicek :Modern Steagnography

Nisha and Kusu, "DATA HIDING IN IMAGE BY OPTIMAL RANDOM SUBSTITUTION," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.22-24, 2014.

This paper proposes a calculation method for the improvement of RSA algorithm which reduces the issues of scalability, flexibility and performance. This paper will be based on the mathematical function used in the RSA algorithm and reduces the number of steps for calculating the value of Md. The proposed method improves the calculation performance of the RSA to make it useful in providing security to every known application.

RSA algorithm, Key generation Encryption, Decryption, Modular Exponentiation, Binary Method

[1]. �A method for obtaining Digital Signature and Public key crypto system� by R.Rivest, A.Shamir, and adleman.
[2]. �Data security in cloud computing using RSA Algorithm�, International Journal of Research in Computer and Technology, IJRCCT, Parsi kalpna et. Al, ISSN 2278-5841, vol1, issue 4, September 2012.
[3]. �Cryptography and Network Security� principle and practices fourth edition, 2006, Page no. 306-366.
[4]. �A study on Improvement in RSA Algorithm and its implementation�, International Journal of Research in Computer and Technology, IJRCCT, P Saveetha & S. Arumugam, ISSN volume-3 2012.
[5]. �High Speed RSA Implementation�Cetin Kaya Koc, RSA Laboratories, version-2.0 Nov 1994.
[6]. �The Art of computer programming: seminumerical Algorithms�, D.E Knuth, volume-2 second Edition 1981.

R.k. Singh, S. Kumar, "Optimization of RSA Algorithm by using Binary Method," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.25-27, 2014.

The last decades have experienced astounding growth in the use of images that has resulted in large repositories of images that have to be stored and transmitted, bringing new techniques and standards to compress such data sets efficiently. Lossless, or numerically lossless, methods commonly achieve moderate compression ratios, whereas lossy methods achieve higher compression ratios at the expense of image fidelity. Performing recognition algorithms on these compressed images require extraction of original image from the codestream. The goal of this research is to examine the feasibility of implementing gender recognition algorithm and identity recognition algorithm directly into JPEG2000 compressed domain avoiding inverse discrete wavelet transform (IDWT). Such an approach would consequently enable the use of compressed images in recognition purposes, thus reducing both computational time and storage requirements.

JPEG2000, Visibility threshold, Bit plane coding, Eigen faces, Discrete Wavelet Transform, Dead Zone Quantization

[1]. Han Oh, A.Biligin, M.W. Visually Lossless Encoding for JPEG2000. IEEE Transactions on Image Processing.vol.22,no.1,pp.189-201,2013.
[2]. Tsung-Han Tsai and Lian-Tsung Tsai. JPEG2000 encoder architecture design with fast EBCOT algorithm. International Symposium on VLSI Design, Automation and Test.pp.279-282,2005.
[3]. A. B. Watson, G. Y .Yang, J. A.Solmon, J.Villasenor , �Visibility of Wavelet quantisation noise�,vol.6,no.8,pp.1164-1175,1990.
[4]. [4] D. S. Taubman and M. W. Marcellin, JPEG2000: Image Compression Fundamentals, Standards, and Practice. Boston, MA: Kluwer, 2002.
[5]. M. Bolin and G. Meyer, �A perceptually based adaptive sampling algorithm,� in Proc. SIGGRAPH Conf., 1998, pp. 299�309.
[6]. A. P. Bradley, �A wavelet visible difference predictor,� IEEE Trans. Image Process., vol. 8, no. 5, pp. 717�730, May 1999.
[7]. Z. Liu, L. J. Karam, and A. B. Watson, �JPEG2000 encoding with perceptual distortion control,� IEEE Trans. Image Process., vol. 15, no. 7, pp. 1763�1778, Jul. 2006.
[8]. S. G. Mallat, �A theory for multiresolution signal decomposition: The wavelet representation,� IEEE Trans. Pattern Anal. Mach. Intell., vol. 11, no. 7, pp. 674�693, Jul. 1989.
[9]. Vignesh Ramanathan , Bangpeng Yaoy , Li Fei-Feiy . �Social Role Discovery in Human Events �, International Conference on Computer Vision and Pattern Recognition(CVPR) ,IEEE,2013 , pp.2475-2482.
[10]. H. Sahoolizadeh, Y. A Ghassabeh. �Face recognition using eigen-faces, fisher-faces and neural networks�, Seventh International Conference on Cyberneic Intelligent Systems (CIS), IEEE, 2008,pp.1-6.
[11]. K.Delac,H.Grgic,S.Grgic. �Towards Face Recognition in JPEG2000 Compressed Domain�, 6th EURASIP Conference on Speech and Image Processing, Multimedia Communications and Services, IEEE, 2007, pp.148-152. [12]. Sahoolizadeh, J; Electr.Arak; Ghassabeh Y.A., �� Face recognition using eigen-faces,fisher-faces and neural networks��, 7th IEEE Conference on Cybernetic Intelligence System, 9-10 Sept 2008, pp. 1-6

A. Sipani, N. Mundra, P. Komati, "Gender and Identity Recognition in a Visually Lossless Encoded Image," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.28-32, 2014.

Today`s location based provisions relies on customer`s mobile device to find the present area. This licenses malignant customers to enter a continued holding or outfit fake guards by undermining their areas. To address this issue, we propose Wi-Fi Based Location Proof Updating System (WBLPUS) in which colocated mobile phones usually make location verification and send data to the location confirmation server. This schema screens the location of the customer and guarantees the assurance reliant upon the advancement of the customer in the particular moment. Furthermore similarly recognize that either the particular customer is the customary customer or the assailant by emulating the log records in the Wi-Fi framework. The source area is ensured subordinate upon the weighed customer in the particular location. Extensive experimental results demonstrate that WBLPUS can enough give location proofs, on a very basic level defend the source location security, and effectively perceive the plotting assaults.

Location Based Services, Colluding Attacks, RSSI (Received Signal Strength Indicator), Wi-Fi, Location Privacy

[1] A.R. Beresford and F. Stajano, �Location Privacy in Pervasive Computing,� IEEE Security and Privacy, 2003.
[2] S. Brands and D. Chaum, �Distance-Bounding Protocols,� Proc. Workshop Theory and Application of Cryptographic Techniques on Advances in Cryptology (EUROCRYPT �93), 1994.
[3] L. Buttya�n, T. Holczer, and I. Vajda, �On the Effectiveness of Changing Pseudonyms to Provide Location Privacy in VANETs,� Proc. Fourth European Conf. Security and Privacy in Ad-Hoc and Sensor Networks, 2007.
[4] S. Capkun and J.-P. Hubaux, �Secure Positioning of Wireless Devices with Application to Sensor Networks,� Proc. IEEE INFOCOM, 2005.
[5] L.P. Cox, A. Dalton, and V. Marupadi, �SmokeScreen: Flexible Privacy Controls for Presence-Sharing,� Proc. ACM MobiSys, 2007.
[6] E.D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica, �Correlation Clustering in General Weighted Graphs,� Theoretical Computer Science, vol. 361, nos. 2/3, pp. 172-187, 2006.
[7] N. Eagle and A. Pentland, �CRAWDAD Data Set mit/reality (v.2005-07-01),�http://crawdad.cs.dartmouth.edu/mit/reality, July 2005.
[8] J. Freudiger, M.H. Manshaei, J.P. Hubaux, and D.C. Parkes, �On Non-Cooperative Location Privacy: A Game-Theoretic Analysis,� Proc. 16th ACM Conf. Computer and Comm. Security (CCS), 2009.
[9] B. Gedik and L. Liu, �A Customizable K-Anonymity Model for Protecting Location Privacy,� Proc. IEEE Int�l Conf. Distributed Computing Systems (ICDCS), 2005.
[10] M. Gruteser and D. Grunwald, �Anonymous Usage of Location- Based Services through Spatial and Temporal Cloaking,� Proc. ACM MobiSys, 2003.
[11] Guohong Cao, and Zhichao Zhu, �Toward Privacy Preserving and Collusion Resistance in a Location Proof Updating System�, IEEE Transactions on Mobile Computing, 2013, Vol 12, no.1, pp.51-64.
[12] R. Herring, J. Ban B. Hoh , M. Gruteser, D. Work, J.C. Herrera, A.M. Bayen, M. Annavaram, and Q. Jacobson, �Virtual Trip Lines for Distributed Privacy-Preserving Traffic Monitoring,� Proc. ACM MobiSys, 2008.
[13] Jiang T, H.J. Wang, and Y.C. Hu, �Location Privacy in Wireless Networks,� Proc. ACM MobiSys, 2007.
[14] Lenders, E. Koukoumidis, P. Zhang, and M. Martonosi, �Location-Based Trust for Mobile User-Generated Content: Applications Challenges and Implementations,� Proc. Ninth Workshop Mobile Computing Systems and Applications, 2008.
[15] Y. Li and J. Ren, �Source-Location Privacy Through Dynamic Routing in Wireless Sensor Networks,� Proc. IEEE INFOCOM, 2010.
[16] W. Luo and U. Hengartner,� Providing Your Location Without Giving Up Your Privacy,� Proc. ACM 11th Workshop Mobile Computing Systems and Applications (HotMobile �10), 2010.
[17] J. Manweiler, R. Scudellari, Z. Cancio, and L.P. Cox, �We Saw Each Other on the Subway: Secure Anonymous Proximity-Based Missed Connections,� Proc. ACM 10th Workshop Mobile Computing Systems and Applications (HotMobile �09), 2009.
[18] J. Manweiler, R. Scudellari, and L.P. Cox, �SMILE: Encounter- Based Trust for Mobile Social Services,� Proc. ACM Conf. Computer and Comm. Security (CCS), 2009.
[19] S.Saroiu and A. Wolman, �Enabling New Mobile Applications with Location Proofs,� Proc.ACM 10th Workshop Mobile Computing Systems and Applications (HotMobile �09), 2009.
[20] M. Shao, Y. Yang, S. Zhu, and G. Cao, �Towards Statistically Strong Source Anonymity for Sensor Networks,� Proc. IEEE INFOCOM, 2008.
[21] Shih-Hau Fang, Chung-Chih Chung, and Chiapin Wang,�Attack-Resistant Wireless Localization Using an Inclusive Disjunction Model�. IEEE Transactions on Communications, 2012, vol.60, no.5, pp.1209-1218.
[22] T. Xu and Y. Cai, �Feeling-Based Location Privacy Protection for Location-Based Services,� Proc. 16th ACM Conf. Computer Comm.Security (CCS), 2009.
[23] Y. Yang, M. Shao, S. Zhu, B. Urgaonkar, and G. Cao, �Towards Event Source Unobservability with Minimum Network Traffic in Sensor Networks,� Proc. First ACM Conf. Wireless Network Security (WiSec), 2008.
[24] Y. Zhang, W. Liu, and W. Lou, �Anonymous Communications in Mobile Ad Hoc Networks,� Proc. IEEE INFOCOM, 2005.
[25] Z. Zhu, G. Cao, S. Zhu, S. Ranjan, and A. Nucci,� A Social Network Based Patching Sheme for WORM Containment in cellular Networks�, Proc. IEEE INFOCOM, 2009.

A. Vinolia, G. Jagajothi, "Estimating Localization for intruder detection in WSN," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.33-38, 2014.

Ranking in Information Retrieval System has been researched extensively in recent years. IR System is aimed at providing users the most relevant documents in minimum possible time. Therefore, providing fast and efficient result to the user is a major issue in determining the performance of the IR systems. Ranking of the pages is done after they have been indexed. Most of the existing architectures of IR system shows that they rely on keyword-based queries and the indexing is done based on the terms of the document and also consists an array of the posting lists, each posting list being associated with a term and containing the term along with the identifiers of the documents containing them. This paper proposes a ranking structure where ranking is done on the basis of a combination of the context of the document and on term basis. Context based indexing is considered in which all the available context along with the list of related terms of that context are stored. List of documents of particular contexts are stored in context repository. The indexing of the documents are done with respect to their context. To rank these documents a combination of context based weight (how much a document is relevant with a context) and TF-IDF weight (how much the user query is relevant to a document without considering context) are used. The ranking is done in decreasing order of their total weight.

Information Retrieval System, Page Ranking, Context, TF, IDF

[1] Parul Gupta and Dr. A.K.Sharma, �Context based Indexing in Search Engines using Ontology�, International Journal of Computer Applications Vol. 1, - No. 14, ISSN 0975-8887.
[2] Sunita Rani, Vinod Jain and Geetanjali Gandhi, �Context Based Indexing and Ranking in Information Retrieval Systems�, International Journal of Computer Science and Management Research, Vol. 2, Issue 4 April 2013, ISSN 2278-733X.
[3] Shikha Gupta, Vinod Jain and Pawan Bhadana, � New Combined Page Ranking Scheme in Information Retrieval System�, International Journal of Scientific and Research Publications, Vol. 4, Issue 4, April 2014, ISSN 2250-3153.
[4] Dilip Kumar Sharma and A. K. Sharma,� A Comparative Analysis of Web Page Ranking Algorithms�, in International Journal on Computer Science and Engineering, Vol. 02, No. 08, 2010, 2670-2676.
[5] L. Page, S. Brin, R. Motwani, and T. Winograd, �The PageRank Citation Ranking: Bringing Order to the Web�, Technical Report,Stanford Digital Libraries SIDL-WP-1999-0120, 1999.
[6] Sergey Brin and Larry Page, �The anatomy of a Large-scale Hypertextual Web Search Engine�, In Proceedings of the Seventh International World Wide Web Conference, 1998.
[7] Wenpu Xing and Ali Ghorbani, �Weighted PageRank Algorithm�, In proceedings of the 2rd Annual Conference on Communication Networks & Services Research, PP. 305-314, 2004.

S. Gupta, V. Jain, P. Bhadana, "Combined Approach for Page Ranking In Information Retrieval System Using Context and TF-IDF Weight," International Journal of Computer Sciences and Engineering, Vol.2, Issue.6, pp.39-42, 2014.