Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Yan Yan Kai Niu Ping Gong Zhiqiang He |
| Copyright Year | 2013 |
| Description | Author affiliation: Key Lab. of Universal Wireless Commun., Minist. of Educ., Beijing Univ. of Posts & Telecommun., Beijing, China (Yan Yan; Kai Niu; Ping Gong; Zhiqiang He) |
| Abstract | With continuous growth of the wireless cellular networks, the network operators take the energy-efficiency into their consideration as a major design goal lately. It also receives a growing number of attentions from engineers and researchers, due to the increasing awareness of environmental and economic issues. In this paper, we develop a theoretical framework for base station (BS) energy saving that encompasses cell clustering and dynamic BS sleeping operation. The combination of these two aspects allows for a more flexible and accessible tradeoff between cellular networks performance and energy consumption. Our clustering strategy based on the geographic information and traffic load is able to degrade the overall scale of this problem. Moreover, the BS sleeping policy could be found quickly by the dynamic programming (DP) algorithm with a state-reduced solution space based on the distances between BSs and the utilizations of BSs. Specifically, we minimize the total cost of the whole network as much as possible with a low complexity of the algorithm and little additional signaling, thus our policy is easy to implement in practice. The simulation results under practical configurations demonstrate that the proposed dynamic algorithms can effectively reduce energy consumption at a low complexity. |
| Sponsorship | IEEE Beijing Sect. |
| Starting Page | 119 |
| Ending Page | 125 |
| File Size | 162744 |
| Page Count | 7 |
| File Format | |
| ISBN | 9781467360777 |
| e-ISBN | 9781467360791 |
| DOI | 10.1109/MAPE.2013.6689966 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2013-10-29 |
| Publisher Place | China |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Energy consumption Heuristic algorithms Merging Dynamic Programming Clustering algorithms Cell Clustering Telecommunication traffic Base-Station Sleeping Policy State Merging Dynamic programming Complexity theory |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|