完整後設資料紀錄
DC 欄位語言
dc.contributor.authorTseng, YCen_US
dc.contributor.authorNi, SYen_US
dc.contributor.authorShih, EYen_US
dc.date.accessioned2014-12-08T15:26:48Z-
dc.date.available2014-12-08T15:26:48Z-
dc.date.issued2001en_US
dc.identifier.isbn0-7695-1077-9en_US
dc.identifier.issn1063-6927en_US
dc.identifier.urihttp://hdl.handle.net/11536/19057-
dc.description.abstractIn a multihop mobile ad hoc network, broadcasting is an elementary operation to support many applications. In [15], it is shown that naively broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which we refer to as the broadcast storm problem. Several threshold-based schemes are shown to perform better than flooding in [15]. However, how to choose thresholds also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose several adaptive schemes, which can dynamically adjust thresholds based on local connectivity information. Simulation results show that these adaptive schemes can offer better reachability as well as efficiency as compared the results in [15].en_US
dc.language.isoen_USen_US
dc.titleAdaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc networken_US
dc.typeProceedings Paperen_US
dc.identifier.journal21ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGSen_US
dc.citation.spage481en_US
dc.citation.epage488en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000169358600052-
顯示於類別:會議論文