计算机科学 ›› 2017, Vol. 44 ›› Issue (Z11): 312-316.doi: 10.11896/j.issn.1002-137X.2017.11A.066

• 网络与通信 • 上一篇    下一篇

基于贪婪策略的NAND FLASH存储器的磨损均衡算法研究

贾鑫,张少平   

  1. 江西农业大学计算机与信息工程学院 南昌330046,江西农业大学计算机与信息工程学院 南昌330046
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金(61462038)资助

Research on Wear Leveling Algorithm of NAND FLASH Memory Based on Greedy Strategy

JIA Xin and ZHANG Shao-ping   

  • Online:2018-12-01 Published:2018-12-01

摘要: NAND FLASH存储器是无线传感器网络节点的存储设备。传感器节点在监控区域中不断获取数据信息,并进行节点之间的数据交互,使得NAND FLASH存储器频繁地进行写操作,从而造成物理块的擦除次数不均衡,缩短了存储器的使用寿命,最终影响整个传感器网络的使用寿命。针对上述问题,提出了贪婪策略的分区地址映射磨损均衡算法。该算法根据磨损擦除的参数进行贪婪选择,选择出擦除次数小的物理块进行写操作,而对擦除次数大的物理块进行配置与实验数据迁移,进入等待擦除。通过软件测试的方式,证明了所提算法可以有效地实现并优化NAND FLASH存储器的磨损均衡。

关键词: 无线传感器网络,数据存储,NAND FLASH,贪婪策略,分区地址映射

Abstract: NAND FLASH memory is the storage device of sensor node in wireless sensor network.Sensor nodes conti-nuously acquire data from monitoring area,and exchange data between nodes.Frequently writing operations on NAND FLASH memory makes the physical block’s erase number unbalanced and reduces the memory’s life.Accordingly,it will affect the life of the whole sensor network.In this paper,a partition address mapping wear leveling algorithm was proposed to solve this problem.In this algorithm,when data is written into memory,a new physical block for writing operations is selected according to the wear leveling measurement which it computed with greedy methods.And the configuration and experimental data are exchanged between the old physical block and the new physical block,then the old physical block enters a wait state.It is proved by software testing that the algorithm proposed in this paper can effectively optimize the wear leveling of NAND FLASH memory.

Key words: Wireless sensor network,Data storage,NAND FLASH,Greedy strategy,Partition address mapping

[1] 滕飞.小型无线传感器网络的实现与无线局域网互联[D].北京:北京交通大学,2010.
[2] 杜明,王志军,乐嘉锦.一种基于Flash DBMS的动态日志方法[J].计算机应用与软件,2010,7(4):171-173,193.
[3] 郑文静,李明强,舒继武.Flash存储技术[J].计算机研究与发展,2010,7(4):716-726.
[4] 张骏,樊晓桠,刘松鹤.一种Flash存储器静态负载平衡策略[J].计算机应用,2006(5):1205-1207.
[5] YUAN H C,JEN W H,TEI W K.Endurance Enhancement of Flash Memory Storage Systems[C]∥An Efficient Static Wear leveling Design National Taiwan University.2007.
[6] 王佳英.基于蚁群优化的无线传感器网络路由协议研究[D].大连:大连理工大学,2009.
[7] 王冬,杨琼,徐晓光.基于区域地址映射的NAND Flash静态磨损均衡算法[J].航空计算技术,2015,5(2):122-125.
[8] 陈晓敏.基于NAND FLASH的大容量SSD磨损均衡算法的仿真及其性能测试[D].上海:上海交通大学,2010.
[9] SHI L,ZHANG B,MOUFTAH H T,et al.DDRP:An efficient data-driven routing protocol for wireless sensor networks with mobile sinks[J].International Journal of Communication Systems,2013,26(10):1341-1355
[10] WANG Y,WEI C.Lightweight,latency-aware routing for data compression in wireless sensor networks with heterogeneous traffics[C]∥Wirel.Commun.Mob.Comput..2015.
[11] LIU B H,NGUYEN N T,PHAM V T,et al.Novel methods for energy charging and data collection in wireless rechargeable sensor networks[J].Int.J.Commun.Syst.,2015.
[12] DI PIETRO R,MICHIARDI P,MOLVA R.Confidentiality and integrity for data aggregation in WSN using peer monitoring[J].Security & Communication Networks,2010,2(2):181-194.
[13] DE SALVO B.Research on Advanced Charge Storage Memories[C]∥Silicon Non-Volatile Memories:Paths of Innovation,ISTE,London,UK,2009.
[14] ARITOME S,et al.Advanced Operation for Multilevel Cell[C]∥Nand Flash Memory Technologies.Hoboken,NJ,USA,2015.
[15] GURUMURTHI S,SIVASUBRAMANIAM A.Energy-Effi-cient Storage Systems for Data Centers[C]∥Energy-Efficient Distributed Computing Systems.Hoboken,NJ,USA,2012.
[16] MARINELLA M J,ZHIRNOV V V.Emerging Memory De-vices:Assessment and Benchmarking[C]∥Emerging Nanoelectronic Devices.Chichester,United Kingdom,2014.
[17] FORNI G,ONG C,RICE C,et al.Flash Memory Applications[M]∥Nonvolatile Memory Technologies with Emphasis on Flash:A Comprehensive Guide to Understanding and Using NVM Devices.John Wiley & Sons,Inc.2007:19-62.
[18] DE SALVO B.Research on Advanced Charge Storage Memories[M]∥Silicon Non-Volatile Memories:Paths of Innovation.ISTE,2010:77-170.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!