期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2013
卷号：2
期号：7
页码：3150
出版社：S&S Publications
摘要：Local algorithms determine the status (forwarding/non forwarding) of each node proactively based on localtopology information and a globally known priority function. In this paper, we first show that local broadcastalgorithms based on the static approach cannot achieve a good approximation factor to the optimum solution (an NPhardproblem). However, we show that a constant approximation factor is achievable if position information isavailable. In the dynamic approach, local algorithms determine the status of each node “on-the-fly” based on localtopology information and broadcast state information. Using the dynamic approach, it was recently shown that localbroadcast algorithms can achieve a constant approximation factor to the optimum solution when (approximate) positioninformation is available. However, using position information can simplify the problem. In some applications it maynot be practical to have position information. Therefore, we wish to know whether local broadcast algorithms based onthe dynamic approach can achieve a constant approximation factor without using position information.
