Abstract
We consider the problem of data dissemination in a broad- cast network. In contrast to previously studied models, broadcasting is among peers, rather than client server. Such a model represents, for example, satellite communication among widely distributed nodes, sensor networks, and mobile ad-hoc networks. We introduce a cost model for data dissemination in peer to peer broadcast networks. The model quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost may be given in terms of dollars, energy, or bandwidth. Using the model we first determine the parameters for which eager (i.e. consistent) replication has a lower cost than lazy (i.e. inconsistent) replication. Then we introduce a lazy broadcast policy and compare it with several naive or traditional approaches to solving the problem.
This research was supported in part by Army Research Labs grant DAAL01-96-2- 0003, DARPA grant N66001-97-2-8901, NSF grants CCR-9816633, CCR-9803974, IRI-9712967, EIA-0000516, and INT-9812325.
A Mobile Ad-hoc Network (MANET) is a system of mobile computers (or nodes) equipped with wireless broadcast transmitters and receivers which are used for com- municating within the system. Such networks provide an attractive and inexpensive alternative to the cellular infrastructures when this infrastructure is unavailable (e.g. in remote and disaster areas), or inefficient, or too expensive to use. Mobile Ad-hoc Networks are used to communicate among the nodes of a military unit, in rescue and disaster relief operations, in collaborative mobile data exchange (e.g the set of attendees at a conference), and other “micronetworking” technologies ([14]).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alonso, D. Barbara, and H. Garcia-Molina, Data Caching Issues in an Information Retrieval System, ACM Transactions on Database Systems, Vol. 15, No. 3, Sept. 1990.
R. Ladin, B. Liskov, S. Ghemawat, Providing High Availability Using Lazy Replication, ACM Transactions on Computer Systems, Vol. 10, No. 4, November 1992.
K. Birman, A. Schiper, P. Stephenson, Lightweight Causal and Atomic Group Multicast, ACM Transactions on Computer Systems, Vol. 9, No. 3, August 1991.
K. Birman, T. A. Joseph, Reliable Communication in the Presence of Failures,ACM Transactions on Computer Systems, Vol. 5, No. 1, Feb. 1987.
L. G. Brown, A Survey of Image Registration Techniques, ACM Computing Surveys, 24(4):325–376, December 1992.
J. P. Macker and M. S. Corson, Mobile Ad Hoc Networking and the IETF, Mobile Computing and Communications Review, Vol. 2, No. 1, January 1998.
C. Olston, J. Widom, Offering a precision-performance tradeoff for aggregation queries over replicated data, http://www-db.stanford.edu/pub/papers/trapp-ag.ps.
A. Schiper, J. Eggli, and A. Sandoz, A new algorithm to implement causal ordering,in the Proceedings of the 3rd International Workshop on Distributed Algorithms, Lecture Notes on Computer Science392, Springer-Verlag, New York, 1989.
E. Pagani and G. P. Rossi, Reliable Broadcast in Mobile Multihop Packet Networks, Proc. ACM MOBICOM’97, pp. 34–42, Budapest, Hungary, 1997.
J. Gray, P. Helland, P. O’Neil, D. Shasha, The dangers of replication and a solution, Proc. ACM SIGMOD 96, pp. 173–182, Montreal, Canada, 1996.
S. Jiang, N. H. Vaidya, Scheduling data broadcast to “impatient” users, Proceedings of ACM International Workshop on Data Engineering for Wireless and Mobile Access, Seattle, Washington, August 1999.
J. M. Kahn, R. H. Katz and K. S. J. Pister, Next century challenges: mobile networking for “Smart Dust”, Proceedings of the fifth ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM99), Seattle, WA, August, 1999.
O. Wolfson, B. Xu, S. Chamberlain, L. Jiang, Moving Objects Databases: Issues and Solutions, Proceedings of the 10th International Conference on Scientific and Statistical Database Management (SSDBM98), Capri, Italy, July 1-3, 1998, pp. 111–122.
F. Bennett, D. Clarke, J. Evans, A. Hopper, A. Jones, and D. Leask, Piconet: Embedded Mobile Networking, IEEE Personal Communications, 4(5), October 1997.
M. D. Schroeder, A. D. Birrell, R. M. Needham, Experience with Grapevine: the growth of a distributed system, ACM Transactions on Computer Systems, vol. 2, No. 1, pp. 3–23, Feb. 1984.
R. Golding, A weak-consistency architecture for distributed information services, Computing Systems, vol. 5, No. 4, 1992. Usenix Association.
S. Chamberlain, Model-Based Battle Command: A Paradigm Whose Time Has Come, 1995 Symposium on C2 Research & Technology, NDU, June 1995
A. S. Tanenbaum, Computer networks, Prentice Hall, 1996.
S. Acharya, M. Franklin, S. Zdonik, Balancing push and pull for data broadcast, Proc. ACM SIGMOD 97, pp. 183–194, Tucson, Arizona, 1997.
S. Acharya, M. Franklin, and S. Zdonik, Prefetching from a broadcast disk, in 12th International Conference on Data Engineering, Feb. 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, B., Wolfson, O., Chamberlain, S. (2001). Cost Based Data Dissemination in Broadcast Networks. In: Van den Bussche, J., Vianu, V. (eds) Database Theory — ICDT 2001. ICDT 2001. Lecture Notes in Computer Science, vol 1973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44503-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-44503-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41456-8
Online ISBN: 978-3-540-44503-6
eBook Packages: Springer Book Archive