Discrete Mathematics - Topics on domination
Randomized algorithms
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Approximating layout problems on random geometric graphs
Journal of Algorithms
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
Smart dust protocols for local detection and propagation
Proceedings of the second ACM international workshop on Principles of mobile computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient and reliable high level communication in randomly deployed wireless sensor networks
Proceedings of the second international workshop on Mobility management & wireless access protocols
Towards a dynamical model for wireless sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
The chromatic and clique numbers of random scaled sector graphs
Theoretical Computer Science - Graph colorings
On node isolation in directional sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
The distant-2 chromatic number of random proximity and random geometric graphs
Information Processing Letters
High level communication functionalities for wireless sensor networks
Theoretical Computer Science
Large independent sets in general random intersection graphs
Theoretical Computer Science
The plasma free space optical model for ubiquitous systems
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Expander properties and the cover time of random intersection graphs
Theoretical Computer Science
Random models for geometric graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
The second eigenvalue of random walks on symmetric random intersection graphs
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Security-aware routing and localization for a directional mission critical network
IEEE Journal on Selected Areas in Communications
Algorithms for wireless sensor networks: design, analysis and experimental evaluation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Models and algorithms for wireless sensor networks (smart dust)
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A distributed algorithm to find hamiltonian cycles in g(np) random graphs
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
| Hi-index | 0.00 |
The main contribution of this paper is presenting a new model for Smart Dust networks communicating through optical links and showing its applicability when the goal of the network is monitoring an area under the surveillance of a base station. We analyze the basic parameters of these networks as a new model of random graphs and propose simple distributed protocols for basic communication. These protocols are designed to minimize the energy consumption.