Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks

Indukuri, R Krishnam Raju; Penumathsa, Suresh Varma

doi:10.14569/ijacsa.2011.020213

Cited by 6 publications

(1 citation statement)

References 14 publications

(10 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Communication hubs are excellent candidates for park-andride (P&R, sometimes P+R) points ( [4]) with good connections to the center and other parts of the city and this idea is a basis of presented work. This problem is well known and is commonly used in industry, in particular in such areas as transport, telecommunication, and distributed computing [1], [2], [11], [13], [16].…”

mentioning

confidence: 99%

Graph based approach to the minimum hub problem in transportation network

Owsiński

Stańczak

Barski

et al. 2015

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-In this paper we consider a hub location problem in a real multimodal public transportation network. This problem is also known as the park-and-ride problem. Hubs stations are special facilities that serve as switches in such a network. In practice the set of hubs has a strategic importance, because all of the traffic that passes through the network can be controlled by these elements. From the theoretical point of view, the minimal hub problem is NP hard. Two different approaches to this problem are presented. The first group of methods bases on the greedy algorithms. In the second group the evolutionary strategy is used. The computational results for these algorithms proved a significant efficiency, what can be clearly expressed in terms of an input data reduction and also in quality measure values for the obtained solutions of this problem. I. INTRODUCTIONET US consider a real public transportation network. This network can be described as a graph [3], [8], [9]. In this graph, each tram/bus stop corresponds to one vertex and any two vertices are adjacent iff they belong to at least one common public transport line. Hence, the set of vertices along a route forms a connected subgraph of the entire graph. Each vertex in this graph is characterized/labeled by a set of numbers of tram/bus lines passing through it. LIn such a graph, a hub set is a subset of vertices, such that any two vertices are connected by a path whose vertices lie in it. Let us define the minimum hub set problem as the problem of finding the hub set of minimal cardinality for a given graph. This collection has a strategic importance for the transportation system, because all the traffic that passes through the network can be controlled by these vertices. Communication hubs are excellent candidates for park-andride (P&R, sometimes P+R) points ([4]) with good connections to the center and other parts of the city and this idea is a basis of presented work. This problem is well known and is commonly used in industry, in particular in such areas as transport, telecommunication, and distributed computing Let us observe that we can try to find the minimum hub set for a given network in two different ways. This problem would be directly reduced to the task of designation the minimum dominating set [6], [14], [15]. Alternatively, we have a possibility of creating a hypergraph, such that its set of vertices is the same as in the original network, and for each set of vertices, which correspond to stops lying along a tram/bus route, we form the hyperedge. In this case, we reduce the considered problem to the search for the minimal transversal in a constructed hypergraph. II. BASIC MATHEMATICAL DEFINITIONSThis section provides some basic notation. A graph is a representation of a set of objects, where some pairs of objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices, and the links that connect some pairs of vertices are called edges. More formally, a graph is an ordered pair G=(V,...

show abstract

mentioning

confidence: 99%

Graph based approach to the minimum hub problem in transportation network

Owsiński

Stańczak

Barski

et al. 2015

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

show abstract

Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism

Chen

Wang

et al. 2023

Artificial Intelligence

View full text Add to dashboard Cite

A Novel approach for Implementing Security over Vehicular Ad hoc network using Signcryption through Network Grid

Vijayan¹,

Sumitkumar²

2011

IJACSA

View full text Add to dashboard Cite

Abstract-Security over Vehicular ad hoc network and identifying accurate vehicle location has always been a major challenge over VANET. Even though GPS system can be used to identify the location of the vehicle they too suffer from major drawbacks. A novel approach has been suggested by the author wherein the VANET is made more secured by using Signcryption technique and at the same time unique approach of using Network Grid to flawlessly identify the location of the vehicle has been proposed. VANET as compared to Mobile ad hoc network or MANET is highly dynamic and unsecured. Providing security and at the same time preventing the current transmission to attain loss due to frequent path breakage over VANET has always been a major challenge. Moreover, the computation cost required over VANET should be less as compared to MANET. So, even if a security protocol is to be implemented over VANET care must be taken so that the computation cost doesn"t increase. A unique public key cryptography technique Signcryption as proposed by Zengh [1] has been suggested in this paper. Signcryption is a cryptography technique which combines the two step of Digital signature and Encryption in one step and hence reduces the computation time up to great extent as compared to Signature-then-Encryption. Keywords-Network Grid

show abstract

Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks

Cited by 6 publications

References 14 publications

Graph based approach to the minimum hub problem in transportation network

Graph based approach to the minimum hub problem in transportation network

Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism

A Novel approach for Implementing Security over Vehicular Ad hoc network using Signcryption through Network Grid

Contact Info

Product

Resources

About