Modified dijkstra’s routing algorithm for security with different trust degrees

ation is generated until such a route exist
of 1m 1m. Two nodes have reliable wireless connection
 and the data about the delivery time and number hops
only when× the distance between them is small than
 is accumulated. In a simulation, we need to generate
a threshold of dth = 0.4. A reliable wireless channel
 2 a certain number of successful realizations. The ratio
is randomly distributed with σh-variance and 0-mean
  2 of the number of successful realizations and that of
complex Normal distribution where σ2 = cL in generated ones is the SDR. As shown, the SDR does not
 h 4π fRd
which cL is the light velocity, fR is the radio frequency, depend on the transmit SNR because a higher transmit
and d is the distance between the considered transmit- SNR only improves the transmission between any two
ter and receiver. We use fR = 900 MHz, one of the nodes, and consequently, the cost or the average deliv-
unlicensed frequency bands in the US. The variance of ery time. More nodes leads to a higher SDR since nodes
the channel reflects the simplified path loss of the Friis can more easily find the next nodes for a route to the
Transmission Formula [22]. The TD of an illegitimate destination. However, when the node number is already
node is randomized with the 1-mean and 0.4-variance high, increasing it does not increase SDR significantly
Normal distribution and truncated in the value range since the nodes are already dense.
of [0 1], i.e., if the random value is larger than 1, the Figure 5 shows the average delivery time for 1 Kbits
TD is set to 1 and if it is smaller than 0, the TD is from node 1 to node n. As shown, all delivery times
set to 0. Figure 3 shows a network example with 15 decrease with the transmit SNR of each hop since
nodes. The source, illegitimate, and destination nodes the receiver of each hope can receive a better signal
are filled with blue, green, and red colors, respectively. and reduce the transmission time in each hop. More
We find the route from node 1 to node n with the number of nodes in a network lead to a shorter delivery
shortest transmission time for 1 Kbits and accumulated time because on average there is a shorter distance,
TD at least α. and therefore, a better transmission rate or a shorter
 In the first simulation, the transmit SNR is varied transmission time between any two nodes.
C. D. T. Thai et al.: Modified Dijkstra’s Routing Algorithm for Security with Different Trust Degrees 59
 4.6 280
 n = 10
 n = 30 270
 n = 50
 4.4
 260 n = 10
 n = 30
 4.2 250 n = 50
 240
 4
 Average number of hops
 230
 Average delivery time for 1K bits (ms)
 3.8 220
 0 5 10 15 20 25 30 0 0.2 0.4 0.6 0.8
 Transmit SNR (dB) Trust threshold (α)
Figure 6. The average number of hops of the best route in case α = 0.7. Figure 8. The average delivery time with varied TD threshold and
 fixed SNR at 20dB.
 1.2 4.4
 1 4.3
 0.8 n = 10 4.2 n = 10
 n = 30 n = 30
 n = 50
 0.6 4.1 n = 50
 0.4 4
 Successful delivery ratio
 Average number of hops
 0.2 3.9
 0 3.8
 0 0.2 0.4 0.6 0.8 0 0.2 0.4 0.6 0.8
 Trust threshold (α) Trust threshold (α)
Figure 7. The successful delivery ratio with varied TD threshold and Figure 9. The average number of hops with varied TD threshold and
fixed SNR at 20dB. fixed SNR at 20dB.
 Figure 6 shows the average number hops that the best not allow less trusted routes with fewer nodes to be
route from node 1 to node n goes through. It decreases considered.
slightly with the transmit SNR since a better transmit
SNR can increase each hop transmission rate so routes
with fewer hops but with worse channels can combat 5 Conclusion
with the other routes and become the best ones. More
 In this paper, we proposed a modified algorithm to find
nodes in the network lead to smaller number of hops
 the route with shortest total transmission time based on
since the nodes can find the next nodes more easily
 Dijsktra’s shortest path algorithm with additional trust
with a determined channel distance threshold d .
 th degree (TD) constraints for the multi-hop decode-and-
 In the second simulation, we vary the trust threshold
 forward relay network. The simulation results show
(α) to see the affects of this parameter on the perfor-
 that successful delivery ratio increases with transmit
mance of the network in terms of SDR, the average
 SNR and decreases when node number increases and
delivery time, and the average number of hops. In this
 the TD constraint is stricter. In the meantime, the time
case, we set the transmit SNR to 20 dB. Differently to
 delivery time and average number of hops increases
the case in Figure 4, the SDR decreases when the trust
 with the node number and the TD constraint and
threshold increases as it puts stricter trust threshold
 decreases when the transmit SNR increases. Therefore
constraint (the accumulated TD must be greater than
 precisely determining the TDs of the nodes in a net-
the trust threshold constraint). Similarly to other cases,
 work is very important since it helps to better optimize
denser nodes will so help to increase the SDR. When α
 the routing and increases the security and network
is low enough (about 0.3) and n is large enough (about
 performance. In case high-resolution TDs are not avail-
30), almost all random realizations succeed.
 able, classifying into different types, with different TD
 Figure 8 shows the average delivery time from node 1
 ranges, also helps.
to node n. As expected, when a stricter TD constraint is
put in the shortest route finding problem, the network
performance gets worse, i.e., the average delivery time Acknowledgement
is longer. As usual, the case with more nodes performs
better. Figure 9 shows the average number of hops. It This work was supported by NAFOSTED Grant 102.02-
also increases with α since a stricter TD constraint will 2018.318.
60 REV Journal on Electronics and Communications, Vol. 10, No. 1–2, January–June, 2020
References [18] Y. Xu, J. Liu, Y. Shen, X. Jiang, and N. Shiratori, “Physical
 layer security-aware routing and performance tradeoffs
 [1] A. Mukherjee, S. Fakoorian, J. Huang, and A. Swindle- in ad hoc networks,” Computer Networks, vol. 123, pp. 77
 hurst, “Principles of Physical Layer Security in Multiuser – 87, 2017.
 Wireless Networks: A Survey,” IEEE Communications Sur- [19] J. Yao, S. Feng, X. Zhou, and Y. Liu, “Secure routing
 veys & Tutorials, vol. 16, no. 1, pp. 1550–1573, Feb. 2014. in multihop wireless ad-hoc networks with decode-and-
 [2] J. Wang, J. Lee, F. Wang, and T. Q. S. Quek, “Jamming- forward relaying,” IEEE Transactions on Communications,
 aided secure communication in massive MIMO Rician vol. 64, no. 2, pp. 753–764, 2016.
 channels,” IEEE Transactions on Wireless Communications, [20] M. Pagan, A. Hession, and S. Yuan, “A security-
 vol. 14, no. 12, pp. 6854–6868, 2015. enhanced routing algorithm with path randomization,”
 [3] C. D. T. Thai, J. Lee, and T. Q. S. Quek, “Secret group in Proceedings of the International Conference on Computing,
 key generation in physical layer for mesh topology,” in Networking and Communications (ICNC), Feb. 2015, pp.
 Proceedings of the IEEE Global Communications Conference 1137–1141.
 (GLOBECOM), Dec. 2015, pp. 1–6. [21] D. Medhi and K. Ramasamy, Network Routing: Algo-
 [4] L. Dong, Z. Han, A. P. Petropulu, and H. V. Poor, “Im- rithms, Protocols, and Architectures. Elsevier, 2007.
 proving wireless physical layer security via cooperating [22] R. C. Johnson and H. Jasik, Antenna Engineering Hand-
 relays,” IEEE Transactions on Signal Processing, vol. 58, book, 2nd ed. New York, NY: McGraw-Hill, Inc., 1984.
 no. 3, pp. 1875–1888, 2009.
 [5] L. Jiang, H. Tian, Z. Xing, K. Wang, K. Zhang, S. Ma-
 harjan, S. Gjessing, and Y. Zhang, “Social-aware energy
 harvesting device-to-device communications in 5G net-
 works,” IEEE Wireless Communications, vol. 23, no. 4, pp.
 20–27, 2016.
 [6] Q. Li and L. Yang, “Artificial Noise Aided Secure Precod-
 ing for MIMO Untrusted Two-Way Relay Systems With
 Perfect and Imperfect Channel State Information,” IEEE
 Transactions on Information Forensics and Security, vol. 13, Chan Dai Truyen Thai received the B.S.
 no. 10, pp. 2628–2638, 2018. degree from Posts and Telecommunications
 [7] M. Zhao, J. Y. Ryu, J. Lee, T. Q. S. Quek, and S. Feng, Institute of Technology (PTIT), Ho Chi Minh
 “Exploiting trust degree for multiple-antenna user co- City, Vietnam; the M.Sc. degree from Korea
 operation,” IEEE Transactions on Wireless Communications, Advanced Institute of Science and Technol-
 vol. 16, no. 8, pp. 4908–4923, 2017. ogy (KAIST), Daejeon, South Korea; and the
 Ph.D. degree from Aalborg University, Den-
 [8] J. Ryu, J. Lee, and T. Q. S. Quek, “Trust Degree based mark, in 2003, 2008, and 2012, respectively.
 Beamforming for MISO Cooperative Communication He was with IFSTTAR, LEOST, Villeneuve
 System,” IEEE Communications Letters, vol. 19, no. 11, pp. d’Ascq, France; with Singapore University of
 1957–1960, 2015. Technology and Design (SUTD); and is now
 [9] Y. Wen, Y. Huo, L. Ma, T. Jing, and Q. Gao, “A scheme the Academic Coordinator cum Senior Lecturer of the Electrical and
 for trustworthy friendly jammer selection in cooperative Computer Engineering (ECE) Study Program, Vietnamese-German
 cognitive radio networks,” IEEE Transactions on Vehicular University (VGU). His research interests include cooperative com-
 Technology, vol. 68, no. 4, pp. 3500–3512, 2019. munications, vehicle-to-vehicle communications, communication for
[10] L. Sun, P. Ren, Q. Du, Y. Wang, and Z. Gao, “Security- high-speed vehicles, security in wireless communications, and secu-
 rity in smart grid.
 aware relaying scheme for cooperative networks with
 untrusted relay nodes,” IEEE Communications Letters,
 vol. 19, no. 3, pp. 463–466, 2014.
[11] J. Xiong, L. Cheng, D. Ma, and J. Wei, “Destination aided
 cooperative jamming for dual-hop amplify-and-forward Vo Nguyen Quoc Bao received the B.E. and
 MIMO untrusted relay systems,” IEEE Transactions on M.Eng. degree in electrical engineering from
 Vehicular Technology, vol. 65, no. 9, pp. 7274–7284, 2015. Ho Chi Minh City University of Technology
[12] C. D. T. Thai, J. Lee, and T. Q. S. Quek, “Physical-layer (HCMUT), Vietnam, in 2002 and 2005, respec-
 secret key generation with colluding untrusted relays,” tively, and Ph.D. degree in Electrical Engineer-
 ing from University of Ulsan, South Korea,
 IEEE Transactions on Wireless Communications, vol. 15, in 2009. In 2002, he joined the Department
 no. 2, pp. 1517–1530, 2015. of Electrical Engineering, Posts and Telecom-
[13] Y. Li, T. Wu, P. Hui, D. Jin, and S. Chen, “Social-aware munications Institute of Technology (PTIT), as
 D2D communications: qualitative insights and quanti- a lecturer. Since February 2010, he has been
 tative analysis,” IEEE Communications Magazine, vol. 52, with the Faculty of Telecommunications, PTIT,
 no. 6, pp. 150–158, 2014. where he is currently an Associate Professor. He is a Senior Member
[14] M. Zhang, X. Chen, and J. Zhang, “Social-aware relay of IEEE. His research interests include wireless communications
 selection for cooperative networking: An optimal stop- and information theory with current emphasis on MIMO systems,
 ping approach,” in Proceedings of the IEEE International cooperative and cognitive communications, physical layer security,
 and energy harvesting. He is currently serving as the Editor of
 Conference on Communications (ICC), Jun. 2014, pp. 2257– Transactions on Emerging Telecommunications Technologies (Wiley
 2262. ETT) and VNU Journal of Computer Science and Communication
[15] X. Chen, B. Proulx, X. Gong, and J. Zhang, “Exploiting Engineering. He is also a Guest Editor of EURASIP Journal on
 social ties for cooperative D2D communications: A mo- Wireless Communications and Networking, special issue on “Co-
 bile social networking case,” IEEE/ACM Transactions on operative Cognitive Networks” and IET Communications, special
 Networking, vol. 23, no. 5, pp. 1471–1484, 2014. issue on “Secure Physical Layer Communications”. He served as a
[16] J. P. Coon, “Modelling trust in random wireless net- Technical Program co-chair for ATC (2013,2014), NAFOSTED-NICS
 works,” in Proceedings of the 11th International Symposium (2014, 2015, 2016), REV-ECIT 2015 and ComManTel (2014, 2015), and
 on Wireless Communications Systems (ISWCS), Aug. 2014, SigComTel (2017, 2018). He is a Member of the Executive Board of the
 Radio-Electronics Association of Vietnam (REV) and the Electronics
 pp. 976–981. Information and Communications Association Ho Chi Minh City
[17] W. She, Q. Liu, Z. Tian, J. Chen, B. Wang, and W. Liu, (EIC). He is currently serving as vice chair of the Vietnam National
 “Blockchain trust model for malicious node detection Foundation for Science and Technology Development (NAFOSTED)
 in wireless sensor networks,” IEEE Access, vol. 7, pp. scientific Committee in Information Technology and Computer Sci-
 38 947–38 956, 2019. ence (2017-2019).
C. D. T. Thai et al.: Modified Dijkstra’s Routing Algorithm for Security with Different Trust Degrees 61
 Tran Quang Nhu received the B. S. degree Huynh Van Hoa received the B. S. degree
 in electronics and telecommunications engi- in electronics and telecommunications engi-
 neering and the M. S. degree in telecommu- neering and the M. S. degree in telecommuni-
 nications engineering from the University of cations engineering from Posts and Telecom-
 Transport and Communication (UTC), Viet- munications Institute of Technology (PTIT),
 nam, in 2008 and 2012, respectively. From Vietnam, in 2013 and 2018, respectively. In
 2008 to 2009, he joined Global Telecommuni- 2018, he joined the Department of Telecom-
 cations Corporation (GTEL), and from 2009 to munications, PTIT, as a lecturer. His major
 2012, VNPT-NEC Telecommunication Systems research interests are wireless communica-
 Company. He is now the Team Leader of lab tions, cooperative and cognitive communi-
 engineers, ECE study program, Vietnamese- cations, physical-layer security, NOMA and
German University (VGU). His major research interests are wireless Short-packet communications.
communications, radio frequency engineering, IP networking.
 Nguyen Thi Yen Linh was born in Tien Giang
 province, Viet Nam in 1982. She received the
 B.Sc. and M.Sc. degrees in applied physics
 from Vietnam National University, Ho Chi
 Minh (VNUHCM) in 2004 and 2008, respec-
 tively. In 2009, she joined the Department
 of Foundation, Posts and Telecommunications
 Institute of Technology (PTIT), as a lecturer.
 She is now a research member of Wireless
 Communication Laboratory (WCOMM), PTIT,
 Vietnam. Her major research interests are ran-
dom wireless network, short packet communication, cooperative
communications, cognitive radio and physical layer security.