GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Mathematics  (1)
Material
Publisher
Language
Years
FID
  • Mathematics  (1)
  • 1
    Online Resource
    Online Resource
    Hindawi Limited ; 2013
    In:  Journal of Applied Mathematics Vol. 2013 ( 2013), p. 1-19
    In: Journal of Applied Mathematics, Hindawi Limited, Vol. 2013 ( 2013), p. 1-19
    Abstract: With the continued evolution of wireless communication technology, relaying is one of the features proposed for the 4G LTE Advanced (LTE-A) system. The aim of relaying is to enhance both coverage and capacity. The idea of relays is not new, but relaying is being considered to ensure that the optimum performance is achieved to enable the expectations or good quality of service (QoS) of the users to be met while still keeping capital expenditure (CAPEX) within the budgeted bounds of operators. In this paper, we try to stand for an operator to propose a solution that determines where and how many relays should be deployed in the planning stages to minimize the development cost. In the planning stages, we not only derive a multicast tree routing algorithm to both determine and fulfill the QoS requirements to enhance throughput, but we also utilize the Lagrangian relaxation (LR) method in conjunction with optimization-based heuristics and conduct computational experiments to evaluate the performance. Our contribution is utilizing the LR method to propose an optimal solution to minimize the CAPEX of operators to build up a relay network with more efficiency and effectiveness and the QoS can be guaranteed by service level agreement.
    Type of Medium: Online Resource
    ISSN: 1110-757X , 1687-0042
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2013
    detail.hit.zdb_id: 2578385-3
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...