Paper Info
Title
Minimum power broadcast trees for wireless networks: optimizing using the viability lemma
Abstract
Wireless multicast/broadcast sessions, unlike wired networks, inherently reach several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. An algorithm for constructing the minimum power tree in wireless networks was first proposed by Wieselthier et al. (2000). The broadcast incremental power (BIP) algorithm suggested by them is a "node-based" minimum-cost tree algorithm for wireless networks. We propose an alternate search based paradigm wherein minimum-cost trees in wireless networks are found through a search process. Two computationally efficient procedures for checking the feasibility (viability) of a solution in the search space are presented. A straightforward procedure for initializing the search using stochastically generated trees is also proposed.
Year
DOI
Venue
2002
10.1109/ISCAS.2002.1009830
Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium  
Keywords
Field
DocType
broadcast channels,minimisation,mobile radio,packet radio networks,stochastic processes,tree searching,minimum power broadcast trees,minimum-cost trees,omnidirectional wireless broadcast,search initialization,stochastically generated trees,viability lemma,wireless networks
Broadcasting,Mobile radio,Key distribution in wireless sensor networks,Omnidirectional antenna,Wireless network,Atomic broadcast,Computer science,Computer network,Minimisation (psychology),Broadcast radiation,Distributed computing
Conference
Volume
Citations 
PageRank 
1
24
2.21
References 
Authors
3
7
Name
Order
Citations
PageRank
Robert J. Marks II127462.56
Arindam Kumar Das2575.43
Mohamed A. El-sharkawi339146.23
Payman Arabshahi4829.64
Andrew Gray5555.32
Marks, R.J.6242.21
El-Sharkawi, M.7292.71