Disseminating data using broadcast when topology is unknown

Consider the problem of disseminating data from an arbitrary source node to all other nodes in a distributed computer system, like Wireless Sensor Networks (WSNs). We assume that wireless broadcast is used and nodes do not know the topology. We propose new protocols which disseminate data faster and use fewer broadcasts than the simple broadcast protocol. Disseminating Data Using Broadcast when Topology is Unknown Bjorn Andersson, Nuno Pereira and Eduardo Tovar IPP Hurray Research Group Polytechnic Institute of Porto, Portugal {bandersson,npereira,emt}@dei.isep.ipp.pt Abstract Consider the problem of disseminating data from an arbitrary source node to all other nodes in a distributed computer system, like Wireless Sensor Networks (WSNs). We assume that wireless broadcast is used and nodes do not know the topology. We propose new protocols which disseminate data faster and use fewer broadcasts than the simple broadcast protocol.Consider the problem of disseminating data from an arbitrary source node to all other nodes in a distributed computer system, like Wireless Sensor Networks (WSNs). We assume that wireless broadcast is used and nodes do not know the topology. We propose new protocols which disseminate data faster and use fewer broadcasts than the simple broadcast protocol.

[1]  Andrey V. Savkin,et al.  Node Localization Using Mobile Robots in Delay-Tolerant Sensor Networks , 2005, IEEE Trans. Mob. Comput..

[2]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[3]  Gang Zhou,et al.  Impact of radio irregularity on wireless sensor networks , 2004, MobiSys '04.

[4]  Chenyang Lu,et al.  Spatiotemporal multicast in sensor networks , 2003, SenSys '03.

[5]  Young-Bae Ko,et al.  A New Directional Flooding Protocol for Wireless Sensor Networks , 2004, ICOIN.

[6]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[7]  J. Lipman,et al.  Reliable optimised flooding in ad hoc networks , 2004, Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710).

[8]  Yehuda Afek,et al.  Time and message bounds for election in synchronous and asynchronous complete networks , 1985, PODC '85.

[9]  Arjan Durresi,et al.  Optimal Flooding Protocol for Routing in Ad- hoc Networks , 2002 .

[10]  Deborah Estrin,et al.  Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks , 2002 .

[11]  Tracy Camp,et al.  A Review of Geocasting Protocols for a Mobile Ad Hoc Network , 2002 .

[12]  Jason Liu,et al.  Experimental evaluation of wireless simulation assumptions , 2004, MSWiM '04.

[13]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

[14]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[15]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[16]  Sang Hyuk Son,et al.  USENIX Association Proceedings of MobiSys 2003 : The First International Conference on Mobile Systems , Applications , and Services , 2003 .

[17]  Gene Tsudik,et al.  Flooding for reliable multicast in multi-hop ad hoc networks , 1999, DIALM '99.

[18]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[19]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[20]  Björn Andersson,et al.  Static-Priority Scheduling of Sporadic Messages on a Wireless Channel , 2005, OPODIS.