An Efficient Flooding Algorithm with Adaptive Retransmission Node Selection for Wireless Sensor Networks 


Vol. 32,  No. 11, pp. 673-684, Nov.  2007


PDF
  Abstract

In this paper, we introduce an FARNS (Flooding algorithm with Adaptive Retransmission Nodes Selection). It is an efficient cross layer-based flooding technique to solve broadcast storm problem that is produced by simple flooding of nodes in wireless sensor network. FARNS can decrease waste of unnecessary energy by preventing retransmission action of whole network node by deciding retransmission candidate nodes that are selected by identification in MAC and distance with neighborhood node through received signal strength information in PHY. In simulation part, we show the results that FARNS has excellent performance than the other flooding schemes in terms of broadcast forwarding ratio, broadcast delivery ratio, number of redundancy packets and overhead. And FARNS can adjust of node ratio for retransmission operation, it can solve broadcast storm problem as well as meet the requirements of various network environments.

  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]

S. J. Choi and S. Yoo, "An Efficient Flooding Algorithm with Adaptive Retransmission Node Selection for Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 11, pp. 673-684, 2007. DOI: .

[ACM Style]

Seung Joon Choi and Sang-Jo Yoo. 2007. An Efficient Flooding Algorithm with Adaptive Retransmission Node Selection for Wireless Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 32, 11, (2007), 673-684. DOI: .

[KICS Style]

Seung Joon Choi and Sang-Jo Yoo, "An Efficient Flooding Algorithm with Adaptive Retransmission Node Selection for Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 11, pp. 673-684, 11. 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