论文信息 - Asymptotically optimal Gossiping in Radio Networks

Asymptotically optimal Gossiping in Radio Networks

Abstract We study the problem of gossiping in a system where n nodes are placed on a line of length Ln independently uniformly distributed. We assume that every node is equipped with a transmitter whose radius of transmission is 1. We further assume that simultaneous transmissions by neighboring nodes results in garbled messages. We present an algorithm for gossiping and show that it works in asymptotically optimal time. We assume that the system is synchronous and time is slotted and that nodes transmit only during a slot.

Suresh Singh | Krishnamurthi Ravishankar

[1] Dimitri P. Bertsekas,et al. Data Networks , 1986 .

[2] Douglas B. West. A class of solutions to the gossip problem, part III , 1982, Discret. Math..

[3] E. J. COCKAYNE,et al. Information Dissemination in Trees , 1981, SIAM J. Comput..

[4] Leonard Kleinrock,et al. Throughput - Delay Characteristics of Some Slotted-ALOHA Multihop Packet Radio Networks , 1985, IEEE Transactions on Communications.

[5] Toby Berger,et al. Delay analysis of interval-searching contention resolution algorithms , 1985, IEEE Trans. Inf. Theory.

[6] Douglas B. West. A class of solutions to the gossip problem, part I , 1982, Discret. Math..

[7] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[8] Ákos Seress. Quick gossiping without duplicate transmissions , 1986, Graphs Comb..

[9] Daniel J. Kleitman,et al. Further gossip problems , 1980, Discret. Math..

[10] Suresh Singh,et al. Broadcasting on [0, L] , 1994, Discret. Appl. Math..

[11] K. Ravishankar,et al. Central Limit Theorem for Time to Broadcast in Radio Networks , 1995, Probability in the Engineering and Informational Sciences.

[12] M. Sridhar,et al. Gossiping on interval graphs , 1993 .

[13] D. West. GOSSIPING WITHOUT DUPLICATE TRANSMISSIONS , 1982 .