ETSHRA: Energy Efficient Threshold Sensitive Hierarchical Routing Algorithm for Cognitive Wireless Sensor Networks
Keywords:
Leveling, gossiping, clustering, cognitive wireless sensor network, spectrum sharing, spectrum holes.Abstract
Today’s wireless networks are regulated by
government organizations where a fixed spectrum is assigned to license holders for a specific geographic region. The spectrum usage is dominated in some areas and a major amount of it is underutilized. The spectrum utilization ranges from 15% to 85% depending on the area and time of usage. The limited spectrum availability and its inefficient use have lead to the development of new approaches where licensed and unlicensed networks can exist in the same area and utilize the
existing spectrum in the most efficient manner. One such approach is to use a spectrum sensor network to sense the spectrum availability in the primary network (licensed network) and provide the details to the cognitive wireless sensor network (secondary network or unlicensed network). In this paper we propose a novel algorithm for cognitive wireless sensor network to use the available spectrum in the primary network in an opportunistic manner. The main aim of our algorithm is to optimize the data aggregation and transmission
process by using hard and soft thresholds while routing the data in the cognitive wireless sensor network. Our approach when applied to a sensor field reduces the amount of data being transmitted throughout the network and helps in increasing the lifetime of the network. This helps the cognitive wireless sensor network in making quick and right decision
while selecting the channel in which it can operate in the primary network. We show that our approach outperforms other existing solutions such as leveling, gossiping and PASCAL up to 35% and is more energy efficient than these solutions.
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
