• Mar 31, 2016 News!Vol.5, No.5 has been indexed by EI (Inspec).   [Click]
  • Aug 02, 2016 News!IJIEE Vol. 6, No. 4 issue has been published online! 10 papers which cover 3 specific areas are published in this issue.   [Click]
  • May 10, 2016 News!Papers published in Vol.6, No.3 have all received dois from Crossref.
General Information
Editor-in-chief

 
Faculty of Science, University of Brunei Darussalam, Brunei Darussalam   
" It is a great honor to serve as the editor-in-chief of IJIEE. I'll work together with the editorial team. Hopefully, IJIEE will be recognized among the readers in the related field."
IJIEE 2012 Vol.2(3): 352-357 ISSN: 2010-3719
DOI: 10.7763/IJIEE.2012.V2.113

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

Mohammad Mehrani, Ali Shaeidi, Mohammad Hasannejad, and Amir Afsheh

Abstract—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. Cluster head as the manager of the cluster divides the cluster area into some cells and selects a node for each cell to work as the router of corresponding cell. Regardless to cluster head, the pivot nodes are also in charge of routing in the network. As the result of this algorithm, all the cluster heads and pivot nodes together make a group called dominating set which covers all over the entire region. This is designed to achieve full coverage and also its nodes establish routing backbone of the network. This is carried out in such a manner that every one of the network nodes has direct access to one of the selected pivots. The presented coverage algorithm is based on the platform of our last work in clustering (FEED). Using this technique reduces existing load of cluster head as well especially in huge networks and considerably decreases energy consumption of the regular nodes.

Index Terms—coverage, clustering, lifetime

M. Mehrani is a member of scientific board of Islamic Azad University, Shoushtar branch, Shoushtar, Iran. Wireless Networks and Ad hoc are hisresearch fields.
A. Shaeidi works in the PNU University of Dezfoul as a member of scientific board. He is interested in Ad hoc and Sensor Networks.
M. Hasannejad and Amir Afsheh are both interested in Ad hoc.

[PDF]

Cite: Mohammad Mehrani, Ali Shaeidi, Mohammad Hasannejad, and Amir Afsheh, "Dominating Set & Clustering Based Network Coverage for Huge Wireless Sensor Networks," International Journal of Information and Electronics Engineering, vol. 2, no. 3, pp. 352-357, 2012.

Copyright © 2008-2016. International Journal of Information and Electronics Engineering. All rights reserved.
E-mail: ijiee@ejournal.net