检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东大学计算机科学与技术学院,山东济南250061
出 处:《计算机应用》2006年第1期25-27,共3页journal of Computer Applications
基 金:山东省信息产业发展专项资金资助项目(2003118)
摘 要:提出了一种保证数据可靠传输的节能算法。该算法根据各节点的最多剩余能量(MRE)在感知区域内建立以sink节点为根的源路由树,以剩余能量少于ε的节点作为叶子节点。若数据传输过程中有中间节点死亡,则调用可靠路由算法;并利用ARQ机制检测是否有数据包丢失,采用hop-by-hop机制进行重传。Many applications in wireless sensor networks require collecting all data without any loss from nodes. An energy efficient algorithm on reliable transfer was discussed. According to maximum residual energy (MRE) of nodes, a tree whose root was the sink node was set up in the covered field in which nodes with maximum residual energy less than ε were leaves. Data packets could be retransmitted reliably from a child to its parent with a hop-by-hop error recovery mechanism using a reliable routing algorithm when its parent on the reverse path was down. ARQ scheme was used to detect packet loss.
关 键 词:无线传感器网络 可靠传输 最多剩余能量 hop—by—hop 路径变换算法
分 类 号:TP393.02[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.166