Constrained Node Placement and Assignment in Mobile Backbone Networks

Emily M. Craparo ()
Additional contact information
Emily M. Craparo: Naval Postgraduate School

A chapter in Sensors: Theory, Algorithms, and Applications, 2012, pp 19-35 from Springer

Abstract: Abstract This chapter describes new algorithms for mobile backbone network optimization. In this hierarchical communication framework, mobile backbone nodes (MBNs) are deployed to provide communication support for regular nodes (RNs). While previous work has assumed that MBNs are unconstrained in position, this work models constraints in MBN location. This chapter develops an exact technique for maximizing the number of RNs that achieve a threshold throughput level, as well as a polynomial-time approximation algorithm for this problem. We show that the approximation algorithm carries a performance guarantee of $$\frac{1} {2}$$ and demonstrated that this guarantee is tight in some problem instances.

Keywords: Mobile Backbone Network; Providing Community Support; Submodular Maximization; Theoretical Performance Guarantees; Network Design Problem (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spochp:978-0-387-88619-0_2

Ordering information: This item can be ordered from
http://www.springer.com/9780387886190

DOI: 10.1007/978-0-387-88619-0_2

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().