Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 2
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

Wireless sensor network (WSN) plays a crucial role in many industrial, commercial, and social applications. However, increasing the number of nodes in a WSN increases network complexity, making it harder to acquire all relevant data in a timely way. By assuming the end node as a base station, we devised an Artificial Ant Routing (AAR) method that overcomes such network difficulties and finds an ideal routing that gives an easy way to reach the destination node in our situation. The goal of our research is to establish WSN parameters that are based on the biologically inspired Ant Colony Optimization (ACO) method. The proposed AAR provides the alternating path in case of congestion and high traffic requirement. In the event of node failures in a wireless network, the same algorithm enhances the efficiency of the routing path and acts as a multipath data transmission approach. We simulated network factors including Packet Delivery Ratio (PDR), Throughput, and Energy Consumption to achieve this. The major objective is to extend the network lifespan while data is being transferred by avoiding crowded areas and conserving energy by using a small number of nodes. The result shows that AAR is having improved performance parameters as compared to LEACH, LEACH-C, and FCM-DS-ACO.
Go to article

Authors and Affiliations

Shankar D. Chavan
1
Amruta S. Thorat
1
Monica S. Gunjal
1
Anup S. Vibhute
1
Kamalakar R. Desai
2

  1. Dr. D. Y. Patil Institute of Technology, Pimpri, Pune, (M.S.), India
  2. Bharati Vidyapeeth College of Engineering, Kolhapur (M.S.), India
Download PDF Download RIS Download Bibtex

Abstract

This paper presents optimisation of a measuring probe path in inspecting the prismatic parts on a CMM. The optimisation model is based on: (i) the mathematical model that establishes an initial collision-free path presented by a set of points, and (ii) the solution of Travelling Salesman Problem (TSP) obtained with Ant Colony Optimisation (ACO). In order to solve TSP, an ACO algorithm that aims to find the shortest path of ant colony movement (i.e. the optimised path) is applied. Then, the optimised path is compared with the measuring path obtained with online programming on CMM ZEISS UMM500 and with the measuring path obtained in the CMM inspection module of Pro/ENGINEERĀ® software. The results of comparing the optimised path with the other two generated paths show that the optimised path is at least 20% shorter than the path obtained by on-line programming on CMM ZEISS UMM500, and at least 10% shorter than the path obtained by using the CMM module in Pro/ENGINEERĀ®.

Go to article

Authors and Affiliations

Slavenko M. Stojadinovic
Vidosav D. Majstorovic
Numan M. Durakbasa
Tatjana V. Sibalija

This page uses 'cookies'. Learn more