UGC APPROVED ISSN 2278-1412

Archive

  Volume 13 | Issue 11

  Volume 13 | Issue 10

  Volume 13 | Issue 9

  Volume 13 | Issue 8

  Volume 13 | Issue 7

  Volume 13 | Issue 6

  Volume 13 | Issue 5

  Volume 13 | Issue 3

  Volume 13 | Issue 1

  Volume 12 | Issue 12

  Volume 12 | Issue 11

  Volume 12 | Issue 10

  Volume 12 | Issue 9

  Volume 12 | Issue 8

  Volume 12 | Issue 7

  Volume 12 | Issue 6

  Volume 12 | Issue 5

  Volume 12 | Issue 4

  Volume 12 | Issue 3

  Volume 12 | Issue 2

  Volume 12 | Issue 1

  Volume 11 | Issue 12

  Volume 11 | Issue 11

  Volume 11 | Issue 10

  Volume 11 | Issue 8

  Volume 11 | Issue 7

  Volume 11 | Issue 6

  Volume 11 | Issue 3

  Volume 11 | Issue 1

  Volume 10 | Issue 12

  Volume 10 | Issue 8

  Volume 10 | Issue 6

  Volume 10 | Issue 3

  Volume 10 | Issue 2

  Volume 10 | Issue 1

  Volume 9 | Issue 10

  Volume 8 | Issue 11

  Volume 8 | Issue 7

  Volume 7 | Issue 8

  Volume 7 | Issue 7

  Volume 7 | Issue 6

  Volume 7 | Issue 5

  Volume 7 | Issue 4

  Volume 7 | Issue 3

  Volume 7 | Issue 2

  Volume 7 | Issue 1

  Volume 6 | Issue 12

  Volume 6 | Issue 10

  Volume 6 | Issue 9

  Volume 6 | Issue 8

  Volume 6 | Issue 7

  Volume 6 | Issue 6

  Volume 6 | Issue 5

  Volume 6 | Issue 4

  Volume 6 | Issue 3

  Volume 6 | Issue 2

  Volume 6 | Issue 1

  Volume 5 | Issue 12

  Volume 5 | Issue 11

  Volume 5 | Issue 10

  Volume 5 | Issue 9

  Volume 5 | Issue 8

  Volume 5 | Issue 7

  Volume 5 | Issue 6

  Volume 5 | Issue 5

  Volume 5 | Issue 4

  Volume 5 | Issue 3

  Volume 5 | Issue 2

  Volume 5 | Issue 1

  Volume 4 | Issue 12

  Volume 4 | Issue 10

  Volume 4 | Issue 8

  Volume 4 | Issue 7

  Volume 4 | Issue 6

  Volume 4 | Issue 5

  Volume 4 | Issue 4

  Volume 4 | Issue 2

  Volume 4 | Issue 1

  Volume 3 | Issue 10

  Volume 3 | Issue 8

  Volume 3 | Issue 6

  Volume 3 | Issue 5

  Volume 3 | Issue 4

  Volume 3 | Issue 3

  Volume 3 | Issue 2

  Volume 3 | Issue 1

  Volume 2 | Issue 12

  Volume 2 | Issue 11

  Volume 2 | Issue 10

  Volume 2 | Issue 9

  Volume 2 | Issue 8

  Volume 2 | Issue 7

  Volume 2 | Issue 2

  Volume 1 | Issue 9

  Volume 1 | Issue 8

  Volume 1 | Issue 7

  Volume 1 | Issue 6

  Volume 1 | Issue 4

  Volume 1 | Issue 3

  Volume 1 | Issue 2

  Volume 1 | Issue 1

Current Volume 13 | Issue 12

Analysis Report on Efficient Coverage and Connectivity Preservation with Load Balance for Wireless Sensor Networks


Volume:  5 - Issue: 06 - Date: 01-06-2016
Approved ISSN:  2278-1412
Published Id:  IJAECESTU279 |  Page No.: 1041-1044
Author: Bharti Yaduwanshi
Co- Author: Ayoush Johari
Abstract:-In this paper develop a unique maximum connected load-balancing cover tree (MCLCT) rule to realize full coverage further as BS-connectivity of every sensing node by dynamically forming load-balanced routing cover trees. Such a task is especially developed as a maximum cover tree drawback that has been proved to be nondeterministic polynomial complete. The planned MCLCT consists of 2 components: 1) a coverage-optimizing recursive heuristic for coverage management and 2) a probabilistic load-balancing strategy for routing path determination.
Key Words:-Wireless sensor networks, coverage/connectivity preservation, scheduling, lifetime Maximization,
Area:-Engineering
Download Paper: 
Preview This Article

Unable to display PDF file. Download instead.


Download Paper

Downlaod Paper

No. of Download

000159

Impact Factor

7.4


ijaece

Upcoming Events


Special Issue For Paper


Upcoming Conference


Call For Paper