Broadcast cancellation in search mechanisms

• Type: Article in International Conference Proceedings Book
• Date: 2013

Authors

Lima, R (Author) Other; Baquero, C (Author) Other; Miranda, H (Author) Other

Conference proceedings International

Title: Proceedings of the ACM Symposium on Applied Computing

Pages: 548-553

28th Annual ACM Symposium on Applied Computing, SAC 2013

Coimbra, 18 March 2013 through 22 March 2013

Indexing

Scopus - 10 Citations

Other information

Authenticus ID: P-008-B0Y

DOI: 10.1145/2480362.2480467

Abstract (EN): Searching for resources over unstructured networks is usually supported by broadcast communication primitives. Ideally, the broadcast process should be cancelled as soon as possible after a successful discovery, to avoid flooding the entire network. However, cancelling an ongoing broadcast is challenging and may increase the number of exchanged messages. In this paper, we compare the cancellation mechanisms used by BERS and BERS* with new proposed cancellation approaches BCIR and BCIR*. The formulation of a simplified analytical model and the simulation results show that: i) it is possible to reduce the number of retransmitted messages, without increasing the latency observed in BERS*; and ii) BCIR is more energy efficient, which can contribute to extend the availability of mobile battery powered devices. Copyright 2013 ACM.

Language: English

Type (Professor's evaluation): Scientific