Volume-7 , Issue-2 , Feb - 2019 Go Back

“When wireless is perfectly applied, the whole earth will be converted into a huge brain, which in fact it is, things being particles of a real and rhythmic whole and the instruments through which we shall be able to do this will be amazingly simple and compact so that it could be carried in the vest pocket.” – Nikola Tesla. The Internet of Things is the smart interconnection of things over the present and future Internet infrastructure. IoT has the ability to revolutionize complete human life in every domain of present life and even beyond imagination. It allows smart human lives allowing communication between objects, machines and everything together with people. With the evolution of the Internet to cover the real-world, many new services will be enabled that will completely ameliorate people’s everyday lives, generate new businesses opportunities, and make cities, buildings and transport smarter. This fantastic opportunity provides some security challenges also. This paper analyzes the basic working and features of Internet of Things. Trends in the Internet of Things with the goal of scrutinizing and inspecting their privacy implications are also discussed. Later, the impact that Internet of Things in our day to day lives is discussed, pointing out the challenges that need to be overcome to ensure that the Internet of Things becomes a benison reality.

Applications, Cloud, IoT, Sensors

[1] Jan Henrik Ziegeldorf1∗, Oscar Garcia Morchon2, and Klaus Wehrle1 1 Communication and Distributed Systems, RWTH Aachen University, Aachen, Germany 2 Philips Research, Eindhoven, Netherlands.
[2] Johanna Virkki, Liquan Chen Personal Perspectives: Individual Privacy in the IOT Advances in Internet of Things, 2013, 3, 21-26
[3] Internet of Things by Mc Graw Hill Education
[4] Felix Wortmann , Kristina Flu¨chter Internet of Things, Technology and value added Springer Fachmedien Wiesbaden 2015Bus Inf Syst Eng 57(3):221–224 (2015) DOI 10.1007/s12599-015-0383-3
[5] Research paper by Akshay Kumar Department of Computer Science and Engineering Indian Institute of Technology Bombay
[6] Journal of cyber Policy Vol 2 2017 internet of things by carsten Maple
[7] Jayavardhana Gubbi,a Rajkumar Buyya,b* Slaven Marusic,a Marimuthu Palaniswamia Internet of Things (IoT): A Vision, Architectural Elements, and Future Directions, Vic - 3010, Australia
[8] Flavio Bonomi, Rodolfo Milito, Jiang Zhu, Sateesh Addepalli, Fog Computing and Its Role in the Internet of ThingsCisco Systems Inc. 2012 ACM 978-1-4503-1519-7/12/08
[9] Somayya Madakam, R. Ramaswamy, Siddharth Tripathi. Internet of Things (IoT): A Literature ReviewJournal of Computer and Communications Vol.03 No.05(2015)
[10]URL dated on 24/3/2013: http://postscapes.com/internet-of-things-history.
[11] Zeinab Kamal Aldein Mohammeda , Elmustafa Sayed Ali Ahmedb Internet of Things Applications, Challenges and Related Future Technologies, World Scientific News, Scientific Publishing house, DARWIN, 2017
[12] Sachin Babar, Antonietta Stango, Neeli Prasad, JAydip Sen, Ramjee Prasad, Proposed embedded security framework for IOT 978-1-4577-0787-2/11 ©2011 IEEE
[13] Debasis Bandyopadhyay • Jaydip Sen, Internet of Things: Applications and Challenges in Technology and Standardization Wireless Pers Commun (2011) 58:49–69 DOI 10.1007/s11277-011-0288-5 © Springer Science+Business Media, LLC. 2011
[14] A. Dohr1, R. Modre-Osprian1, M. Drobics2, D. Hayn1, G.Schreier1 The Internet of things for Ambient Assisted Living 2010 Seventh International Conference on Information Technology 978-0-7695-3984-3/10 $26.00 © 2010 IEEE DOI 10.1109/ITNG.2010.104

Anu Mangal, Tanushri Bhagat, Srishti Valuskar, M.A. Rizvi, "IoT Creating an Ingenious, Collaborative and Congruent World," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.918-922, 2019.

Distributed computing gives individuals an approach to share substantial mount of distributed assets having a place with various associations. Distributed computing can be characterized as the executives and arrangement of various assets, for example, programming, applications and data as administrations over the cloud (web) on interest. That is a decent method to share numerous sorts of distributed assets, however it likewise makes security issues more entangle and more imperative for clients than previously. In this venture, secure distributed algorithm execute Hadoop Map Reduce structure over multiple distributed storage (MDS) and assess its execution on a general heterogeneous group of gadgets. An actualize the nonexclusive record framework interface of Hadoop for MDS which makes our framework interoperable with other Hadoop systems like HBase. There are no progressions required for existing HDFS applications to be sent over MDS. To the best of our insight, this is the main work to bring Hadoop Map Reduce system for versatile cloud that really addresses the difficulties of the dynamic system condition. Our framework gives a distributed figuring model to handling of huge datasets in versatile condition while guaranteeing solid assurances for vitality productivity, information unwavering quality, Data region and security.

Multiple distributed system, hadoop, Data mining

[1] Kevin Sloan, “ecurity in a virtualised world”, Network Security, August 2009, page(s)15-18.
[2] Jason Reid Juan M. González Nieto Ed Dawson, "Privacy and Trusted Computing", Proceedings of the 14th International Workshop on Database and Expert Systems Applications, IEEE, 2003.
[3] Algirds Avizienis, Jean-Claude Laprie, Brian Randell, and Carl Landwehr, “Basic Concepts and Taxonomy of Dependable and Secure Computing”, IEEE transactions on dependable and secure computing, vol.1, No.1, January-March, 2004.
[4] Frank E. Gillett, “Future View: The new technology ecosystems of cloud, cloud services and cloud computing” Forrester Report, August 2008.
[5] Trusted Computing Group (TCG), "TCG Specification Architecture Overview Specification Revision 1.2", April 28, 2004.
[6] "Trusted Computing Platform Alliance (TCPA) Main Specification Version 1.1b", Published by the Trusted Computing Group, 2003.
[7] Dr.Rao Mikkilineni, Vijay Sarathy, “Cloud Computing and the Lessons from the Past”, the 18th IEEE international Workshops on Enabling Technologies: Infrasturctures for Colloaborative Enterises, on page(s):57-62, 2009.
[8] Balachandra Reddy Kandukuri, Ramacrishna PaturiV, Atanu Rakshi, “Cloud Security Issues”, 2009 IEEE International Conference on Services Computing, pages(s):517-520.
[9] N. Santos, K. P. Gummadi, and R. Rodrigues. Towards trusted cloud computing. In USENIX HotCloud, 2009.

R. Rajalakshmi, V. Sharmila, "Hadoop Map Reduce Over Multiple Distributed Storage System," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.923-927, 2019.

A standout amongst the most essential issues in such frameworks that has pulled in a great deal of interests as of late, is connect expectation. Systems can speak to a wide scope of complex frameworks, for example, social, natural and innovative frameworks. In such complex conditions, there are numerous difficulties and issues that can be contemplated and considered. Numerous examinations have been practiced on connection forecast in the course of the most recent couple of years, however the current methodologies are not tasteful in handing topological data as they have high time multifaceted nature. Numerous examines in conventional techniques expect that endpoint impact spoken to by endpoint degree, wants to encourage the association between huge degree endpoints. The proposed mining User-mindful Rare Sequential Topic Patterns in record streams comprises of three stages. At first, literary archives are crept from some small scale blog destinations or discussions, and establish a report stream as the contribution of our methodology. At that point, as preprocessing algorithm and partition algorithm utilized for the first stream is changed to a subject dimension archive stream and then separated into numerous sessions to distinguish total client practices. Our straight data structure empowers us to figure a tight headed for amazing pruning and to straightforwardly distinguish high utility examples in a productive and versatile way. Preprocessing algorithm and partition algorithm preprocessing algorithm and partition algorithm.

Prartitioning Algorithm, Link Weight, Social Network

[1] L. Lü, C.-H. Jin, T. Zhou, Similarity index based on local paths for link prediction of complex networks, Phys. Rev. E 80 (4) (2009) 046122.
[2] W. Liu, L. Lü, Link prediction based on local random walk, EPL (Europhys. Lett.) 89 (5) (2010) 58007.
[3] D. Davis, R. Lichtenwalter, N.V. Chawla, Supervised methods for multi-relational link prediction, Soc. Netw. Anal. Min. 3 (2) (2013) 127–141.
[4] L. Lü, T. Zhou, Role of weak ties in link prediction of complex networks, in: Proceedings of the 1st ACM International Workshop on Complex Networks Meet Information & Knowledge Management, ACM, 2009, pp. 55–58.
[5] F. Lorrain, H.C. White, Structural equivalence of individuals in social networks, J. Math. Sociol. 1 (1) (1971) 49–80.
[6] L. Yao, L. Wang, L. Pan, K. Yao, Link prediction based on common-neighbors for dynamic social network, Procedia Comput. Sci. 83 (2016) 82–89.
[7] T. Zhou, L. Lü, Y.-C. Zhang, Predicting missing links via local information, Eur. Phys. J. B 71 (4) (2009) 623–630.
[8] E. Ravasz, A.L. Somera, D.A. Mongru, Z.N. Oltvai, A.-L. Barabási, Hierarchical organization of modularity in metabolic networks, Science 297 (5586) (2002) 1551–1555.
[9] T. Sørensen, A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons, Biol. Skr. 5 (1948) 1–34.
[10] G. Salton, M.J. McGill, Introduction to modern information retrieval (1986).
[11] P. Jaccard, Etude comparative de la distribution florale dans une portion des Alpes et du Jura, Impr. Corbaz, 1901.
[12] E.A. Leicht, P. Holme, M.E. Newman, Vertex similarity in networks, Phys. Rev. E 73 (2) (2006) 026120.
[13] Y.-L. Wang, T. Zhou, J.-J. Shi, J. Wang, D.-R. He, Empirical analysis of dependence between stations in Chinese railway network, Physica A 388 (14) (2009) 2949–2955.
[14] L. Katz, A new status index derived from sociometric analysis, Psychometrika 18 (1) (1953) 39–43.
[15] D.J. Klein, M. Randic´, Resistance distance, J. Math. Chem. 12 (1) (1993) 81–95.
[16] F. Fouss, A. Pirotte, J.-M. Renders, M. Saerens, Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation, IEEE Trans. Knowl. Data Eng. 19 (3) (2007) 355–369.
[17] G. Jeh, J. Widom, Simrank: a measure of structural-context similarity, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2002, pp. 538–543.
[18] X. Li, H. Chen, Recommendation as link prediction in bipartite graphs: a graph kernel-based machine learning approach, Decis. Support Syst. 54 (2) (2013) 880–890.
[19] S. Scellato, A. Noulas, C. Mascolo, Exploiting place features in link prediction on location-based social networks, in: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2011, pp. 1046–1054.
[20] R.N. Lichtenwalter, N.V. Chawla, Vertex collocation profiles: subgraph counting for link analysis and prediction, in: Proceedings of the 21st International Conference on World Wide Web, ACM, 2012, pp. 1019–1028.
[21] M. Al Hasan, V. Chaoji, S. Salem, M. Zaki, Link prediction using supervised learning, SDM06: Workshop on Link Analysis, Counter.

M. Sheela, M. Harikrishnan, "Using Partitioning Methods for Mining URL Weight in Social Networks," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.928-933, 2019.

This venture centers around discharging the crisis occasion on three distinct states (flare-up, decay and inertness). These three distinct states can ready to break down the crisis occasion and discharge the data through web asset. A crisis occasion can occur whenever. So the inactive client may not break down the occasion and discharge the news through web source. This may happen simply because of the best possible investigate of the specific occasion. Since the current framework does not give the accurate news to distribute through the site, the proposed fake event detection algorithm to deal with examine and discharge the specific news occasion. This may cause the web assets which depends on various occasion is created so as to tell the general population of a crisis occasion plainly and help the social gathering or government process the crisis occasions adequately. The underlying condition of the idle state can be utilized to announce the underlying status of the crisis occasion. The exploratory outcome demonstrates that break down will be utilized to settle on the right choice for the client.

Fake Event detection, Web resources

[1] J. Makkonen. Investigation on event evolution in fake event detection algorithm. In Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language, PP.43-48, 2003.
[2] C. Yang, X. Shi, and C. Wei. Discovering Event Evolution Graphs from News Corpora. IEEE Trans. on Systems, Man and Cybernetics—Part A: 39(4):850-863, 2009.
[3] J. Abonyi, B. Feil, S. Nemeth, and P. Arva. Modified Gath–Geva clustering for fuzzing segmentation of multivariate time-series. Fuzzy Sets and Systems, Data Mining, Special Issue 149:39-56, 2005.
[4] X. Wu, Y. Lu, Q. Peng, and C. Ngo. Mining Event Structures from Web Videos. IEEE Multimedia, 18(1):38-51, 2011.
[5] Q. He, K. Chang, E. Lim and A. Banerjee. Keep It Simple with Time: A Reexamination of Probabilistic Topic Detection Models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(10):1795-1808, 2010.
[6] C. Sung and T. Kim Collaborative Modeling Process for Development of Domain-Specific Discrete Event Simulation Systems. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 42(4):532-546, 2012.
[7] J. Allan, G. Carbonell, G. Doddington, J. Yamron, and Y. Yang. Topic Detection and Tracking Pilot Study Final Report. In Proceedings of the Broadcast News Transcription and Understanding Workshop, 1998.
[8] J. Allan. Topic Detection and Tracking: Event-Based Information Organization. Norwell, MA: Kluwer, 2000.
[9] Q. Mei and C. Zhai. Discovering evolutionary theme patterns from text: An exploration of temporal text mining. In Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp.198-207, 2005.
[10] C. Wei and Y. Chang. Discovering event evolution patterns from document sequences. IEEE Transactions on Systems, Man and Cybernetics, Part A, 37(2):273–283, 2007.
[11] C. Yang and X. Shi. Discovering event evolution graphs from newswires. In Proceedings of the 15th international conference on World Wide Web, pp. 945-946, 2006.
[12] Y. Jo, C. Lagoze, C. Lee Giles. Detecting research topics via the correlation between graphs and texts. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 370-379, 2007.
[13] R. Nallapati, A. Feng, F. Peng, and J. Allan. Event threading within news topics. In Proceedings of the thirteenth ACM international conference on Information and knowledge management, pp. 446-453, 2004.
[14] G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. Information Processing & Management, 24(5):513-523, 1988.
X. Jin, S. Spangler, R. Ma, and J. Han. Topic Initiator Detection on the World Wide Web. In Proceedings of the 19th international conference on World Wide Web, pp. 481-490, 2010.

R. Priya, J. Janani, "Fake Event Detection Using Web Resources," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.934-938, 2019.

An Ad-hoc Network covers a lot of self-sufficient portable hubs that conveys through remote correspondence in a foundation less condition. For the most part a multicasting scheduling algorithm are utilized in gathering correspondence instruments like military applications, crisis seek, salvage tasks, vehicular specially appointed interchanges and mining activities and so on. The first propose a customer multicast booking calculation which limits the normal data transfer capacity utilization given a specific reserve allotment. At that point define the reserve allotment issue under the full access design into a raised issue, which can be adequately unraveled by a water-filling calculation. Reserving system depends on putting away the prominent substance at the Small-cell Base Stations by means of backhaul joins. Multicast is utilized to lessen vitality and transfer speed utilization of remote system by serving simultaneous client demands for a similar substance by means of regular multicast stream. Blend of Cache and multicast is viable when there is happening rehashed asked for a couple of substance documents show up after some time. It can in reality decrease vitality costs. The additions over existing reserving plans are most minimal rate when clients endure deferral of three minutes, expanding further with the sharpness of substance get to design.

Multi cast, Routing, Cache

[1] P. Ostovari, A. Khreishah, and J. Wu, “Cache Content Placement Using Triangular Network Coding,” in IEEE, pp. 1375–1380, Apr, 2013.
[2] K. Poularakis, G. Iosifidis, V. Sourlas, and L. Tassiulas, “Multicast-aware caching for small-cell networks,” in IEEE, pp. 2300–2305, Apr. 2014.
[3] M. Dehghan, “On the complexity of optimal routing and content caching in heterogeneous networks,” in IEEE, pp. 936–944, Apr. 2015.
[4] Neelam Yadav, Rajeev Paulus, A.K Jaiswal and Aditi Agrawal, “Analysis the Services of Multicast and Broadcast in Heterogeneous Network using QualNet6.1” in International Journal of Computer Applications, Vol 121, issue-6, pp:0975 – 8887, July 2015.
[5] B.Palguna kumar and B.Purushotham, “Efficient resource allocation for wireless multicast in Heterogeneous Network,” in International Journal of Advanced Research in Computer Science and Software Engineering, vol- 2, Issue- 4, pp- 387–400, Apr.2012.
[6] Bo Zhou, Ying Cui and Meixia Tao, “Stochastic Content-Centric Multicast Scheduling for Cache-Enabled Heterogeneous Cellular Networks”, IEEE Transactions on Wireless Communications, Vol- 15, Issue- 9 pp- 6284 – 6297 ,2016.
[7] Sheng Zhou, Jie Gong, Zhenyu Zhou, Wei Chen and Zhisheng Niu, “GreenDelivery: Proactive Content Caching and Push with Energy Harvesting-based Small Cells”, IEEE Communications Magazine, Year: 2015, Volume: 53, Issue: 4, pp-142 – 149.
[8] Georgios Paschos, Ejder Bastug, Ingmar Land, Merouane Debbah and Giuseppe Caire, “Wireless Caching: Technical Misconceptions and Business Barriers”, in IEEE, Vol- 54, Issue- 8, pp-16 – 22, 2016.
[9] Sabrina Muller, Onur Atany, Mihaela van der Schaary and Anja Klein, “Context-Aware Proactive Content Caching with Service Differentiation in Wireless Networks”, in Communications Engineering Lab, 14th June 2016.

G. Abinaya, K. Kurinji Malar, "On-Demand Multicast Routing for 5G Wireless Systems," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.939-944, 2019.

One of the significant aspects of image storage is its effective compression. The compression is a very important factor of the solutions available for creating file sizes of manageable and transmittable dimensions. In a scattered environment, the big images file remains a major bottleneck within systems. With the increasing in bandwidth by another method, the cost sometimes makes a less attractive solution. The goal of image compression is to reduce the number of bits wanted to represent an image by eliminating the spatial and spectral terminations as much as possible. This paper present the algorithm working behind the image compression and its implementation to achieve maximum possible compression in image without degrading its property. After analysis the results, it is found that the proposed algorithm reduces the image file size upto 86 per cent.

Image Compression, SPIHT, Image Quality, Quantization

[1] Mohammed Al-laham1 and Ibrahiem M. M. El Emary, “Comparative Study Between Various Algorithms of Data Compression Techniques”, Proceedings of the World Congress on Engineering and Computer Science (WCECS 2007), 2017, San Francisco, USA.
[2] AnilKatharotiya, Swati Patel, Mahesh Goyani, “Comparative Analysis between DCT and DWT Techniques of Image Compression” Journal of Information Engineering and Applications Vol 1, No.2, 2016.
[3] GauravVijayvargiya, Sanjay Silakari and Rajeev Pandey, “A Survey: Various Techniques of the Image Compression", International Journal of Computer Science and Information Security, Volume 11, No. 10, October 2014
[4] Jau-JiShen and Hsiu-Chuan Huang, “An Adaptive Image Compression Method which is Based on Vector Quantization” ,IEEE, pp. 377-381, 2015.
[5] S. A. Al-Dubaee and N. Ahmad, “New Strategy of Lossy-Text Compression”,Integrated Intelligent Computing (ICIC), 2014
[6] Suresh Yerva,Smita Nair and Krishnan Kutty,“Lossless Image Compression based on Data Folding Method”,‖IEEE, pp. 999-1004, 2015.
[7] A. Alarabeyyat, S. Al-Hashemi1, T. Khdour1, M. Hjouj Btoush1,S.Bani-Ahmad1, R. Al-Hashemi “The Lossless Image Compression Technique Using Combination Methods”, Journal of Software Engineering andApplications, 2016.
[8] Vartika Singh “A Brief Introduction on Image CompressionTechniques and Standards”, International Journal of Technology and ResearchAdvances, Volume of 2016 issue II.
[9] Yu-Ting Pai, Fan-Chieh Cheng, Shu-Ping Lu, and Shanq-Jang Ruan, “Sub-Trees Modification of Huffman Coding for Stuffing Bits Reduction and Efficient N-R-Z-I Data Transmission”, IEEE Transactions On Broadcasting, Vol.58,No.2, June 2016
[10] Mamta Sharma, “Compression using Huffman-Coding”,International Journal of Computer Science and Network Security, Vol.10, No.5,May 2015
[11] Mohammed Al-laham1 and Ibrahiem M. M. El Emary, “Comparative Study Between Various Algorithms of Data Compression Techniques”, Proceedings of the World Congress on Engineering and Computer Science (WCECS 2015), 2015.

Pradeep Kumar Atulker, Rajendra Gupta, "An Implementation in Image Compression Technique and its Effect on Image," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.945-948, 2019.

In this digital era, it is virtually impossible to find even a single business premise that does not host a local area network in place. Knowledge of all softwares installed and all hardwares connected to LAN is extremely essential to a lab technician. Because on many occasions, any minor error in LAN requires the lab technician to check virtually all computers connected to LAN manually which is extremely time consuming and a lengthy process. In majority of cases, only few machines in the network contain softwares owning to the limited user licenses. Some machines contain softwares which are occasionally used. Locating such an information in a large local area network is an extremely time consuming task. The aim of current research is to design and develop an interface for LAN which accepts the queries pertaining to hardware and software installed in LAN in natural language (NL) which is parsed using NLP parser designed and developed by the authors for the domain under consideration for facilitating the human-machine interaction. For this a set of alphabets, a set of tokens, and a context free grammar is designed. The parts-of-speech tags are numerically encoded and a pattern is generated for a syntactically valid statements. A set of rules are generated by observing the statements which are syntactically valid. The research is carried out in two phases. In the first phase, the query entered by the user in a natural language is parsed using NLP parser. In the second phase of the research, the queries which are found to be syntactically correct in phase I are further evaluated by mapping them to the corresponding prolog queries which interfaces with the knowledge base for retrieving the desired set of information. Finally, the model is implemented in a hypothetical educational institute to evaluate the operational feasibility of the model.

Hardware Query Language, Knowledge base, Parse Tree, Parts-of-Speech Tokens, Prolog, Semantics

[1] Dr.P.G.Naik, Mr. M. B. Patil “ Design and Development of Network Monitoring and Controlling tool for Domain Controller @Department of Computer Studies, CISBER using RMI Technology- A case study”. International Journal of Engineering Trends and Technology (IJETT) – Volume 26 Number 2- August 2015
[2] Wei Wang , Huankai Shi “Analysis of the Combination of Natural Language Processing and Search Engine Technology “.
International Workshop on Information and Electronics Engineering (IWIEE), 2012.
[3] JE Cooling “Survivable LANs for distributed control systems”. Published in Computer communication, Publisher- Elsevier, Volume17, Issue 5, May 1994, Pages 317-331.
[4] Yukoko Sasaki Alam “A Subcategory-based Parser Directed to Generating Representations for Text Understanding”. Published by Elsevier Ltd, Pacific Association for Computational Linguistics (PACLING)., Procedia - Social and Behavioral Sciences 27 ( 2011 ) 194 – 201.
[5] Marta Andersson, Adnan Ozturely, Silvia Pareti “Annotating Topic Development in Information Seeking Queries”. Published by Research at Google, 2016.
[6] Ankur P. Parikh, Dipanjan Das “A Decomposable Attention Model for Natural Language Inference.” Proceedings of EMNLP 2016, subject-co mputation and language, cite as arXiv:1606.01933[cs.CL] Submitted on 6 Jun2016 (v1), last revised 25 Sep2016(this version,v2)
[7] Dan Gillick, Cliff Brunk , Oriol Vinyals, Amarnag Subramanya “Multilingual Language Processing From Bytes. Proceedings of EMNLP 2016, subject-computation and language, cite as arXiv:1606.01933[cs.CL] Submitted on 1 Dec 2015 (v1), last revised 2 Apr 2016 (this version, v2))
[8] Ronan Collobert, Jason Weston , Leon Bottou, Michael Karlen “Natural Language Processing (Almost) from Scratch.” Journal of Machine Learning Research 12 (2011) 2493-2537 Submitted 1/10; Revised 11/10; Published 8/11.
[9] Abu Taha Zamani, Javed Ahmad “ Wireless LAN Security : IEEE 802.11g & VPN”. International Journal of Innovative Research in Computer and Communication Engineering (An ISO 3297: 2007 Certified Organization) Vol. 4, Issue 6, June 2016. ISSN(Online): 2320-9801 ISSN (Print) : 2320-9798.
[10] Vijay Chandramouli “A Detailed Study on Wireless LAN Technologies”. Publisher RearchGate, scientific-contributions/2024466239 in 2017.

Poornima G. Naik, Santosh G. Patil, Girish R. Naik, "Natural Language Interface for Querying Hardware and Software Configuration of a Local Area Network," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.949-963, 2019.

Performance is a critical concern of multi-core systems. There are some issues which affect the performance of multicore systems especially shared resource contention and application to core mapping. To address the performance issues various software and hardware-based policies are proposed in different works of literature. These policies address the particular performance issue through some specific approach in isolation. However, having many performance issues and the corresponding number of policies to solve the issues; it is not clear which policy would be beneficial for a particular situation for application execution. There is a need of investigation & classification of existing policies through various aspects like the approach used to address the performance issues, tools used for profiling the application and metrics used to find the source of performance degradation. The classification of policies could help make static and runtime decisions for addressing different performance issues which arise owing to resource allocation and contention. In this paper, we reviewed various policies employed for performance improvement of multicore systems. Policies like the application to core scheduling, memory allocation, bandwidth allocation, parameter tuning & self-awareness are investigated on various angles and resulted in an in-depth classification which is conferred from the tables. Further, classification could be used to design a holistic policy scheduler which could schedule a policy considering the application workload characteristics in totality. Also, the scheduler could help on performance improvement through scheduling/switching the appropriate policies at run time for application execution while considering the system status.

Investigation, Multi-core, Parameter, Policy, Performance

[1] D. Geer, "Chip makers turn to multi-core processors", Computer, vol. 38, no. 5, pp. 11-13,2005.
[2] A. Roy, J. Xu, and M. Chowdhury, "Multi-core processors: A new wayforward and challenges", International Conference on Microelectronics, Sharjaha,UAE, pp.454-457, 2008.
[3] G. Blake, R. Dreslinski and T. Mudge, "A survey of multi-core processors", IEEE Signal Processing Magazine, vol. 26, no. 6, pp. 26-37,2009.
[4] S. Hao, Q. Liu, L. Zhang, and J. Wang, "Processes Scheduling on Heterogeneous Multi-core Architecture with Hardware Support", in International Conference on Networking, Architecture, and Storage, China, , pp. 236-241, 2011.
[5] R. Teodorescu and J. Torrellas, "Variation-Aware Application Scheduling and Power Management for Chip Multiprocessors",66 in International Symposium on Computer Architecture, Beijing, China, pp.363-374, 2008.
[6] Y. Cheng, W. Chen, Z. Wang, and Y. Xiang, “Precise contention-aware performance prediction on virtualized multicore system,” Journal of system architecture, vol. 72, pp. 42-50, 2017.
[7] A. Asaduzzaman "Performance modeling of multicore and manycore networked systems," in International Journal of Computer Networks and communications (IJCNC), vol.4, No.2, pp. 53-67, 2012.
[8] S. Prasad, "Program Execution on Reconfigurable Multicore Architectures", Electronic Proceedings in Theoretical Computer Science, vol. 211, pp. 83-91, 2016.
[9] H. Yun, G. Yao, R. Pellizzoni, M. Caccamo and L. Sha, "Memory Bandwidth Management for Efficient Performance Isolation in Multi-Core Platforms", IEEE Transactions on Computers, vol. 65, no. 2, pp. 562-576,2016.
[10] S. Ren, L. Tan, C. Li, Z. Xiao and W. Song, "Leveraging Hardware-Assisted Virtualization for Deterministic Replay on Commodity Multi-Core Processors", IEEE Transactions on Computers, vol. 67, no. 1, pp. 45-58,2018.
[11] M. Pricopi and T. Mitra, "Bahurupi", ACM Transactions on Architecture and Code Optimization, vol. 8, no. 4, pp. 1-21, 2012.
[12] James E. Bennett, Michael J. Flynn, Performance Factors for Superscalar Processors, Stanford University, Stanford, CA,1995
[13] Lachaize, R., Lepers, B. and Quéma, V., “MemProf: a memory profiler for NUMA multicore systems”, In: USENIX ATC`12 Proceedings of the 2012 USENIX conference on Annual Technical Conference. Boston: ACM, pp.5-5, 2012.
[14] R. Knauerhase, P. Brett, B. Hohlt, T. Li, and S. Hahn, "Using OS Observations to Improve Performance in Multicore Systems", IEEE Micro, vol. 28, no. 3, pp. 54-66, 2008.
[15] D. Shelepov and et al., "HASS: A Scheduler for Heterogeneous Multicore Systems", in ACM SIGOPS Operating Systems Review, New York, pp. 66-75, 2009
[16] Becchi M, Crowley P, “Dynamic thread assignment on heterogeneous multiprocessor architectures”, In Proceedings of the 3rd conference on computing frontiers, New York, 2006, pp. 29-40, 2006
[17] Kumar R et al. “Single-ISA heterogeneous multi-core architectures for multithreaded workload performance”, In Proceedings of the 31st annual international symposium on computer architecture, Washington, pp., 64-75, 2004
[18] T.M.Birhanu, Z. Li, H. Sekiya, N. Komuro, Y.-J. Choi, "Efficient thread mapping for heterogeneous multicore iot systems", Mobile Information Systems, vol. 1565, pp. 8, 2017
[19] D. Koufaty, D. Reddy, and S. Hahn, "Bias scheduling in heterogeneous multi-core architectures," in Proc. of the 5th European Conference on Computer Systems, France pp. 125-138, 2010
[20] S. Zhuravlev, S. Blagodarov, and A. Fedorova, “Addressing shared resource contention in multicore processors via scheduling,” in ACM SIGARCH Computer Architecture News, vol. 38, pp. 129–142, 2010.
[21] Z. Majo and T. Gross, "Memory management in NUMA multicore systems: trapped between cache contention and interconnect overhead", in ACM SIGPLAN Notices - ISMM `11, pp.11-20 2011.
[22] Agarwal A, Miller J, Eastep J, Wentziaff D, Kasture H Self-aware computing. Technical report, MIT, 2009.
[23] D. Molka, R. Schöne, D. Hackenberg and W. Nagel, "Detecting memory-boundedness with hardware performance counters", Proceedings of the 8th ACM/SPEC International Conference on Performance Engineering, Italy, pp. 27-38, 2017.
[24] H. Yun, G. Yao, R. Pellizzoni, M. Caccamo, L. Sha, "MemGuard: Memory bandwidth reservation system for efficient performance isolation in multi-core platforms", Proc. Real-Time Embedded Technol. Appl. Symp., USA, pp. 55-64, 2013.
[25] Karcher, T., Pankratius, V.: Auto-Tuning Multicore Applications at Run-Time with a Cooperative Tuner. Technical Report, 2011-4, Karlsruhe Institute of Technology, Germany (2011)
[26] P. Kansakar and A. Munir, “A Design space exploration methodology for parameter optimization in multicore processors,” IEEE Trans. Parallel Distrib. Syst., vol. 29, no. 1, pp. 2–15,2018.
[27] M. Kulkarni, V. Pai, and D. Schuff, “Towards architecture independent metrics for multicore performance analysis,” ACM SIGMETRICS Perform. Eval. Rev., vol. 38, pp. 10-14, 2011.
[28] Y. Wang and K. B. Kent, “A Region-Based Approach to Pipeline Parallelism in Java Programs on Multicores,” Proc. - 2017 25th Euromicro Int. Conf. Parallel, Distrib. Network-Based Process. PDP 2017, Russia, pp. 124–131, 2017.
[29] R. Das et al., "Application-to-core Mapping Policies to Reduce Memory System Interference in Multi-core Systems", HPCA 2013.
[30] Eric Lau , Jason E. Miller , Inseok Choi , Donald Yeung , Saman Amarasinghe,Anant Agarwal, “Multicore performance optimization using partner cores”, Proceedings of the 3rd USENIX conference on Hot topic in parallelism, Berkeley, pp.11-11, 2011,
[31] Da-WeiChang,Ing-ChaoLin,Yu-ShiangChien,Chn-LunLin,A.Su,andChung PingYoung,"CASA:Contention-Aware Scratchpad Memory Allocation for Online Hybrid On-Chip Memory Management", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 33, no. 12, pp. 1806-1817, 2014.
[32] S. Gu, Q. Zhuge, J. Yi, J. Hu, E. H.-M. Sha, "Optimizing task and data assignment on multi-core systems with multi-port SPMs", IEEE Trans. Parallel Distrib. Syst., vol. 26, no. 9, pp. 2549-2560, 2015.
[33] N. Ramasubramanian, V. V. Srnivas, and N. Ammasai Gounden, “Performance of Cache Memory Subsystems for Multicore Architectures,” Int. J. Comput. Sci. Eng. Appl., vol. 1, no. 5, pp. 59–71,2011.
[34] V. Kazempour, A. Fedorova, and P. Alagheband, “Performance implications of cache affinity on multicore processors,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 5168, pp. 151–161, 2008.
[35] M. Rawlins, A. Gordon-Ross, "A cache tuning heuristic for multi-core architecture", IEEE transaction on computers, vol. 62, no. 8, pp. 1570-1583, 2013.
[36] M. Rawlins and A. Gordon-Ross, "An application classification guided cache tuning heuristic for multi-core architectures", 17th Asia and South Pacific Design Automation Conference,2012.
[37] K. Huang, K. Wang, D. Zheng, X. Zhang and X. Yan, "Access Adaptive and Thread-Aware Cache Partitioning in Multicore Systems", Electronics, vol. 7, no. 9, pp. 172, 2018.
[38] Y. Song, O. Alavoine, and B. Lin, “Row-buffer hit harvesting in orchestrated last-level cache and DRAM scheduling for heterogeneous multicore systems,” in Proceedings of the 2018 Design, Automation and Test in Europe Conference and Exhibition, Janua, pp. 779–784, 2018
[39] P. Anuradha, H. Rallapalli, and G. Narsimha, “Energy efficient scheduling algorithm for the multicore heterogeneous embedded architectures,” Des. Autom. Embed. Syst., vol. 22, no. 1–2, 2018
[40] Fuad, M., Deb, D. and Baek, J., “Self-Healing by Means of Runtime Execution Profiling”, Proceedings of 14th International Conference on Computer and Information Technology, Dhaka, pp., 202-207, 2011.
[41] A. Ganapathi, K. Datta, A. Fox, and D. A. Patterson, “A case for machine learning to optimize multicore performance,” in Proceedings of the First USENIX conference on Hot topics in parallelism, 2009.
[42] Jain, R., Panda, P. and Subramoney, S. “Cooperative Multi-Agent Reinforcement Learning-Based Co-optimization of Cores, Caches, and On- chip Network”, ACM Transactions on Architecture and Code Optimization, vol. 14, issue-4, pp.1-25, 2017.
[43] N. Huber, F. Brosig, S. Spinner, S. Kounev and M. Bahr, "Model-Based Self- Aware Performance and Resource Management Using the Descartes Modeling Language", IEEE Transactions on Software Engineering, vol. 43, no. 5, pp. 432-452, 2017.
[44] K.Hasan,J.Antonio, and S.Radhakrishnan," A model-driven approach for predicting and analysing the execution efficiency of multi-core processing", International Journal of Computational Science and Engineering, vol. 14, no. 2, pp. 105-125, 2017.
[45] Khondker S. Hasan, John K. Antonio, and Sridhar Radhakrishnan, "A New Multi-core CPU Resource Availability Prediction Model for Concurrent Processes," Lecture Notes in Engineering and Computer Science: Proceedings of The International MultiConference of Engineers and Computer Scientists, Hong Kong, pp. 130-135, 2017.
[46] K. Moazzemi, A. Kanduri, D. Juh´asz, A. Miele, A. M. Rahmani, P. Liljeberg, A. Jantsch, N. Dutt, “Trends in on-chip dynamic resource management”, in21st Euromicro Conference on Digital System Design (DSD), Prague, pp. 62–69, 2018.
[47] Yan-fei Zhu and Xiong-min Tang, "Overview of swarm intelligence”,International Conference on Computer Application and System Modeling, China, pp. 400-403, 2010.
[48] Hariri, B. Khargharia, H. Chen, J. Yang, Y. Zhang, M. Parashar, and H. Liu, "The Autonomic Computing Paradigm", Cluster Computing, vol. 9, no. 1, pp. 5-17, 2006.
[49] Lewis, P.R., Self-aware computing systems: from psychology to engineering. In: Design, Automation and Test in Europe Conference and Exhibition, Switzerland,pp.,1044–1049, 2017.
[50] N. Dutt, A. Jantsch, and S. Sarma, "Toward Smart Embedded Systems", ACM Transactions on Embedded Computing Systems, vol. 15, no. 2, pp. 1-27, 2016.
[51] D. Dasgupta, H. Bedi, and D. Garrett, “A conceptual model of self-monitoring multi-core systems,” Proc. Sixth Annu. Work. Cyber Secur. Inf. Intell. Res. - CSIIRW ’10, pp. 83 1,2010.
[52] O. Mattes and W. Karl, “Evaluating the Self-Optimization Process of the Adaptive Memory Management Architecture Self-aware Memory,” in Proceedings of the 1st Workshop on Resource Awareness and Adaptivity in Multi-Core, Germany pp.16–21, 2014.
[53] G.P. Sunitha, B.P. Vijay Kumar, S.M. Dilip Kumar, "A Nature Inspired Optimal Path Finding Algorithm to Mitigate Congestion in WSNs", International Journal of Scientific Research in Network Security and Communication, Vol.6, Issue.3, pp.50-57, 2018
[54] Chingrace Guite, Kamaljeet Kaur Mangat, "A Study on Energy Efficient VM Allocation in Green Cloud Computing", International Journal of Scientific Research in Computer Science and Engineering, Vol.6, Issue.4, pp.37-40, 2018

Surendra Kumar Shukla, P.K. Chande, "Investigating Policies for Performance of Multi-core Processors," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.964-980, 2019.

Student psychology in general terms is the study of development of child in terms of his/her abilities. Seeking the evidence on the problems of relative effects i.e., personal and environmental, upon the child’s ability and consideration of adjustment of the child to the circumstances. Every child is special in his/her own way. The mind-set of the child depends and grows upon the instances which the child undergoes i.e. either by personal problem or say environmental effect. Both the internal, as well as external factor plays a major role in building up the personality and attitude of the child. Student’s attitude may differ due to the circumstance they undergo on daily basis. This paper deals with a 3D metric (Internal factor, External factor, Self interest) which plays a key role in analyzing the psychology of the student pertaining to education. The analysis is done through questionnaire consisting of factors affecting the study and a parametric way of scoring is done to the answers which help the student in finding the optimum way out to address the factors affecting them.

Psychology, factors, Internal, External, Environmental, Metric

effects among social skills, vocabulary, and
reading comprehension in first grade” Contemporary
Educational Psychology, Volume 53, April 8,
Pages 159–167
[2] Hilary E. Miller, Vanessa R. Simmering, “Children’s
attention to task-relevant information accounts for
relations between language and spatial cognition",
Journal of Experimental Child Psychology, Volume 172,
August 2018, Pages 107–129.
[3] Eric S. Buhs et.al, “Shyness and engagement:
Contributions of peer rejection and teacher sensitivity”
Published in Early Childhood Research Quarterly
30 (2015), pp 12–19
[4] Katrina et.al, “The role of friends in help-seeking
tendencies during early adolescence: Do classroom goal
structures moderate selection and influence of friends?”,
Contemporary Educational Psychology, Volume 53, April
2018, Pages 135-145
[5] Overlay panelTheoWubbelsMiekeBrekelmans ,” Two
decades of research on teacher–student relationships in
class”, International Journal of Educational Research,
Volume 43, Issues 1–2,2005, Pages 6-24

[6] Berna A. Uzundag, , Aylin C. Küntay, "Children’s
referential communication skills: The role of cognitive
abilities and adult models of speech", Journal of
Experimental Child Psychology, Volume 172, August
2018, Pages 73–95
[7] Keith Topping, “Peer Assessment Between
Students in Colleges and Universities”,
Research Article

https://doi.org/10.3102/00346543068003249
[8] Berna A. Uzundag, , Aylin C. Küntay, "Children’s
referential communication skills: The role of cognitive
abilities and adult models of speech", Journal of
Experimental Child Psychology, Volume 172, August
2018, Pages 73–95

Kumudavalli M.V., Anagha Shailesh Kulkarni, G. Ambrish, "3D Metric approach to study the factors affecting student’s psychology on Education," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.981-984, 2019.

Localization is a significant characteristic in Wireless Sensor Networks (WSNs) area, and it has much research concentration between academia and the research community. WSN is designed and implemented using a vast number of tiny, low energy, limited processing capability and low-cost sensors interconnected wirelessly in an ad-hoc manner. The concept of describing physical coordinates, i.e. the location of sensor nodes in WSNs is a major issue in communication systems to assess the point of origin of events under monitoring. The necessity of the positioning accuracy differs for different applications so different approaches for localization are utilized in various applications. WSNs use two different type of localization methods, Range based and Range-free. Range based localization is expensive and used for accurate position estimation in position-critical applications like forest fire detection, reconnaissance etc. whereas Range-free localization is much economic and used for ascertaining approximate position estimation in not-so-position-critical applications like livestock and animal tracking etc. In this paper, an efficient recursive localization method called Position Estimate Localization Routing (PELR) is proposed for range-free localization. It reduces the consumption of energy, the time of execution, and the communication overhead. It enhances overall system performance for large-scale WSNs taking into consideration the trade-off between location accuracy and time cost. The simulation outcomes demonstrate that the recommended system has enhanced performance than the existing ones.

Wireless Sensor Networks; Position Estimation; Range Free Localization; PELR

[1] Rudafshani, M., & Datta, S. “Localization in wireless sensor networks” In 6th IEEE International Symposium on Information Processing in Sensor Networks (IPSN2007), Cambridge, MA, USA, pp. 51-60, 2007.
[2] Jiang, J., Han, G., Zhu, C., Dong, Y., & Zhang, N., “Secure localization in wireless sensor networks: a survey”, Journal of Communications, 6(6), pp. 460-470, 2011.
[3] Kohlbacher, A., Eliasson, J., Acres, K., Chung, H., & Barca, J. C., “A Low-Cost Omnidirectional Relative Localization Sensor for Swarm Applications”, In IEEE World Forum on Internet of Things 2018.
[4] Chelouah, L., Semchedine, F., & Bouallouche-Medjkoune, L., “Localization protocols for mobile wireless sensor networks: A survey”, Computers & Electrical Engineering, pp. 1-19, 2017.
[5] Zeng, Y., Cao, J., Hong, J., Zhang, S., & Xie, L., “Secure localization and location verification in wireless sensor networks: a survey”, The Journal of Supercomputing, 64(3), 685-701, 2013.
[6] Srinivasan, A., & Wu, J., “A survey on secure localization in wireless sensor networks”, Encyclopedia of Wireless and Mobile communications, CRC Press, pp. 126, 2007.
[7] Sivakumar, S., & Venkatesan, R., “Performance evaluation of hybrid evolutionary algorithms in minimizing localization error for wireless sensor networks”, Journal of Scientific and Industrial Research, 75(5), 289-295, 2016
[8] Abo-Elhassab, A. E., El-Kader, S. M. A., & Elramly, S., “Wireless Sensor Networks Localization”, In Routing Protocols and Architectural Solutions for Optimal Wireless Networks and Security, IGI Global, pp. 204-240, 2017.
[9] Mridula, K. M., & Ameer, P. M., “Localization under anchor node uncertainty for underwater acoustic sensor networks”, International Journal of Communication Systems, 31(2), e3445, 2018
[10] Ammari, H. M., & Chen, A. J., “Sensor localization in three-dimensional space: A survey”, In Handbook of Research on Wireless Sensor Network Trends, Technologies, and Applications, IGI Global, pp. 120-144, 2017
[11] Abu-Mahfouz, A. M., & Hancke, G. P., “Localized information fusion techniques for location discovery in wireless sensor networks”, International Journal of Sensor Networks, 26(1), pp. 12-25, 2018
[12] Kiruthiga, G., & Mohanapriya, M., “An adaptive signal strength-based localization approach for wireless sensor networks”, Cluster Computing, pp. 1-10, 2017
[13] Baroutis, N., & Younis, M., “Load-conscious maximization of base-station location privacy in wireless sensor networks”, Computer Networks, 124, pp. 126-139, 2017
[14] Wu, H., Ding, A., Liu, W., Li, L., & Yang, Z., “Triangle Extension: Efficient Localizability Detection in Wireless Sensor Networks”, IEEE Transactions on Wireless Communications, 16(11), pp. 7419-7431, 2017.
[15] Farooq-I-Azam, M., Ni, Q., & Ansari, E. A., “Intelligent energy-efficient localization using variable range beacons in industrial wireless sensor networks”, IEEE Transactions on Industrial Informatics, 12(6), pp. 2206-2216, 2016.
[16] Lv, C., Zhu, J., & Tao, Z., “An Improved Localization Scheme Based on PMCL Method for Large-Scale Mobile Wireless Aquaculture Sensor Networks”, Arabian Journal for Science and Engineering, 43(2), pp. 1033-1052, 2018.
[17] S. Haidar, “A novel localization algorithm for large-scale wireless sensor networks”, Computer Communications, pp. 3246, 2014.
[18] G. M. B. Fidan and B. D. Anderson, “Wireless sensor network localization techniques”, Computer Networks, pp. 2529-2553, 2007.
[19] W. Akkari, B. Bouhdid, and A. Belghith, “LEATCH: Low energy adaptive tier clustering hierarchy”, in Elsevier Procedia Computer Science, Vol. 50, pp. 365-372, 2015.
[20] Bouhdid, B., Akkari, W., & Belghith, A., “Efficient localization approach for large-scale wireless sensor networks”, In 13th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP2017), pp. 437-442, 2017
[21] S. L. Mewada, U. K. Singh and P. Sharma, “A Novel Security Based Model for Wireless Mesh Networks”, International Journal of Scientific Research in Network Security and Communications, Vol. 1(1), pp. 11-15, 2013
[22] N. Purohit, P. Varadwaj & S. Tokekar, “Reliability Analysis of Wireless Sensor Netwoprks”, 16th IEEE International Conference on Networks (ICON2008), New Delhi INDIA, 2008, pp. 1-6
[23] P. Jat & K. Jain, “A revised and efficient k-means Clustering algorithm”, International Journal of Computer Sciences and Engineering, Vol. 6(12), pp. 118-124, 2018
[24] S. L. Mewada, Pradeep Sharma, S. S. Gautam, Sarita Sharma, Priyanka Agiwal & Arti Shrivastava, “Simulation based performance analysis of DSDV, OLSR and DSR routing algorithms in Wireless Personal Area Networks using NS2”, Research Journal of Computer and Information Technology Sciences, Vol. 4(1), pp. 1-7, 2016
[25] N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less low-cost outdoor localization for very small devices”, IEEE Personal Communications Magazine, Vol. 7(5), pp. 28–34, 2000.
[26] A. Gopi Saminathan, V. Nivedhitha, “A Comprehensive review on cluster-based energy efficient routing protocols in wireless sensor networks”, International Journal of Computer Sciences and Engineering, Vol. 6(9). Pp. 662-668, 2018
[27] J. Blumenthal, R. Grossmann, F. Golatowski, and D. Timmermann, “Weighted centroid localization in Zigbee-based sensor networks”, In Proceedings of the IEEE International Symposium on Intelligent Signal Processing (WISP ’07), Madrid, Spain, October 2007.
[28] F. Reichenbach, J. Blumenthal, and D. Timmermann, “Improved precision of coarse-grained localization in wireless sensor networks”, In Proceedings of the 9th Euromicro Conference on Digital System Design (DSD ’06), pp. 630–637, Dubrovnik, Croatia, September 2006.
[29] S. Schuhmann, K. Herrmann, K. Rothermel, J. Blumenthal and D. Timmermann, “Improved weighted centroid localization in smart ubiquitous environments”, Ubiquitous Intelligence and Computing, vol. 5061, pp. 20–34, 2008.
[30] G. Han, X. Li, J. Jiang, L. Shu and J. Lloret Mauri, “Intrusion Detection Algorithm Based on Neighbor Information Against Sinkhole Attack in Wireless Sensor Networks”, The Computer Journal, Vol. 58, pp. 1280-1292, 2015

Shishir Rastogi, Neeta Rastogi, Manuj Darbari, "Position Estimate Localization Routing for Large Scale Wireless Sensor Networks," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.985-994, 2019.