Team Members:
Abhishek SamantaSixia ChenAlexander RussellRavi Sundaram
Background:
Over the last few decades, wireless communication proved to be an enabling technology to an increasingly
large number of applications. Now-a-days most of the devices used on daily basis, are capable of communicating via some kind of wireless technology, viz, Wifi,
Bluetooth, radio frequency identification (RFID), near field communication (NFC) etc. But, due to enormous deployment, the ISM band is over crowded which essen
tially results in poor working efficiency of devices using this band. In contrast, licensed frequency bands have been found to be sparsely used by their primary users.
Thus, to increase the efficiency of wireless devices, dynamic spectrum allocation (DSA) techniques have been proposed with cognitive radio network (CRN) to uti
lize unlicensed frequency bands (ISM) along with licensed spectrum, when these spectrums are not actively used by its primary users. In order to utilize the large
amount of frequency bands available to CRN, earliest rendezvous is of prime concern of nodes. The fastest rendezvous is possible if all nodes share a common con-
trol channel (CCC) on which the frequency allocation informations are coordinated. But, CCC makes the whole network vulnerable to protocol aware adversaries
(“jammer”) who know the control channel. But, on the other hand, protocols without CCC tend to work slowly, in terms of time to rendezvous. Because, nodes are un-
able to predict the wherabout of each other. For example, if a node ai wants to communicate with another node aj , without presence of CCC, it has to wait for
the next time when ai and aj rendezvous, by virtue of overlapping frequency hopping sequences of the nodes. This waiting time, in turn, degrades the efficiency of
overall network.
Goal:
We are interested in developing a protocol to enable nodes rendezvous with each other as fast as possible. Moreover, in presence of a jammer, the protocol should efficiently antijam.
Publication
[ Deterministic Blind Rendezvous in Cognitive Radio Networks in ICDCS 2014 ]
References
[1] [E. Bayraktaroglu, C. King, X. Liu, G. Noubir, R. Rajaraman, and B. Thapa. On the
performance of ieee 802.11 under jamming. In INFOCOM, pages 1265–1273. IEEE, 2008. ]
[2] [A. Chan, X. Liu, G. Noubir, and B. Thapa. Broadcast Control channel jamming: Resilience and
identification of traitors. In IEEE International Symposium on Information Theory (ISIT). IEEE, 2007.]
[3] [S.-Y. Chang, Y.-C. Hu, and N. Laurenti. Simplemac: a jamming-resilient mac-layer
protocol for wireless channel coordination. In Mobicom ’12, pages 77–88. ACM, 2012. ]
[4] [J. T. Chiang and Y. chun Hu. Extended abstract: Cross-layer jamming detection and mitigation in
wireless broadcast networks. In MobiCom 07, pages 346–349. ACM, 2007. ]
[5] [ R. Graham, B. Rothschild, and J. Spencer. Ramsey Theory. Wiley Series in Discrete
Mathematics and Optimization. Wiley, 1990. ]
[6] [D. E. Knuth. Efficient balanced codes. IEEE Transactions on Information Theory, IT-32(1):51–53, 1986. ]
[7][C.-Y. Koo, V. Bhandari, J. Katz, and V. H. Nitin. Reliable broadcast in radio networks: the
bounded collision case. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, PODC ’06,
pages 258–264. ACM, 2006. ]
[8][ L. Lazos, S. Liu, and M. Krunz. Mitigating control-channel jamming attacks in multi-channel
ad hoc networks. In Proceedings of the second ACM conference on Wireless network security, WiSec ’09, pages 169–180. ACM. ]
[9][ M. Li, I. Koutsopoulos, and R. Poovendran. Optimal jamming attacks and network defense
policies in wireless sensor networks. In 26th Annual IEEE Conference on Computer Communications (INFOCOM ’07), pages 1307–1315. IEEE. ]
[10][G. Lin and G. Noubir. On link layer denial of service in data wireless lans: Research articles.
Wireless Communication and Mobile Computing, 5(3):273–284, May 2005. ]
[11][ Z. Lin, H. Liu, X. Chu, and Y.-W. Leung. Jump-stay based channel-hopping algorithm with guaranteed rendezvous
for cognitive radio networks. In The 31st Annual IEEE International Conference on Computer Communications (INFOCOM ’11), pages 2444–2452. IEEE. ]
[12][ A. Liu, P. Ning, H. Dai, and Y. Liu. USD-FH: Jamming-resistant wireless communication using frequency hopping
with uncoordinated seed disclosure. In 7th International Conference on Mobile Adhoc and Sensor Systems (MASS ’10), pages 41–50. IEEE. ]
[13][ H. Liu, Z. Lin, X. Chu, and Y.-W. Leung. Ring-walk based channel-hopping algorithms with guranteed rendezvous
for congnitive radio networks. In IEEE/ACM Int’l Conference on Green Computing and Communications & Int’l Conference on Cyber, Physical and Social
Computing (GREENCOM-CPSCOM ’10), pages 755–760. IEEE. ]
[14][ S. Liu, L. Lazos, and M. Krunz. Thwarting inside jamming attacks on wireless broadcast communications. In Fourth ACM conference on
Wireless network security (WiSec ’11), pages 29–40. ACM. ]
[15][ Y. Liu, P. Ning, H. Dai, and A. Liu. Randomized differential dsss: Jamming-resistant wireless broadcast communication. In The 29th
Conference on Computer Communications (INFOCOM ’10), pages 1–9. IEEE. ]
[16][ K. B. Rasmussen, S. Capkun, and M. Cagalj. Secnav: secure broadcast localization and time synchronization in wireless networks. In
Proceedings of the 13th annual ACM international conference on Mobile computing and networking, MobiCom ’07, pages 310–313. ACM, 2007. ]
[17][ D. Y. J. Shin and C. Kim. Deterministic rendezvous scheme in multichannel access networks. Electronics Letters, 2010. ]
[18][ D. Slater, P. Tague, R. Poovendran, and B. J. Matt. A coding-theoretic approach for efficient message verification over insecure channels. In
Proceedings of the Second ACM Conference on Wireless Network Security, WISEC ’09, pages 151–160. ACM. ]
[19][ M. Strasser, C. Popper, and S. Capkun. Efficient uncoordinated fhss anti-jamming communication. In Tenth ACM International Symposium on
Mobile Ad Hoc Networking and Computing, (MobiHoc ’09), pages 207–218. ACM. ]
[20][ P. Tague, D. Slater, R. Poovendran, and G. Noubir.Linear programming models for jamming attacks on network traffic flows. In
6th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt ’08), pages 207–216. ]
[21][ M. Wilhelm, I. Martinovic, J. B. Schmitt, and V. Lenders. Short paper: reactive jamming in wireless networks: how realistic is the threat?
In WISEC ’11, pages 47–52. ACM. ]
[22][ W. Xu, K. Ma, W. Trappe, and Y. Zhang. Jamming sensor networks: attack and defense strategies. IEEE Network, 20(3):41–47, 2006.]
[23][W. Xu, K. Ma, W. Trappe, and Y. Zhang. Jamming sensor networks: attack and defense strategies. IEEE Network, 20(3):41–47, 2006. ]
[24][ W. Xu, W. Trappe, and Y. Zhang. Channel surfing: defending wireless sensor networks from interference. In Proceedings of the 6th international
conference on Information processing in sensor networks, IPSN ’07, pages 499–508. ACM. ]
[25][W. Xu, W. Trappe, and Y. Zhang. Defending wireless sensor networks from radio interference through channel adaptation. ACM Transactions
on Sensor Networks (TOSN), 4(4):18:1–18:34, Sept. 2008.]