Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 30 for “"Node density"”.

  1. Performance Analysis of New Algorithms for Routing in Mobile Ad-hoc Networks. The development and performance evaluation of some new routing algorithms for mobile ad-hoc networks based on the concepts of angle direction and node density.

    … the angles (directions) of the adjacent mobile nodes and also the node density. In choosing the next node in forming a route, the neighbour node with the closest heading angle to that of the node of interest is selected, so the connection between the source and the destination consists of a …

    bradford Repository record for Performance Analysis of New Algorithms for Routing in Mobile Ad-hoc Networks. The development and performance evaluation of some new routing algorithms for mobile ad-hoc networks based on the concepts of angle direction and node density. (opens in a new tab)

  2. Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency

    … network, which consists of stationary sensor nodes, usually has a data sink because of the limitation on processing capability of sensor nodes. The data traffic of the entire network is directional towards the sink. This directional traffic burdens the nodes/clusters differently according to …

    cape-town Repository record for Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency (opens in a new tab)

  3. Bandwidth and Energy-Efficient Route Discovery for Noisy Mobile Ad-Hoc Networks

    … request (RREQ) packet is broadcast by the source node and each receiving node rebroadcasts it. This continues until the RREQ packet arrives at the destination node. Pure flooding generates excessive redundant routing traffic that may lead to the broadcast storm problem (BSP) and deteriorate the …

    de-montfort Repository record for Bandwidth and Energy-Efficient Route Discovery for Noisy Mobile Ad-Hoc Networks (opens in a new tab)

  4. Design considerations for fixed node assisted multi-hop mobile sensor networks

    Node mobility in Wireless Sensor Network poses a challenge to the routing protocol; it causes link breakages and disconnections between the nodes. This instability in the network leads to a drop in the successful transmission of data packets to the main station. In order to understand the key …

    uoit Repository record for Design considerations for fixed node assisted multi-hop mobile sensor networks (opens in a new tab)

  5. Automated Quadrilateral Coarsening by Ring Collapse

    … regions of the mesh with higher and lower node density. Mesh adaptation has received extensive study in both computational mechanics and computer graphics to increase the resolution or accuracy of the solution in specific areas. The algorithm developed in this thesis, the Automated …

    byu Repository record for Automated Quadrilateral Coarsening by Ring Collapse (opens in a new tab)

  6. Design of Sensor Networks for Detection Applications via Large -Deviation Theory

    … are envisioned to contain legions of wireless nodes. As such, asymptotic regimes where the number of nodes becomes large are important tools in identifying design guidelines for future sensor systems. This work presents interesting applications of large-deviation theory and asymptotic analysis …

    uiuc Repository record for Design of Sensor Networks for Detection Applications via Large -Deviation Theory (opens in a new tab)

  7. A performance analysis of ad-hoc ocean sensor network

    … protocol has been studied based on variations in node density, mobility as well as loading conditions. The mobility model selected for the simulation has considered the ocean effects on the mobile nodes, in particular the surface current. However, the available mobility models (Random Waypoint, …

    nps Repository record for A performance analysis of ad-hoc ocean sensor network (opens in a new tab)

  8. Topologies for ad-hoc networks utilizing directional antennas with restricted fields of view

    … being lost simultaneously. Scenes with varying node density, number of terminals per node, fields of view, and re-targeting delays are used to test the algorithms against a wide range of possible situations.

    mit Repository record for Topologies for ad-hoc networks utilizing directional antennas with restricted fields of view (opens in a new tab)

  9. Energy-Efficient and Timely Event Reporting Using Wireless Sensor Networks

    … comprise hundreds of thousands of tiny sensor nodes with reduced node complexity, (2) are suitable to monitor an area of tens of square kilometers, (3) achieve a lifetime of several years. The deduced quantifiable relationships between key network parameters — e.g., node size, node density, …

    passau-thes Repository record for Energy-Efficient and Timely Event Reporting Using Wireless Sensor Networks (opens in a new tab)

  10. Hybrid probabilistic broadcast schemes for mobile ad hoc networks

    … The simplest approach is flooding, where each node retransmit every unique received packet exactly once on each outgoing link. Although flooding ensures that broadcast packet is received by all network nodes, it generates many redundant transmissions which can trigger high transmission …

    glasgow Repository record for Hybrid probabilistic broadcast schemes for mobile ad hoc networks (opens in a new tab)

  11. An Intrusion Detection Scheme for Wireless Mobile Ad hoc Networks based on DSDV Protocol

    … the unreliability of wireless links between nodes, possibility of mobile nodes being captured or compromised, break down of cooperative algorithms, all lead to increased vulnerability. No matter how supposedly secure a system is, unrelenting attackers eventually succeed in infiltrating it. …

    vt Repository record for An Intrusion Detection Scheme for Wireless Mobile Ad hoc Networks based on DSDV Protocol (opens in a new tab)

  12. Receiver-Assigned CDMA in Wireless Sensor Networks

    … of Things (IoT) that features extremely high node density, low data rates per node, and high network dependability. Applications such as industrial IoT, factory automation, vehicular networks, aviation, spacecraft and others will soon feature hundreds of low power, low data rate (1-15 kbps) …

    vt Repository record for Receiver-Assigned CDMA in Wireless Sensor Networks (opens in a new tab)

  13. Transient wave propagation on random fields with fractal and Hurst effects

    … equation. We then introduce disorder to the mass-density. We first evaluate the surface response of cellular automata to uncorrelated mass-density fields, known as white noise. The random fields vary in coarseness as compared to cellular automata's node density. Then, we evaluate the response of …

    uiuc Repository record for Transient wave propagation on random fields with fractal and Hurst effects (opens in a new tab)

  14. IP address auto-configuration for wireless ad-hoc networks

    In an ad hoc network, nodes collaborate to allow communication without the presence of network infrastructure. Lack of manual management in ad hoc networks means that automatic configuration is highly desirable. The need for automatic configuration capabilities will become significantly more …

    zulu Repository record for IP address auto-configuration for wireless ad-hoc networks (opens in a new tab)

  15. Cross-Layer Optimization and Distributed Algorithm Design for Frequency-Agile Radio Networks

    … impact of fundamental network settings, such as node density and traffic load, on the performance of partially overlapped channel based networks. We then propose a cross-layer radio resource allocation algorithm JSSRC (Joint Spectrum Sharing and end-to-end data Rate Control) that iteratively …

    vt Repository record for Cross-Layer Optimization and Distributed Algorithm Design for Frequency-Agile Radio Networks (opens in a new tab)

  16. Probabilistic route discovery for Wireless Mobile Ad Hoc Networks (MANETs)

    … the task of routing is distributed among network nodes which act as both end points and routers in a wireless multi-hop network environment. To discover a route to a specific destination node, existing on-demand routing protocols employ a broadcast scheme referred to as simple flooding whereby a …

    glasgow Repository record for Probabilistic route discovery for Wireless Mobile Ad Hoc Networks (MANETs) (opens in a new tab)

  17. To Shift or Not To Shift: Maximizing the Efficiency of a Wireless Sensor Network Using Multiple Sinks

    … efficient utilization of the life of the sensor node in a WSN is a critical problem. This is a problem since the sensor nodes closest to the sink node expend more energy because they send more messages, mostly for routing, than any other node on the network.</p> <p>This decreases the life of …

    usm Repository record for To Shift or Not To Shift: Maximizing the Efficiency of a Wireless Sensor Network Using Multiple Sinks (opens in a new tab)

  18. Game theoretic approach in routing protocols for wireless mobile ad hoc networks

    … the network, therefore all of the participating nodes relay packets for other nodes and perform routing if necessary. Because of the limitations in wireless transmission range, communication links could be multi-hop. Routing protocol is the most important element of MANET. Routing protocols for …

    windsor Repository record for Game theoretic approach in routing protocols for wireless mobile ad hoc networks (opens in a new tab)

  19. Hierarchical Clustering Techniques for Energy-efficient Algorithms in WSNs

    … (WSNs) with large number of micro-sensor nodes, successfully receiving all the useful data with unnecessary loss of energy is a major challenge. WSNs are extremely important for many applications in civil and military domains. Despite their use in many successful applications, the sensor …

    liverpool-jm Repository record for Hierarchical Clustering Techniques for Energy-efficient Algorithms in WSNs (opens in a new tab)

  20. Distortion-Tolerant Communications with Correlated Information

    … system performance. First, the optimum</p> <p>node density, i.e., the optimum number of nodes in a unit area, is identified by utilizing the spatial data correlation in the one- and two-dimensional wireless sensor networks (WSNs), under the</p> <p>constraint of fixed power per unit area. The …

    arkansas Repository record for Distortion-Tolerant Communications with Correlated Information (opens in a new tab)

Page 1 of 2