An Efficient Scheme for Reducing Overhead in Data-Centric Storage Sensor Networks

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 394
  • Download : 0
In Data-Centric Storage sensor networks where numerous sensors collaborate to monitor and report occurrences of environmental events, GPSR routing algorithm can be used to route event and query packets efficiently. However, the routing algorithm usually routes packets completely around perimeters enclosing destination locations. In this paper, we show that such perimeter walks cause significant overhead in many practical settings of sensor networks. We then propose an efficient pruning scheme to reduce overhead of perimeter walks. Our algorithm incurs no additional communications overhead; only requires the knowledge of node transmission range; but can significantly reduce overhead of insertions and queries.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2009-12
Language
English
Article Type
Article
Citation

IEEE COMMUNICATIONS LETTERS, v.13, no.12, pp.989 - 991

ISSN
1089-7798
DOI
10.1109/LCOMM.2009.12.091596
URI
http://hdl.handle.net/10203/100535
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0