Name
Abstract | ||
|---|---|---|
We describe a model for analysing the coverage graph from physical placement of mobile agents or sensor devices to improve coverage, fault tolerance and network lifetime. The planar graph for the devices is augmented by small-world network 'short-cuts'; the network then has properties intermediate between those of a fixed regular mesh and a random graph. Results from computational physics involving percolation and scaling phenomena help interpret network behaviours. Individual mobile sensors are modelled as points in Euclidean space with a circular region of influence and awareness; clustering algorithms are used to construct connectivity graphs which are analysed using conventional methods. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1504/IJWMC.2010.034213 | IJWMC |
Keywords | Field | DocType |
random graph,coverage graph,wireless agent sensor network,connectivity graph,optimal coverage,mobile agent,network behaviour,scaling,euclidean space,small-world network,individual mobile sensor,small-world effect,planar graph,percolation,network lifetime,wireless agents,fault tolerant,small world network,small world networks,sensor network,wireless sensor networks,clustering algorithms,connected graph,fault tolerance | Wireless network,Random graph,Spatial network,Computer science,Small-world network,Local area network,Cluster analysis,Wireless sensor network,Planar graph,Distributed computing | Journal |
Volume | Issue | Citations |
4 | 3 | 13 |
PageRank | References | Authors |
0.93 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. A. Hawick | 1 | 293 | 66.26 |
| H. A. James | 2 | 18 | 2.91 |