The large wireless sensor networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. This paper proposes a new protocol called hierarchical QoS routing protocol (HQRP) that achieves scalability by organizing the network as a hierarchy of domains using the full-mesh aggregation technique. In HQRP, each local node just only needs to maintain local routing and summary information of other domains, but does not requires any global states maintained. The HQRP uses a Reverse Best Metric Path Forwarding approach with hierarchical, topological and QoS forwarding conditions to construct the multicast tree while minimizing message overhead and satisfying delay-bandwidth and minimum energy consumption. The paper presents proof of correctness and complexity analysis of the HQRP. Simulation results show very good performance in terms of success ratio and message overhead. Large multicast routing domains can be decomposed into multiple sub-domains organized hierarchically, such that one sub-domain is treated as a single link in a higher level domain to scale the multicast service up to large wireless sensor networks. A domain is a set of nodes that are connected by communication links. Some nodes are connected to another domain and these nodes are called gate border nodes. We model the network and the domains as directed graphs where links can be asymmetric in both directions to make it more flexible. An example of a hierarchical network is provided in Fig.1 . A network consists of a set of domains and links that connect them. A network is denoted as
Recently, Z. Zhou, Y. Xu, M. Qin, C. Mao, and L. Li REF propose a new protocol called hierarchical QoS routing protocol (HQRP) that achieves scalability by organizing the network as a hierarchy of domains using the full-mesh aggregation technique.
A Hierarchical QoS Routing Protocol for the Wireless Sensor Networks
Applied Mechanics and Materials
Computer Science