期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2013
卷号：2
期号：2
页码：443-447
出版社：Shri Pannalal Research Institute of Technolgy
摘要：Two main approaches to broadcast packets in wireless ad hoc networks are static and dynamic. In the static approach, algorithms determine the status (forwarding/nonforwarding) of each node proactively based on local topology information and a globally known priority function. In the dynamic approach, local algorithms determine the status of each node based on local topology information and broadcast state information. Using the dynamic approach that local broadcast algorithms can achieve a constant approximation factor to the optimum solution when position information is available. We design a local broadcast algorithm in which the status of each node is decided "on -the-fly" and prove that the algorithm can achieve both full delivery and a constant heuristic to the optimum solution without using position information. In this paper we improve the transmission via probability scheme through reduce the number of transmission.
关键词：Mobile ad hoc networks; connected ; dominating set; broadcasting; constant heuristic
