The effective radius model for multi-hop wireless networks

Authors:
Liran Ma;Weidong Jiang;Kai Xing;E. K. Park
Affiliations:
Department of Computer Science, The George Washington University, Washington D.C., U.S.A;Institute of Electronic Science and Engineering, The National University of Defense Technology, P.R. China;Department of Computer Science, The George Washington University, Washington D.C., U.S.A;Computer Science and Electrical Engineering Department, School of Computing and Engineering, University of Missouri at Kansas City, Kansas City, MO, U.S.A
Venue:
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Year:
2006

Citing 11
Cited 0

DSR: the dynamic source routing protocol for multihop wireless ad hoc networks

Ad hoc networking
Performance of multipath routing for on-demand protocols in mobile ad hoc networks

Mobile Networks and Applications
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Topology management for sensor networks: exploiting latency and density

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Fault tolerant deployment and topology control in wireless networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Topology control for wireless sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
The number of neighbors needed for connectivity of wireless networks

Wireless Networks
Toward resilient security in wireless sensor networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
The Strange Logic of Random Graphs

The Strange Logic of Random Graphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a novel model, termed as Effective Radius (ER), to calculate the expected number of t-hop neighbors in a multi-hop wireless network with a uniform node distribution on the average. This ER model is an analytical tool that recursively computes a t-hop effective radius for t=2, 3, ⋯. The total number of nodes covered by the disk with a t-hop effective radius equals to the expected number of nodes reachable through at most t hops in the original physical topology. We conduct extensive simulation studies to validate our model and the results demonstrate that the ER model is accurate and can be adaptive to different deployment scenarios. Our findings have interesting applications to the design and evaluation of multi-hop wireless networks.