期刊名称：International Journal on Applications of Graph Theory in Wireless ad hoc Networks and Sensor Networks
印刷版ISSN：0975-7260
电子版ISSN：0975-7031
出版年度：2013
卷号：5
期号：4
页码：1-18
DOI：10.5121/jgraphoc.2013.5401
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Battlefield theater applications require supporting large number of nodes.It can facilitate many multi-hoppaths between each source and destination pairs. For scalability, it is critical that for supporting networkcentric applications with large set of nodes require hierarchical approach to designing networks. In thisresearchwe consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each clustersupports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within thecluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no servicedisruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,for inter-cluster communications, only cluster heads are connected. The selection of intra-clustercommunicationsand inter-cluster communications allow scalability of the network to support multi-services applications end-to-end with a desired Quality of Service (QoS). This paper proposes graphtheoretic approach to establish efficient connection between a source and a destination within each clusterin intra-cluster network and between clusters in inter-cluster network. Graph theoretic approachtraditionally was applied networks where nodes are static or fixed. In this paper, we have applied thegraph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET isto support an efficient routing algorithm for multi-hop communications across many nodes which aredynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the nodedegree and mobility at each instance of time in order to maintain end-to-end QoS for multi-serviceprovisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hopconnectivity path based on cumulativeminimum degree that minimizes the contention and schedulingdelay end-to-end. It is applied to both intra-cluster communications as well as inter-clustercommunications. The performance shows that having a multi-hop connectivity for intra-clustercommunications is more power efficient compared to broadcast of information with maximum powercoverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.Our simulation results show that the proposed graph theoreticrouting approach will reduce the overalldelay and improves the physical layer data frame transmission.
Loading...
