Facilitating match-making service in ad hoc and sensor networks using pseudo quorum

@inproceedings{Aydin2002FacilitatingMS,
  title={Facilitating match-making service in ad hoc and sensor networks using pseudo quorum},
  author={Ilknur Aydin and Chien-Chung Shen},
  booktitle={ICCCN},
  year={2002}
}
In a match-making system, sources (producers) advertise generated data without any particular destination in mind. Destinations (consumers) are determined based on their interests (via subscriptions) in receiving the produced data. Advertisements and subscriptions are matched by the underlying network routing system. We propose to facilitate match-making capability in ad hoc and sensor networks by adapting the idea of quorum system. A quorum system is formed by organizing nodes into subsets… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 74 citations. REVIEW CITATIONS
44 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

74 Citations

051015'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Distributed Operating Systems & Algorithms

  • R. Chow, T. Johnson
  • Addison Wesley
  • 1997

Vitnyi, “Distributed Match-Making for Processes in Computer Networks,

  • P. S. Mullender
  • Proceedings 4th ACM Principles of Distributed…
  • 1985

Similar Papers

Loading similar papers…