Approximating geographic routing using coverage tree heuristics for wireless network
TL;DR: This work proposes a coverage-tree heuristic based routing instead of face routing in geographic routing schemes when greedy forwarding fails, and shows that the coverage tree based routing problem is NP hard by reduction using minimum rooted spanning tree of depth 2 (RST 2).
Abstract: Geographic routing scheme (such as Greedy perimeter stateless routing) makes use of location information to forward packets greedily Nodes need to keep only this location information in stateless routing When the greedy forwarding fails, routing switches to perimeter forwarding based on either planar graph (GG and RNG) or cross link detection protocol approaches However, it has drawback in terms of cost and computational overheads We propose a coverage-tree heuristic based routing instead of face routing in geographic routing schemes when greedy forwarding fails We prove that the coverage tree based routing problem is NP hard by reduction using minimum rooted spanning tree of depth 2 (RST 2) We also show that coverage-tree based geographic routing problem is APX hard and not approximable with a factor of $$1/2(1-\in ) \ln n$$1/2(1-?)lnn for any fixed $$\in > 0$$?>0 unless $$NP\subseteq DTIME(n^{\log \log n})$$NP⊆DTIME(nloglogn) Our proposed scheme of coverage-tree heuristics based geographic routing is $$(1+\ln m)$$(1+lnm)-approximation algorithm, a polynomial time algorithm using minimum distance topology knowledge On performance comparison using simulation, our proposed scheme outperforms with the competitive schemes in term of success rate, network overhead and success rate against varying node density
Citations
More filters
NIIT1
TL;DR: The limitation of the original Apriori algorithm of wasting time and space for scanning the whole database searching on the frequent itemsets, and an improvement on A Priori are indicated.
75 citations
TL;DR: The proposed method constructs the CDSs of smaller sizes with lower construction cost in comparison to existing CDS construction algorithms for both uniform and random distribution of nodes.
31 citations
NIIT1
TL;DR: The proposed schema presents HE-RSA or hybrid encryption RSA along with Advanced Encryption Standard or AES to ensure efficiency, consistency and trustworthiness in cloud servers.
Abstract: Cloud computing is a rising technology that is still unclear to many security issues. The most challenging issue today in cloud servers is to ensure data security and privacy of the users. The proposed schema presents HE-RSA or hybrid encryption RSA along with Advanced Encryption Standard or AES to ensure efficiency, consistency and trustworthiness in cloud servers. The goal of this paper is to use various cryptography concepts during communication along with its application in cloud computing and to enhance the security of ciphertext or encrypted data in cloud servers along with minimizing the consumption of time, cost and memory size during encryption and decryption.
24 citations
Cites background from "Approximating geographic routing us..."
...This section gives the detail explanation and analysis of the proposed approach:...
[...]
NIIT1
TL;DR: Proposed framework can protect data while transferring, sharing and storing in data centers using classification of data, Hashed Message Authentication codes and Index Building.
Abstract: Cloud Computing is a rising field in the history of computing. It is a way to maximise the capacity and capabilities without spending a lot to buy a new infrastructure and software. When users are online, they can get faster access to their data due to the massive storage. Although Cloud computing has many advantages due to large number of organizations moving towards it, it comes up with lots of security issues and breaches faced by both cloud service providers and users which are addressed in this paper. An efficient framework is devised for dealing with such issues. Proposed framework can protect data while transferring, sharing and storing in data centers using classification of data, Hashed Message Authentication codes and Index Building. The data is divided into three sections and accordingly the user is asked for authentication. User is provided the digital signature which can be verified with cloud directory. Using indexing, search can be made on the encrypted data.
20 citations
Cites background from "Approximating geographic routing us..."
...While sending messages on a network [14], [15], confidentiality is very important....
[...]
01 Jan 2018
TL;DR: A scheme that integrates the multi-party computation with homomorphic encryption to allow calculations of encrypted data without decryption is proposed and the overheads are compared with Homomorphic Encryption and Multi-Party Computation.
Abstract: Cloud computing is a developing technology that is yet unclear to many security issues. Data in the untrusted clouds can be encrypted using encryption algorithm. Randomizing this data provides more security which can be achieved by padding concept in the cloud. In this paper, the user's data is encrypted using padding scheme, called Optimal Asymmetric Encryption Padding (OAEP) together with Hybrid Encryption algorithm that is based on RSA (i.e., HE-RSA), in order to allow multiple parties to compute a function on their inputs while preserving Integrity and Confidentiality. The Homomorphic Encryption(HE) is performed on the encrypted data without decrypting it in computationally powerful clouds and the Secure Multi-Party Computation (SMPC) can be used in the cloud to ensure security and privacy of the users. In this paper, we have proposed a scheme that integrates the multi-party computation with homomorphic encryption to allow calculations of encrypted data without decryption. The cryptographic techniques used in our cloud model are described and the overheads are compared with Homomorphic Encryption and Multi-Party Computation.
19 citations
Cites methods from "Approximating geographic routing us..."
...The proposed secure cloud computing algorithm is ensuring the security and privacy [21], [22] of individual data in the cloud along with the enhancement of the security mechanism like Homomorphic Encryption and Multi Party Computation (MPC)....
[...]
References
More filters
01 Jan 1979
42,654 citations
Book•
01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Abstract: This is the second edition of a quarterly column the purpose of which is to provide a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book ‘‘Computers and Intractability: A Guide to the Theory of NP-Completeness,’’ W. H. Freeman & Co., San Francisco, 1979 (hereinafter referred to as ‘‘[G&J]’’; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J] is assumed. Readers having results they would like mentioned (NP-hardness, PSPACE-hardness, polynomial-time-solvability, etc.), or open problems they would like publicized, should send them to David S. Johnson, Room 2C355, Bell Laboratories, Murray Hill, NJ 07974, including details, or at least sketches, of any new proofs (full papers are preferred). In the case of unpublished results, please state explicitly that you would like the results mentioned in the column. Comments and corrections are also welcome. For more details on the nature of the column and the form of desired submissions, see the December 1981 issue of this journal.
40,020 citations
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.
17,936 citations
01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.
7,384 citations
09 Jul 2003
TL;DR: This paper proposes a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters, and extends this algorithm to generate a hierarchy of clusterheads and observes that the energy savings increase with the number of levels in the hierarchy.
Abstract: A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center.
1,935 citations
"Approximating geographic routing us..." refers background in this paper
...[56] proposed a distributed, randomized clustering algorithm to distribute the sensor nodes in a WSN [57] into clusters and they also extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy....
[...]