Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library | 
|---|---|
| Author | Tae-Suk Kim Yong Yang Hou, J.C. Krishnamurthy, S.V. | 
| Copyright Year | 2002 | 
| Abstract | Many next generation applications (such as video flows) are likely to have associated minimum data rate requirements in order to ensure satisfactory quality as perceived by end-users. In this paper, we develop a framework to address the problem of maximizing the aggregate utility of traffic flows in a multi-hop wireless network, with constraints imposed both due to self-interference and minimum rate requirements. The parameters that are tuned in order to maximize the utility are (i) transmission powers of individual nodes and (ii) the channels assigned to the different communication links. Our framework is based on using a cross-decomposition technique that takes both inter-flow interference and self-interference into account. The output of our framework is a schedule that dictates what links are to be activated in each slot and the parameters associated with each of those links. If the minimum rate constraint cannot be satisfied for all of the flows, the framework intelligently rejects a sub-set of the flows and recomputes a schedule for the remaining flows. We also design an admission control module that determines if new flows can be admitted without violating the rate requirements of the existing flows in the network. We provide numerical results to demonstrate the efficacy of our framework. | 
| Starting Page | 2046 | 
| Ending Page | 2054 | 
| Page Count | 9 | 
| File Size | 629413 | 
| File Format | |
| ISSN | 15361276 | 
| Volume Number | 12 | 
| Issue Number | 5 | 
| Language | English | 
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) | 
| Publisher Date | 2013-05-01 | 
| Publisher Place | U.S.A. | 
| Access Restriction | One Nation One Subscription (ONOS) | 
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) | 
| Subject Keyword | Resource management Schedules Interference Quality of service Vectors Logic gates Wireless communication admission control Wireless mesh network QoS congestion control resource allocation | 
| Content Type | Text | 
| Resource Type | Article | 
| Subject | Applied Mathematics Electrical and Electronic Engineering Computer Science Applications | 
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...
                             |