Location Determination Algorithms

  • Type: Project
  • Department: Computer Engineering
  • Project ID: CPE0078
  • Access Fee: ₦5,000 ($14)
  • Pages: 50 Pages
  • Format: Microsoft Word
  • Views: 230
  • Report This work

For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853

Abstract The public transport industry is an essential part of people’s lives. However, the problem associated with the local public transport industry is, travellers usually get frustrated when waiting for a bus to arrive at a bus stop due to uncertainty on when the bus may arrive or if it may arrive at all. This leads to anxiety on the part of the traveller as well as time wastage, especially if this was not planned for in the trip. To solve this, historically GPS receivers are used in conjunction with GSM/GPRS modules or RFID technologies to keep track of the location of the buses. The caveat here is this results in a relatively expensive solution to a fundamental problem travellers face. This is because of associated costs in this solution; namely, the cost of equipping each vehicle with a GPS module and charges incurred on bus operators as these modules send the bus data to a cloud data server before being queried by travellers’ devices. In this project, alternative technologies and location determination algorithms are explored to propose a cost-effective solution using LoRa technology and a variation of the trilateration algorithm to determine the location of a bus. The results from the project confirm the feasibility of using alternative methods to determine vehicle location.

Location Determination Algorithms
For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853

Share This
  • Type: Project
  • Department: Computer Engineering
  • Project ID: CPE0078
  • Access Fee: ₦5,000 ($14)
  • Pages: 50 Pages
  • Format: Microsoft Word
  • Views: 230

500
Leave a comment...

    Related Works

    CHAPTER ONE: INTRODUCTION 1.1 BACKGROUND OF THE STUDY Cryptography is an effective way of protecting sensitive information that is stored on media or transmitted through network communication paths. Although the ultimate goal of cryptography, and the mechanisms that make it up, is to hide information from unauthorized individuals because most... Continue Reading
    ABSTRACT This research work took theoretical and empirical studies that have been done over the past years on sorting algorithms and its variants. The study includes a comparative sorting algorithms (i.e. Bubble sort, shell sort, straight insertion sort quick sort, simple sort etc.) the same criteria such as... Continue Reading
    ABSTRACT One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time constraints. In this paper, we study the problem of providing real-time service to either hard or soft real-time messages in conjunction with a normal transmission... Continue Reading
    ABSTRACT One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time constraints. In this paper, we study the problem of providing real-time service to either hard or soft real-time messages in conjunction with a normal transmission... Continue Reading
    ABSTRACT One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time constraints. In this paper, we study the problem of providing real-time service to either hard or soft real-time messages in conjunction with a normal transmission... Continue Reading
    ABSTRACT Internal s o r t i n g a l g o rithms constitute a class of util ity prog rams that are widely used in performi n g rout i n e comput i n g operations . This thesis exam i n es t h e t h eory and structu res of these algorithms and i l l ustrates t h e i r basic principles w i t h f l owcharts and tabular presentations. PASCAL codes were... Continue Reading
    Internal sorting algorithms constitute a class of util ity programs that are  widely used in performing routine computing operations . This thesis examines  the t heory and structu res of these algorithms and ill ustrates their basic  principles with flowcharts and tabular presentations. PASCAL codes were also  developed and implemented for... Continue Reading
    ABSTRACT Computing square roots over finite fields is a problem of interest, especially to understanding which algorithm is efficient, and how it works well. There are several known algorithms that computes square roots over finite fields, of all of them the shank’s algorithm is known to be the most efficient. The objective of this dissertation... Continue Reading
    The difficulties of developing appropriate examination time table for institutions and tertiary is increasing. Institutions are enrolling more students into wider variety of courses in many different fields. For example, at Osun State Polytechnic, Iree, approximately 14,000 students have to be filled into about 150 exams over two and a half... Continue Reading
    Abstract This thesis presents research and study of load balancing algorithms and the analysis of the performance of each algorithm in varying conditions. The research also covers a study of the characteristics of Internet traffic and its statistical properties. The network workload models that were implemented in the simulation program were... Continue Reading
    Call Us Get this work