Algorithmic Aspects of Wireless Networks
- PDF / 55,400 Bytes
- 3 Pages / 600.05 x 792 pts Page_size
- 42 Downloads / 204 Views
Editorial Algorithmic Aspects of Wireless Networks Xiuzhen Cheng,1 Wei Li,2 and Taieb Znati3 1 Department
of Computer Science, The George Washington University, Washington, DC 20052, USA of Electrical Engineering and Computer Science, The University of Toledo, Toledo, OH 43606, USA 3 Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA 2 Department
Received 2 May 2007; Accepted 2 May 2007 Copyright © 2007 Xiuzhen Cheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Recent advances in electronic and computer technologies have paved the way for the proliferation of ubiquitous wireless networks. Fast deployment of these communication networks for the users is preferred under many situations. Topics that are related to ad hoc and sensor networking, mobile computing, and wireless and mobile security have been extensively studied recently. Potential applications of these networks include search and rescue, smart homes, battlefield surveillance, environment monitoring and control, and so forth. In response to the above demand for wireless networks, this special issue aims at providing a timely and concise reference of the current activities and findings in the relevant technical fields, as well focuses on the state-of-the-art and up-to-date efforts in the algorithmic aspects of wireless networks include location management, topology control and coverage, security and privacy, scalable design, cross-layer design, resource optimization, QoS, to just name a few. We believe that almost all papers included in this special issue not only provide novel ideas, new analytical models, simulation and experimental results, and handful experience in this field, but also simulate the future research activities in the area of the quality of service for mobile ad hoc networks. A brief summary of each paper is listed as follows. The first paper, by M. Shabany et al., proposes a novel framework to model downlink resource allocation problem in multiservice direct sequence code division multiple access (DS-CDMA) cellular networks. This framework is based on a defined utility function, which leads to utilizing the network resources in a more efficient way. This utility function quantifies the degree of utilization of resources. As a matter of fact, using the defined utility function, users’ channel fluctuations and their delay constraints along with the load conditions of all BSs are all taken into consideration. Unlike previous works, the authors solve the problem with the
general objective of maximizing the total network utility instead of maximizing the achieved utility of each base-station (BS). It is shown that this problem is equivalent to finding the optimum BS assignment throughout the network, which is mapped to a multidimensional multiple-choice Knapsack problem (MMKP). Since MMKP is NP-hard, a polynomialtime suboptimal algorithm
Data Loading...
