Han et al., 2009 - Google Patents
Fault-tolerant relay node placement in heterogeneous wireless sensor networksHan et al., 2009
View PDF- Document ID
- 11442242784092873167
- Author
- Han X
- Cao X
- Lloyd E
- Shen C
- Publication year
- Publication venue
- IEEE Transactions on Mobile computing
External Links
Snippet
Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identical transmission radius. In contrast, this paper addresses the problem of deploying …
- 230000005540 biological transmission 0 abstract description 31
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/22—Arrangements for maintenance or administration or management of packet switching networks using GUI [Graphical User Interface]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
- H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Han et al. | Fault-tolerant relay node placement in heterogeneous wireless sensor networks | |
Egeland et al. | The availability and reliability of wireless multi-hop networks with stochastic link failures | |
Cooper et al. | The cover time of random geometric graphs | |
Fernandes et al. | Scalable vanet simulations with ns-3 | |
CN113706326B (en) | Mobile social network diagram modification method based on matrix operation | |
Qureshi et al. | Attack resistance-based topology robustness of scale-free internet of things for smart cities | |
Draz et al. | Energy efficient watchman based flooding algorithm for IoT‐enabled underwater wireless sensor and actor networks | |
Pereira et al. | Branch‐and‐cut algorithms for the‐arborescence star problem | |
Zhang et al. | Trade-off scheme for fault tolerant connected dominating sets on size and diameter | |
Tseng et al. | Reliable broadcast with trusted nodes: Energy reduction, resilience, and speed | |
Lu et al. | Skeleton construction in mobile social networks: Algorithms and applications | |
Koskinen et al. | On improving connectivity of static ad-hoc networks by adding nodes | |
Busch et al. | Improved sparse covers for graphs excluding a fixed minor | |
Lu | Fast methods for designing circulant network topology with high connectivity and survivability | |
Krol et al. | Extending network coverage by using static and mobile relays during natural disasters | |
Wu et al. | Chance discovery based security service selection for social P2P based sensor networks | |
Cvetkovski et al. | On the choice of a spanning tree for greedy embedding of network graphs | |
Rohrer et al. | Path diversification for future internet end-to-end resilience and survivability | |
Balaji et al. | Total dominating set based algorithm for connected dominating set in Ad hoc wireless networks | |
Das et al. | A network planning and management tool for mitigating the impact of spatially correlated failures in infrastructure networks | |
Zou et al. | Reducing the vulnerability of network by inserting modular topologies | |
Hou et al. | Novel routing algorithms in space information networks based on timeliness-aware data mining and time-space graph | |
Srinivasagopalan et al. | An oblivious spanning tree for single-sink buy-at-bulk in low doubling-dimension graphs | |
Zhang et al. | Construction of Virtual Backbone with Multiple Factors Constraints in Wireless Ad-hoc Network. | |
Sakaguchi et al. | Analysis of constrained random WayPoint mobility model on graph |