The Neighborhoods Method and Virtual Polar Coordinates in Wireless Sensor Networks

A. Sukhov and D. Chemodanov

Network and Communication Technologies, 2013, vol. 2, issue 1, 19

Abstract: In this paper we propose the development of a neighborhoods method for finding the route with the least number of transitions. A double pass of neighborhoods allows the determination of the shortest routes, and also the solution to the local minima problem. The proposed algorithms are complemented by search algorithms for the central anchor of and rules for angle calculation, which automatically leads to the assignment of a virtual polar coordinate system. The problem of reconstruction maps for the sensors, on the basis of limited data about nodes and their immediate neighbors, is discussed. The possibility of generalizing the neighborhoods method for inter-domain routing is supposed.

Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/nct/article/download/26117/16131 (application/pdf)
http://www.ccsenet.org/journal/index.php/nct/article/view/26117 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:nctjnl:v:2:y:2013:i:1:p:19

Access Statistics for this article

More articles in Network and Communication Technologies from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().