Browsing by Subject "Base stations"

Now showing 1 - 9 of 9

Open Access
Çok kullanıcılı çok antenli sistemlerde iş birlikli iletim
(IEEE, 2008-04) Yazarel, Y. K.; Aktaş, Defne
Bu çalışmada işbirlikli, çok kullanıcılı, ve çok antenli bir haberleşme sisteminde telsiz erişim terminallerinin en iyi veri iletimi tekniğine ortaklaşa karar vermeleri problemini inceliyoruz. Burada pek çok çalışmadan farklı olarak kullanıcıların bireysel başarım hedefleri ve anten başına iletim gücü kısıtlamaları olduğu durumu ele alıyoruz. Önceki bir çalışmamızda bu kısıtlamalar altında en iyi sonucu bulan döngülü bir algoritma sunmuştuk. Ancak bu algoritma merkezi bir yapıda olduğu için tam anlamıyla dağıtılmış şekilde gerçeklenememektedir. Bununla birlikte basit yaklaşıklıklar kullanarak en iyiye yakın bir başarım sağlayan ve kısıtlı ve yerel veri iletimi ile gerçeklenebilecek etkin bir algoritma öneriyoruz.
Open Access
Dikgen frekans bölmeli çoklu erişim sistemlerinde telsiz erişim terminallerinin işbirliği
(IEEE, 2009-04) Tokel, Turgut Barış; Aktaş, Defne
Gelecek nesil kablosuz iletişim sistemlerinde öngörülen veri hızlarına ulaşabilmek için bu sistemlerde frekans yeniden kullanım oranının 1 olmasına ihtiyaç¸ vardır, bu ise özellikle hücre sınırlarındaki kullanıcıların önemli ölçüde hücreler arası girişime maruz kalmalarına neden olur. Telsiz erişim terminalleri arasında işbirliği hücreler arası girişimin azaltılmasında önemli bir rol oynamaktadır. Bu bildiride çok hücreli, çok girdili çok çıktılı, dikgen frekans bölmeli çoklu erişim sistemlerinde telsiz erişim terminallerinden kullanıcılara işbirlikli veri iletimi problemini ele alıyoruz. Telsiz erişim terminallerinin aralarında kısıtlı ileti paylaşımı ile çizelgeleme ve veri iletimi yaptıkları etkin bir işbirlikli algoritma öneriyoruz.
Open Access
Downlink beamforming under individual SINR and per antenna power constraints
(IEEE, 2007-08) Yazarel, Y. K.; Aktaş, Defne
In this paper we consider the problem of finding the optimum beamforming vectors for the downlink of a multiuser system, where there are individual signal to interference plus noise ratio (SINR) targets for each user. Majority of the previous work on this problem assumed a total power constraint on the base stations. However, since each transmit antenna is limited by the amount of power it can transmit due to the limited linear region of the power amplifliers, a more realistic constraint is to place a limit on the per antenna power. In a recent work, Yu and Lan proposed an iterative algorithm for computing the optimum beamforming vectors minimizing the power margin over all antennas under individual SINR and per antenna power constraints. However, from a system designer point of view, it may be more desirable to minimize the total transmit power rather than minimizing the power margin, especially when the system is not symmetric. Reformulating the transmitter optimization problem to minimize the total transmit power subject to individual SINR constraints on the users and per antenna power constraints on the base stations, the algorithm proposed by Yu and Lan is modified. Performance of the modified algorithm is compared with existing methods for various cellular array scenarios. ©2007 IEEE.
Open Access
An energy efficient scatternet formation algorithm for Bluetooth-based sensor networks
(IEEE, 2005-02) Saginbekov, Sain; Körpeoğlu, İbrahim
In this paper, we propose an energy-efficient scatternet formation algorithm for Bluetooth based sensor networks. The algorithm is based on first computing a shortest path tree from the base station to all sensor nodes and then solving the degree constraint problem so that the degree of each node in the network is not greater than seven, which is a Bluetooth constaint. In this way, less amount of energy is spent in each round of communication in the sensor network. The algorithm also tries to balance the load evenly on the high-energy consuming nodes which are the nodes that are close to the base station. In this way, the lifetime of the first dying node is also prolonged. We obtained promising results in the simulations. © 2005 IEEE.
Open Access
Joint routing, gateway selection, scheduling and power management optimization in wireless mesh networks
(Institute of Industrial Engineers, 2012-05) Uzunlar Onur; Gökbayrak, Kağan; Yıldırım, E. A.
The third generation (3G) wireless communications technology delivers user traffic in a single step to the wired network via base station; therefore it requires all base stations to be connected to the wired network. On the other hand, in the fourth generation (4G) communication systems, it is planned to have the base stations set up so that they can deliver each other's traffic to a small number of base stations equipped with wired connections. In order to improve system resiliency against failures, a mesh structure is preferred. The most important issue in Wireless Mesh Networks (WMN) is that the signals that are simultaneously transmitted on the same frequency channel can interfere with each other to become incomprehensible at the receiver end. It is possible to operate the links at different times or at different frequencies, but this also lowers capacity usage. In this paper, we tackle the planning problems of WMN, using 802.16 (Wi-MAX) protocol, such as deploying a given number of gateway nodes along with operational problems such as routing, management of power used by nodes and scheduling while maximizing the minimum service level provided. In order to be able to apply our results to real systems, we work with optimization models based on realistic assumptions such as physical interference and single path routing. We propose heuristic methods to obtain optimal or near optimal solutions in reasonable time. The models are applied to some cities in Istanbul and Ankara provinces.
Open Access
A low-complexity transmission and scheduling scheme for wimax systems with base station cooperation
(SpringerOpen, 2010) Aktas, D.; Tokel, T. B.
This paper considers base station cooperation as an interference management technique for the downlink of a WiMAX network (IEEE 802.16 standard) with frequency reuse factor of 1. A low-complexity cooperative transmission and scheduling scheme is proposed that requires limited feedback from the users and limited information exchange between the base stations. The proposed scheme requires minor modifications to the legacy IEEE 802.16e systems. The performance of the proposed scheme is compared with noncooperative schemes with similar complexity through computer simulations. Results demonstrate that base station cooperation provides an attractive solution for mitigating the cochannel interference and increases the system spectral efficiency compared to traditional cellular architectures based on frequency reuse.
Open Access
On the analysis of expected distance between sensor nodes and the base station in randomly deployed WSNs
(Springer Verlag, 2014) Sevgi, C.; Ali, S.A.
In this study, we focus on the analytical derivation of the expected distance between all sensor nodes and the base station (i.e., E[dtoBS]) in a randomly deployed WSN. Although similar derivations appear in the related literature, to the best of our knowledge, our derivation, which assumes a particular scenario, has not been formulated before. In this specific scenario, the sensing field is a square-shaped region and the base station is located at some arbitrary distance to one of the edges of the square. Having the knowledge of E[dtoBS] value is important because E[dtoBS] provides a network designer with the opportunity to make a decision on whether it is energy-efficient to perform clustering for WSN applications that aim to pursue the clustered architectures. Similarly, a network designer might make use of this expected value during the process of deciding on the modes of communications (i.e., multi-hop or direct communication) after comparing it with the maximum transmission ranges of devices. Last but not least, the use of our derivation is not limited to WSN domain. It can be also exploited in any domain when there is a need for a probabilistic approach to find the average distance between any given number of points which are all assumed to be randomly and uniformly located in any square-shaped region and at a specific point outside this region. © Springer International Publishing Switzerland 2014.
Open Access
rtPS uplink scheduling algorithms for IEEE 802.16 networks
(Boğaziçi University, 2008-06) Ertürk, Mustafa Cenk; Akar, Nail
IEEE 802.16 MAC provides flexible bandwidth allocation and QoS mechanisms for users with different requirements. However, QoS scheduling is not specified by the 802.16 standard and is thus left open for vendors' implementation. In this paper, we propose an uplink scheduler to be used in WiMAX Base Station (BS) for rtPS type of connections. We propose that the base station maintains a leaky bucket for each rtPS connection to police and schedule rtPS traffic for uplink traffic management. The proposed scheduler is studied via simulations in MATLAB and throughput and fairness properties of the scheduler are demonstrated. Copyright ©2008 by Boǧaziçi University.
Open Access
Transmit beamforming with cooperative base stations
(IEEE, 2005-09) Ng, B. L.; Evans, J. S.; Hanly, S. V.; Aktaş, Defne
We consider a cellular network where base stations can cooperate to determine the signals to be transmitted on the downlink. In such a scenario, it would be possible to use "macroscopic" transmit beamforming to improve system performance. The downlink beamformer of interest is generalised from some transmit beamformers that have been shown to meet various optimality criteria in the literature. The particular down-link beamformer structure enables us to recast our downlink beamforming problem as a virtual LMMSE estimation problem. Based on this virtual set up, we exploit the structure of the channel and develop distributed beamforming algorithms using local message passing between neighbouring base stations. Two algorithms are outlined, both of which are based on the Kalman smoothing framework. The first algorithm is a forward-backward algorithm that produces optimal performance, but it has the disadvantage of a delay that grows linearly with array size. The second algorithm, which is a limited extent algorithm, solves the delay problem by using only local information.