Distributed Broadcast in Wireless Networks with Unknown Topology

作者: Andrea E. F. Clementi , Riccardo Silvestri , Angelo Monti

DOI:

关键词:

摘要: A multi-hop synchronous wirelss network is said to be unknown if the nodes have no knowledge of topology. basic task in wireless that broadcasting a message (created by fixed source node) all network. Typical operations real-life networks multi-broadcast consists performing set r independent broadcasts. The study broadcast on started seminal paper Bar-Yehuda et al [BGI87] and has been subject several recent works. In this paper, we completion termination time distributed protocols for both (single) as functions number n, maximum eccentricity D, in-degree �, congestion c networks. We establish new connections between these some combinatorial concepts, such selective families, strongly-selective families (also known superimposed codes), pairwise r-different families. Such connections, combined with lower upper bounds size above allow us derive operations. particular, our are almost tight improve exponentially over previous

参考文章(35)
A.G. Dyachkov, V.V. Rykov, A survey of superimposed code theory Problems of Control and Information Theory. ,vol. 12, pp. 229- 242 ,(1983)
D. Krizanc, A. Pelc, E. Kranakis, Fault-tolerant broadcasting in radio networks Lecture Notes in Computer Science. pp. 283- 294 ,(1998)
Allen Pahlavan, K, and Levesque, Wireless Information Networks ,(1995)
S. S. Iyengar, C. Xavier, Introduction to Parallel Algorithms ,(1998)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks symposium on discrete algorithms. pp. 709- 718 ,(2001) , 10.5555/365411.365756
W. Kautz, R. Singleton, Nonrandom binary superimposed codes IEEE Transactions on Information Theory. ,vol. 10, pp. 363- 377 ,(1964) , 10.1109/TIT.1964.1053689
Lawrence G. Roberts, ALOHA packet system with and without slots and capture ACM SIGCOMM Computer Communication Review. ,vol. 5, pp. 28- 42 ,(1975) , 10.1145/1024916.1024920
Uzi Vishkin, Deterministic sampling: a new technique for fast pattern matching SIAM Journal on Computing. ,vol. 20, pp. 22- 40 ,(1991) , 10.1137/0220002
Shiva Chaudhuri, Jaikumar Radhakrishnan, Deterministic restrictions in circuit complexity symposium on the theory of computing. pp. 30- 36 ,(1996) , 10.1145/237814.237824
William B. Frakes, Ricardo Baeza-Yates, Information Retrieval: Data Structures and Algorithms ,(1992)