Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17553
Title: An analytical model for broadcasting by self pruning in wireless ad hoc networks
Authors: Huang, Y
Liu, B
Tao, X
Cao, J 
Jin, B
Keywords: Analytical model
Broadcasting
Flooding
Self pruning
Wireless ad hoc networks
Issue Date: 2008
Source: Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008, 2008, v. 2, 4755287, p. 571-576 How to cite?
Abstract: The broadcast operation is a fundamental service in wireless ad hoc networks. The naïve flooding mechanism may trigger a great number of data retransmissions at the same time and congest the networks, resulting in the broadcast storm problem. Self pruning is a simple heuristic, which reduces redundant data transmission of flooding, making use of the neighbor knowledge. However, exiting evaluation on self pruning is mainly based on experiments and greatly lacks detailed theoretical analysis. To this end, we propose in this paper an analytical model, which estimates the expected cost and the scalability of self pruning. To evaluate the accuracy of the proposed analytical model, we compare the analytical results with results obtained from the experiments. The experimental evaluation shows that the proposed analytical model accurately estimates the expected cost and scalability of self pruning, especially when the density of nodes is.
Description: 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008, Shanghai, 17-20 December 2008
URI: http://hdl.handle.net/10397/17553
ISBN: 9780769534923
DOI: 10.1109/EUC.2008.121
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Aug 10, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Aug 15, 2017

Page view(s)

49
Last Week
5
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.