The Neighborhoods Method and Virtual Polar Coordinates in Wireless Sensor Networks

A. M. Sukhov, D. Yu. Chemodanov

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.


Full Text: PDF DOI: 10.5539/nct.v2n1p19

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Network and Communication Technologies   ISSN 1927-064X(Print)   ISSN 1927-0658 (Online)
Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.