Adaptation of LEACH routing protocol to cognitive radio sensor networks

Panahi, Nayyer, Rohi, Hojat Olah, Payandeh, Ali and Haghighi, Mohammad Sayad 2012, Adaptation of LEACH routing protocol to cognitive radio sensor networks, in IST 2012 : Proceedings of the 6th International Symposium on Telecommunications, IEEE, Piscataway, N.J., pp. 541-547.

Attached Files
Name Description MIMEType Size Downloads

Title Adaptation of LEACH routing protocol to cognitive radio sensor networks
Author(s) Panahi, Nayyer
Rohi, Hojat Olah
Payandeh, Ali
Haghighi, Mohammad Sayad
Conference name International Symposium on Telecommunications (6th : 2012 : Tehran, Iran)
Conference location Tehran, Iran
Conference dates 6-8 Nov. 2012
Title of proceedings IST 2012 : Proceedings of the 6th International Symposium on Telecommunications
Editor(s) [Unknown]
Publication date 2012
Conference series International Symposium on Telecommunications
Start page 541
End page 547
Total pages 7
Publisher IEEE
Place of publication Piscataway, N.J.
Keyword(s) Cognitive Radio Sensor Networks (CRSN)
LEACH
routing
spectrum sensing
Summary One of the drawbacks of LEACH protocol is the uncontrolled selection of cluster heads which, in some rounds, leads to the concentration of them in a limited area due to the randomness of the selection procedure. LEACH-C is a variant of LEACH that uses a centralized clustering algorithm and forms good clusters through sink control. According to experimental results, the IEEE 802.15.4 packets are damaged by WLAN interferences in ISM band. It seems that, sensor nodes equipped with cognitive radio capabilities can overcome this problem. In cognitive radio sensor networks (CRSN), routing must be accompanied by channel allocation. This requires spectrum management which can be devolved to cluster heads. For this networks, new duty cycle mechanisms must be designed that jointly consider neighbor discovery, and spectrum sensing/allocation. Cluster-based network architecture is a good choice for effective dynamic spectrum management. In such architecture, cluster heads have a proper spatial distribution and are optimally located all over the network. In this paper, using the physical layer information and preserving the feature of random cluster head selection in LEACH, it has been tried to both move the position of cluster heads to appropriate locations and make their quantity optimal. The simulation results show that the transferal of cluster heads to appropriate locations increases the network lifetime significantly though this comes at the price of early instability appearance. By considering the energy level in cluster head election algorithm, one can overcome the network stability issues too. However, this will move the cluster heads away from their appropriate locations. © 2012 IEEE.
ISBN 9781467320733
Language eng
Field of Research 080503 Networking and Communications
Socio Economic Objective 890199 Communication Networks and Services not elsewhere classified
HERDC Research category E1 Full written paper - refereed
Persistent URL http://hdl.handle.net/10536/DRO/DU:30052623

Document type: Conference Paper
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 2 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 62 Abstract Views, 3 File Downloads  -  Detailed Statistics
Created: Fri, 24 May 2013, 12:06:48 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.