Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 9 of 9.

Add to Quick Collection   All 9 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/359479
Description: Highly dynamic networks rarely offer end-to-end connectivity at a given time. Yet, connectivity in these networks can be established over time and space, based on temporal analogues of multi-hop paths ... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/319169
Description: Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. Yet, connectivity can be achieved over time and space, leading to evaluate a g ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/221569
Description: We study the computability and complexity of the exploration problem in a class of highly dynamic networks: carrier graphs, where the edges between sites exist only at some (unknown) times defined by ... More
Reviewed: Reviewed
Date: 2011
Subject Keyword: 080500 Distributed Computing
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/159635
Description: Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. In most cases, however, a form of connectivity can be established over time an ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/322833
Description: Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be available between a ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148105
Description: In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchronously. In particular ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/147984
Description: We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unknown) times defined b ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148597
Description: 12 page(s)
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/9323
Description: Sense of direction is a property of labeled graphs which has been shown to have a definite impact on computability and complexity in systems of communicating entities, and whose applicability ranges f ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last