The first image in a slideshow demo.
Announcements
ijmcs  IJMCS

Volume-6 & Issue-3 Published http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Submit your Paper Last date 20th June 2018 http://www.ijmcs.info/submit_your_paper

ijmcs  IJMCS

Submit your paper @ Free of Cost http://www.ijmcs.info/publication_fee...

ijmcs  IJMCS

Volume-5 & Issue-6 Published (Acceptance Ratio=42.85%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-5 & Issue-5 Published (Acceptance Ratio=27.27%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-5 & Issue-4 Published (Acceptance Ratio=47.36%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-5 & Issue-3 Published (Acceptance Ratio=38.88%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-5 & Issue-2 Published (Acceptance Ratio=25%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-5 & Issue-1 Published (Acceptance Ratio=28.94%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-4 & Issue-5 Published (Acceptance Ratio=41.42%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-4 & Issue-4 Published (Acceptance Ratio=54.02%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-4 & Issue-3 Published (Acceptance Ratio=48.05%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-4 & Issue-2 Published (Acceptance Ratio=44%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-4 & Issue-1 Published (Acceptance Ratio=50%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Volume-3 & Issue-2 Published (Acceptance Ratio=34%)http://www.ijmcs.info/current_issue

ijmcs  IJMCS

Submit your Paper Last date 10th October 2015 http://www.ijmcs.info/submit_your_paper

ijmcs  IJMCS

Volume-2 & Issue-6 Published (Acceptance Ratio=69.56%) http://www.ijmcs.info/current_issue

ijmcs  IJMCS October

Volume-2 & Issue-5 Published (Acceptance Ratio=45.94%) http://www.ijmcs.info/current_issue

ijmcs  IJMCS 15 August

Upcoming Isuue: Volume-2 & Issue-6 http://www.ijmcs.info/next_issue

ijmcs  IJMCS

Volume-2 & Issue-4 Published (Acceptance Ratio=25%) http://www.ijmcs.info/current_issue

ijmcs  IJMCS

National Conference on (Advances in Modern Computing and Application Trends) Organised By Acharya Institute of Technology Bangalore, India

  • For More Detail Click Here
  • http://www.acharya.ac.in/Techman_2014.pdf

    Volume-6 Issue-3(May 2018)
    Title: Selective Encryption Algorithm for Text Messages in Wireless Ad-hoc Networks
    Authors: Mr. Ganesh G. Patil and Mr. Pankaj G. Gaikwad
    Abstract: Security is one of the most challenging aspects in internet and network applications domain. In this domain the major issue is to provide security to the data which is travelling on the communication link. Data encryption is the primary solution to protect the data confidentiality and integrity between any pair of node. Using symmetric key algorithms fast and efficient cryptosystems can be built as they have significant applications. For a wireless ad hoc network with constraint computational resources, the cryptosystem based on symmetric key algorithms is extremely suitable for such an agile and dynamic environment along with other security strategies. The selective encryption algorithms are preferred by wireless networks because they are energy efficient for wireless devices. Probabilistic methodology and proposed algorithm enable a sender to include proper uncertainty in the process of message encryption so that only entrusted receiver can decrypt the cipher text and other unauthorized nodes have no knowledge of the transmitted messages on the whole.
    Click Here to Download Pdf
    Title: Energy Efficiency Using PEGASIS Bacteria Foraging Protocol in Wireless Sensor Network
    Authors: Ramanjit Kaur and Vandhana
    Abstract: Sensor networks containing of nodes with restricted battery power and wireless communications are organized to collect beneficial material from the field. Gathering sensed information in an energy efficient manner is dangerous to operate the sensor network for an extensive period of time. In existing work, in a data collection problematic is defined where, in a round of message, each sensor node has a container to be sent to the unfriendly base station. If each node conveys its sensed data straight to the base station then it will deplete its power speedily. Wireless sensor network is turning into a dynamically imperative and testing investigation territory. Progress in WSN empowers an extensive variety of natural observing and item following framework. Routing is a very important aspect in terms of wireless sensor networks. Routing stands for the sending the required data to the destination in such a manner that it reaches efficiently with high throughput and accuracy. The data is transporting over the network each sensor use some energy in receiving data, sending data. The life of the network be contingent how much energy used up in each transmission. The problem occurs when the transmission path meets with some sort of failure like path failure or node goes to sleep mode. The focus, however, has been given to the routing protocols which might change contingent on the application and network architecture. In this thesis, we have proposed the state-of-the-art routing technique using PEGASIS protocol Bacteria Foraging Algorithm Optimization technique to choose an alternative path in WSNs. And compare the evaluated normal PEGASIS result and enhanced PEGASIS with BFO outcome in terms of parameters such as throughput, accuracy as well as bit error rate.
    Click Here to Download Pdf
    Title: Secure Search on Encrypted Information through Secure Similarity Joins
    Authors:Shital P Patil and Prof P. B. Mali
    Abstract: Cloud storage system is a storage system which includes collection of storage servers. When user store their data on cloud storage because of public access to data it may cause data security issues. To improve data security must be stored in secured format but the main problem will occurred in search operation on data. Existing work try to tackle this issue but it was not totally secured because data owner share secrete keys with data user it causes data leakage by unauthorised user. To resolve this problem proposed work is designed in which we can perform search operation on encrypted data without disclosing of information by employing Symmetric Searchable Encryption and Locality Sensitive Hashing.
    Click Here to Download Pdf

    QR Code

    IJMCS