Indexed by:
Abstract:
Wireless sensor networks have been used widely in many application fields, whereas such applications as battlefield information obtaining, disaster survivor rescuing, etc. need an immediate and fast route that is simultaneously secure and energy-efficient. In this paper, by constructing a neighbor table, we build a tree-structure route that can meet all the above requirements for the large-sized wireless sensor networks with only a resource-constrained sink node. Our proposed routing scheme has salient features: light overhead, quick formation, and immediate effectiveness. 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. We show through experiments that our routing scheme can ensure adequately the security and energyefficiency of the route request message and the sensing data. © 2011 ACADEMY PUBLISHER.
Keyword:
Reprint Author's Address:
Email:
Source :
Journal of Networks
ISSN: 1796-2056
Year: 2011
Issue: 9
Volume: 6
Page: 1288-1295
ESI Discipline: COMPUTER SCIENCE;
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 5
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 13
Affiliated Colleges: