Article ID Journal Published Year Pages File Type
1142968 Operations Research Letters 2009 5 Pages PDF
Abstract
Local search methods are often used to reduce the power consumption of broadcast routing in wireless networks. For a classic method, sweep, the best available time complexity result is O(|V|4). We present an O(|V|2)-time method, which exhaustively removes unnecessary transmissions yielding a solution comparable to that of sweep.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A fast local search method for minimum energy broadcast in wireless ad hoc networks
Authors
, , ,