Geographic Node-Disjoint Path Routing for Wireless Sensor Networks

Kumar, Alok; Varma, Shirshu

doi:10.1109/jsen.2009.2038893

Cited by 27 publications

(12 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The two hidden metrics are exploited in case of basic GNPR approach (Kumar & Varma, 2010), which are direction and distance. Individually these metrics employed in notorious routing approaches: compass routing (CR) and greedy routing (GR).…”

Section: Fuzzy Logic-based Gnprmentioning

confidence: 99%

Performance analysis of fuzzy logic-based geographical node-disjoint path routing for WSNs

Goutele

Singh

Gurjar

et al. 2014

International Journal of Electronics

View full text Add to dashboard Cite

Geographical routing in wireless sensor networks is an effective approach for monitoring of seismically sensitive zones where the probability of earthquake and hazards is very high. In this letter, we are proposing an efficient fuzzy logic-based geographical routing approach for seismically sensitive areas using wireless sensor network (WSN). The proposed system uses the concept of basic geographical node-disjoint path routing (GNPR). The difference between proposed system and its conventional GNPR is that, it uses fuzzy logic to find out the shortest path per iteration and repeatedly apply the fuzzy inference rules in subsequent iteration to find the next on-demand node. Simulation results show that the proposed scheme gives better performance in terms of higher throughput and lower delay as compared to basic GNPR approach.

show abstract

Section: Fuzzy Logic-based Gnprmentioning

confidence: 99%

Performance analysis of fuzzy logic-based geographical node-disjoint path routing for WSNs

Goutele

Singh

Gurjar

et al. 2014

International Journal of Electronics

View full text Add to dashboard Cite

show abstract

“…The work in Griffin and Korkmaz (2011) gives a distributed algorithm to check if the network configuration contains at least two disjoint paths between all node pairs. For general k, some distributed algorithms are proposed in Ganesan et al (2001), Li and Wu (2005), Baek et al (2007), Sidhu et al (1991), Deb et al (2003), Fang et al (2009), Omar et al (2011, and Kumar and Varma (2010) for finding k disjoint s ∼ t paths in a network. However, they do not consider the length of the routing paths.…”

Section: Related Workmentioning

confidence: 99%

“…In recent years, the problem of finding multiple disjoint s ∼ t paths has become more and more widely researched (Guo et al 2014;Zhou et al 2014;Li et al 2014;Ganesan et al 2001;Srinivas and Modiano 2003;Li and Wu 2005;Baek et al 2007;Sidhu et al 1991;Bhandari 1997;Khuller and Schieber 1989;Iwama et al 1997;Suurballe 1974;Deb et al 2003;Chen et al 2004;Fang et al 2009;Hashiguchi et al 2011;Omar et al 2011;Kumar and Varma 2010;Cai et al 2005Cai et al , 2008Cai et al , 2009Cai et al , 2011. To solve the MIN-k-DP problem, all the existing distributed algorithms (Ganesan et al 2001;Li and Wu 2005;Baek et al 2007;Sidhu et al 1991;Deb et al 2003;Fang et al 2009;Omar et al 2011;Griffin and Korkmaz 2011;Kumar and Varma 2010) (which are efficient in WSNs) can not guarantee correctness or optimality.…”

Section: Introductionmentioning

confidence: 99%

“…To solve the MIN-k-DP problem, all the existing distributed algorithms (Ganesan et al 2001;Li and Wu 2005;Baek et al 2007;Sidhu et al 1991;Deb et al 2003;Fang et al 2009;Omar et al 2011;Griffin and Korkmaz 2011;Kumar and Varma 2010) (which are efficient in WSNs) can not guarantee correctness or optimality. Although some centralized algorithms (Srinivas and Modiano 2003;Bhandari 1997;Suurballe 1974;Hashiguchi et al 2011) can solve the problem with correctness and optimality guarantee, they have to build the topology of the whole network, so their overhead is overwhelming for WSNs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks

et al. 2015

View full text Add to dashboard Cite

This paper investigates the MINimum-length-k-Disjoint-Paths (MINk-DP) problem: in a sensor network, given two nodes s and t, a positive integer k, finding k (node) disjoint paths connecting s and t with minimum total length. An efficient distributed algorithm named Optimally-Finding-Disjoint-Paths (OFDP) is proposed for this problem. OFDP guarantees correctness and optimality, i.e., (1) it will find k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise; (2) the disjoint paths it outputs do have minimum total length. To the best of our knowledge, OFDP is the first distributed algorithm that can solve the MIN-k-DP problem with correctness and optimality guarantee. Compared with the existing centralized algorithms which also guarantee correctness and optimality, OFDP is shown to be much more efficient by simulation results.

show abstract

“…Of the multiple paths, a path selection algorithm is used to select one of the paths, and is also useful during route maintenance. Generally geographic routing protocols [15]- [17] are being considered for WSN. They are not affected at all by topology changes due to failure of nodes as they can simply select some other node as the next hop neighbor.…”

Section: Related Workmentioning

confidence: 99%

An efficient delay aware multipath GPS routing protocol for Wireless Sensor Networks

Chitra

Sumalatha

Deepthi

2013

2013 Fifth International Conference on Advanced Computing (ICoAC)

View full text Add to dashboard Cite

There have been several geographic routing protocols proposed for disseminating data in Wireless Sensor Networks. In these protocols, routing is based on the location of neighboring nodes and the selection of the next hop is done based on a direction based or a location based strategy. In this paper, a novel routing protocol that makes use of this direction based strategy to disseminate data in the shortest possible time is proposed. The protocol uses minimal amount of storage to determine the next hop in the shortest amount of time possible. Simulation results obtained using the Castalia simulator show the efficiency of the proposed protocol over the standard geographic protocol GPSR.

show abstract

Geographic Node-Disjoint Path Routing for Wireless Sensor Networks

Cited by 27 publications

References 2 publications

Performance analysis of fuzzy logic-based geographical node-disjoint path routing for WSNs

Performance analysis of fuzzy logic-based geographical node-disjoint path routing for WSNs

OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks

An efficient delay aware multipath GPS routing protocol for Wireless Sensor Networks

Contact Info

Product

Resources

About