Academic
Publications
On the minimum node degree and connectivity of a wireless multihop network

On the minimum node degree and connectivity of a wireless multihop network,10.1145/513800.513811,Christian Bettstetter

On the minimum node degree and connectivity of a wireless multihop network   (Citations: 350)
BibTex | RIS | RefWorks Download
This paper investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity. Both topology attributes depend on the spatial distribution of the nodes and their transmission range. Using typical modeling assumptions :--- :a random uniform distribution of the nodes and a simple link model :--- :we derive an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network. Equivalently, if the maximum r0 of the nodes is given, we can find out how many nodes are needed to cover a certain area with a k--connected network. We also investigate these questions by various simulations and thereby verify our analytical expressions. Finally, the impact of mobility is discussed.The results of this paper are of practical value for researchers in this area, e.g., if they set the parameters in a network--level simulation of a mobile ad hoc network or if they design a wireless sensor network.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...In terms of communication networks, the probability that no node is isolated in the multi-hop UV-C network depends on the node density, ‰, as well as the transmission range, r0, of every UV-C node and is given by [17]...
    • ...UV-C network has a minimum node degree dmin ‚ k is given by [17]...

    Alexander Vavoulaset al. Connectivity Issues for Ultraviolet UV-C Networks

    • ...In the following simulations, we consider a unit square deployment area [4], [5], [26]...

    Mauro Contiet al. Distributed Detection of Clone Attacks in Wireless Sensor Networks

    • ...For example, it has been shown that to ensure either 1-connectivity (there exists a path between any pair of nodes) [3], [4] or -connectivity (there exist at least node-disjoint paths between any pair of nodes) [5], the average number of neighbors of each node must increase with the network size...

    Wei Renet al. Connectivity of Heterogeneous Wireless Networks

    • ...[4] and [5] study the relation between the minimum node degree and -connectivity in a random graph and explore the minimum radio transmission range for achieving a fully connected ad hoc network for a given node density...
    • ...Let us label the vertices in the one-dimensional geometric graph from left to right as nodes 1, 2, 3, and so on. If there is an edge (communication link) between vertices (nodes) and , where , it directly implies there are edges between vertex and vertices located in between nodes and since those node pairs haveshorter Euclideandistances than that between nodes and . With reference to [4], a graph is said to be -connected if for each node ...

    Ivan Wang-Hei Hoet al. Stochastic model and connectivity dynamics for VANETs in signalized ro...

    • ...1) Simulation Setup: We assume the spectrum auction hosted by the auctioneer is deployed in a 1*1 square area, where nodes are uniformly distributed and connected [37], [38]...

    Miao Panet al. Purging the BackRoom Dealing: Secure Spectrum Auction Leveraging Paill...

Sort by: