On Shortest Path Routing Schemes for Wireless Ad Hoc Networks

Dhar, Subhankar; Rieck, Michael Q.; Pai, Sukesh

doi:10.1007/978-3-540-24596-4_15

Cited by 4 publications

(21 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to do so, they reduced the problem to a special case of the Set Covering Problem. A similar but different reduction to this problem was also used in Dhar et al (2003b). For a given value of k, the latter requires fewer overhead communications than does the Liang-Haas method.…”

Section: Related Workmentioning

confidence: 97%

“…Firstly, let us state certain properties associated with such a set (cf. Dhar et al, 2003b;Rieck et al, 2002).…”

Section: Previous Work On K-spr Setsmentioning

confidence: 97%

“…Dhar et al, 2003bDhar et al, , 2004. As already said, each network node v plays the role of a type-one vertex in H .…”

Section: The New Algorithmsmentioning

confidence: 98%

“…A subset C of A covers B if and only if it is a k-SPR set, as is straightforward to check. For more details, (see Dhar et al, 2003b). The following definition will be useful, although it really is just another name for 'node degree' in the context of the bipartite graph.…”

Section: Set Covering Problem Bipartite Graphmentioning

confidence: 98%

“…To establish the above, Dhar et al (2003b) introduces the notion of a k-SPR set, which is defined as follows.…”

Section: Previous Work On K-spr Setsmentioning

confidence: 99%

See 4 more Smart Citations

An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks

Dhar

Rieck

2007

IJMNDI

Self Cite

View full text Add to dashboard Cite

New energy-efficient routing algorithms are introduced, based on a generalisation of the k-SPR sets from earlier work by the authors. This generalisation provides a means for the automatic avoidance of certain nodes and links when messages are routed. Sensor networks are modelled as connected graphs with vertex costs and edge costs. In addition, a two-tiered routing system in introduced. The low level routing is used for local routing within k hops, and is essentially (local) link-state routing. The high level routing depends on the routers from a k-SPR set, to manage this global routing.

show abstract

Section: Related Workmentioning

confidence: 97%

“…Firstly, let us state certain properties associated with such a set (cf. Dhar et al, 2003b;Rieck et al, 2002).…”

Section: Previous Work On K-spr Setsmentioning

confidence: 97%

“…Dhar et al, 2003bDhar et al, , 2004. As already said, each network node v plays the role of a type-one vertex in H .…”

Section: The New Algorithmsmentioning

confidence: 98%

Section: Set Covering Problem Bipartite Graphmentioning

confidence: 98%

“…To establish the above, Dhar et al (2003b) introduces the notion of a k-SPR set, which is defined as follows.…”

Section: Previous Work On K-spr Setsmentioning

confidence: 99%

See 3 more Smart Citations

An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks

Dhar

Rieck

2007

IJMNDI

Self Cite

View full text Add to dashboard Cite

show abstract

Hierarchical Routing in Sensor Networks Using k-Dominating Sets

Rieck

Dhar

2005

Distributed Computing – IWDC 2005

Self Cite

View full text Add to dashboard Cite

For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called k-SPR sets. Such a set can serve as a virtual backbone to facilitate shortest path routing, as introduced in [40], [12] and [13]. When employed in a hierarchical fashion, together with a hybrid (partly proactive, partly reactive) strategy, the k-SPR set methods become highly scalable, resulting in guaranteed shortest path routing with comparatively little overhead.In this paper, we first discuss the notion of k-SPR sets, with the nodes of such a set functioning as routers for the network. These sets generalize our earlier k-SPR sets, which facilitated shortest path routing. We then introduce K-SPR sequences that are used for hierarchical routing. We propose a distributed greedy algorithm for construction of K-SPR sequences. The new sets facilitate minimal path routing, where "minimal path" here means "shortest weighted path based on edge weights".Finally, we introduce an efficient hybrid hierarchical routing strategy that is based on K-SPR sequences. Our approach is unique in the sense that although dominating sets have been used to construct virtual backbones in ad hoc and sensor networks, this is the first attempt to use k-hop connected k-dominating sets for hierarchical routing that is also minimal path routing.

show abstract