会议专题

SECURE ROUTING BASED ON THE NEIGHBOR TABLE IN WIRELESS SENSOR NETWORKS

In this paper, we build a secure and energyefficient tree-structure route for the large-sized wireless sensor networks with only a resourceconstrained sink node. Our proposed routing scheme has salient features: light overhead, quick formation, and immediate effectiveness. By constructing a neighbor table that contains the related key and energy information, the security and energy-efficiency of the route request message and the sensing data can be ensured adequately. We also adopt some effective energy-conserving measures, such as data aggregation, node sleep, sink move and parent reselection, etc., to prolong the lifetime of wireless sensor networks.

wireless sensor networks routing security energy efficiency neighbor table

Xing Zhang Jingsha He Qian Wei

College of Computer Science and Technology, Beijing University of Technology, Beijing 100124, China School of Software Engineering, Beijing University of Technology, Beijing 100124, China

国际会议

2010 3rd IEEE International Conference on Broadband Network & Multimedia Technology(2010年第三届IEEE宽带网络与多媒体国际会议 IC-BNMT 2010)

北京

英文

1084-1088

2010-10-26(万方平台首次上网日期,不代表论文的发表时间)