Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Compressed sensing algorithm for neighbour discovery in mobile ad hoc networks

© The Institution of Engineering and Technology
Received 21/03/2018, Accepted 15/04/2019, Revised 09/03/2019, Published 17/04/2019

Considering the neighbour discovery problem in mobile ad hoc networks (MANETS) with omnidirectional antennas, all nodes want to discover the nodes within a single hop and obtain their identities. However, many existing algorithms spend an extra overhead for neighbour discovery and there is a need of response from neighbours. In this study, a slot allocation scheme is introduced for duplex communication, making all nodes recognisable to each other with a unique codeword. Then, a novel neighbour discovery algorithm based on compressed sensing to apply in this scheme is proposed; it enables all nodes to update neighbour information through the received signal after one or several frames and spends no extra overhead. Furthermore, many algorithms cannot be applied in the overload networks, but the algorithm proposed here is suited for overload networks; the upper bound for its active neighbours is limited to the performance of the network. Finally, the algorithm is validated through simulation and the effect of the three main factors on the performance of the algorithm is researched. The result implies that this algorithm can adapt to various scenarios of the MANETS.

Inspec keywords: mobile ad hoc networks; omnidirectional antennas; compressed sensing; network coding

Other keywords: mobile ad hoc networks; slot allocation scheme; codeword; single hop; MANET; duplex communication; compressed sensing algorithm; omnidirectional antennas; neighbour discovery problem

Subjects: Signal processing and detection; Single antennas; Codes; Mobile radio systems

References

    1. 1)
      • 12. Pozza, R., Nati, M., Georgoulas, S., et al: ‘Neighbor discovery for opportunistic networking in internet of things scenarios: a survey’, IEEE Access, 2015, 3, (3), pp. 1101–1131.
    2. 2)
      • 17. Kim, J., Han, K.: ‘Backoff scheme for crowded bluetooth low energy networks’, IET Commun., 2017, 11, (4), pp. 548–557.
    3. 3)
      • 18. Kindt, P.H., Saur, M., Balszun, M., et al: ‘Neighbor discovery latency in ble-like protocols’, IEEE Trans. Mob. Comput., 2018, 17, (3), pp. 617–631.
    4. 4)
      • 14. Beirami, A., Nejati, H.: ‘A framework for investigating the performance of chaotic-map truly random number generators’, IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., 2013, 60, (7), pp. 446–450.
    5. 5)
      • 8. Tong, Z., Russ, C., Vanka, S., et al: ‘Prototype of virtual full duplex via rapid on-off-division duplex’, IEEE Trans. Commun., 2015, 63, (10), pp. 3829–3841.
    6. 6)
      • 13. Chen, L., Bian, K., Zheng, M.: ‘Never live without neighbors: from single- to multi-channel neighbor discovery for mobile sensing applications’, IEEE/ACM Trans. Netw., 2016, 60, (7), pp. 3148–3161.
    7. 7)
      • 9. Burghal, D., Tehrani, A., Molisch, A.: ‘On expected neighbor discovery time with prior information: modeling, bounds and optimization’, IEEE Trans. Wirel. Commun., 2018, 17, (1), pp. 339–351.
    8. 8)
      • 20. Guo, D., Luo, J., Zhang, L., et al: ‘Compressed neighbor discovery for wireless networks’, Perform. Eval., 2011, 70, (7–8), pp. 457–471.
    9. 9)
      • 2. Nur, F.N., Sharmin, S., Habib, M.A., et al: ‘Collaborative neighbor discovery in directional wireless sensor networks: algorithm and analysis’, EURASIP J. Wirel. Commun. Netw., 2017, 119, (1), pp. 1–15.
    10. 10)
      • 16. Biswas, K., Muthukkumarasamy, V., Singh, K.: ‘An encryption scheme using chaotic map and genetic operations for wireless sensor networks’, IEEE Sens. J., 2015, 15, (5), pp. 2801–2809.
    11. 11)
      • 10. Vasudevan, S., Adler, M., Goeckel, D., et al: ‘Efficient algorithms for neighbor discovery in wireless networks’, IEEE/ACM Trans. Netw., 2013, 21, (1), pp. 69–83.
    12. 12)
      • 4. Hong, S.N., Kim, J.: ‘A low-complexity algorithm for neighbor discovery in wireless networks’, IEEE Commun. Lett., 2014, 18, (7), pp. 1119–1122.
    13. 13)
      • 3. Wu, F., Tong, M., Li, A., et al: ‘Have you recorded my voice: toward robust neighbor discovery in mobile wireless networks’, IEEE/ACM Trans. Netw., 2018, 26, (3), pp. 1432–1445.
    14. 14)
      • 1. Zhang, R., Sun, J., Zhang, Y., et al: ‘Jamming-resilient secure neighbor discovery in mobile ad hoc networks’, IEEE Trans. Wirel. Commun., 2016, 14, (10), pp. 5588–5601.
    15. 15)
      • 15. Beirami, A., Nejati, H., Ali, W.H.: ‘Zigzag map: a variability-aware discrete-time chaotic-map truly random number generator’, Electron. Lett., 2013, 48, (24), pp. 1537–1538.
    16. 16)
      • 11. Russell, A., Vasudevan, S., Wang, B., et al: ‘Neighbor discovery in wireless networks with multipacket reception’, IEEE Trans. Parallel Distrib. Syst., 2015, 26, (7), pp. 1984–1998.
    17. 17)
      • 6. Guo, D., Zhang, L.: ‘Virtual full-duplex wireless communicationvia rapid on-off-division duplex’. Proc. Allerton Conf. Communication, Control, Computing, Monticello, IL, USA, 2010, pp. 412–419.
    18. 18)
      • 5. Sun, G., Wu, F., Gao, X., et al: ‘Time-efficient protocols for neighbor discovery in wireless ad hoc networks’, IEEE Trans. Veh. Technol., 2013, 62, (6), pp. 2780–2791.
    19. 19)
      • 19. Donoho, D.L.: ‘Compressed sensing’, IEEE Trans. Inf. Theory, 2006, 52, (4), pp. 1289–1306.
    20. 20)
      • 21. Chang, L.H., Wu, J.Y.: ‘An improved rip-based performance guarantee for sparse signal recovery via orthogonal matching pursuit’, IEEE Trans. Inf. Theory, 2014, 60, (9), pp. 405–408.
    21. 21)
      • 7. Zhang, L., Guo, D.: ‘Virtual full duplex wireless broadcasting via compressed sensing’, IEEE/ACM Trans. Netw., 2014, 22, (5), pp. 1659–1671.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2018.5127
Loading

Related content

content/journals/10.1049/iet-com.2018.5127
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address