Scalable broadcast strategies for ad hoc routing protocols

摘要: In ad hoc wireless networks, routes are discovered either by means of a periodic update between 1-hop neighbors or using reactive routing protocol which relies on an explicit route discovery process. Although the major advantage is reduction in overhead, conventional flooding mechanism used to propagate request (RREQ) message during process does not scale well large networks. addition overhead problem, way gets propagated across network affects performance two different ways: (i) it determines how fast can be acquired; (ii) also important factor determining availability and quality route. this paper, we propose three novel RREQ broadcast techniques, i.e., weighted p-persistence, slotted p-persistence schemes. Our simulation results show that proposed schemes achieve up 75% while keeping acquisition delay close equal scheme.