Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | ACM Digital Library |
|---|---|
| Author | Le, Nguyen Phi Van, Nguyen Khanh Hieu, Nguyen Trung |
| Abstract | A critical issue in designing efficient routing algorithms for wireless sensor networks (WSN) is dealing with holes which do occur due to several reasons, including cases caused by natural obstacles or disaster suffered areas. Traditional solutions utilize perimeter routing techniques that however lead to traffic concentration on the nodes on the hole boundary, which can make these nodes getting energy exhausted and the hole enlarging, consequently. Several recent proposals attempt to fix this by deploying a special, forbidding area around the hole, which helps to improve path length but still causes significant load unbalancing due to the fixed shape of this forbidding area. We introduce a novel approach in dealing with routing holes where the packet forwarder node notices early enough about the occurrence of a hole in the direction to the destination and hence, can "bend" the path around this hole efficiently. This can be done by deploying a hole aware area around the hole where each node maintains an angle of its view to this hole. We achieve this hole awareness mechanism by using an economical learn-and-disseminate strategy where the nodes on a hole's boundary learn and create a core shape of the hole and then economically disseminate this information piece to the surrounding neighborhood of a controlled size wherein each node then compute and store its hole-view angle. To the best of our knowledge, our proposed routing scheme is the first one that targets and achieves both the two requirements of energy efficiency and load balancing in dealing with the occurrence of holes. Our simulation experiments show that our scheme strongly outperforms several important existing schemes in several performance factors, including route length, efficient use of energy and load balancing. |
| Starting Page | 190 |
| Ending Page | 199 |
| Page Count | 10 |
| File Format | |
| ISBN | 9781450312325 |
| DOI | 10.1145/2350716.2350745 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2012-08-23 |
| Publisher Place | New York |
| Access Restriction | Subscribed |
| Subject Keyword | Routing holes Wireless sensor networks Energy efficiency Load balancing |
| 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...
|