Mobility

Queuing Schedule for Location Based on Wireless Ad-hoc Networks With D-Cover Algorithm

Free registration required

Executive Summary

A rudimentary problem in wireless sensor networks is localization - the determination of the geographical locations of sensors. Most existing localization algorithms were designed to work well either in networks of static sensors or networks in which all sensors are mobile. The authors think over the problem of estimating the geographic locations of nodes in a sensor network where most sensors are without an effective self-positioning functionality. In this paper, they proposed a novel algorithm for location problem in the optimization of Wireless ad-hoc networks, such as: Wireless Mesh Networks (WMNs) and Wireless Sensor Networks (WSNs). With the considering of requirements, emergency response time and total system cost, a distribution of the dispatch nodes can be obtained by the algorithm.

  • Format: PDF
  • Size: 1751.04 KB