For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Versatile Broadcasting Algorithm on Multi-Hop Wireless Networks: WDD Algorithm
Toshio KOIDE Hitoshi WATANABE
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/06/01
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Mobile Information Network and Personal Communications
multi-hop wireless networks, waiting-time function, information dissemination,
Full Text: PDF>>
In recent years, studies on multi-hop wireless networks have been made by many brilliant researchers. Such a network consists of a set of mobile nodes having wireless communication devices, and is constructed by the nodes autonomously. The most serious problem on the network is the difficulty of network topology management. All nodes are freely movable and their topology is dynamically changing continuously, so it is difficult to determine the paths to any nodes in the network. Although a classical flooding algorithm is a robust algorithm in that situation, the number of retransmitting nodes increases beyond what is necessary. In this paper, a new and more efficient information dissemination algorithm called WDD is proposed, which can substitute for various broadcasting algorithms by just selecting an appropriate waiting-time function. The algorithm is implemented and its applicability is evaluated on a network simulator.