Min-energy broadcast in mobile ad hoc networks with restricted motion

J. M. Díaz-Báñez (), R. Fabila-Monroy (), D. Flores-Peñaloza (), M. A. Heredia () and J. Urrutia ()
Additional contact information
J. M. Díaz-Báñez: Universidad de Sevilla
R. Fabila-Monroy: Centro de Investig. y de Estudios Avanzados del Instituto Politéc. Nacional
D. Flores-Peñaloza: Universidad Nacional Autónoma de México
M. A. Heredia: Universidad Nacional Autónoma de México
J. Urrutia: Universidad Nacional Autónoma de México

Journal of Combinatorial Optimization, 2012, vol. 24, issue 4, No 2, 413-426

Abstract: Abstract This paper concerns about energy-efficient broadcasts in mobile ad hoc networks, yet in a model where each station moves on the plane with uniform rectilinear motion. Such restriction is imposed to discern which issues arise from the introduction of movement in the wireless ad hoc networks. Given a transmission range assignment for a set of n stations S, we provide an polynomial O(n 2)-time algorithm to decide whether a broadcast operation from a source station could be performed or not. Additionally, we study the problem of computing a transmission range assignment for S that minimizes the energy required in a broadcast operation. An O(n 3log n)-time algorithm for this problem is presented, under the assumption that all stations have equally sized transmission ranges. However, we prove that the general version of such problem is NP-hard and not approximable within a (1−o(1))ln n factor (unless NP⊂DTIME(n O(log log n))). We then propose a polynomial time approximation algorithm for a restricted version of that problem.

Keywords: Mobile ad hoc networks; Restricted motion; Power assignment; Optimization algorithms (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9397-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:24:y:2012:i:4:d:10.1007_s10878-011-9397-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9397-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().