Abstract:
In a disaster scenario, energy resources become scarce. It becomes one of the goals of routing scheme that minimize node energy consumption while forwarding packet efficiently. Routing scheme of opportunistic network based on grouping strategy is proposed. The nodes of network are grouped in accordance with the characteristics. The role of each group is different. Each group uses different routing strategy. The scheme is based on flooding strategy and can control the degree of flooding with p, k, t parameter. Simulation results show that in different network size, the scheme can be closed to the optimal network cost and achieve high delivery rate. It is a suitable routing scheme for disaster scenario.
Key words:
opportunistic networ,
routing algorith,
disaster scenario,
grouping strategy,
backbone role
摘要： In a disaster scenario, energy resources become scarce. It becomes one of the goals of routing scheme that minimize node energy consumption while forwarding packet efficiently. Routing scheme of opportunistic network based on grouping strategy is proposed. The nodes of network are grouped in accordance with the characteristics. The role of each group is different. Each group uses different routing strategy. The scheme is based on flooding strategy and can control the degree of flooding with p, k, t parameter. Simulation results show that in different network size, the scheme can be closed to the optimal network cost and achieve high delivery rate. It is a suitable routing scheme for disaster scenario.
关键词:
opportunistic network,
routing algorithm,
disaster scenario,
grouping strategy,
backbone role
CLC Number:
SUN Jian-Zhi, HAN Zhong-Meng, CHEN Dan, LI Huo-Hui. Opportunistic Network Routing Algorithm Based on Grouping Strategy in Disaster Scenario[J]. Computer Engineering, 2011, 37(23): 79-82.
孙践知, 韩忠明, 陈丹, 李越辉. 灾难场景下基于分组策略的机会网络路由算法[J]. 计算机工程, 2011, 37(23): 79-82.