Adaptive Reversal Tree Protocol with Optimal Pathfor Dynamic Sensor Networks 


Vol. 32,  No. 10, pp. 1004-1014, Oct.  2007


PDF
  Abstract

In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Hwang, "Adaptive Reversal Tree Protocol with Optimal Pathfor Dynamic Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 10, pp. 1004-1014, 2007. DOI: .

[ACM Style]

Kwang-il Hwang. 2007. Adaptive Reversal Tree Protocol with Optimal Pathfor Dynamic Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 32, 10, (2007), 1004-1014. DOI: .

[KICS Style]

Kwang-il Hwang, "Adaptive Reversal Tree Protocol with Optimal Pathfor Dynamic Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 10, pp. 1004-1014, 10. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880