Minimum Latency Gossiping in Radio Networks

—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and the objective is to distribute each node’s message to the entire network with minimum latency. We studied this problem in the unit-size message model and the unit disk graph model. The unit-size model means different messages cannot be combined as one message, and the unit disk graph model means a link exists between two nodes if and

• Type: Journal
• Year: 2010
• Where: TPDS
• Authors: Scott C.-H. Huang, Peng-Jun Wan, Hongwei Du, E. K. Park
• Keywords: Minimum Latency, Model, TPDS 2010, Unit Disk