%0 Journal Article %1 noauthororeditor %A Patel, Kirtikumar K. %A Dhadesugoor.R.Vaman, %D 2014 %J International Journal of Next-Generation Networks (IJNGN) %K networks wireless %N 1 %P 15 %R https://doi.org/10.5121/ijngn.2014.6101 %T A Novel Routing Technique for Mobile Ad Hoc Networks (Manet) %U https://airccse.org/journal/ijngn/papers/6114ijngn01.pdf %V 6 %X Actual network size depends on the application and the protocols developed for the routing for this kind of networks should be scalable and efficient. Each routing protocol should support small as well as large scale networks very efficiently. As the number of node increase, it increases the management functionality of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here, we designed all identical nodes in the cluster except the cluster head and this criterion reduces the management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend. It is applied to both intra-cluster communications as well as inter-cluster communications. The performance shows that having a multi-hop connectivity for intra-cluster communications is more power efficient compared to broadcast of information with maximum power coverage. We also showed the total number of required intermediate nodes in the transmission from source to destination. However, dynamic behavior of the nodes requires greater understanding of the node degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that the proposed graph theoretic routing approach will reduce the overall delay and improves the physical layer data frame transmission.

@article{noauthororeditor, abstract = {Actual network size depends on the application and the protocols developed for the routing for this kind of networks should be scalable and efficient. Each routing protocol should support small as well as large scale networks very efficiently. As the number of node increase, it increases the management functionality of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here, we designed all identical nodes in the cluster except the cluster head and this criterion reduces the management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend. It is applied to both intra-cluster communications as well as inter-cluster communications. The performance shows that having a multi-hop connectivity for intra-cluster communications is more power efficient compared to broadcast of information with maximum power coverage. We also showed the total number of required intermediate nodes in the transmission from source to destination. However, dynamic behavior of the nodes requires greater understanding of the node degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that the proposed graph theoretic routing approach will reduce the overall delay and improves the physical layer data frame transmission.}, added-at = {2023-11-03T13:03:25.000+0100}, author = {Patel, Kirtikumar K. and Dhadesugoor.R.Vaman}, biburl = {https://www.bibsonomy.org/bibtex/2700ab7285732013baeffe5fa08981b09/josephjonse}, doi = {https://doi.org/10.5121/ijngn.2014.6101}, interhash = {b821b25c4da2a21846a95208aa49dc1e}, intrahash = {700ab7285732013baeffe5fa08981b09}, issn = {ISSN : 0975-7023 Online); 0975-7252 ( Print )}, journal = {International Journal of Next-Generation Networks (IJNGN)}, keywords = {networks wireless}, language = {English}, month = {3}, number = 1, pages = 15, timestamp = {2023-11-03T13:03:25.000+0100}, title = {A Novel Routing Technique for Mobile Ad Hoc Networks (Manet)}, url = {https://airccse.org/journal/ijngn/papers/6114ijngn01.pdf}, volume = 6, year = 2014 }