Proceedings ArticleDOI

Improvised k-hop Neighbourhood Knowledge Based Routing in Wireless Sensor Networks

15 Dec 2013-pp 136-141

TL;DR: This work proposes a cost-effective scheme which makes use of khop neighbourhood knowledge and this heuristic is applied when greedy forwarding fails and is used instead of face routing and planarization and proves to be better than planarized in most of the cases.

AbstractGeographic Perimeter Stateless Routing (GPSR) makes use of location information to forward packets greedily. Nodes need to keep only this local information, hence called as stateless. There are two graphs used for the planarization namely the Gabriel Graph (GG) and the Relative Neighbourhood Graph (RNG) but they were very expensive and had to be run for each node whenever greedy forwarding failed. So it was further replaced by CLDP, however it also suffered from drawbacks both in terms of cost and complications. Here, we propose a cost-effective scheme which makes use of khop neighbourhood knowledge and this heuristic is applied when greedy forwarding fails and is used instead of face routing and planarization. Moreover it proves to be better than planarization in most of the cases.

Citations
More filters
Journal ArticleDOI
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.
Abstract: Apriori Algorithm is one of the most important algorithm which is used to extract frequent itemsets from large database and get the association rule for discovering the knowledge. It basically requires two important things: minimum support and minimum confidence. First, we check whether the items are greater than or equal to the minimum support and we find the frequent itemsets respectively. Secondly, the minimum confidence constraint is used to form association rules. Based on this algorithm, this paper indicates the limitation of the original Apriori algorithm of wasting time and space for scanning the whole database searching on the frequent itemsets, and present an improvement on Apriori.

70 citations

Journal ArticleDOI
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

28 citations

Cites background from "Improvised k-hop Neighbourhood Know..."

• ...They recognized and stated that for the small forwarding state greedy forwarding requires a deep insight into the possibilities of routing based on the knowledge of geographic locations [13, 21–23] of all the nodes in a wireless radio network [24, 25]....

[...]

Proceedings ArticleDOI
06 Mar 2014
TL;DR: A new tree selection algorithm is proposed in GDSTR which improves the performance in terms of path and hop stretch with the competitive schemes.
Abstract: The Geographic Perimeter Stateless Routing (GPSR)use location information to forward packets greedily. Nodes need to keep only this local information, hence called as stateless. When Greedy Forwarding is fails, the algorithm recovers by switching to face routing, which is based on the right-hand rule in planarized node graph, to route around the void. The Gabriel Graph(GG) and the Relative Neighbourhood Graph (RNG) are the two graphs used for planarization but may lead to graph partitioning. Alternatively, instead of switching to face routing and planarizition, the existing Greedy Distributed Spanning Tree Routing(GDSTR) scheme enables nodes to continue routing by traversing on a spanning tree until it reaches a point where greedy forwarding can take place. GDSTR sometimes incorporates two spanning trees although it uses only one. So, in this work, we proposed new tree selection algorithm in GDSTR which improves the performance in terms of path and hop stretch with the competitive schemes.

2 citations

Cites background from "Improvised k-hop Neighbourhood Know..."

• ...The Geographic Perimeter Stateless Routing(GPSR)[5], [6], [7], [8], [9], [17], [18], [19], [20] makes extensive use of geography to achieve scalability in wireless routing protocols....

[...]

Journal ArticleDOI
TL;DR: A mechanism for partitioning the graph of vehicles in an intersection into multiple bipartite directional sub-graphs, such that each sub- graph aggregates messages using short range communication and make one long range communication of aggregated message is proposed.
Abstract: We formulate a multi-directional broadcast (MDB) storm problem arising in dense vehicular ad-hoc networks (VANETs) when the multiple nodes (moving in multiple directions) forward broadcast packets meet at the road intersections, resulting in severe packet collisions inducing delays at medium access control. In this work, we have proposed a mechanism for partitioning the graph of vehicles in an intersection into multiple bipartite directional sub-graphs, such that each sub-graph aggregates messages using short range communication and make one long range communication of aggregated message. The k balanced graph partitioning problem contains partitions of size ≤ |V|/k nodes. For a graph G = (V, E), a partitioning P, is (k, 1 + e) balanced if V is partitioned into k disjoint subsets each containing at most (1 + e)n/k vertices. Our proposed approximation algorithm for intersection-cast problem uses a balanced partition with Θ (log^2 n) approximation for balance constant, v > 1. We have given simulation results for the performance analysis of our intersection-cast protocol compared to the existing competitive schemes and found improvement in terms of broadcast success rate, reachability and message overhead in the networks.

2 citations

Cites methods from "Improvised k-hop Neighbourhood Know..."

• ...The performance of hybrid routing (Maia et al., 2012; Das and Misra, 2013; Yang et al., 2005; Karp, 2000; Leong, 2006) scheme is evaluated using both simulations and real testbed experiments....

[...]

Book ChapterDOI
03 Aug 2017
TL;DR: A unified framework and new metrics that combines integrated modelling, system integration and optimization, official certification and validation, and automatic synthesis approaches for analysing the security and safety of ITS and booming out design space investigation of both in-vehicle electronic control systems and vehicle-to-Vehicle communications are recommended.
Abstract: There is a serious mismatch between the growing traffic volume and the availability of resources to support the traffic. Some of the important reasons for this mismatch are the rapid development of our economy, increased affordability of our society, multiple vehicles per family, and so on. We believe that the mismatch will continue to grow and adversely affect our traffic infrastructure unless efficient traffic management solutions that include system integration, design, prediction, safety verification, validation, and security are developed and deployed. Security has appeared as an important issue for Intelligent Transportation Systems (ITS). Some security threats become more challenging task with the emergence of Vehicle-to-Vehicle (V2V) communication and Vehicle-to-Roadside (V2R) communication in vehicular networks. Addressing the security issues in smart vehicular communication systems requires new effective and efficient algorithm that encompass considerations of new security techniques, safety things, communication related resource limitations, and other related new performance metrics. In this paper, we recommend a unified framework and new metrics that combines integrated modelling, system integration and optimization, official certification and validation, and automatic synthesis approaches for analysing the security and safety of ITS and booming out design space investigation of both in-vehicle electronic control systems and vehicle-to-vehicle communications. This integrated framework will facilitated the system integration and optimization and enable validation of various design the new metrics for vehicular networks such as timing, direction, reliability, speed, security and performance.

1 citations

References
More filters
Journal ArticleDOI
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.
Abstract: This paper describes the concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of factors influencing the design of sensor networks is provided. Then, the communication architecture for sensor networks is outlined, and the algorithms and protocols developed for each layer in the literature are explored. Open research issues for the realization of sensor networks are also discussed.

17,354 citations

"Improvised k-hop Neighbourhood Know..." refers background in this paper

• ...For this reason, Greedy Forwarding is very effective in dense wireless sensor networks [4], [13]....

[...]

• ...However it is difficult to obtain the static connected plain graph in wireless network [4]....

[...]

• ...The adaptability of these to mobility of wireless sensor [4], [13] nodes is done in the following sections....

[...]

Proceedings ArticleDOI
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,152 citations

Proceedings ArticleDOI
29 Sep 2006
TL;DR: This article gives the first complete and formal proofs that several proposed face routing, and combined greedy-face routing schemes do guarantee delivery in specific graph classes or even any arbitrary planar graphs.
Abstract: It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this article is to clarify that this is not the truth in general. We show that specifically in relative neighborhood and Gabriel graphs recovery from a greedy routing failure is always possible without changing between any adjacent faces. Guaranteed delivery then follows from guaranteed recovery while traversing the very first face. In arbitrary graphs, however, a proper face selection mechanism is of importance since recovery from a greedy routing failure may require visiting a sequence of faces before greedy routing can be restarted again. A prominent approach is to visit a sequence of faces which are intersected by the line connecting the source and destination node. Whenever encountering an edge which is intersecting with this line, the critical part is to decide if face traversal has to change to the next adjacent one or not. Failures may occur from incorporating face routing procedures that force to change the traversed face at each intersection. Recently observed routing failures which were produced by the GPSR protocol in arbitrary planar graphs result from incorporating such a face routing variant. They cannot be constructed by the well known GFG algorithm which does not force changing the face anytime. Beside methods which visit the faces intersected by the source destination line, we discuss face routing variants which simply restart face routing whenever the next face has to be explored. We give the first complete and formal proofs that several proposed face routing, and combined greedyface routing schemes do guarantee delivery in specific graph classes or even any arbitrary planar graphs. We also discuss the reasons why other methods may fail to deliver a message or even end up in a loop.

272 citations

"Improvised k-hop Neighbourhood Know..." refers background or methods in this paper

• ...For this reason, Greedy Forwarding is very effective in dense wireless sensor networks [4], [13]....

[...]

• ...The algorithm used to by pass the void [5] or the local maxima is called face routing [1], [13] or the perimeter routing....

[...]

• ...The adaptability of these to mobility of wireless sensor [4], [13] nodes is done in the following sections....

[...]

• ...The face routing or perimeter routing [1], [5], [11], [13] makes use of the Right Hand Rule [11]....

[...]

Journal ArticleDOI
TL;DR: An overview of the void problem is presented and the currently available void-handling techniques (as of July 2006) for geographic routing are surveyed, each designed with a different approach.
Abstract: Communications voids, where geographic greedy forwarding fails to move a packet further towards its destination, are an important issue for geographic routing in wireless networks. This article presents an overview of the void problem and surveys the currently available void-handling techniques (as of July 2006) for geographic routing. In the survey, we classify these void-handling techniques into six categories, each designed with a different approach, that is, planar-graph-based, geometric, flooding-based, costbased, heuristic, and hybrid. For each category, we present its basic principle and illustrate some classic techniques as well as the latest advances. We also provide a qualitative comparison of these techniques and discuss some possible directions of future research.

226 citations

"Improvised k-hop Neighbourhood Know..." refers background or methods in this paper

• ...The sequence of edges covered is called the perimeter [5]....

[...]

• ...The Greedy Forwarding tries to bring the message closer to the destination in each step based on only local information....

[...]

• ...The Greedy Forwarding never fails if for any node, there is at least one neighbour in every 2*π/3 sector of its area....

[...]

• ...The face routing or perimeter routing [1], [5], [11], [13] makes use of the Right Hand Rule [11]....

[...]

• ...Most of the single path strategies are based on the two techniques: Greedy Forwarding [5] and Face Routing [1]....

[...]

Journal ArticleDOI
TL;DR: This paper aims to provide both a comprehensive and methodical survey of existing literature in the area of geographic routing from its inception as well as acting as an introduction to the subject.
Abstract: Geographic routing offers a radical departure from previous topology-dependent routing paradigms through its use of physical location in the routing process. Geographic routing protocols eliminate dependence on topology storage and the associated costs, which also makes them more suitable to handling dynamic behavior frequently found in wireless ad-hoc networks. Geographic routing protocols have been designed for a variety of applications ranging from mobility prediction and management through to anonymous routing and from energy efficiency to QoS. Geographic routing is also part of the larger area of context-awareness due to its usage of location data to make routing decisions and thus represents an important step in the journey towards ubiquitous computing. The focus of this paper, within the area of geographic routing is on wireless ad-hoc networks and how location information can benefit routing. This paper aims to provide both a comprehensive and methodical survey of existing literature in the area of geographic routing from its inception as well as acting as an introduction to the subject.

206 citations