Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IET Digital Library |
|---|---|
| Author | Kumar, Dilip |
| Abstract | Over the last couple of decades, clustering-based protocols are believed to be the best for heterogeneous wireless sensor networks (WSNs) because they work on the principle of divide and conquer. In this study, the authors propose and evaluate two new clustering-based protocols for heterogeneous WSNs, which are called single-hop energy-efficient clustering protocol (S-EECP) and multi-hop energy-efficient clustering protocol (M-EECP). In S-EECP, the cluster heads (CHs) are elected by a weighted probability based on the ratio between residual energy of each node and average energy of the network. The nodes with high initial energy and residual energy will have more chances to be elected as CHs than nodes with low energy whereas in M-EECP, the elected CHs communicate the data packets to the base station via multi-hop communication approach. To analyse the lifetime of the network, the authors assume three types of sensor nodes equipped with different battery energy. Finally, simulation results indicate that the authors protocols prolong network lifetime, and achieve load balance among the CHs better than the existing clustering protocols. |
| Starting Page | 9 |
| Ending Page | 16 |
| Page Count | 8 |
| ISSN | 20436386 |
| Volume Number | 4 |
| e-ISSN | 20436394 |
| Issue Number | Issue 1, Mar (2014) |
| Alternate Webpage(s) | https://digital-library.theiet.org/content/journals/iet-wss/4/1 |
| Alternate Webpage(s) | https://digital-library.theiet.org/content/journals/10.1049/iet-wss.2012.0150 |
| Journal | IET Wireless Sensor Systems |
| Publisher Date | 2013-09-05 |
| Access Restriction | Open |
| Rights Holder | © The Institution of Engineering and Technology |
| Subject Keyword | Base Station Battery Energy Cluster Heads Data Packets Divide And Conquer Method Heterogeneous Wireless Sensor Network Heterogeneous WSN Load Balance M-EECP Multihop Communication Approach Multihop Energy-efficient Clustering Protocol Network Lifetime Maximization Pattern Clustering Probability Protocol Reliability Residual Energy S-EECP Sensor Node Single-hop Energy-efficient Clustering Protocol Statistics Telecommunication Network Reliability Weighted Probability Wireless Sensor Network |
| Content Type | Text |
| Resource Type | Article |
| Subject | Industrial and Manufacturing 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...
|