Download now Free registration required
Flooding is a basic operation to propagate control messages in most ad hoc routing protocols. Recently, many flooding schemes have been studied to avoid the problems of severe redundancies, contentions, and collisions in traditional implementations. One of the recent efficient approaches is 1HI by Liu et al., which uses only 1-hop neighbor information. The advantage of this scheme is that it achieves local optimality in term of the number of retransmitting nodes with the time complexity O(nlogn), although considerable redundant transmissions still remain.
- Format: PDF
- Size: 191.77 KB