Euro-Par 2004 Parallel Processing

DOI10.1007/B99409MaRDI QIDQ5311360zbMATH OpenOpenAlexFDO

Authors J. Urrutia, Evangelos Kranakis, D. Krizanc

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99409

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Coverage Problem of Wireless Sensor Networks
• Covering a planar region by randomly distributed sensors
• Coverage by directional sensors in randomly deployed wireless sensor networks
• Coverage by randomly deployed wireless sensor networks
• Principles of Distributed Systems

Cited in

(7)

• STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE
• On the theta-coverage and connectivity of large random networks
• Coverage Problem of Wireless Sensor Networks
• Multiple Round Random Ball Placement: Power of Second Chance
• How many wireless sensors are needed to guarantee connectivity of a one-dimensional network with random inter-node spacing?
• Coverage by directional sensors in randomly deployed wireless sensor networks
• Priority-based target coverage in directional sensor networks using a genetic algorithm

This page was built for publication: Euro-Par 2004 Parallel Processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311360)