Abstract
In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminate information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them. This allows the sensors to efficiently distribute data given a limited energy supply. We simulate and analyze the performance of four specific SPIN protocols: SPIN-PP and SPIN-EC, which are optimized for a point-to-point network, and SPIN-BC and SPIN-RL, which are optimized for a broadcast network. Comparing the SPIN protocols to other possible approaches, we find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches in a point-to-point network and 80% more data for a given amount of energy in a broadcast network. We also find that, in terms of dissemination rate and energy usage, the SPIN protocols perform close to the theoretical optimum in both point-to-point and broadcast networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Agrawal, A. Abbadi and R. Steinke, Epidemic algorithms in replicated databases, in: Proc. 16th ACM Principles of Database Systems (May 1997).
C. Bormann, Network news transport protocol, Internet Draft, IETF (work in progress) (November 1998).
J. Broch, D. Maltz, D. Johnson, Y. Hu and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc netowrk routing protocols, in: Proc. 4th ACM International Conference on Mobile Computing and Networking (Mobicom'98) (October 1998).
D. Clark and D. Tennenhouse, Architectural consideration for a new generation of protocols, in: Proc. ACM SIGCOMM (September 1990).
S. Deering and D. Cheriton, Multicast routing in datagram internet-works and extended LANs, ACM Transactions on Computer Systems 8(2) (May 1990).
A. Demers, D. Greene, C. Hauser, W. Irish and J. Larson, Epidemic algorithms for replicated database maintenance, in: ACM Principles of Distributed Computing (August 1987).
D.R. Engler, M.F. Kaashoek and J. O'Toole, Jr., Exokernel: An operating system architecture for application-level resource management, in: Proc. of the 15th ACM Symposium on Operating Systems Principles (December 1995).
M. Harchol-Balter, T. Leighton and D. Lewin, Resource discovery in distributed networks, in: ACM Symposium on Principles of Distributed Computing (May 1999).
S. Hedetniemi, S. Hedetniemi and A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988).
C. Huitema, Routing in the Internet (Prentice Hall, 1996).
D. Johnson, Routing in ad hoc networks of mobile hosts, in: Proc. IEEE Workshop on Mobile Computing Systems and Applications (December 1994).
P. Karn, Spectral efficiency considerations for packet radio, in: ARRL 10th Computer Networking Conf. (1991).
T. Meng and R. Volkan, Distributed network protocols for wireless communication, in: Proc. IEEEE ISCAS (May 1998).
Monarch extensions to the ns-2 network simulator (1999) http://www.monarch.cs.cmu.edu/cmu-ns.html
J. Moy, OSPF Version 2, RFC 1583 (1991).
ns-2 network simulator (1998) http://www-mash.cs. berkeley.edu/ns/
K. Pahlavan and A. Levesque, Wireless Information Networks (Wiley, 1995).
V. Park and S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proc. INFOCOM'97 (April 1997).
A. Pelc, Fault-tolerant broadcasting and gossiping in communication, Networks 28(3) (October 1996).
C. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, in: Proc. SIGCOMM'94 Conference on Communications Architectures, Protocols and Applications (August 1994).
S. Raman and S. McCanne, Scalable data naming for application level framing in reliable multicast, in: Proc. ACM Multimedia (September 1998).
Reliable Multicast Research Group (1998) http://www.east. isi.edu/RMRG/
T. Shepard, A channel access scheme for large dense packet radio networks, in: Proc. ACM SIGCOMM (August 1998).
P. Sinha, R. Sivakumar and V. Bharghavan, CEDAR: A core-extraction distributed ad hoc routing algorithm, in: Proc. IEEE INFOCOM (March 1999).
M. Steenstrup, Routing in Communication Networks (Prentice Hall, 1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kulik, J., Heinzelman, W. & Balakrishnan, H. Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks. Wireless Networks 8, 169–185 (2002). https://doi.org/10.1023/A:1013715909417
Issue Date:
DOI: https://doi.org/10.1023/A:1013715909417