2001
DOI: 10.1109/98.944002
|View full text |Cite
|
Sign up to set email alerts
|

Service discovery in DEAPspace

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
61
0
2

Year Published

2007
2007
2015
2015

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 159 publications
(63 citation statements)
references
References 6 publications
0
61
0
2
Order By: Relevance
“…In the purely distributed method, participating nodes in the network stores store the registry locally and distributed querying service spans these registries to compile and present the required information to the user. The drawback of this method is the communication overhead involved in establishing a contact between peers and same is surmounted by adopting multicasting solution instead of broadcasting, [52]. Considering the scalability issues in multicasting domain [43], the solution in terms of minimizing the number of search hops is proposed [44] and the performance selective forwarding [44,45,46] in which the peers that are not able to solve the service discovery query uses the previous knowledge to forward the query to the correct peers.…”
Section: Service Discovery Issuesmentioning
confidence: 99%
“…In the purely distributed method, participating nodes in the network stores store the registry locally and distributed querying service spans these registries to compile and present the required information to the user. The drawback of this method is the communication overhead involved in establishing a contact between peers and same is surmounted by adopting multicasting solution instead of broadcasting, [52]. Considering the scalability issues in multicasting domain [43], the solution in terms of minimizing the number of search hops is proposed [44] and the performance selective forwarding [44,45,46] in which the peers that are not able to solve the service discovery query uses the previous knowledge to forward the query to the correct peers.…”
Section: Service Discovery Issuesmentioning
confidence: 99%
“…The Service Location Protocol (SLP) focuses on the protocol for automatic discovery [10], Czerwinski et al focus on expressiveness and security [8], and Castro et al deals with inter-domain service discovery [3]. DeapSpace [15] and Heidemann et al [11] propose approaches for discovery in ad-hoc sensor networks. None of these systems, however, has explicit support for context-sensitive names or subscriptions.…”
Section: Related Workmentioning
confidence: 99%
“…It uses unicast and broadcast as the communication mechanism and does not provide any service invocation mechanism. DEAPspace [43] proposed by IBM research, is aimed for single-hop ad hoc environments. Nodes cache service information and periodically broadcast it to share the information with each other.…”
Section: Related Workmentioning
confidence: 99%
“…IP is clearly insufficient; delay tolerant networking solutions [28], store-and-forward mechanisms, and opportunistic routing algorithms [34] are needed. Since the network is not pre-configured, protocols are needed for resource and service discovery [14,43,16,4]. For this to happen, new naming conventions are needed to uniquely identify resources and services, as IP addresses do not scale well to highly dynamic scenarios.…”
Section: Challenges and Requirementsmentioning
confidence: 99%