Research Article

A Relation Routing Scheme for Distributed Semantic Media Query

Table 1

Packet structures.
(a) Relation query packet

Name Query name in the form of name_r constraints
Selector Order preference, publisher filter
Scope Response quantity, timeout, and so forth
Nonce Time stamp or sequence number to avoid routing loops

(b) Relation response packet

Name Same as in the relation query packet
Publisher ID Identification of the publisher for this relational data
Validation Key Information needed to verify the validity of relational data.
Data A sequence of relational data results