Computing optimal local cover set for broadcast in ad hoc networks

Min Te Sun, Ten Hwang Lai

研究成果: 雜誌貢獻會議論文同行評審

11 引文 斯高帕斯(Scopus)

摘要

Broadcast service is fundamental in ad hoc networks for different applications and dynamic source routing protocols. One problem that makes the traditional broadcast protocol inefficient is the broadcast storm problem. To alleviate the broadcast storm problem, the number of re-transmissions for a broadcast needs to be reduced. One possible solution is to use the node's geometric location information to obtain a smaller subset of neighbors (called local cover set) for re-transmissions. In this paper, we investigate the unique existence of the optimal local cover set. Based on the proof, we construct a location-based algorithm to compute the local cover set. We prove the correctness of our algorithm and discuss the time complexity of the algorithm. The simulation shows that the local cover set generated by our algorithm is significantly smaller than the graph-based broadcast protocol in [13].

原文???core.languages.en_GB???
頁(從 - 到)3291-3295
頁數5
期刊Conference Record - International Conference on Communications
5
出版狀態已出版 - 2002
事件2002 International Conference on Communications (ICC 2002) - New York, NY, United States
持續時間: 28 4月 20022 5月 2002

指紋

深入研究「Computing optimal local cover set for broadcast in ad hoc networks」主題。共同形成了獨特的指紋。

引用此