Bounds on hop distance in greedy routing approach in wireless ad hoc networks

Authors:
Swades De;Antonio Caruso;Tamalika Chaira;Stefano Chessa
Affiliations:
Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA.;Dipartimento di Matematica, University of Lecce, Collegio Fiorini, via Arnesano, 73100 Lecce, Italy/ Istituto di Scienza e Tecnologie dell;Informazione, Area della Ricerca, CNR di Pisa-/S.Cataldo, 56100 Pisa, Italy.;Department of Electronics and Electrical, Communication Engineering, Indian Institute of Technology, Kharagpur, West Bengal 721302, India.
Venue:
International Journal of Wireless and Mobile Computing
Year:
2006

Citing 12
Cited 10

Optimal transmission ranges for mobile communication in linear multihop packet radio networks

Wireless Networks - Special issue on performance evaluation methods for wireless networks
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
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
Performance of multihop wireless networks: shortest path is not enough

ACM SIGCOMM Computer Communication Review
Worst-Case optimal and average-case efficient geometric ad-hoc routing

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning

PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
Organizing a global coordinate system from local information on an ad hoc sensor network

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
A survey on position-based routing in mobile ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Analytical evaluation of virtual infrastructures for data dissemination in wireless sensor networks with mobile sink

Proceedings of the First ACM workshop on Sensor and actor networks
Binary waypoint geographical routing in wireless mesh networks

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Proactive data dissemination to mission sites

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
On average and maximum load of greedy routing in wireless ad hoc networks

WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Intervehicle-communication-assisted localization

IEEE Transactions on Intelligent Transportation Systems
Probability of k-hop connection under random connection model

IEEE Communications Letters
Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks

ACM Transactions on Sensor Networks (TOSN)
Airborne network: a cyber-physical system perspective

Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
Proactive data dissemination to mission sites

Wireless Networks
A stochastic process model of the hop count distribution in wireless sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless ad hoc networks are generally characterised by random node locations and multi-hop routes. A quantitative knowledge of the relation between hop count and Euclidean distance could provide a better understanding of important network parameters such as end-to-end delay, power consumption along the route, and node localisation. In this paper, we present an analytic approach to capture the statistics on hop count for a given source-to-destination Euclidean distance in a greedy routing approach. We also show that, for a given hop count, the bounds on Euclidean distance can be computed from the distribution characteristics of per-hop progress.