Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | Springer Nature Link |
|---|---|
| Author | Wang, Zhijun Zhang, Jingyuan |
| Copyright Year | 2006 |
| Abstract | A speed adaptive location management scheme will greatly reduce the cost of tracking mobile stations, because mobile stations can travel at a wide range of speeds. Recently, an elegant distance- and time-based scheme has been proposed. The scheme uses a look-up table which describes the relationship between the distance and the time: the distance decreases while the time increases. In the scheme, the paging area for a mobile station will be automatically reduced if the mobile station does not update its location over a certain time period. Therefore, the scheme performs well when a mobile station travels at a low speed. However, it does not perform well when the incoming call arrival rate is high or when the speed of a mobile station is high. To overcome those drawbacks, a novel speed-adaptive scheme is proposed in this paper. The proposed scheme uses an enhanced look-up table that consists of two parts: the distance in the first part increases while the time increases; in the second part, the distance decreases with the increasing time. By introducing the first part, the proposed scheme reduces the paging cost for a call arriving shortly after a location update, and adapts to the speed range of a mobile station. To reduce the paging cost further, a paging angle is introduced for high-speed mobile stations. Numerical simulations using various activity-based models and random walk models show that the proposed scheme performs well for mobile stations traveling at both high and low speeds. |
| Starting Page | 759 |
| Ending Page | 769 |
| Page Count | 11 |
| File Format | |
| ISSN | 10220038 |
| Journal | Wireless Networks |
| Volume Number | 12 |
| Issue Number | 6 |
| e-ISSN | 15728196 |
| Language | English |
| Publisher | Kluwer Academic Publishers |
| Publisher Date | 2006-04-27 |
| Publisher Place | Boston |
| Access Restriction | One Nation One Subscription (ONOS) |
| Subject Keyword | Cellular networks Location management Location update Paging Performance comparison Computer Communication Networks Electronic and Computer Engineering Business Information Systems |
| Content Type | Text |
| Resource Type | Article |
| Subject | Computer Networks and Communications Information Systems Electrical and Electronic Engineering |
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...
|