篮球竞彩胜负 :CIMSՓĵ

򾺲 www.fasfz.com  

oWjw}еĿ\ģʽ

ע⣺ՓڡcQߡ 2006,21(10):1119-1123,1133l
ʹՈעՓij̎
갂1,2 |1 ں1 ם12
(1.ЇƌWԺԄӻо110016 2.ЇƌWԺ оԺ100080)

ժҪ:оoWjеĸw}, @WjĹ܃ԼԵȆ}ʮҪ x. еĂģͺExpo sure ģ, oόHģ, ģͱڷӋ. o Ŀ˵c, ʹֵСExpo sure ֵ\ӷ; oĿ˵ʺ\Еrg, ʹEx2 po sure ֵ\ģʽ. Expo sure ķˌw}ķ. YCՓ_.
PI~: Wj; w; Exposure
̖TP212 īIRaA
¾̖: 100120920 (2006) 1021119205

Optimal Moving Path in the Sensor Network Coverage Problem

ZANG Chuan-zhi LIANG Wei YU Hai-bin Bia Yinjie
(1Shenyang Institute AutomationChinese Academy of SciencesShenyang 110016
2Graduate School of the Chinese Academy of SciencesBeijing 100049China)

Abstract: In a sensor network, the coverage p roblem is very important to the energy consumpt ion, network performance and sensor deployment. A new sensor model and an exposure model are defined which are more reasonable and comprehensible than the existing ones. Furthermore, the new models are more convenient for analysis and computation. For the given target starting position, two directions are identified which enable the target to get themaximal and minimal expo sure values respect ively. If the target velocity and moving time are given, the maximal moving
model is identified which produces the maximal exposure value. The simulations show the accuracy of the results.
Keywords:Sensor network; Coverage; Exposure

1g[PDFʽȫҪʹܛAbode Acrobat(ܛ^󲢳Ҋ,վṩd)

2dՓȫՈcI顱ʹÔcmܛd(182KB)


վ䛵ıߵՓģ

1ڶwՓFoWjĿ˱Oҕc׷ۙIJ

2oWjлƄwĿ׷ۙ

3oWjӑBfͬ΄շC

4Target Tracking based on the Dynamic Cluster Method in the Acoustic Sensor Network

5The critical speeds and radii for converage in sensor networks

6The Probabilistic Analysis of Distance Estimators in Wireless Sensor Network

PՓՈcվ<<<վȫ>>>

gӭӑՓlՓļоIĿ
(Ոڰlԕrژ}ʹcuՓĵ}Ŀо@ӷҞg[)

| CIMSՓ | й | ̓M | | Փ | Ŀ_l | WgYԴ | վȫ | MՓľWվȫ |

line.gif (4535 ֹ)

˸õĞҷgӭӱվͶƱ{

򾺲 Ոc

վ򾺲 gӭL

ע⣺վδSDd

All rights reserved, all contents copyright 2000-2019
վ20003¿WL