The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider at...The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.展开更多
Vehicular Ad hoc Networks (VANETs) which is a special form of Mobile Ad hoc Networks (MANETs) has promising application prospects in the future. Due to the rapid changing of topology structure, how to find a route whi...Vehicular Ad hoc Networks (VANETs) which is a special form of Mobile Ad hoc Networks (MANETs) has promising application prospects in the future. Due to the rapid changing of topology structure, how to find a route which can guarantee Quality of Service (QoS) is an important issue in VANETs. This paper presents an improved Greedy Perimeter Stateless Routing (GPSR) protocol based on our proposed next-hop node selection mechanism. Firstly, we define the link reliability in two cases which take the movement direction angle between two vehicles into consideration. Then we propose a next-hop node selection mechanism based on a weighted function which consists of link reliability between the sender node and next-hop candidate node, distance between next-hop candidate node and the destination, movement direction angle of next-hop candidate node. At last, an improved GPSR protocol is proposed based on the next-hop node selection mechanism. Simulation results are presented to evaluate the performance of the improved GPSR protocol, which shows that the performance including packet delivery ratio and average end-to-end delay of the proposed protocol is better in some situations.展开更多
针对无线传感器网络的选择性转发攻击行为,提出了一种结合节点特征和非合作博弈的选择性转发攻击检测(node characteristics and non-cooperative game for selective forwarding attack detection,NC-NCG)方法。该方法通过设置独立监...针对无线传感器网络的选择性转发攻击行为,提出了一种结合节点特征和非合作博弈的选择性转发攻击检测(node characteristics and non-cooperative game for selective forwarding attack detection,NC-NCG)方法。该方法通过设置独立监督网络环境,将节点特征中的转发率与门限阈值进行比较,计算小于阈值节点的当前转发率与T时间内平均转发率的偏离程度,根据偏离程度进行二次判定,以提高选择性转发攻击的检测率。同时为提高网络吞吐量,构建了不完全信息的非合作博弈模型,迫使可疑节点参与网络功能,实现节点快速识别。仿真实验结果表明,该方法不仅能够有效识别选择性转发攻击,而且在资源有限的情况下,可以提高网络吞吐量并延长网络生命周期。展开更多
针对高动态无人机自组网中节点之间链路生存时间(Link Live Time,LLT)短和节点遭遇路由空洞次数多的问题,提出了一种基于空洞节点检测的可靠无人机自组网路由协议——GPSR-HND(Greedy Perimeter Stateless Routing Based on Hollow Node...针对高动态无人机自组网中节点之间链路生存时间(Link Live Time,LLT)短和节点遭遇路由空洞次数多的问题,提出了一种基于空洞节点检测的可靠无人机自组网路由协议——GPSR-HND(Greedy Perimeter Stateless Routing Based on Hollow Node Detection)。GPSR-HND协议中,转发节点通过空洞节点检测机制检测邻居节点状态,将有效邻居节点加入待选邻居节点集;然后基于层次分析法(Analytic Hierarchy Process,AHP)的多度量下一跳节点选择机制从待选邻居节点集中选择权重最大的邻居节点贪婪转发数据;如果待选邻居节点集为空,则从空洞邻居节点集中选择权重最大的空洞节点启动改进的周边转发机制,寻找可恢复贪婪转发模式的节点。与GPSR-NS协议和GPSR协议相比,GPSR-HND协议表现出了更好的性能,包括平均端到端时延和丢包率的改善,以及吞吐量的提高。展开更多
针对水下传感器网络中节点能耗不均衡和能量有限的问题,提出一种能耗均衡与节能的自适应水下路由协议ECBES(energy consumption balanced and energy saving adaptive underwater routing protocol)。构建双区非均匀分层拓扑。基于能耗...针对水下传感器网络中节点能耗不均衡和能量有限的问题,提出一种能耗均衡与节能的自适应水下路由协议ECBES(energy consumption balanced and energy saving adaptive underwater routing protocol)。构建双区非均匀分层拓扑。基于能耗均衡因子,利用拓扑和节点剩余能量计算节点转发优先级,实现自适应转发节点选择,均衡网络能耗。与此同时,通过候选转发区域各分区域中节点参与转发数据包的比例确定次优候选转发区域,将次优候选转发区域作为初始策略,利用策略迭代思想确定最优候选转发区域,保证投递率的同时减少不同网络规模中重复数据包的转发,降低网络的整体能耗。仿真结果表明,ECBES相比VBF、ES-VBF和ALRP,在不同节点数量下,节点死亡率均最低,在保证数据包投递率的同时,能耗最少。展开更多
在无线传感器(Wireless Sensors Networks,WSN)中,由于节点能量有限,可能导致节点过早死亡,引起网络结构发生变化,链路稳定性变差。针对该问题文中提出了一种基于链路预测和能量感知的机会路由协议ELPOR(Opportunistic Routing Protocol...在无线传感器(Wireless Sensors Networks,WSN)中,由于节点能量有限,可能导致节点过早死亡,引起网络结构发生变化,链路稳定性变差。针对该问题文中提出了一种基于链路预测和能量感知的机会路由协议ELPOR(Opportunistic Routing Protocol Based on Link Prediction and Energy Sensing,ELPOR).该协议综合考虑节点能量和各节点之间链路连接的概率,从潜在的候选转发集中选择一个中继节点,以实现能量的高效利用和数据的可靠传输。仿真结果表明,该协议能够有效均衡网络能耗、提高吞吐量和延长网络生存周期。展开更多
An improved on-demand multicast routing protocol(ODMRP), node classification on-demand multicast routing protocol(NC-ODMRP), which is based on node classification in mobile ad hoc networks was proposed. NC-ODMRP class...An improved on-demand multicast routing protocol(ODMRP), node classification on-demand multicast routing protocol(NC-ODMRP), which is based on node classification in mobile ad hoc networks was proposed. NC-ODMRP classifies nodes into such three categories as ordinary node, forwarding group(FG) node, neighbor node of FG node according to their history forwarding information. The categories are distinguished with different weights by a weight table in the nodes. NC-ODMRP chooses the node with the highest weight as an FG node during the setup of forwarding group, which reduces a lot of redundant FG nodes by sharing more FG nodes between different sender and receiver pairs. The simulation results show that NC-ODMRP can reduce more than 20% FG number of ODMRP, thus enhances nearly 14% data forwarding efficiency and 12% energy consumption efficiency when the number of multicast senders is more than 5.展开更多
Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less t...Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8);confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.展开更多
To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’...To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’s performance in selecting main path. In route discovery process, the routing update rule calculates the node weight of each path and sorts the path weight by descending value in route list, and we choose the path which has the largest path weight for data transmission. NS-AOMDV also uses the technology of route request (RREQ) packet delay forwarding and energy threshold to ease network congestion, limit the RREQ broadcast storm, and avoid low energy nodes to participate in the establishment of the path. The results of simulation show that NS-AOMDV can effectively improve the networks’packets delivery rate, throughput and normalized routing overhead in the situation of dynamic network topology and heavy load.展开更多
Extending the lifetime of the wireless sensor networks (WSNs), where recharging sensors is not always possible, has been a major concern for researchers for the past decade. In this paper, we study the cooperation bet...Extending the lifetime of the wireless sensor networks (WSNs), where recharging sensors is not always possible, has been a major concern for researchers for the past decade. In this paper, we study the cooperation between nodes in wireless sensor networks in forwarding packets to others, and we propose a new collaboration technique which stimulates intermediate nodes to forward packets toward their destination. Some nodes show selfish behavior by denying the forwarding packets to other nodes in commercial networks in an effort to preserve their own energy. This paper applies a technique which is used to prolong the network lifetime, based on a node’s energy and trust value, and additionally incorporates fuzzy logic, which stimulates nodes to forward packets by rewarding cooperation. According to simulation results, the proposed approach surpasses the Nuglets (virtual currency) approach and the Reputation approach in network energy and thus prolongs the network lifetime. Additionally, our proposed approach demonstrates better results in the number of dropped packets, PDR and forwarded packets to neighboring nodes.展开更多
针对避免广播冲突的CR Ad Hoc网络的分布式广播协议广播成功率低和基于选择性广播信道集的低延迟广播算法广播冲突率高的问题,提出基于中继节点选择的多跳CR Ad Hoc网络广播算法。根据节点可用信道集的大小和基于邻居度的转发概率选取...针对避免广播冲突的CR Ad Hoc网络的分布式广播协议广播成功率低和基于选择性广播信道集的低延迟广播算法广播冲突率高的问题,提出基于中继节点选择的多跳CR Ad Hoc网络广播算法。根据节点可用信道集的大小和基于邻居度的转发概率选取中继节点,并对相应中继节点的可用信道集随机左移,在保证一定广播成功率、广播时延和广播冲突率的前提下,降低节点转发率,减少网络中的冗余信息;建立综合评价函数对广播算法的综合性能进行了定量分析;给出广播冲突概率推导。仿真结果表明,该算法与分布式广播协议相比,提高了广播成功率,降低了广播时延;与低延迟广播算法相比,降低了节点转发率和广播冲突概率。根据综合评价函数,该广播算法的综合性能更好。展开更多
文摘The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.
文摘Vehicular Ad hoc Networks (VANETs) which is a special form of Mobile Ad hoc Networks (MANETs) has promising application prospects in the future. Due to the rapid changing of topology structure, how to find a route which can guarantee Quality of Service (QoS) is an important issue in VANETs. This paper presents an improved Greedy Perimeter Stateless Routing (GPSR) protocol based on our proposed next-hop node selection mechanism. Firstly, we define the link reliability in two cases which take the movement direction angle between two vehicles into consideration. Then we propose a next-hop node selection mechanism based on a weighted function which consists of link reliability between the sender node and next-hop candidate node, distance between next-hop candidate node and the destination, movement direction angle of next-hop candidate node. At last, an improved GPSR protocol is proposed based on the next-hop node selection mechanism. Simulation results are presented to evaluate the performance of the improved GPSR protocol, which shows that the performance including packet delivery ratio and average end-to-end delay of the proposed protocol is better in some situations.
文摘针对无线传感器网络的选择性转发攻击行为,提出了一种结合节点特征和非合作博弈的选择性转发攻击检测(node characteristics and non-cooperative game for selective forwarding attack detection,NC-NCG)方法。该方法通过设置独立监督网络环境,将节点特征中的转发率与门限阈值进行比较,计算小于阈值节点的当前转发率与T时间内平均转发率的偏离程度,根据偏离程度进行二次判定,以提高选择性转发攻击的检测率。同时为提高网络吞吐量,构建了不完全信息的非合作博弈模型,迫使可疑节点参与网络功能,实现节点快速识别。仿真实验结果表明,该方法不仅能够有效识别选择性转发攻击,而且在资源有限的情况下,可以提高网络吞吐量并延长网络生命周期。
文摘针对高动态无人机自组网中节点之间链路生存时间(Link Live Time,LLT)短和节点遭遇路由空洞次数多的问题,提出了一种基于空洞节点检测的可靠无人机自组网路由协议——GPSR-HND(Greedy Perimeter Stateless Routing Based on Hollow Node Detection)。GPSR-HND协议中,转发节点通过空洞节点检测机制检测邻居节点状态,将有效邻居节点加入待选邻居节点集;然后基于层次分析法(Analytic Hierarchy Process,AHP)的多度量下一跳节点选择机制从待选邻居节点集中选择权重最大的邻居节点贪婪转发数据;如果待选邻居节点集为空,则从空洞邻居节点集中选择权重最大的空洞节点启动改进的周边转发机制,寻找可恢复贪婪转发模式的节点。与GPSR-NS协议和GPSR协议相比,GPSR-HND协议表现出了更好的性能,包括平均端到端时延和丢包率的改善,以及吞吐量的提高。
文摘针对水下传感器网络中节点能耗不均衡和能量有限的问题,提出一种能耗均衡与节能的自适应水下路由协议ECBES(energy consumption balanced and energy saving adaptive underwater routing protocol)。构建双区非均匀分层拓扑。基于能耗均衡因子,利用拓扑和节点剩余能量计算节点转发优先级,实现自适应转发节点选择,均衡网络能耗。与此同时,通过候选转发区域各分区域中节点参与转发数据包的比例确定次优候选转发区域,将次优候选转发区域作为初始策略,利用策略迭代思想确定最优候选转发区域,保证投递率的同时减少不同网络规模中重复数据包的转发,降低网络的整体能耗。仿真结果表明,ECBES相比VBF、ES-VBF和ALRP,在不同节点数量下,节点死亡率均最低,在保证数据包投递率的同时,能耗最少。
文摘在无线传感器(Wireless Sensors Networks,WSN)中,由于节点能量有限,可能导致节点过早死亡,引起网络结构发生变化,链路稳定性变差。针对该问题文中提出了一种基于链路预测和能量感知的机会路由协议ELPOR(Opportunistic Routing Protocol Based on Link Prediction and Energy Sensing,ELPOR).该协议综合考虑节点能量和各节点之间链路连接的概率,从潜在的候选转发集中选择一个中继节点,以实现能量的高效利用和数据的可靠传输。仿真结果表明,该协议能够有效均衡网络能耗、提高吞吐量和延长网络生存周期。
基金Project(90304010) supported by the National Natural Science Foundation of China project supported by the NewCentury Excellent Talents in University
文摘An improved on-demand multicast routing protocol(ODMRP), node classification on-demand multicast routing protocol(NC-ODMRP), which is based on node classification in mobile ad hoc networks was proposed. NC-ODMRP classifies nodes into such three categories as ordinary node, forwarding group(FG) node, neighbor node of FG node according to their history forwarding information. The categories are distinguished with different weights by a weight table in the nodes. NC-ODMRP chooses the node with the highest weight as an FG node during the setup of forwarding group, which reduces a lot of redundant FG nodes by sharing more FG nodes between different sender and receiver pairs. The simulation results show that NC-ODMRP can reduce more than 20% FG number of ODMRP, thus enhances nearly 14% data forwarding efficiency and 12% energy consumption efficiency when the number of multicast senders is more than 5.
文摘Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8);confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.
文摘To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’s performance in selecting main path. In route discovery process, the routing update rule calculates the node weight of each path and sorts the path weight by descending value in route list, and we choose the path which has the largest path weight for data transmission. NS-AOMDV also uses the technology of route request (RREQ) packet delay forwarding and energy threshold to ease network congestion, limit the RREQ broadcast storm, and avoid low energy nodes to participate in the establishment of the path. The results of simulation show that NS-AOMDV can effectively improve the networks’packets delivery rate, throughput and normalized routing overhead in the situation of dynamic network topology and heavy load.
文摘Extending the lifetime of the wireless sensor networks (WSNs), where recharging sensors is not always possible, has been a major concern for researchers for the past decade. In this paper, we study the cooperation between nodes in wireless sensor networks in forwarding packets to others, and we propose a new collaboration technique which stimulates intermediate nodes to forward packets toward their destination. Some nodes show selfish behavior by denying the forwarding packets to other nodes in commercial networks in an effort to preserve their own energy. This paper applies a technique which is used to prolong the network lifetime, based on a node’s energy and trust value, and additionally incorporates fuzzy logic, which stimulates nodes to forward packets by rewarding cooperation. According to simulation results, the proposed approach surpasses the Nuglets (virtual currency) approach and the Reputation approach in network energy and thus prolongs the network lifetime. Additionally, our proposed approach demonstrates better results in the number of dropped packets, PDR and forwarded packets to neighboring nodes.
文摘针对避免广播冲突的CR Ad Hoc网络的分布式广播协议广播成功率低和基于选择性广播信道集的低延迟广播算法广播冲突率高的问题,提出基于中继节点选择的多跳CR Ad Hoc网络广播算法。根据节点可用信道集的大小和基于邻居度的转发概率选取中继节点,并对相应中继节点的可用信道集随机左移,在保证一定广播成功率、广播时延和广播冲突率的前提下,降低节点转发率,减少网络中的冗余信息;建立综合评价函数对广播算法的综合性能进行了定量分析;给出广播冲突概率推导。仿真结果表明,该算法与分布式广播协议相比,提高了广播成功率,降低了广播时延;与低延迟广播算法相比,降低了节点转发率和广播冲突概率。根据综合评价函数,该广播算法的综合性能更好。