A Routing Algorithm with Small Routing Traffic


KIPS Transactions on Computer and Communication Systems, Vol. 18, No. 4, pp. 279-286, Aug. 2011
10.3745/KIPSTC.2011.18.4.279,   PDF Download:

Abstract

This paper proposes techniques for wireless sensor network routing algorithm with small routing traffics. It reduces routing traffic by gathering routing messages for fixed duration of time and the routing message for the configuration result is sent once. The routing traffic gathering technique has disadvantage of longer network configuration time. To overcome this, first one or first few routing messages are delivered immediately and later routing messages are gathered for fixed duration of time. The proposed scheme was modelled and implemented in Qualnet simulator using C language. Experimental results show that the proposed techniques are effective for reducing routing traffics.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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]
I. S. Choi, G. H. Kwark and G. H. Kim, "A Routing Algorithm with Small Routing Traffic," KIPS Journal C (2001 ~ 2012) , vol. 18, no. 4, pp. 279-286, 2011. DOI: 10.3745/KIPSTC.2011.18.4.279.

[ACM Style]
Ick Sung Choi, Gwang Hoon Kwark, and Geun Hyung Kim. 2011. A Routing Algorithm with Small Routing Traffic. KIPS Journal C (2001 ~ 2012) , 18, 4, (2011), 279-286. DOI: 10.3745/KIPSTC.2011.18.4.279.