期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2015
期号：MULTICON
页码：974
出版社：S&S Publications
摘要：Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent linkbreakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot beneglected. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where amobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, andthus it causes the broadcast storm problem. In this paper, we propose a neighbor coverage-based probabilisticrebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverageknowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the moreaccurate additional coverage ratio by sensing neighbor coverage knowledge. We also define a connectivity factor toprovide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set areasonable rebroadcast probability. Our approach combines the advantages of the neighbor coverage knowledge and theprobabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routingoverhead, and can also improve the routing performance.
关键词：Mobile ad hoc networks; neighbor coverage; network connectivity; probabilistic rebroadcast; routing;overhead
