Deadline-Constrained Optimal Broadcasting under Hidden Terminals in Cognitive Networks
Article No.: 13, Pages 1 - 4
Abstract
This paper investigates the successful delivery probability (ps) of deadline-constrained broadcast messages in a cognitive network under the presence of hidden nodes (or terminals). The network has nodes acting as secondary users (SUs) of time slots originally assigned to some other primary users (PUs). SUs are only allowed to access unused time slots, and they do so by using the slotted-Aloha medium access control (MAC) protocol under the same access probability. ps is derived and shown to be substantially impacted due to the hidden terminals which is proposed according to a given spatial node density. Also, ps goes to zero with the increase in the number of SUs, while the limiting maximum network throughput is found to be a constant equal to 1/e as in the case of the classic slotted-Aloha, regardless of the value for the deadline for the message.
References
[1]
J. Eriksson, M. Faloutsos and S. Krishnamurthy. DART: Dynamic address routing for scalable ad hoc and mesh networks. IEEE/ACM Trans.Netw., 15(1):119--132, February 2007.
[2]
M. Conti and S. Giordano. Mobile Ad Hoc Networking: Milestones, Challenges, and New Research Directions. IEEE Commun. Mag., 52(1):85--96, January 2014.
[3]
B. Suh and S. Berber. Broadcast-based data delivery strategy for V2I multihop vehicular networks. Electron. Lett., 50(7):556--558, March 2014.
[4]
E.-S. Jung and N. H. Vaidya. A power control mac protocol for ad hoc networks. Wireless Networks, 11(1--2):55--66, January 2005.
[5]
R. Chen, W.-L. Jin and A. Regan. Broadcasting safety information in vehicular networks: issues and approaches. IEEE Network, 24(1):20--25, January-February 2010.
[6]
C. Campolo, A. Vinel, A. Molinaro and Y. Koucheryavy. Modeling broadcasting in IEEE 802.11p/WAVE vehicular networks. IEEE Commun. Lett., 15(2):199--201, February 2011.
[7]
Y. H. Bae. Analysis of optimal random access for broadcasting with deadline in cognitive radio networks. IEEE Commun. Lett., 17(3):573--575, March 2013.
[8]
L. G. Roberts. ALOHA packet system with and without slots and capture. ACM SIGCOMM Computer Commun. Review, 5(2):28--42, April 1975.
[9]
Z. Qing, L. Tong, A. Swami and Y. Chen. Decentralized cognitive mac for opportunistic spectrum access in ad hoc networks: A pomdp framework. IEEE J. Select. Areas in Commun., 25(3):589--600, April 2007.
[10]
IEEE 802.11p/D10.0, 2010.
Index Terms
- Deadline-Constrained Optimal Broadcasting under Hidden Terminals in Cognitive Networks
Index terms have been assigned to the content through auto-classification.
Recommendations
Modeling the short-term unfairness of IEEE 802.11 in presence of hidden terminals
IEEE 802.11 exhibits both short-term and long-term unfairness. The short-term fairness automatically gives rise to long-term fairness, but not vice versa. When we thoroughly investigated a simple scenario with hidden terminals, we found it to be unfair ...
Collaborative Multi-hop Routing in Cognitive Wireless Networks
The collaboration of nodes in cognitive wireless networks is a large challenge. This paper studies the collaborative multi-hop routing in cognitive networks. We propose a new algorithm to construct the collaborative routing in multi-hop cognitive ...
Handling multi-channel hidden terminals using a single interface in cognitive radio networks
ICIC'09: Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applicationsCognitive networks enable efficient sharing of the radio spectrum. Multi-hop cognitive network is a cooperative network in which cognitive users take help of their neighbors to forward data to the destination. Control signals exchanged through a common ...
Comments
Information & Contributors
Information
Published In
Copyright © 2014 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 18 September 2014
Check for updates
Author Tags
Qualifiers
- Tutorial
- Research
- Refereed limited
Conference
LANC '14
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 46Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in