A velocity and neighbor density-based broadcast scheme in mobile ad hoc networks

Abstract

Broadcasting is a fundamental and essential data dissemination mechanism in Mobile Ad hoc NETworks (MANETs). This paper presents an efficient probability-based broadcast scheme. In the scheme, to accelerate the packets propagation, the nodes with higher velocity are selected with higher probability to rebroadcast the received packet. Moreover, to reduce transmission redundancy and collisions without decreasing packet delivery ratio, the rebroadcast probability at each node is dynamically and adaptively adjusted according to neighbor density. The velocity and neighbor density-based rebroadcast mechanism keeps the scheme insensitive to the ever-changing network environment, even to the high mobility environment. The theoretical analysis and the simulations show that the proposed scheme outperforms the existing broadcast schemes in packet delivery ratio and normalized broadcast overhead, especially in average end-to-end delay.

Keywords

Rebroadcast probability normalized broadcast overhead average end-to-end delay packet delivery ratio

Get full access to this article

View all access options for this article.

References

[1]

Bako,

Kargl,

Schoch et al., Advanced adaptive gossiping using 2-hop neighborhood information, in: Proceedings of IEEE Global Telecommunications Conference, New Orleans, LA, USA, 2008, pp. 1–6.

[2]

Banerjee,

Misra,

Yeo et al., Energy-efficient broadcast and multicast trees for reliable wireless communication, in: Proceedings of IEEE Wireless Communications and Networking (WCNC), New Orleans, LA, USA, 2003, pp. 660–667.

[3]

Chen and

Kao, Game-based broadcast over reliable and unreliable wireless links in wireless multihop networks, IEEE Trans. on Mobile Computing 12(8) (2013), 1613–1624.

[4]

Grossglauser and

Tse, Mobility increases the capacity of ad hoc wireless networks, IEEE/ACM Trans. on Networking 10(4) (2002), 477–486.

[5]

Z.J.

Haas,

J.Y.

Halpern and

Li, Gossip-based ad hoc routing, IEEE/ACM Trans. on Networking 14(3) (2006), 479–491.

[6]

Z.J.

Haas and

M.V.

Nikolov, Towards optimal broadcast in wireless networks, in: Proceedings of the 14th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, ACM, New York, NY, 2011, pp. 213–222.

[7]

Ho,

Obraczka,

Tsudik et al., Flooding for reliable multicast in multi-hop ad hoc networks, in: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM, New York, 1999, pp. 64–71.

[8]

Humoud,

Mackenzie and

Abdulai, Neighbourhood-aware counter-based broadcast scheme for wireless ad hoc networks, in: Proceedings of IEEE GLOBECOM Workshops, New Orleans, LA, USA, 2008, pp. 1–6.

[9]

Jetcheva,

Hu,

Maltz et al., A simple protocol for multicast and broadcast in mobile ad hoc networks, Internet-Draft, IETF MANET Working Group, 2001.

10.

[10]

Ke,

Yi and

Ren, Improved broadcast encryption schemes with enhanced security, Journal of Ambient Intelligence and Humanized Computing 6(1) (2015), 121–129.

11.

[11]

Khabbazian and

V.K.

Bhargava, Efficient broadcasting in mobile ad hoc networks, IEEE Trans. on Mobile Computing 8(2) (2009), 231–245.

12.

[12]

Khabbazian,

Blake and

Bhargava, Local broadcast algorithms in wireless ad hoc networks: reducing the number of transmissions, IEEE Trans. on Mobile Computing 11(3) (2012), 402–413.

13.

[13]

Khelil,

Becker,

Tian et al., An epidemic model for information diffusion in MANETs, in: Proceedings of the 5th ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems, ACM, New York, NY, 2002, pp. 54–60.

14.

[14]

Liarokapis,

Shahrabi and

Komninos, Diba: an adaptive broadcasting scheme in mobile ad hoc networks, in: Proceedings of Communication Networks and Services Research Conference, Moncton, NB, Canada, 2009, pp. 224–231.

15.

[15]

Lin and

Jan, A tree-based scheme for security of many-to-many communications, Journal of High Speed Networks 16(1) (2007), 69–79.

16.

[16]

Liu,

Wan,

Jia et al., Efficient flooding scheme based on 1-hop information in mobile ad hoc networks, in: Proceedings of IEEE INFOCOM, Catalunya, Spain, 2006, pp. 1–12.

17.

[17]

Lou and

Wu, Toward broadcast reliability in mobile ad hoc networks with double coverage, IEEE Trans. on Mobile Computing 6(2) (2007), 148–163.

18.

[18]

M.N.

Mariyasagayam,

Osafune and

Lenardi, Enhanced multi-hop vehicular broadcast (MHVB) for active safety applications, in: Proceedings of Seventh International Conference on ITS Telecommunications, Sophia Antipolis, France, 2007, pp. 1–6.

19.

[19]

Palmieri, Scalable service discovery in ubiquitous and pervasive computing architectures: a percolation-driven approach, Future Generation Computer Systems 29(3) (2013), 693–703.

20.

[20]

Palmieri and

Castiglione, Condensation-based routing in mobile ad-hoc networks, Mobile Information Systems 8(3) (2012), 199–211.

21.

[21]

Perkins ,

Belding-Royer and

Das, Ad hoc on-demand distance vector (AODV) routing, RFC 3561, IETF, 2003.

22.

[22]

D.G.

Reina,

J.M.

Leon-Coca,

S.L.

Toral et al., Multi-objective performance optimization of a probabilistic similarity/dissimilarity-based broadcasting scheme for mobile ad hoc networks in disaster response scenarios, Soft Computing 18(9) (2014), 1745–1756.

23.

[23]

F.J.

Ros,

P.M.

Ruiz and

Stojmenovic, Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad hoc networks, IEEE Trans. on Mobile Computing 11(1) (2012), 33–46.

24.

[24]

Slavik and

Mahgoub, Spatial distribution and channel quality adaptive protocol for multihop wireless broadcast routing in VANET, IEEE Trans. on Mobile Computing 12(4) (2013), 722–734.

25.

[25]

Stojmenovic,

Seddigh and

Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, IEEE Trans. on Parallel and Distributed Systems 13(1) (2002), 14–25.

26.

[26]

Tao,

Lu and

Yang, An adaptive energy-aware multi-path routing protocol with load balance for wireless sensor networks, Wireless Personal Communications 63(4) (2012), 823–846.

27.

[27]

Tseng,

Ni,

Chen and

Sheu, The broadcast storm problem in a mobile ad hoc network, Wireless Networks 8(2–3) (2002), 153–167.

28.

[28]

Tseng,

Ni and

Shih, Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network, IEEE Trans. on Computers 52(5) (2003), 545–557.

29.

[29]

Wang,

Lu,

Jia et al., Reliable gossip-based broadcast protocol in mobile ad hoc networks, in: Proceedings of Mobile Ad-Hoc and Sensor Networks, Wuhan, China, 2005, pp. 207–218.

30.

[30]

Wu and

Li, Intelligent broadcast in wireless ad hoc networks using live packet information, in: Proceedings of 9th International Conference on Information, Communications and Signal Processing, Tainan, Taiwan, China, 2013, pp. 1–5.

31.

[31]

Wu and

Dai, Broadcasting in ad hoc networks based on self-pruning, in: Proceedings of INFOCOM, San Francisco, CA, USA, 2003, pp. 2240–2250.

32.

[32]

Xue and

Kumar, The number of neighbors needed for connectivity of wireless networks, Wireless Networks 10(2) (2004), 169–181.

33.

[33]

M.B.

Yassein,

S.F.

Nimer and

A.Y.

Al-Dubai, A new dynamic counter-based broadcasting scheme for mobile ad hoc networks, Simulation Modelling Practice and Theory 19(1) (2011), 553–563.

34.

[34]

X.M.

Zhang,

E.B.

Wang,

J.J.

Xia et al., A neighbor coverage-based probabilistic rebroadcast for reducing routing overhead in mobile ad hoc networks, IEEE Trans. on Mobile Computing 12(3) (2013), 424–433.