Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer A
DOI: 10.1109/infcom.2000.832232
|View full text |Cite
|
Sign up to set email alerts
|

On the construction of energy-efficient broadcast and multicast trees in wireless networks

Abstract: -The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. After addressing the characteristics of wireless networks that distinguish them from wired networks, we introduce and evaluate algorithms for tree construction in infrastructureless, all-wireless applications. The performance metric used to evaluate broadcast and multicast trees is energyefficiency. We develop the Broadcast Incremental Power Algorithm, and adapt it to multicast operation … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
1,098
0
30

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 877 publications
(1,131 citation statements)
references
References 9 publications
3
1,098
0
30
Order By: Relevance
“…We first compare the energy consumption of PNC with Non-NC. We use an energy consumption model of E = d 4 [27], where d is the transmission range. The field will generate events which are of interest in an hourly basis and the sensors will record these events.…”
Section: B Comparison Of Energy Consumptionmentioning
confidence: 99%
“…We first compare the energy consumption of PNC with Non-NC. We use an energy consumption model of E = d 4 [27], where d is the transmission range. The field will generate events which are of interest in an hourly basis and the sensors will record these events.…”
Section: B Comparison Of Energy Consumptionmentioning
confidence: 99%
“…MAC broadcast messages are used to minimize transmissions for data to multiple children, and overheard data packets provide free acknowledgements using the "wireless broadcast advantage" ( [14]) to parent nodes, with onyl leaf nodes sending an explicit acknowledgement. Link weight is expected transmissions to the root node, calculated from collected link-quality data.…”
Section: Minimum Spanning Tree Algorithmmentioning
confidence: 99%
“…Broadcast oriented protocols achieve the objective but considers the broadcast process from a given source node. For example, the well-known centralized algorithm is a greedy heuristics called BIP [5] (Broadcast Incremental Power). It is a variant of the Prim's algorithm that takes advantage of the broadcast nature of wireless transmissions.…”
Section: Related Workmentioning
confidence: 99%