{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:48Z","timestamp":1759638288616},"reference-count":13,"publisher":"SAGE Publications","issue":"9","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:p> The open wireless channel makes the data prone to being eavesdropped. Current wireless security schemes are designed to protect data through cryptography. But an adversary can still recover the secrets by eavesdropping the frames and performing off-line brute-force attacks. Capturing valid frames is fundamental for such attacks. It is generally accepted that each frame at data link layer is designed to include cyclic redundancy check (CRC) checksum sequence for integrity check. However, frame checksum sequence also helps adversary to capture correct frames and drop corrupted ones, which are fundamental to future off-line attacks. In this article, we argue that from the perspective of wireless security, it is unreasonable to include checksum sequence in data link layer frame without any protection. A reluctant checksum scheme named R-CS is proposed. Based on the inherent characteristic of wireless networks that frame error is inevitable, checksum of frame is protected by accumulated checksum algorithm in R-CS. The checksum of the frame cannot be decoded by any nodes except the receiver. Without checksum, adversaries cannot distinguish error frames from correct ones. R-CS requires little computation and communication resources, which is particularly suitable for resource-limited wireless sensor network. Our experimental results clearly demonstrate that R-CS is feasible for wireless sensor network. <\/jats:p>","DOI":"10.1177\/1550147717731041","type":"journal-article","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T15:21:22Z","timestamp":1505143282000},"page":"155014771773104","update-policy":"http:\/\/dx.doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["Improve security of wireless sensor networks through reluctant checksum"],"prefix":"10.1177","volume":"13","author":[{"given":"Qiong","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianyu","family":"Xiao","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Central South University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,9,11]]},"reference":[{"key":"bibr1-1550147717731041","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2010.5601960"},{"key":"bibr2-1550147717731041","doi-asserted-by":"publisher","DOI":"10.1016\/S1353-4858(11)70120-9"},{"key":"bibr3-1550147717731041","doi-asserted-by":"publisher","DOI":"10.1007\/s10796-014-9492-7"},{"key":"bibr4-1550147717731041","first-page":"1113","volume-title":"Proceedings of MILCOM 2002","author":"Sperandio C"},{"key":"bibr5-1550147717731041","first-page":"1125","volume-title":"Proceedings of IEEE INFOCOM 2011","author":"Gollakota S"},{"key":"bibr6-1550147717731041","first-page":"123","volume-title":"The ninth international conference on networking and services","author":"Kim KH"},{"key":"bibr7-1550147717731041","first-page":"478","volume-title":"IEEE global conference on signal and information processing","author":"Li S","year":"2014"},{"key":"bibr8-1550147717731041","first-page":"216","volume-title":"Proceedings of the 19th annual international cryptology conference on advances in cryptology","author":"Black J"},{"key":"bibr9-1550147717731041","first-page":"89","volume-title":"Proceedings of the third international workshop on fast software encryption","author":"Anderson RJ"},{"key":"bibr11-1550147717731041","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2014.11.012"},{"key":"bibr12-1550147717731041","volume-title":"Securing the internet of things","author":"Li S","year":"2017","edition":"1"},{"key":"bibr13-1550147717731041","first-page":"154","volume-title":"Proceedings of the twelfth workshop on parallel and distributed simulation","author":"Zeng X"},{"key":"bibr14-1550147717731041","first-page":"735","volume-title":"IEEE 27th conference on computer communications","author":"Rayanchu S"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1550147717731041","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1550147717731041","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1550147717731041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T13:32:00Z","timestamp":1610631120000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1177\/1550147717731041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":13,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["10.1177\/1550147717731041"],"URL":"https:\/\/doi.org\/10.1177\/1550147717731041","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"value":"1550-1477","type":"print"},{"value":"1550-1477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}