Abstract
There are many parameters that govern data flows in wireless networks, among them: mobility usage, service, and connectivity. The connectivity between nodes clearly has a strong influence on the way data passes between nodes and the total data traffic possible in the entire network. Unlike wireline networks, where increased connectivity generally leads to increased flow, in wireless networks increased connectivity can also lead to increased interference and the therefore possibly reduced flow. I discuss a modrl where connectivity is driven by a purely random event such as the existence of an obstacle, and show how the choice of random event can have a large influence on traffic flows in a wireless network. Using graph-theoretic tools, I give some implications for an optimal amount of connectivity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
