Abstract
Wireless sensor networks are integration of sensors, MicroElectroMechanical Systems(MEMS) and wireless communication techniques. It has a wide application future. Military, academia and industries are very interested in it. On the assumption that every node has a fixed radio range, how many nodes can connect to one and two vertices connectivity connected graph network in a fixed area are researched. Those questions are answered through computer simulation. Nodes are randomly deployed and the network connectivity is tested. The relations among the node number, radio range and the connectivity celiability are given. The curves are transformed to logarithm and regressed. Experiment formulas of one vertex and two vertices connectivity probability are given. The experiment formulas are exactly coincident to original date. Those are a guidance of calculating nodes number and radio range in the wireless sensor networks designing.
Original language | English (US) |
---|---|
Pages (from-to) | 379-385 |
Number of pages | 7 |
Journal | Chinese Journal of Sensors and Actuators |
Volume | 17 |
Issue number | 3 |
State | Published - 2004 |
Keywords
- Ad hoc networks
- Articulation point
- Connected graph
- Vertex connectivity
- Wireless sensor networks
ASJC Scopus subject areas
- Control and Systems Engineering
- Electrical and Electronic Engineering