S2U: An efficient algorithm for optimal integrated points placement in hybrid optical-wireless access networks
نویسندگان
چکیده
0140-3664/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.comcom.2011.02.005 ⇑ Corresponding author. Tel.: +1 312 567 3916x799 E-mail addresses: [email protected] (Y. Liu), zhou@iit (Y. Cheng). Integration of optical and wireless networks is considered as one of the promising technologies for next generation Internet access. In this paper, we consider the integrated points placement problem in the hybrid optical-wireless system for optimal resource utilization under the given constraints including hop count, cluster size, and relay load. While the optimization formulation is an NP-hard problem in general, we propose a polynomial-time heuristic algorithm – SU algorithm to obtain the near-optimal solution that minimizes the number of integrated points required to support all wireless BSs residing in the wireless part of the integrated system. In contrast to the existing work, our SU algorithm forms the clusters starting from the network edge towards its center and the construction of clusters is not only based on the greedy idea but also considers load balancing. We present a theoretical analysis of the complexity of the proposed SU algorithm and its approximation ratio to the optimal solution. Furthermore, we present extensive numerical results to compare the proposed SU algorithm with the main existing methods. It is shown that SU can not only cover a network with a smaller number of integrated points, but also achieve better network performance in terms of the average transmission delay (average hop count) and load balance. In addition, we compare our results with the optimal solution obtained via CPLEX in terms of the minimum number of integrated points. The results show that the gap between the results obtained from our SU algorithm and the optimal results is within 5% in average. 2011 Elsevier B.V. All rights reserved.
منابع مشابه
A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks
Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...
متن کاملHYREP: A Hybrid Low-Power Protocol for Wireless Sensor Networks
In this paper, a new hybrid routing protocol is presented for low power Wireless Sensor Networks (WSNs). The new system uses an integrated piezoelectric energy harvester to increase the network lifetime. Power dissipation is one of the most important factors affecting lifetime of a WSN. An innovative cluster head selection technique using Cuckoo optimization algorithm has been used in the desig...
متن کاملDesign of physical topology and placement of equipment in a hybrid optical-wireless access network
Due to the emergence of numerous bandwidth-hungry applications, we are motivated to investigate cheaper and faster Internet access solutions to serve in a neighborhood. We concentrate on the convergence of optical and wireless networks for the deployment of Internet access networks so that we can exploit the opportunities of both technologies. We focus on network dimensioning and placement of e...
متن کاملHybrid Bio-Inspired Clustering Algorithm for Energy Efficient Wireless Sensor Networks
In order to achieve the sensing, communication and processing tasks of Wireless Sensor Networks, an energy-efficient routing protocol is required to manage the dissipated energy of the network and to minimalize the traffic and the overhead during the data transmission stages. Clustering is the most common technique to balance energy consumption amongst all sensor nodes throughout the network. I...
متن کاملMathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks
In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 34 شماره
صفحات -
تاریخ انتشار 2011