Assessment of service traffic dependences in Ad-hoc networks

Authors

DOI:

https://doi.org/10.18372/2073-4751.84.20903

Keywords:

ad-hoc networks, service traffic, routing, node density, wireless networks, AODV, ND-AODV, information entropy, scalability

Abstract

The article devoted to the problem of excessive service traffic in wireless ad-hoc networks, which arises due to the lack of a fixed infrastructure, dynamic topology, and limited node resources. Service traffic is interpreted from an information-theoretic point of view as a mechanism for reducing uncertainty about the network state. A mathematical model is proposed that relates the intensity of service traffic to the number and density of nodes, the level of interference, and the signal-to-noise ratio in communication channels. It is shown that for a fixed deployment area, an increase in node density leads to a superlinear, close to quadratic, increase in network management overhead. Special attention is paid to the possibilities of reducing the effective node density due to algorithmic routing mechanisms, in particular, approaches such as ND-AODV, which allow significantly reducing the volume of service traffic in dense networks. The results obtained can be used to assess the scalability of ad-hoc networks and develop more effective management protocols.

References

T. Cover and J. Thomas, Elements of Information Theory, 2nd ed. Wiley, 2006.

A. Goldsmith, Wireless Communications. Cambridge University Press, 2005.

N. Bisnik and A. A. Abouzeid, “On the capacity deficit of mobile wireless ad hoc networks: A rate-distortion formulation,” IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5737–5751, Dec. 2009.

N. Bisnik, A. A. Abouzeid, and R. G. Maunder, “Bounds on the overhead of geographic routing in mobile ad hoc networks,” IEEE/ACM Transactions on Networking, vol. 19, no. 1, pp. 136–149, Feb. 2011.

P. Gupta and P. R. Kumar, “The capacity of wireless networks,” IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388–404, Mar. 2000.

E. M. Royer and C. E. Perkins, “An implementation study of the AODV routing protocol,” IEEE Wireless Communications and Networking Conference (WCNC), 2000.

S. Murthy and J. J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” Mobile Networks and Applications, vol. 1, no. 2, pp. 183–197, 1996.

S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The broadcast storm problem in a mobile ad hoc network,” ACM/IEEE MobiCom, 1999.

Y. Sasson, D. Cavin, and A. Schiper, “Probabilistic broadcast for flooding in wireless mobile ad hoc networks,” IEEE Wireless Communications and Networking Conference, 2003.

V. Kawadia and P. R. Kumar, “A cautionary perspective on cross-layer design,” IEEE Wireless Communications, vol. 12, no. 1, pp. 3–11, Feb. 2005.

M. Conti and S. Giordano, “Mobile ad hoc networking: Milestones, challenges, and new research directions,” IEEE Communications Magazine, vol. 52, no. 1, pp. 85–96, Jan. 2014.

J. Zhai and Y. Fang, “Physical carrier sensing and spatial reuse in multirate and multihop wireless ad hoc networks,” IEEE INFOCOM, 2006.

K. Fall and K. Varadhan (eds.), The ns Manual, The VINT Project, 2011.

M. Grossglauser and D. Tse, “Mobility increases the capacity of ad hoc wireless networks,” IEEE/ACM Transactions on Networking, vol. 10, no. 4, pp. 477–486, Aug. 2002.

Published

2025-12-30

How to Cite

Teleshko, I. (2025). Assessment of service traffic dependences in Ad-hoc networks. Problems of Informatization and Management, 4(84), 131–137. https://doi.org/10.18372/2073-4751.84.20903

Issue

Section

Статті