Article

Analysis of hop-distance relationship in spatially random sensor networks

Authors:

Serdar Vural,

Eylem EkiciAuthors Info & Claims

MobiHoc '05: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing

Pages 320 - 331

https://doi.org/10.1145/1062689.1062730

Published: 25 May 2005 Publication History

Get Access

Abstract

In spatially random sensor networks, estimating the Euclidean distance covered by a packet in a given number of hops carries a high importance for various other methods such as localization and distance estimations. The inaccuracies in such estimations motivate this study on the distribution of the Euclidean distance covered by a packet in spatially random sensor networks in a given number of hops. Although a closed-form expression of distance distribution cannot be obtained, highly accurate approximations are derived for this distribution in one dimensional spatially random sensor networks. Using statistical measures and numerical examples, it is also shown that the presented distribution approximation yields very high accuracy even for small number of hops. A discussion on how these principles can be extended to the analysis of the same problem in two dimensional networks is also provided.

References

[1]

Y. Cheng and T. Robertazzi. Critical connectivity phenomena in multihop radio models. IEEE Transactions on Communications, 37:770--777, July 1989.

Crossref

Google Scholar

[2]

A. Hyvärinen, J. Karhunen, and E. Oja. Independent Component Analysis. John Wiley & Sons, 2001.

Google Scholar

[3]

G. Korkmaz, E. Ekici, F. Ozguner, and U. Ozguner. Urban multi-hop broadcast protocols for inter-vehicle communication systems. In Proceedings of First ACM Workshop on Vehicular Ad Hoc Networks (VANET 2004), pages 76--85, October 2004.

Digital Library

Google Scholar

[4]

R. Nagpal, H. Shrobe, and J. Bachrach. Organizing a global coordinate system from local information on an ad hoc sensor network. In 2nd International Workshop on Information Processing in Sensor Networks (IPSN '03), April 2003.

Digital Library

Google Scholar

[5]

D. Niculescu and B. Nath. Ad hoc positioning system (aps). In IEEE GlobeCom, November 2001.

Crossref

Google Scholar

[6]

D. Niculescu and B. Nath. Dv based positioning in ad hoc networks. Telecommunication Systems, 22(1-4):267--280, 2003.

Digital Library

Google Scholar

[7]

C. Savarese, J. Rabay, and K. Langendoen. Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In Proceedings of the General Track: 2002 USENIX Annual Technical Conference, pages 317--327, 2002.

Digital Library

Google Scholar

[8]

S. Vural and E. Ekici. Wave addressing for dense sensor networks. In Proceedings of Second International Workshop on Sensor and Actor Network Protocols and Applications (SANPA 2004), pages 56--66, August 2004.

Google Scholar

Cited By

View all

Shamoun SLi FCoutinho R(2019)Distributed Learning of Hop Count Distributions in Ad Hoc NetworksProceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access10.1145/3345770.3356745(57-62)Online publication date: 25-Nov-2019
https://dl.acm.org/doi/10.1145/3345770.3356745
Jo BKhan R(2018)An Internet of Things System for Underground Mine Air Quality Pollutant Prediction Based on Azure Machine LearningSensors10.3390/s1804093018:4(930)Online publication date: 21-Mar-2018
https://doi.org/10.3390/s18040930
Ataei MKunz TBanihashemi A(2015)Localization and Location Verification in Non-Homogeneous One-Dimensional Wireless Ad-Hoc NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2015.243028033:7(1304-1316)Online publication date: Jul-2015
https://doi.org/10.1109/JSAC.2015.2430280
Show More Cited By

Index Terms

Analysis of hop-distance relationship in spatially random sensor networks
1. Applied computing
  1. Physical sciences and engineering
2. Mathematics of computing
  1. Mathematical analysis
    1. Integral equations
  2. Probability and statistics
    1. Distribution functions

Recommendations

Single versus multi-hop wireless reprogramming in sensor networks
TridentCom '08: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities

Wireless reprogramming of the sensor network is useful for uploading new code or for changing the functionality of the existing code. In recent years, the research focus has shifted from single hop reprogramming to multi-hop reprogramming primarily ...
Probability distribution of multi-hop-distance in one-dimensional sensor networks

In spatially random sensor networks, estimating the Euclidean distance covered by a packet in a given number of hops carries a high importance for various functions such as localization and distance estimations. The inaccuracies in such estimations ...
An efficient cluster-based communication protocol for wireless sensor networks

A wireless sensor network is a network of large numbers of sensor nodes, where each sensor node is a tiny device that is equipped with a processing, sensing subsystem and a communication subsystem. The critical issue in wireless sensor networks is how ...

Comments

Information & Contributors

Information

Published In

MobiHoc '05: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing

May 2005

470 pages

ISBN:1595930043

DOI:10.1145/1062689

General Chair:
P. R. Kumar
University of Illinois at Urbana-Champaign, Urbana, IL
,
Program Chairs:
Andrew T. Campbell
Columbia University
,
Rogert Wattenhofer
ETH Zurich, Switzerland

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 May 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MobiHoc05

Sponsor:

MobiHoc05: The Sixth ACM International Symposium on Mobile Ad Hoc Networking and Computing 2005

May 25 - 27, 2005

IL, Urbana-Champaign, USA

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
764
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shamoun SLi FCoutinho R(2019)Distributed Learning of Hop Count Distributions in Ad Hoc NetworksProceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access10.1145/3345770.3356745(57-62)Online publication date: 25-Nov-2019
https://dl.acm.org/doi/10.1145/3345770.3356745
Jo BKhan R(2018)An Internet of Things System for Underground Mine Air Quality Pollutant Prediction Based on Azure Machine LearningSensors10.3390/s1804093018:4(930)Online publication date: 21-Mar-2018
https://doi.org/10.3390/s18040930
Ataei MKunz TBanihashemi A(2015)Localization and Location Verification in Non-Homogeneous One-Dimensional Wireless Ad-Hoc NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2015.243028033:7(1304-1316)Online publication date: Jul-2015
https://doi.org/10.1109/JSAC.2015.2430280
Engmann FAbdulai JAzasoo J(2015)Improving on the Reliability of Wireless Sensor NetworksProceedings of the 2015 15th International Conference on Computational Science and Its Applications10.1109/ICCSA.2015.18(87-91)Online publication date: 22-Jun-2015
https://dl.acm.org/doi/10.1109/ICCSA.2015.18
Wei QZhong DHan J(2014)Improved localisation method based on multi-hop distance unbiased estimationIET Communications10.1049/iet-com.2014.02638:16(2797-2804)Online publication date: 6-Nov-2014
https://doi.org/10.1049/iet-com.2014.0263
Joe IChung S(2012)The distance-power consumption trade-off with the optimal number of relays for cooperative Wireless Sensor NetworksInternational Journal of Ad Hoc and Ubiquitous Computing10.1504/IJAHUC.2012.0455529:2(104-110)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1504/IJAHUC.2012.045552
Nath SEkambaram VKumar AKumar P(2012)Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networksACM Transactions on Sensor Networks10.1145/2240116.22401248:4(1-38)Online publication date: 25-Sep-2012
https://dl.acm.org/doi/10.1145/2240116.2240124
Wang YKelly BZhou A(2012)Hop Distance Analysis in Partially Connected Wireless Sensor NetworksProceedings of the 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems10.1109/MASCOTS.2012.28(161-168)Online publication date: 7-Aug-2012
https://dl.acm.org/doi/10.1109/MASCOTS.2012.28
Behnad ANader-Esfahani S(2011)On the Statistics of MFR Routing in One-Dimensional Ad Hoc NetworksIEEE Transactions on Vehicular Technology10.1109/TVT.2011.216265560:7(3276-3289)Online publication date: Sep-2011
https://doi.org/10.1109/TVT.2011.2162655
Szczytowski PKhelil AAli ASuri N(2011)TOM: Topology oriented maintenance in sparse Wireless Sensor Networks2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks10.1109/SAHCN.2011.5984941(548-556)Online publication date: Jun-2011
https://doi.org/10.1109/SAHCN.2011.5984941
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Single versus multi-hop wireless reprogramming in sensor networks

Probability distribution of multi-hop-distance in one-dimensional sensor networks

An efficient cluster-based communication protocol for wireless sensor networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations