Mobility

Dominating Set & Clustering Based Network Coverage for Huge Wireless Sensor Networks

Free registration required

Executive Summary

Routing is one of the most important issues in wireless sensor networks. In order to transfer packets in the network effectively, a sound path between nodes should exist to reduce data transmission costs. A proper coverage algorithm is very critical to establish a suitable routing algorithm. Small set of nodes in a network is an important consideration for a coverage algorithm. This paper proposes a problem entitled "Inter and intra cluster dominating set based routing". Clusters are made in large networks with numerous nodes to perform coverage in both inter and intra cluster levels.

  • Format: PDF
  • Size: 2173.7 KB