Abstract
In the advanced routing of new networks communication and network technologies, it not only operates on some lower levels of a network protocol. But it also operates on some upper layers such as the application layer the highest-level layer in network protocol stack of OSI model. The routing process can be known by a more abstract concept. It can process on many layers on network’s stack of OSI model. So this kind of routing may be called the upper layer routing protocol. As the content based routing, in the service based routing protocol, the information can be classified by categories or service classes. Subscribers and publishers can communicate with each other but they don’t know other’s address. So it is more dynamical in processing and more comfortable for ad-hoc network. However the upper routing must be based on lower layers to make routing decisions. But normal routing protocols are used for most static network or rather small wireless networks or not high mobility networks. In mobile ad-hoc networks, nodes move very often and fast, so bandwidth of connection between them may be reduced. Therefore the transmission delay may be increased. The paper aims at purpose to increate QOS of routing by hierarchical clustering routing by using R+ tree in addition with some advanced techniques multicast routing, multiple paths, use GEN/ BEE/ ANT to optimize routes to transmit data. In R+ tree model, the network’s nodes are managed by Bottom-Up model from leaf nodes to root of the tree. All the leaf nodes, inner nodes and root of this tree are used for two roles: i) Manage a cluster that consists all nodes that have direct connections with this node; ii) Operate as a normal node. The paper mentions: (i) Setup hierarchical clustering network by using R tree structure. (ii) Making multicast tree from some cluster heads for fast routing. (iii) Making optimized route by Ant Colony Optimization.
Highlights
R tree is the same as another tree, such as it has root, branches, and leaves
We apply R+ tree to organize the network in hierarchical clustering model
When a node is covered by a cluster head with satisfied bandwidth, it may join this cluster by invitation message of this cluster head
Summary
R tree is the same as another tree, such as it has root, branches, and leaves. it always keeps balance in its structure that is after each insert, update, delete operations it has to regulate its structure to remain each node has number of its children in the predefined range. The network nodes in a level and belonged to a local root that are called a cluster or group. Root often transmits control messages to their children members to coordinate its one level lower clusters. When a node is covered by a cluster head with satisfied bandwidth, it may join this cluster by invitation message of this cluster head This network local change is transmitted to network by multicast tree of some clusters. The cluster head of PC transmits this M to all members of PC and to CH of its cluster By this way, this change of network configuration is very fast to be updated on all CHs. All network leaf nodes don’t need to receive this information, so it reduces much of bandwidth. Because this model of networks can avoid the constraint of [m, M] in each level of R+
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
