research-article

Stochastic Modeling and Simulation for Redundancy and Coexistence in Graphs Resulting from Log-Normal Shadowing

Authors:

Steffen Böhmer,

Daniel Schneider,

Hannes FreyAuthors Info & Claims

MSWIM '19: Proceedings of the 22nd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

Pages 173 - 182

https://doi.org/10.1145/3345768.3355933

Published: 25 November 2019 Publication History

Abstract

Recent studies have identified redundancy and coexistence as a supporting graph structure for building connected intersection free planar drawings in wireless network graphs. Empirical evidence suggests that under certain conditions these properties can be assumed to hold with high probability. In this paper we advance insight on these probabilities with a rigorous stochastic treatment studying randomly generated network graphs pertaining to the log-normal shadowing model. We derive nested integral expressions to compute probabilities of redundancy and coexistence numerically under the standard uncorrelated log-normal shadowing model. For a recent model extension including correlation among network links our findings provide a means for efficient stochastic simulation of these probabilities. We illustrate numerical and simulation application of the derived formulae with a comprehensive parameter study for redundancy and coexistence under correlated and uncorrelated log-normal shadowing modeled randomly generated graphs. We also demonstrate how far support for these properties can be improved by artificially cutting communication distance while keeping the network well connected in terms of percolation bounds.

References

[1]

Piyush Agrawal and Neal Patwari. 2009. Correlated Link Shadow Fading in Multi-Hop Wireless Networks . IEEE Transactions on Wireless Communications, Vol. 8, 8 (2009), 4024--4036.

Digital Library

[2]

Lali Barrière, Pierre Fraigniaud, Lata Narayanan, and Jaroslav Opatrny. 2003. Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wireless Communications and Mobile Computing, Vol. 3, 2 (2003), 141--153.

[3]

Christian Bettstetter and Christian Hartmann. 2005. Connectivity of wireless multihop networks in a shadow fading environment . Wireless Networks, Vol. 11, 5 (2005), 571--579.

Digital Library

[4]

Prosenjit Bose, Pat Morin, Ivan Stojmenović, and Jorge Urrutia. 2001. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks . Wireless Networks, Vol. 7, 6 (nov 2001), 609--616.

Digital Library

[5]

Y. Deng and I. Stojmenovic. 2009. Partial Delaunay Triangulations Based Data-Centric Storage and Routing with Guaranteed Delivery in Wireless Ad Hoc and Sensor Networks. In 2009 Mexican International Conference on Computer Science. 24--32.

[6]

Qing Fang, Jie Gao, and L. J. Guibas. 2004. Locating and bypassing routing holes in sensor networks. In IEEE INFOCOM 2004, Vol. 4. 2458--2468 vol.4.

[7]

H. Frey, F. Ingelrest, and D. Simplot-Ryl. 2008. Localized minimum spanning tree based multicast routing with energy-efficient guaranteed delivery in ad hoc and sensor networks. In 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks. 1--8.

[8]

Jie Gao, Leonidas J Guibas, John Hershberger, Li Zhang, and An Zhu. 2001. Geometric spanner for routing in mobile networks. In Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '01 .

Digital Library

[9]

Jie Gao, L. J. Guibas, J. Hershberger, Li Zhang, and An Zhu. 2005. Geometric spanners for routing in mobile networks. IEEE Journal on Selected Areas in Communications, Vol. 23, 1 (Jan 2005), 174--185.

[10]

Qingfeng Huang, Chenyang Lu, and G. C. Roman. 2004. Reliable mobicast via face-aware routing. In IEEE INFOCOM 2004, Vol. 3. 2108--2118 vol.3.

[11]

Brad Karp and H. T. Kung. 2000. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking . 243--254.

[12]

Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger. 2008a. Ad hoc networks beyond unit disk graphs . Wireless Networks, Vol. 14, 5 (oct 2008), 715--729.

Digital Library

[13]

F. Kuhn, R. Wattenhofer, and A. Zollinger. 2008b. An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks. IEEE/ACM Transactions on Networking, Vol. 16, 1 (Feb 2008), 51--62.

Digital Library

[14]

X. Li, Y. Deng, V. Narasimhan, A. Nayak, and I. Stojmenovic. 2010. Localized address autoconfiguration in wireless ad hoc networks. In 2010 International Conference on Wireless Communications Signal Processing (WCSP). 1--6.

[15]

Xiang-Yang Li, G. Calinescu, and Peng-Jun Wan. 2002. Distributed construction of a planar spanner and routing for ad hoc wireless networks. In Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3. 1268--1277 vol.3.

[16]

Yujun Li and Yaling Yang. 2010. Asymptotic connectivity of large-scale wireless networks with a log-normal shadowing model. In IEEE Vehicular Technology Conference . IEEE, 1--5.

[17]

Emi Mathews. 2012. Planarization of Geographic Cluster-based Overlay Graphs in Realistic Wireless Networks. In 2012 Ninth International Conference on Information Technology - New Generations . 95--101.

[18]

Emi Mathews and Hannes Frey. 2010. Topological Cluster Based Geographic Routing in Multihop Ad Hoc Networks. In Proceedings of the Fourth International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies (UBICOMM). Florence, Italy, 342--345.

[19]

Emi Mathews and Hannes Frey. 2011. A Localized Planarization Algorithm for Realistic Wireless Networks. In Proceedings of the 11th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) .

Digital Library

[20]

Emi Mathews and Hannes Frey. 2012. A Localized Link Removal and Addition Based Planarization Algorithm. In Proceedings of the 13th International Conference on Distributed Computing and Networking (ICDCN). 337--350.

Digital Library

[21]

N. Mitton, D. Simplot-Ryl, and I. Stojmenovic. 2009. Guaranteed Delivery for Geographical Anycasting in Wireless Multi-Sink Sensor and Sensor-Actor Networks. In IEEE INFOCOM 2009. 2691--2695.

[22]

Florentin Neumann, Daniel Vivas Estevao, Frank Ockenfeld, Jovan Radak, and Hannes Frey. 2016. Short Paper: Structural Network Properties for Local Planarization of Wireless Sensor Networks. In Proceedings of the 15th International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW 2016), Vol. 9724. 229--233.

[23]

Sumesh J Philip, Joy Ghosh, Hung Q Ngo, and Chunming Qiao. 2006. Routing on Overlay Graphs in Mobile Ad Hoc Networks. In Proceedings of the IEEE Global Communications Conference, Exhibition & Industry Forum (GLOBECOM'06) .

[24]

Sylvia Rathnasamy, Brad Krap, Scott Shenker, Deborah Estrin, Ramesh Govindan, Li Yin, and Fang Yu. 2003. Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table. Mobile Networks and Applications, Vol. 8, 4 (Aug 2003), 427--442.

[25]

Juan A. Sanchez, Pedro M. Ruiz, Jennifer Liu, and Ivan Stojmenovic. 2007. Bandwidth-Efficient Geographic Multicast Routing Protocol for Wireless Sensor Networks . IEEE Sensors Journal, Vol. 7, 5 (may 2007), 627--636.

[26]

Mahtab Seddigh, Julio Solano González, and Ivan Stojmenovic. 2001. RNG and Internal Node Based Broadcasting Algorithms for Wireless One-to-one Networks. SIGMOBILE Mobile Computing and Communications Review, Vol. 5, 2 (April 2001), 37--44.

Digital Library

[27]

I. Stojmenovic. 2004. Geocasting with guaranteed delivery in sensor networks. IEEE Wireless Communications, Vol. 11, 6 (Dec 2004), 29--37.

Digital Library

[28]

Ivan Stojmenovic, Mahtab Seddigh, and Jovisa Zunic. 2002. Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks . IEEE Transactions on Parallel and Distributed Systems, Vol. 13, 1 (2002), 14--25.

Digital Library

[29]

Jindong Tan. 2008. A Scalable Graph Model and Coordination Algorithms for Mobile Sensor Networks .Springer US, Boston, MA, 65--83.

[30]

Hua-Wen Tsai, Chih-Ping Chu, and Tzung-Shi Chen. 2007. Mobile Object Tracking in Wireless Sensor Networks. Computer Communications, Vol. 30, 8 (June 2007), 1811--1825.

Digital Library

Cited By

Böltz LSofronie-Stokkermans VFrey H(2024)On the Verification of the Correctness of a Subgraph Construction AlgorithmVerification, Model Checking, and Abstract Interpretation10.1007/978-3-031-50524-9_14(303-325)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1007/978-3-031-50524-9_14
Böhmer SFrey H(2023)Percolation and Range Bounds in Log-Normal Shadowing Modeled NetworksICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10278797(1438-1443)Online publication date: 28-May-2023
https://doi.org/10.1109/ICC45041.2023.10278797
Böltz LBecker BFrey H(2021)Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and CoexistenceProcedia Computer Science10.1016/j.procs.2021.11.016195(108-117)Online publication date: 2021
https://doi.org/10.1016/j.procs.2021.11.016

Index Terms

Stochastic Modeling and Simulation for Redundancy and Coexistence in Graphs Resulting from Log-Normal Shadowing

Recommendations

Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence
Abstract
Connected plane graphs enable many local algorithmic solutions for data communication, task coordination and network maintenance in wireless sensor networks, sensor-actuator networks and distributed robotics. We study construction of such graphs ...
A New Approximate Closed-Form Distribution and Performance Analysis of a Composite Weibull/Log-Normal Fading Channel

The presence of both the fading and shadowing effects (also called composite multipath/shadowed fading) is often encountered in a realistic radio propagation scenario, thus, making it necessary to consider the simultaneous effect of fading and shadowing ...
Determining the Ordering of a Line Topology under Correlated Shadowing and Fast Fading
MSWiM '23: Proceedings of the Int'l ACM Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems

We study the success rate of detecting the ordering of a line topology under correlated shadowing and fast fading for two methods from the literature which rely on signal strength measurements only. First we propose a model extension of the so far only ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MSWIM '19: Proceedings of the 22nd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

November 2019

340 pages

ISBN:9781450369046

DOI:10.1145/3345768

General Chair:
Antonio A. F. Loureiro
Federal University of Minas Gerais, Brazil
,
Program Chairs:
Salil Kanhere
University of New South Wales, Australia
,
Paolo Bellavista
University of Bologna, Italy

Copyright © 2019 ACM.

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]

Sponsors

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 November 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Deutsche Forschungsgemeinschaft

Conference

MSWiM '19

Sponsor:

SIGSIM

MSWiM '19: 22nd Int'l ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

November 25 - 29, 2019

FL, Miami Beach, USA

Acceptance Rates

Overall Acceptance Rate 398 of 1,577 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
60
Total Downloads

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

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Böltz LSofronie-Stokkermans VFrey H(2024)On the Verification of the Correctness of a Subgraph Construction AlgorithmVerification, Model Checking, and Abstract Interpretation10.1007/978-3-031-50524-9_14(303-325)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1007/978-3-031-50524-9_14
Böhmer SFrey H(2023)Percolation and Range Bounds in Log-Normal Shadowing Modeled NetworksICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10278797(1438-1443)Online publication date: 28-May-2023
https://doi.org/10.1109/ICC45041.2023.10278797
Böltz LBecker BFrey H(2021)Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and CoexistenceProcedia Computer Science10.1016/j.procs.2021.11.016195(108-117)Online publication date: 2021
https://doi.org/10.1016/j.procs.2021.11.016

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.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten