ppt講稿-集中式數(shù)據(jù)采集與通訊的無線傳感器網(wǎng)絡(luò)-預(yù)覽頁
【正文】 d rounds of datagathering。一、雙向鏈，無論網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)發(fā)生任何微小的變化，都可以自動調(diào)整適應(yīng)；二、單向鏈，用于處理有限圈數(shù)的數(shù)據(jù)收集；三、查詢鏈?zhǔn)怯脕韽囊恍└信d趣的 /有針對性的傳感器節(jié)點(diǎn)上收集數(shù)據(jù)。 antchain和雙向 antchain 單向 antchain是一個簡單的鏈?zhǔn)浇Y(jié)構(gòu)，在數(shù)據(jù)采集過程，其中的每一個節(jié)點(diǎn)都以同一個方向向其隔壁的節(jié)點(diǎn)傳輸數(shù)據(jù)，如圖二所示。 The advantage of employing a bidirection AntChain scheme for regular data collection is that it is able to detect the death of sensor nodes. When node i dies, its both neighbors will detect it because no message is received from node i. After receiving data from their only remaining neighbor, each of them (nodes i – 1 and i+1) will activate itself as a chain head (or tail) and send data directly to the base station. By this means, there are no larger amount data losses due to the dead node. The base station will know the death of this particular node when the message from its neighbors is received and it is able to make decisions of reconfiguration. WSN的應(yīng)用 應(yīng)用螞蟻鏈算法的 WSN進(jìn)行數(shù)據(jù)收集可以分為三個過程： 一、預(yù)安裝階段：基站收集 WSN內(nèi)所有傳感器節(jié)點(diǎn)的信息，然后發(fā)廣播命令喚醒他們，如圖四所示。 Fig. 5. The work structures produced by different algorithms. BiAntChain算法的優(yōu)勢是顯而易見的，首先： BiAntChain產(chǎn)生的網(wǎng)絡(luò)結(jié)構(gòu)簡單，路徑最短，根據(jù)無線電理論，路徑最短，表明能耗最低。 最客觀的比較方法是看那種方法可以用最低的能耗傳輸最大的數(shù)據(jù)量，表一的數(shù)據(jù)，是基于以下假設(shè)所做出的，每個節(jié)點(diǎn)都有 ，他們用這能量傳輸數(shù)據(jù)，當(dāng)死亡率達(dá)到一定階段 (20%, 50%, 80% and 100%)時，所傳輸出去多少數(shù)據(jù)。 initial energy is J. left, sensor area is 100?100
規(guī)章制度相關(guān)推薦
鄂ICP備17016276號-1