AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.5 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Topology Adaptation for Robust Ad Hoc Cyberphysical Networks under Puncture-Style Attacks

Department of Electrical and Computer Engineering, Rutgers University, New Brunswick, NJ 08901, USA.
Show Author Information

Abstract

Many cyber physical networks will involve ad hoc deployments utilizing peer-to-peer communications. Examples include transportation systems where a group of moving cars communicate in order to avoid collisions, teams of robotic agents that work together in support of disaster recovery, and sensor networks deployed for health-care monitoring, monitoring the operation of a factory plant or to coordinate and actuate mechanisms for energy conservation in a building. These networks may face a variety of threats that puncture their connectivity and, should their performance degrade, the result could be catastrophic. Consider, for example, a vehicular ad hoc network where communication assists collision avoidance. In such a case, degradation could lead to vehicle accidents. Therefore, in order to overcome network performance degradations and the puncture of a network (such as blackhole or jamming) which is under attack, we propose an algorithm called the Fiedler Value Power Adjustment Topology Adaption (FVPATA). FVPATA aims to dynamically adapt an ad hoc network’s topology, even if the attacker varies its location and in the case of an interference-style attack by increasing the interference power. The algorithm utilizes the formulation from the graph theory which works with the Fiedler value to guide each node in wireless ad hoc network utilizing power adjustments to enhance the network’s overall robustness. The advantage of the proposed mechanism is that it is a light-weight approach which is totally distributed, based on topology updates inherent in the Optimized Link State Routing (OLSR) protocol and, hence, it is unnecessary to introduce additional messages. Additionally, an algorithm was developed to resolve problems involving asymmetric links that arise in ad hoc networks by eliminating unnecessary energy consumption of Fiedler nodes. Simulation results using NS3 show that the proposed mechanism successfully decreases the average amount of hops used by 50% and the delay of flows when nodes are migrating at a modest rate below 60 m/min.

References

[1]
He T., Stankovic J. A., Lu C., and Abdelzaher T., Speed: A stateless protocol for real-time communication in sensor networks, in Distributed Computing Systems, 2003. Proceedings 23rd International Conference on, IEEE, 2003, pp. 46-55.
[2]
Su W. and Gerla M., Ipv6 flow handoff in ad hoc wireless networks using mobility prediction, in Global Telecommunications Conference, 1999. GLOBECOM99, IEEE, 1999, vol. 1, pp. 271-275.
[3]
Toh C.-K., Associativity-based routing for ad hoc mobile networks, Wireless Personal Communications, vol. 4, no. 2, pp. 103-139, 1997.
[4]
Marti S., Giuli T. J., Lai K., and Baker M., Mitigating routing misbehavior in mobile ad hoc networks, in Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, ACM, 2000, pp. 255-265.
[5]
Liu Y. and Trappe W., Localization in peer to peer networks based on q-learning, in the 40th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2015), Brisbane, Australia, 2015, to be appeared.
[6]
Helmer G. G., Wong J. S., Honavar V., and Miller L., Intelligent agents for intrusion detection, in Information Technology Conference, IEEE, 1998, pp. 121-124.
[7]
Huang Y.-A. and Lee W., A cooperative intrusion detection system for ad hoc networks, in Proceedings of the 1st ACM Workshop on Security of ad hoc and Sensor Networks, ACM, 2003, pp. 135-147.
[8]
Zhou L. and Haas Z. J., Securing ad hoc networks, Network, IEEE, vol. 13, no. 6, pp. 24-30, 1999.
[9]
Marina M. K. and Das S. R., On-demand multipath distance vector routing in ad hoc networks, in Network Protocols, 2001. Ninth International Conference on, IEEE, 2001, pp. 14-23.
[10]
Al-Shurman M., Yoo S.-M., and Park S., Black hole attack in mobile ad hoc networks, in Proceedings of the 42nd Annual Southeast Regional Conference, ACM, 2004, pp. 96-97.
[11]
Tague P., Nabar S., Ritcey J. A., and Poovendran R., Jamming-aware traffic allocation for multiple-path routing using portfolio selection, Networking, IEEE/ACM Transactions on, vol. 19, no. 1, pp. 184-194, 2011.
[12]
Tague P., Nabar S., Ritcey J. A., Slater D., and Poovendran R., Throughput optimization for multipath unicast routing under probabilistic jamming, in Personal, Indoor and Mobile Radio Communications, 2008. PIMRC 2008. IEEE 19th International Symposium on, IEEE, 2008, pp. 15.
[13]
Ma K., Zhang Y., and Trappe W., Mobile network management and robust spatial retreats via network dynamics, in Mobile Adhoc and Sensor Systems Conference, 2005. IEEE International Conference on, IEEE, 2005, p. 8.
[14]
Xu W., Ma K., Trappe W., and Zhang Y., Jamming sensor networks: Attack and defense strategies, Network, IEEE vol. 20, no. 3, pp. 41-47, 2006.
[15]
Panyim K. and Krishnamurthy P., A hybrid key predistribution scheme for sensor networks employing spatial retreats to cope with jamming attacks, Mobile Networks and Applications, vol. 17, no. 3, pp. 327-341, 2012.
[16]
Yue G., Anti-jamming coding techniques, Signal Processing Magazine, IEEE, vol. 25, no. 6, pp. 35-45, 2008.
[17]
Yue G. and Wang X., Anti-jamming coding techniques with application to cognitive radio, Wireless Communications, IEEE Transactions on, vol. 8, no. 12, pp. 5996-6007, 2009.
[18]
Xu X., Zheng B., Zhang J., and Yan J., An efficient anti-jamming piecewise coding in cognitive of dm, in Communication Technology (ICCT), 2010 12th IEEE International Conference on, IEEE, 2010, p. 14.
[19]
Cheun K. and Stark W. E., Performance of robust metrics with convolutional coding and diversity in fhss systems under partial-band noise jamming, Communications, IEEE Transactions on, vol. 41, no. 1, pp. 200-209, 1993.
[20]
Sidek O. and Yahya A., Reed solomon coding for frequency hopping spread spectrum in jamming environment, American Journal of Applied Sciences, vol. 5, no. 10, p. 1281, 2008.
[21]
Fiedler M., Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, vol. 23, no. 2, pp. 298-305, 1973.
[22]
Jamakovic A. and Uhlig S., On the relationship between the algebraic connectivity and graphs robustness to node and link failures, in Next Generation Internet Networks, 3rd EuroNGI Conference on, IEEE, 2007, pp. 96-102.
[23]
de Abreu N. M. M., Old and new results on algebraic connectivity of graphs, Linear Algebra and Its Applications, vol. 423, no. 1, pp. 53-73, 2007.
[24]
Johnson D. B., Maltz D. A., and Broch J., Dsr: The dynamic source routing protocol for multi-hop wireless ad hoc networks, in Ad Hoc Networking. Boston, MA, USA: Addison-Wesley Longman Publishing Co. Inc., 2001, pp. 139-172.
[25]
Perkins C. E. and Royer E. M., Ad-hoc on-demand distance vector routing, in Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA99. Second IEEE Workshop on, IEEE, 1999, pp. 90-100.
[26]
Chen T.-W. and Gerla M., Global state routing: A new routing scheme for ad-hoc wireless networks, in Communications, 1998. ICC 98. Conference Record. 1998 IEEE International Conference on, IEEE, 1998, vol. 1, pp. 171-175.
[27]
Al-Karaki J. N. and Kamal A. E., Efficient virtualbackbone routing in mobile ad hoc networks, Computer Networks, vol. 52, no. 2, pp. 327-350, 2008.
[28]
Clausen T., Jacquet P., Adjih C., Laouiti A., Minet P., Muhlethaler P., Qayyum A., and Viennot L.. Optimized link state routing protocol (OLSR), RFC 3626, Internet Engineering, Task Force (IETF), 2003.
[29]
Jain S. and Sahu S., Topology vs position based routing protocols in mobile ad hoc networks: A survey, International Journal of Engineering Research and Technology, vol. 1, no. 3, pp. 1-11, 2012.
[30]
Newman M. E., The structure and function of complex networks, SIAM Review, vol. 45, no. 2, pp. 167-256, 2003.
[31]
Pandana C. and Liu K. R., Robust connectivity-aware energy-efficient routing for wireless sensor networks, Wireless Communications, IEEE Transactions on, vol. 7, no. 10, pp. 3904-3916, 2008.
[32]
Mohar B. and Alavi Y., The Laplacian spectrum of graphs, Graph Theory, Combinatorics, and Applications, vol. 2, pp. 871-898, 1991.
Tsinghua Science and Technology
Pages 364-375
Cite this article:
Liu Y, Trappe W. Topology Adaptation for Robust Ad Hoc Cyberphysical Networks under Puncture-Style Attacks. Tsinghua Science and Technology, 2015, 20(4): 364-375. https://doi.org/10.1109/TST.2015.7173452

544

Views

8

Downloads

1

Crossref

N/A

Web of Science

4

Scopus

1

CSCD

Altmetrics

Received: 01 May 2015
Revised: 18 June 2015
Accepted: 28 June 2015
Published: 03 August 2015
© The authors 2015
Return