{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T12:44:40Z","timestamp":1710420280223},"reference-count":0,"publisher":"National Library of Serbia","issue":"2","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Wireless sensor networks (WSN) have become increasingly popular in monitoring\n   environments such as: disaster relief operations, seismic data collection,\n   monitoring wildlife and military intelligence. The sensor typically consists\n   of small, inexpensive, battery-powered sensing devices fitted with wireless\n   transmitters, which can be spatially scattered to form an ad hoc\n   hierarchically structured network. Recently, the global positioning system\n   (GPS) facilities were embedded into the sensor node architecture to identify\n   its location within the operating environment. This mechanism may be\n   exploited to extend the WSN?s applications. To face with the security\n   requirements and challenges in hierarchical WSNs, we propose a dynamic\n   location-aware key management scheme based on the bivariate polynomial key\n   predistribution, where the aggregation cluster nodes can easily find their\n   best routing path to the base station, by containing the energy consumption,\n   storage and computation demands in both the cluster nodes and the sensor\n   nodes. This scheme is robust from the security point of view and able to\n   work efficiently, despite the highly constrained nature of sensor nodes.<\/jats:p>","DOI":"10.2298\/csis120907025c","type":"journal-article","created":{"date-parts":[[2013,4,16]],"date-time":"2013-04-16T09:16:28Z","timestamp":1366103788000},"page":"589-609","source":"Crossref","is-referenced-by-count":9,"title":["Using bivariate polynomial to design a dynamic key management scheme for wireless sensor networks"],"prefix":"10.2298","volume":"10","author":[{"given":"Chin-Ling","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering Chaoyang University of Technology, Taichung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Ting","family":"Tsai","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering Chaoyang University of Technology, Taichung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniello","family":"Castiglione","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Salerno Via Ponte don Melillo, Fisciano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Palmieri","sequence":"additional","affiliation":[{"name":"Department of Industrial and Information Engineering, Second University of Naples, Via Roma, Aversa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:30:58Z","timestamp":1685349058000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141300025C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013]]}},"URL":"https:\/\/doi.org\/10.2298\/csis120907025c","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}