AN ADAPTIVE EPIDEMIC BROADCAST MECHANISM FOR MOBILE AD HOC NETWORKS
A major problem with the on-demand routing protocols for MANETs is the high cost flooding associated with route discovery process. Amongst many different optimizations for the pure flooding, the simple epidemic algorithm that emulates the spread of an infection in a crowded population, is one of the promising approaches. Based on the observation that phase transition phenomenon occurs under the relatively realistic ad hoc conditions with modest node mobility, our study show that adapting the packet retransmission probability to the local topology information can greatly enhance the overall performance of on-demand routing protocols for MANETs. The simulation results also exhibit that the adaptive gossip-based flooding offers a reasonable scalability in a relatively large-scale network.
MANETs Broadcast Epidemic Gossip Routing
ZHEN-YU LIU MARTA KWIATKOWSKA KAI LEI
Institute of Digital Media, Shenzhen Graduate School, Peking University, Shenzhen 518055, China Computing Laboratory, Oxford University, Oxford OX1 3QD, England Center for Internet Research and Engineering, Shenzhen Graduate School, Peking University, Shenzhen
国际会议
2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)
昆明
英文
3651-3656
2008-07-12（万方平台首次上网日期，不代表论文的发表时间）