Various broadcasting schemes have been proposed for a unified routing approach in Wireless Adhoc Networks. In their efforts, the researchers mostly aim to minimize the routing-overheads including overfilling of query, routing delay and energy-drain. The routing overheads are minimized using either repeated broadcast or canceling the query-broadcast. On one hand broadcast cancellation methods work based on query-chasing, which creates an extra routing-overhead. On the other hand routing cache based query-broadcast techniques are not adaptive with mobility of target nodes giving rise to unreachability problem. Both types of approaches pose the increased energy-drain and ultimately slow down the route-discovery . These limitations in particular, have motivated us to propose a dynamic request-zone approach for query-broadcasting based on routing-cache. In order to counter the destination unreachability problem, a combined weight metric is used, which is defined as a multi-criteria decision making problem. Later defined problem is solved to compute the weights using extended fuzzy best-worst method. Furthermore the performance of proposed approach is evaluated in terms of query-diffusion, route-latency, and energy-saving.

对于无线自组织网络中的统一路由方法，已经提出了各种广播方案。在他们的努力中，研究人员的主要目标是最大程度地减少路由开销，包括查询的过量填充，路由延迟和能量消耗。使用重复广播或取消查询广播可以最大程度地减少路由开销。一方面，广播取消方法基于查询跟踪，这会产生额外的路由开销。另一方面，基于路由高速缓存的查询-广播技术不能适应目标节点的移动性，从而引起不可达性问题。两种方法都会增加能量消耗，并最终减慢路线发现的速度。这些限制尤其促使我们提出一种基于路由缓存的用于查询广播的动态请求区方法。为了解决目的地不可达性问题，使用了组合权重度量，它被定义为多准则决策问题。解决了后来定义的问题，从而使用扩展的模糊最佳-最差方法计算权重。此外，从查询扩散，路由等待时间和节能方面评估了所提出方法的性能。