Distributed routing schemes for ad hoc networks using d-SPR sets

Dhar, Subhankar; Rieck, Michael Q.; Pai, Sukesh; Kim, Eun Jik

doi:10.1016/j.micpro.2004.03.016

Cited by 15 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the only difference in the statement of the theorem presented in this section and (Dhar et al, 2004, Theorem 1) is that the present theorem deals with minimal rather than shortest paths, this difference is nevertheless quite significant. It provides for the implementation of a more general routing algorithm, one that automatically ensures routing that avoids nodes and edges with high costs.…”

Section: Weighted Graphs and A Generalisation Of K-spr Setsmentioning

confidence: 78%

“…We refer to this algorithm as k-SPR-G. This is discussed fully in Dhar et al (2003aDhar et al ( , 2004. This approach tends to result in a substantially smaller k-SPR set than the previous two algorithms.…”

Section: The K-spr-g Algorithmmentioning

confidence: 99%

“…By imposing tight conditions on being a k-election pair, it is also possible to control the size of a k-SPR set. Theorem 1 of Dhar et al (2004) is now generalised as follows. This generalisation is significant in so far as the routing strategies will now be able to facilitate minimal-path routing in a manner that has routers (members of a k-SPR set) routinely encountered (within k hops).…”

Section: Weighted Graphs and A Generalisation Of K-spr Setsmentioning

confidence: 99%

“…As with the more restrictive definition of k-SPR sets used in Dhar et al (2004), it is possible to interpret the more general definition of a k-SPR set in the context of a certain bipartite graph H . This is comprised of two types of vertices.…”

Section: New Distributed K-spr Algorithmsmentioning

confidence: 99%

“…In Dhar et al (2004), each node was not only able to detect the election pairs for which it was a candidate, but was also able to detect (in its local view) all of the other candidates for such election pairs. This too might no longer be the case.…”

Section: Local Views and Anomaliesmentioning

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: Weighted Graphs and A Generalisation Of K-spr Setsmentioning

confidence: 78%

Section: The K-spr-g Algorithmmentioning

confidence: 99%

Section: Weighted Graphs and A Generalisation Of K-spr Setsmentioning

confidence: 99%

Section: New Distributed K-spr Algorithmsmentioning

confidence: 99%

Section: Local Views and Anomaliesmentioning

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

Regression test suite reduction based on SDL models of system requirements

Chen

Probert

Ural

2009

J. Softw. Maint. Evol.: Res. Pract.

View full text Add to dashboard Cite

This paper proposes a model-based regression test suite reduction method. The proposed method considers an SDL model representing the requirements of a system under test and a set of modifications on this model, applies dependence analysis to identify interaction patterns related to each type of modifications, i.e., adding, deleting, and changing transitions in the SDL model, and reduces the size of a given regression test suite by examining interaction patterns covered by each test case in the test suite. Results of empirical studies are reported. modified to reflect the changes in system requirements. When a system model is changed, modelbased testing techniques can be applied to the modified model, to partially test the SUT with respect to the selected requirements. But the size of such a regression test suite (RTS) may be very large even for relatively small systems [16]. In addition, model-based testing techniques usually attempt to satisfy some coverage criterion for constructing a test suite [13,15,17,18]. However, an RTS may not need to target the same coverage as an original test suite. This is mainly for two reasons. The first reason is that, only part of the SUT is tested by the RTS to verify that modifications have not caused unintended effects in the SUT and that the SUT complies with the changes in the requirements. The second reason is that, the cost and complexity of frequent regression testing during software maintenance are reduced by minimizing the size of the RTS.In this paper, we propose a method for reducing the size of a given RTS with respect to a given set of modifications to an SDL (Specification Description Language [19]) model of the requirements of an SUT. SDL is an internationally standardized formal description language for specifying the expected behaviour of state-based systems. Often requirements are given in the form of a set of use cases, scenarios expressed in Message Sequence Charts (MSC [20]). These MSCs can then be used to automatically construct an SDL model of the requirements, as done, e.g., by TeleLogic TAU with KLOCwork's MSC2SDL synthesizer integrated [21].The proposed method is an extension of the work of Korel et al. [22] and Xie [23] for test suite reduction. In [22], Korel et al. presented a requirements-based RTS reduction approach utilizing dependence analysis of a given Extended Finite State Machine (EFSM) model on the basis of a given set of modifications. During the traversal of each test case in the given RTS, 'interaction patterns' caused by the modifications are computed and only those test cases such that at least one of their interaction patterns is not produced for any other test case are included in the reduced RTS. In [23], Xie formalized Korel et al.'s approach, defined sub-types of some of the dependencies introduced by Korel et al., and proposed algorithms to exploit these dependencies to reduce the given RTS. Our proposed method differs from the work of Korel et al. [22] and Xie [23] in terms of its coverage: we considered changes in transitions a...

show abstract