Abstract: Today’s software organizations have to operate in an environment which is highly networked. With this it has an increase concern not only for integrating various technologies but also for economic, environmental and social aspects. Environmental factors are considered to be very influential while performing requirement engineering (RE) process in global software development (GSD) paradigm. Our focus in this study is towards environmental aspects of RE in GSD paradigm where the teams are geographically distributed from each other. In specific we want to explore the environmental factors which may impact the software RE process in GSD paradigm. The information used for this identification is taken from the literature by performing systematic literature review (SLR). In order to have unique identification of each of the environmental factor, Grounded theory’s constant comparison and memoing steps are adopted. The initial list of environmental factors may leads to progressive enhancement f

• Publication Date: 05-May-2013
• DOI: 10.15224/978-981-07-6261-2-35
• Views: 0
• Downloads: 0

Abstract: Resource allocation for multiuser OFDM relay systems is investigated in this paper. The separate power limits for the base station and the relay station is considered. The resource fairness problems for each user are also presented, including the subcarrier fairness and the proportional end-to-end throughput fairness. This paper introduces a hierarchical scheme to combine the maximum end-to-end throughput and minimum transmit power. The set of the switching levels for the modulation types is applied in this paper. The simulated annealing algorithm is introduced. The methods of the neighborhood search is discussed and compared with two heuristic allocation algorithms. Owing to the characteristic of the relay system, unbalanced throughput among hop links happened. This paper proposed a suitable bit loading approach using water-filling method applied to load bits optimally for each user under the power constraint and the fairness constraints. Each user’s hop links are guaranteed to have t

• Publication Date: 05-May-2013
• DOI: 10.15224/978-981-07-6261-2-34
• Views: 0
• Downloads: 0