By Topic

Biological Foraging-Inspired Communication in Intermittently Connected Mobile Cognitive Radio Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Atakan, B. ; Dept. of Electr. & Electron. Eng., Koc Univ., Istanbul, Turkey ; Akan, O.B.

Intermittently connected mobile cognitive radio ad hoc networks (IMCRNs) are promising wireless networks in which mobile unlicensed nodes use their temporarily available contacts and vacant licensed channels for end-to-end message delivery. In this paper, we propose biological foraging-inspired communication (BFC) algorithm for the energy-efficient and spectrum-aware communication requirements in IMCRNs. BFC is based on two profitability measures called relay selection profitability (RSP) and channel selection profitability (CSP). RSP and CSP provide an autonomous decision-making mechanism that does not need any a priori information on node mobility and spectrum availability patterns. This decision-making mechanism also leads to an optimization procedure to determine optimal relay and channel selection rules. Performance evaluations reveal that BFC enables each node to determine and regulate its transmission strategy to provide minimum energy consumption without sacrificing end-to-end delay performance. BFC also maximizes overall spectrum utilization in a way that any idle channel is always allocated by a node within a delay bound.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:61 ,  Issue: 6 )