{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:30:26Z","timestamp":1722943826014},"reference-count":22,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcm"],"published-print":{"date-parts":[[2019]]},"DOI":"10.12720\/jcm.14.7.530-537","type":"journal-article","created":{"date-parts":[[2019,12,30]],"date-time":"2019-12-30T00:52:13Z","timestamp":1577667133000},"page":"530-537","source":"Crossref","is-referenced-by-count":0,"title":["Delaunay Triangulation Based Key Distribution for Wireless Sensor Network"],"prefix":"10.12720","author":[{"name":"Computer Science and Engineering Department, North Eastern Regional Institute of Science and Technology, Nirjuli-791109, Arunachal Pradesh, India","sequence":"first","affiliation":[]},{"given":"Monjul","family":"Saikia","sequence":"first","affiliation":[]},{"given":"Md. Anwar","family":"Hussain","sequence":"additional","affiliation":[]}],"member":"4977","published-online":{"date-parts":[[2019]]},"reference":[{"key":"ref0","doi-asserted-by":"publisher","unstructured":"[1] L. Eschenauer and B. D. Gligor, \"A key management scheme for distributed sensor networks,\" in Proc. 9th ACM Conference on Computer and Communication Security, Washington, DC, USA, 2002. p. 41-47.","DOI":"10.1145\/586110.586117"},{"key":"ref1","unstructured":"[2] H. Chan, A. Perrig, and D. Song, \"Random key predistribution schemes for sensor networks,\" in Proc. IEEE Symposium on Security and Privacy, 2003, pp. 197-213."},{"key":"ref2","doi-asserted-by":"publisher","unstructured":"[3] S. Liu and P. Ning, \"Improving key predistribution with deployment knowledge in static sensor networks,\" ACM Transactions on Sensor Networks, vol. 1, no. 2, pp. 204-239, 2005","DOI":"10.1145\/1105688.1105691"},{"key":"ref3","doi-asserted-by":"publisher","unstructured":"[4] D. Liu and P. Ning, \"Establishing pairwise keys in distributed sensor networks,\" in Proc. 10th ACM conference on Computer and communication security- CCS '03, New York, 2003, p. 52.","DOI":"10.1145\/948109.948119"},{"key":"ref4","doi-asserted-by":"publisher","unstructured":"[5] J. Zhang and V. Varadharajan, \"Wireless sensor network key management survey and taxonomy,\" Journal of Network and Computer Applications, March 2010.","DOI":"10.1016\/j.jnca.2009.10.001"},{"key":"ref5","doi-asserted-by":"publisher","unstructured":"[6] X Zheng, Y. Chen, H. Wang, H. Liu, and R. Liu, \"Neighborhood prediction based decentralized key management for mobile wireless networks,\" Wireless Networks, vol. 19, no. 6, pp. 1387-1406, 2013.","DOI":"10.1007\/s11276-013-0540-x"},{"key":"ref6","doi-asserted-by":"publisher","unstructured":"[7] M. F. Younis, K. Ghumman, and M. Eltoweissy, \"Location-Aware combinatorial key management scheme for clustered sensor networks,\" IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 8, pp. 865-882, 2006.","DOI":"10.1109\/TPDS.2006.106"},{"key":"ref7","doi-asserted-by":"publisher","unstructured":"[8] S. A. Camtepe and B. Yener, \"Combinatorial design of key distribution mechanisms for wireless sensor networks,\" in Proc. IEEE\/ACM Transactions on Networking, Springer, 2007.","DOI":"10.1109\/TNET.2007.892879"},{"key":"ref8","doi-asserted-by":"publisher","unstructured":"[9] R. Blom, \"An optimal class of symmetric key generation systems,\" in Proc. Workshop Advances in Cryptology: Theory and Application of Cryptographic Techniques, 1984, pp. 335-338.","DOI":"10.1007\/3-540-39757-4_22"},{"key":"ref9","doi-asserted-by":"publisher","unstructured":"[10] F. Piper and P. Wild, \"The use of combinatorics in key management,\" IMA J. Math. Applied in Business and Industry, vol. 7, pp. 207-218, 1996.","DOI":"10.1093\/imaman\/7.3.207"},{"key":"ref10","doi-asserted-by":"publisher","unstructured":"[11] C Intanagonwiwat, R Govindan, and D Estrin, \"Directed diffusion: A scalable and robust communication paradigm for sensor networks,\" in Proc. 6th Annual International Conference on Mobile Computing and Networking, ACM New York, NY, USA, 2000, pp. 56-67.","DOI":"10.1145\/345910.345920"},{"key":"ref11","doi-asserted-by":"publisher","unstructured":"[12] Perrig, R. Szewczyk, V. Wen, D. Cullar, and J. D. Tygar, \"SPINS: Security protocols for sensor networks,\" in Proc. of MOBICOM, 2001.","DOI":"10.1145\/381677.381696"},{"key":"ref12","unstructured":"[13] S. Zhu, S. Xu, S. Setia, and S. Jajodia, \"Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach,\" in Proc. IEEE 11th Int. Conf. Network Protocols, 2003, pp. 326-335."},{"key":"ref13","doi-asserted-by":"publisher","unstructured":"[14] S. Zhu, S. Setia, and S. Jajodia, \"LEAP: Efficient security mechanisms for large-scale distributed sensor networks,\" in Proc. ACM CCS Conference, 2003, pp. 62-72.","DOI":"10.1145\/948109.948120"},{"key":"ref14","unstructured":"[15] W. Stallings, Cryptography and Network Security- Principles and Practices, 3rd ed. Upper Saddle River, NJ: Prentice Hall, 2003."},{"key":"ref15","doi-asserted-by":"publisher","unstructured":"[16] M. Saikia and M. A. Hussain, \"Combinatorial group based approach for key predistribution scheme in wireless sensor network,\" in Proc. Int. Conf. on Computing, Communication and Automation, India, May 5-6, 2017, pp. 502-506.","DOI":"10.1109\/CCAA.2017.8229851"},{"key":"ref16","doi-asserted-by":"publisher","unstructured":"[17] M. Saikia and M. A. Hussain, \"Location dependent key predistribution scheme for square grid and hexagonal grid,\" Indian Journal of Science and Technology, vol. 10, no. 9, pp. 1-6, March 2017.","DOI":"10.17485\/ijst\/2017\/v10i9\/109238"},{"key":"ref17","doi-asserted-by":"publisher","unstructured":"[18] C. Blundo, A. D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, \"Perfectly-Secure key distribution for dynamic conferences,\" in Proc. 12th Ann. Int'l Cryptology Conf. Advances in Cryptology, 1993, vol. 740, pp. 471-486.","DOI":"10.1007\/3-540-48071-4_33"},{"key":"ref18","unstructured":"[19] B. Delaunay, \"Sur la sphere vide,\" Izv. Akad. Nauk SSSR, Otdelenie Matematicheskiii Estestvenny ka Nauk, 1934."},{"key":"ref19","doi-asserted-by":"publisher","unstructured":"[20] D. T. Lee and J. B. Schachter, \"Two algorithms for constructing a delaunay triangulation,\" International Journal of Computer & Information Sciences, vol. 9, no. 3, pp. 219-242, 1980.","DOI":"10.1007\/BF00977785"},{"key":"ref20","doi-asserted-by":"publisher","unstructured":"[21] Schroeder, J. William, and M. S. Shephard, \"Geometry\u2010Based fully automatic mesh generation and the delaunay triangulation,\" Int. Journal for Numerical Methods in Engineering, vol. 26, no. 11, pp. 2503-2515, 1988.","DOI":"10.1002\/nme.1620261109"},{"key":"ref21","doi-asserted-by":"publisher","unstructured":"[22] W. Chun-Hsien, K. C. Lee, and Y. C. Chung, \"A delaunay triangulation based method for wireless sensor network deployment,' Computer Communications, vol. 30, no. 14-15, pp. 2744-2752, 2007.","DOI":"10.1016\/j.comcom.2007.05.017"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2019\/0610\/20190610045453185.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T21:27:41Z","timestamp":1609363661000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=228&id=1384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":22,"URL":"https:\/\/doi.org\/10.12720\/jcm.14.7.530-537","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2019]]}}}