篮球竞彩分析* :CIMSՓĵ

򾺲 www.fasfz.com  

oWjӑBfͬ΄շC

ע⣺ՓڡϢcơ 2006,35(2):189-192,200l
ʹՈעՓij̎
ꐄϼ1,2 갂1,2 |1 ں1
(1.ЇƌWԺԄӻо110016 2.ЇƌWԺ оԺ100080)

ժҪ:ԟoWjĿ׷ۙ鱳һNٲõĄӑB“˅fͬ΄շCˬFЄӑB“˵γəC˄ӑB“˵ĽY˳ɹˆT™CF˄ӑB΄շĶڽĵͬr˾WjܣڷٲõĄӑB“˅fͬ΄շCcFеĻڰĄӑB“˙CMб^C˻ٲõĄӑB“˙Cܺĺ׷ܷۙă ݣ
PI~: oWj΄շٲӑB“
̖TP393 īIRaA
¾̖1002-041 1(2006)02-0189-04

Optimal Moving Path in the Sensor Network Coverage Problem

Chen Jianxia1,2 ZANG Chuan-zhi1,2 LIANG Wei1 YU Hai-bin1
(1Shenyang Institute AutomationChinese Academy of SciencesShenyang 110016
2Graduate School of the Chinese Academy of SciencesBeijing 100049China)

Abstract: A mediation based dynamic coalition task allocation scheme for single target tracking in wireless sensor networks is presentedwhich simplifies the negotiating process of coalition in the present schemeSuccess ratio of the coalition formation is increasedA coalition member updating scheme is introduced to realize dynamic task allocation.The energy consumption is reduced and the perform ance of the network is improved as wel1.The mediationbased dynamic coalition task allocation scheme is compared with the case-based reasoning one in simulationsand the result demonstrates that the former one is advantageous in energy consumptions and tracking quality.
Keywords: wireless sensor networktask allocationmediationdynamic coalition

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

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


վ䛵ıߵՓģ

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

2oWjлƄwĿ׷ۙ

3oWjw}еĿ\ģʽ

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