RFID Virtual Coordinate Location Routing Algorithm

Article Preview

Abstract:

We have put forward a RFID routing algorithm based on virtual coordinates, on the basis of the differences and similarities between the RFID route and the WSN route. In order to solve the RFID routing problem under the environment of mobile node, this method has specified physical environment with virtual coordinates, and has found the optimal path between the source node and destination node by using scanning calculation. In the eclipse environment, the results of the experiment show that this method is more efficient and has less communication overhead.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2667-2672

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] KOHVAKKAM, HANNIKAINENM, TIMO D. Wireless sensor proto-type platform[C]/Proc of the 29th Annual Conference on the IEEE Industrial Electronics Society. Virginia: [s. n. ], 2003: 1499-1504.

Google Scholar

[2] BRAG INSKY D, ESTR IN D. Rumor rou ting algorithm for sensor ne-tw ork s[ C] / /P roc of th e 1 stW orkshop on S ensor N etw ork s and App l-icat ions (WSNA ) . A t lan ta: [ s. n. ] , (2002).

Google Scholar

[3] Eckhorn R, Reitboeck H J, Arndt M, et al. A neural network for futurelinking via synchronous activity: results from cat visual cortexand from simulations[C]/Cotterill R M J. Models of Brain Function. Cambridge, UK: Cambridge Uinv Press, 1989: 255- 272.

DOI: 10.1109/ijcnn.1989.118659

Google Scholar

[4] Lin H M, Willson A N. Median filters with adaptive length[J]. IEEETransactions on Circuits and Systems, 1988, 35( 6) : 675- 690.

DOI: 10.1109/31.1805

Google Scholar

[5] Brownrigg D R K. The weighted median filter[J]. Commun Ass Comput, 1984, 27( 8) : 807- 818.

Google Scholar