Abstract
Localization of sensor nodes in a wireless sensor network is needed for many practical uses. If the nodes are considered as vertices of a globally rigid graph then the nodes can be uniquely localized up to translation, rotation and reflection. We have given the construction of globally rigid graph through Euclidean distance powers of Unit Disk graph.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Purohit, G.N., Verma, S., Sharma, U.: Powers of a Graph and Associated Graph Labeling. International Journal of Computer and Network Security (IJCNS) 2(4), 45–49 (2010)
Anderson, B.D.O., Belhumeur, P.N., Eren, T., Goldenberg, D.K., Stephen Morse, A., Whiteley, W., Richard Yang, Y.: Graphical properties of easily localizable sensor network”s. Wireless Networks 15(2), 177–191 (2009)
Ren, T., Bryan, K.L., Thoma, L.: On coloring the square of unit disk graph, University of Rhode Island Dept. of Computer Science and Statistics, Tech. Rep. (2006)
Bryan, K.L., Ren, T., DiPippo, L., Henry, T., Fay-Wolfe, V.: Towards Optimal TDMA Frame Size in Wireless Sensor Networks, University of Rhode Island Dept. of Computer Science and Statistics, Tech. Rep.
Khot, V., Hemnani, P.: Localization in wireless sensor networks, http://www.siesgst.com/images/pdf/beyond_academics/sample_paper.pdf
Alfakih, A.Y.: On The Universal Rigidity of Generic Bar Frameworks, vol. 5(1), pp. 7–17, ISSN 1715-0868, http://cdm.ucalgary.ca/index.php/cdm/article/viewFile/103/103
Priyantha, N.B., Balakrishnan, H., Demaine, E., Teller, S.: Anchor Free Distributed Localization in Sensor Networks, April 8 (2003), http://cricket.csail.mit.edu/papers/TechReport892.pdf
Connelly, R.: Generic Global rigidity, October 27 (2003), http://www.math.cornell.edu/~connelly/global-6.pdf
Hendrickson, B.: Condition for unique graph realizations. SIAM J. Comput. 21(1), 65–84 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Purohit, G.N., Verma, S., Sharma, U. (2011). Application of Euclidean Distance Power Graphs in Localization of Sensor Networks. In: Meghanathan, N., Kaushik, B.K., Nagamalai, D. (eds) Advanced Computing. CCSIT 2011. Communications in Computer and Information Science, vol 133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17881-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-17881-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17880-1
Online ISBN: 978-3-642-17881-8
eBook Packages: Computer ScienceComputer Science (R0)