Performance Analysis of DEBT Routing Protocols for Pocket Switch Networks

Pocket Switched Networks(PSN)represent a particular remittent network for direct communication between the handheld mobile devices.Compared to traditional networks,there is no stable topology structure for PSN where the nodes observe the mobility model of human society.It is a kind of Delay Tolerant Networks(DTNs)that gives a description to circulate information among the network nodes by the way of taking the benefit of transferring nodes from one area to another.Considering its inception,there are several schemes for message routing in the infrastructure-less environment in which human mobility is only the best manner to exchange information.For routing messages,PSN uses different techniques such asDistributed Expectation-Based Spatio-Temporal(DEBT)Epidemic(DEBTE),DEBT Cluster(DEBTC),and DEBT Tree(DEBTT).Understanding on how the network environment is affected for these routing strategies are the main motivation of this research.In this paper,we have investigated the impact of network nodes,the message copies per transmission,and the overall carrying out of these routing protocols.ONE simulator was used to analyze those techniques on the basis of delivery,overhead,and latency.The result of this task demonstrates that for a particular simulation setting,DEBTE is the best PSN routing technique among all,against DEBTC and DEBTT.

基于功率分配算法的WSN安全路由连接概率优化分析

对于结构复杂多跳无线传感器网络物理层安全性能优化时需考虑组合窃听问题。为了提高无线传感器网络(WSN)安全路由安全性,设计了一种基于功率分配算法的WSN安全路由连接概率优化(JPASR)方法。定端到端最低功率,路由方案及功率分配具有分布式特征,选取优化求解方式。研究结果表明:路由安全连接概率在网络规模增大时显著提高,形成的安全路由数量增大。相比SR算法、FA算法,JPASR算法安全性在固定网络规模时均更高。FA和SR算法路由安全连接概率在提高窃听者密度下持续降低,调整功率及窃听情况有效规避可应用JPASR算法实现。该研究有助于提高无线网络传输效率,具有很好的实际推广价值。

移动传感器网络中基于概率分布的动态的低冗余路由算法

受到节点移动、有限的存储空间及能量等因素的影响,容延迟移动传感器网络在将数据汇聚至Sink过程中伴随着较高的丢包率与数据冗余,传统的确定性路由机制难以应用。对此,利用节点在一定数量时间槽内与Sink点连通的概率分布,提出了一种动态的、分布式的路由算法。该算法充分利用了节点的移动性,使网络在保持低冗余的同时,具有较高的数据送达率。实验结果表明,在节点数多、移动速度快、节点传输距离大的网络中,该算法更具优势。

一种基于地理位置的无线传感器网络安全路由协议

提出了一种基于地理位置的无线传感器网络安全路由协议。该协议将安全因素引入路由选择机制,将能量、距离以及安全三个因素作为优选路径的标准;利用基于六边形部署信息的密钥预分布方案来分配节点间的通信密钥,建立完善的数据传输机制,保证了数据的机密性、完整性和新鲜性;通过采用辅助机制,增强了协议抵御网络攻击的能力。仿真结果和性能分析表明,该协议在抵御网络攻击方面具有良好的性能,与已有协议相比,在提高能源利用的有效性,及延长网络生命周期方面有较优的表现。

基于节点概率分布的机会传送路由算法

针对容延迟移动传感器网络在数据发送时的高丢包率及高数据冗余问题,提出基于节点与Sink连通的概率分布下的数据复制传送策略;首先,通过理论分析,统计出在一定数量的时间槽内各节点与Sink点连通的概率分布;在此基础上,各节点以分布式地方式确定数据机会传送策略;仿真实验结果表明,该路由算法在使得网络中的数据以高概率成功传递的同时,大幅度减少了网络中的数据冗余,降低了网络中的数据传送次数,减少了网络能量消耗。

EMRPP:一种DTMSN组播路由算法

针对容迟移动传感器网络(Delay Tolerant Mobile Sensor Network,DTMSN)网络的容迟及节点的移动性特点,提出了一种新的基于概率预测的能量均衡组播路由算法(Energy-balanced Multicast Routing based Probability Probabilistic,EMRPP)。该算法采用到达概率选择路由下一跳的方式,且考虑了节点能量对算法性能的影响。仿真结果表明,EMRPP算法在数据传输率和平均传输延迟方面的性能要优于改进之前的PROPHET算法,是一种有效的容迟移动网络组播路由方案。

Small World Model-Based Polylogarithmic Routing Using Mobile Nodes

The use of mobile nodes to improve network system performance has drawn considerable attention recently The movement-assisted model considers mobility as a desirable feature, where routing is based on the store-carry-forward paradigm with random or controlled movement of resource rich mobile nodes. The application of such a model has been used in several emerging networks, including mobile ad hoc networks （MANETs）, wireless sensor networks （WSNs）, and delay tolerant networks （DTNs）. It is well known that mobility increases the capacity of MANETs by reducing the number of relays for routing, prolonging the lifespan of WSNs by using mobile nodes in place of bottleneck static sensors, and ensuring network connectivity in DTNs using mobile nodes to connect different parts of a disconnected network. Trajectory planning and the coordination of mobile nodes are two important design issues aiming to optimize or balance several measures, including delay, average number of relays, and moving distance. In this paper, we propose a new controlled mobility model with an expected polylogarithmic number of relays to achieve a good balance among several contradictory goals, including delay, the number of relays, and moving distance. The model is based on the small-world model where each static node has ＂short＂ link connections to its nearest neighbors and ＂long＂ link connections to other nodes following a certain probability distribution. Short links are regular wireless connections whereas long links are implemented using mobile nodes. Various issues are considered, including trade-offs between delay and average number of relays, selection of the number of mobile nodes, and selection of the number of long links. The effectiveness of the proposed model is evaluated analytically as well as through simulation.

基于功率分配算法的WSN安全路由连接概率优化分析

为了提高WSN安全路由的计算能力,提出了一种基于功率分配算法的WSN安全路由连接概率优化方法。仿真优化分析得到:当网络内含有更多的节点数时算法路由传输功率减小。当节点数量增加后,各算法计算得到路由跳数也更加接近,获得更加接近的总功率。JPAI算法达到了比SRI算法与FAT算法更低的传输功率,各误码率状态下的JPAI算法传输总功率可以形成比SRI算法与FAT算法更低的总功率。在更大的网络规模下,所有算法模式下的路由安全连接概率都提高。相对传统算法,JPAI算法可以实现增强网络连接安全性以及减小系统运行功率。在较低的窃听者密度条件下,各算法达到了相近的安全连接概率,JPAI算法则能够有效规避窃听情况并完成功率的有效调整。