The first image in a slideshow demo.
Announcements
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

Submit your Paper Last date 20th June 2017 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-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-2 Issue-4 (August 2014)
    Title: Optimized Multipath Extension of AODV to Minimize Delay and Network Traffic with Reduce Packet Retransmission Attempts to Improve Performance
    Authors: Akhilesh A. Waoo and Sanjay Sharma
    Abstract: A mobile ad-hoc network (MANET) is a collection of self configuring wireless devices which is capable of moving randomly and connected without having any fixed infrastructure i.e. wireless medium. Due to the limited range of each mobile host’s wireless transmissions, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. All the nodes in a MANET act both as a router and as a host. The biggest challenge in MANET is to reduce energy consumption and overhead of each node during communication and to give a better packet delivery ratio. This paper describes improvement in standard routing protocol AODV for mobile ad-hoc networks. Our mechanism setups multiple optimal paths based on bandwidth and delay. It allows storing multiple optimal paths based on bandwidth and access delay. At time of link failure, it will switch to next available path. Multiple paths are set using the information that is available in RREQ packet and also send RREP packet to more than one path. It reduces overhead of local route discovery at the time of link failure. This paper deals with the performance metrics namely attempt of retransmission, access delay, Network overhead by network simulation.
    Click Here to Download Pdf
    Title: Presenting a tree structure for storing and searching large lists of order O(1)
    Authors: Hossein Nick khah and Yasna Raeisi estabragh
    Abstract: Sort the list of greatest concern is that mathematicians are working on optimizing the algorithms. Sort the list so far using linear arrays was performed. Due to the limited size of the linear array and traverse difficult time sorting this type of data structure and it was not desired. Sorting in linear lists must be scanned once for each element and other elements to be compared. Thus when about twice the size of the list to sort the list (O (n2)) to spend. Scrolling up to search for the elements as we move toward the desired element. The best way to split the original list into two smaller lists, with this action against O (Log (n)) to be spent. In this paper has presented a tree structure for storing and searching that can order large lists in O (n) order time. It also has a search feature in the list of possible list elements do not depend on the size and type of the list is the same time (O (1)).
    Click Here to Download Pdf
    Title: An Efficient Fuzzy C-Means Clustering Algorithm for the Segmentation of Cloud Image Using Threshold Gradient and Otsu Method
    Authors: D. Napoleon, R.Santhoshi and A.Shameena
    Abstract: Image threshold is playing a major role in image segmentation. Threshold based techniques are mainly used for segmenting images consisting of bright objects against dark backgrounds and vice versa. The Otsu method is a popular non-parametric method in image segmentation. This proposed work presents a mixture approach for image segmentation based on threshold by using Fuzzy C-Means algorithm and Otsu method for cloud image segmentation. In this given image is converted to grayscale then applying the sobel gradient edge detector. Sobel gradient is used to smooth on the cloud image edges. After FCM threshold is applied to that sobel gradient image based on cluster class. Finally the Otsu method is applied to the threshold image. The experimental results showing in this paper for the proposed method is effective in segmenting the cloud image
    Click Here to Download Pdf
    Title: Route Discovery by DSR Protocol in Different Area with Different Antenna Height and Transmission Power
    Authors: Abhijyoti Ghosh and Sudip Kumar Ghosh
    Abstract: Mobile Ad-hoc Network (MANET) is a network consists of mobile nodes that are free to move anywhere in the MANET area without the need of any central management system. In an Ad-hoc network hosts are referred as nodes & these nodes are communicating each other using multi-hop wireless links. As all the nodes are mobile in nature, communication between these nodes is very difficult. For proper communication without any infrastructure each node in MANET has to work as a router, forwarding the packets between nodes. Proper functioning of MANET needs special types of routing protocols that can perform efficient routing operation in a highly unstable atmosphere. Dynamic Source Routing (DSR) protocol is a well defined on-demand routing protocol for MANET that discovers and maintains routes between two end nodes. This paper shows DSR discovers and maintain multiple routes between source and destination. The simulation results are taken in the different area with 20 randomly deployed nodes in the MANET area with different antenna height and different transmission power. A comparative study of number of routes discovered with different antenna height and transmission power is also presented in table format.
    Click Here to Download Pdf
    Title: Improved Route Stability in Mobile Ad-hoc Network Using Energy Saver Path Routing Algorithm
    Authors: Mr. K.Prabu and Dr. A.Subramani
    Abstract: Mobile Ad-hoc Network (MANET) most often a cluster of wireless mobile nodes dynamically establishing a brief live network without use of network infrastructure. MANET is associate with rising space of analysis in the communication network world. In this research paper I proposed new routing algorithm named Energy Saver Path Routing algorithm using Optimized Link State Routing (ESPR-OLSR) protocol for energy efficient routing in MANET. This ESPR-OLSR algorithm takes minimum energy to find the path between source to destination using high potential score edge node selections. This high potential score calculation through based on the Distance Calculation, Direction of Motion Identification and Stability of the link between the nodes. The same procedure execute until reach the destination and also hop1, hop2 and so on. Finally adjust the parameter after using ESPR-OLSR algorithm, provide better performance compare to ordinary OLSR protocol and also improved Route Stability, reduced transmission power to finding path from source to destination.
    Click Here to Download Pdf
    Title: Enhanced Authetication Scheme Using Image Fuzion and Multishared Cryptography
    Authors: Mr.Vijay B Gadicha and Dr. A.S.Alvi
    Abstract: The secret sharing schemes in conventional visual cryptography are characterized by encoding one shared secret into a set of random transparencies which reveal the secret to the human visual system when they are superimposed. The ordinary concept of secret sharing is sharing the secret key, and secret sharing schemes are also wildly used for secret transmission nowadays. But most secret sharing schemes are based on cryptography [3–11] such that the encryption and decryption processes need high computation costs. Visual cryptography, a kind of secret sharing schemes, differs from traditional secret sharing in terms of the efficient decryption process. This ultimately brings the downfall of the scheme. Therefore, we need a Password Generator Scheme which will restrict the Intruders to crack the password or we should design such a scheme which will cause sufficient delay in cracking of a password so that the Generator of the password changes the previous password.
    Click Here to Download Pdf

    QR Code

    IJMCS