Distributed Broadcast Scheduling in Mobile Ad Hoc Networks with Unknown Topologies

Tan, Guang; Jarvis, Stephen A.; Xue, James; Hammond, Simon David

doi:10.1109/ipdps.2007.370591

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the centralized network setting [27], we assume that each node has full knowledge about the topology of the network, including size, distance, and the ids of all nodes. In the distributed network settings [60,16,22], we assume that each node has only partial information about the network; for example, the number of neighbors it has or the total number of nodes.…”

Section: Introductionmentioning

confidence: 99%

Message and time efficient multi-broadcast schemes

Levin

Kowalski

Segal

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages

show abstract