A DYNAMIC CROSS-LAYER DATA QUEUE MANAGEMENT APPROACH BASED ON PRIORITY FOR DELAY-TOLERANT MOBILE SENSOR NETWORKS

This paper presents a Dynamic Cross-layer Data Queue Management approach (DC-DQM) based on priority to address the priority deviation problem in Delay-Tolerant Mobile Sensor Networks (DT-MSNs). Receiver-driven data delivery scheme is used for fast response to data transfers, and a priority based interaction model is adopted to identify the data priority. Three interactive parameters are introduced to prioritize and dynamically manage data queue. The experimental results show that it can ameliorate data delivery ratio and achieve good performance in terms of average delay.

Analysis on topology control boundary conditions in delay tolerant wireless sensor networks

In wireless sensor networks(WSNs),nodes are often scheduled to alternate between working mode and sleeping mode from energy efficiency point of view.When delay is tolerable,it is not necessary to preserve network connectivity during activity(working or sleeping) scheduling,enabling more sensors to be switched to sleeping mode and thus more energy savings.In this paper,the nodal behavior in such delay-tolerant WSNs(DT-WSNs) is modeled and analyzed.The maximum hop count with a routing path is derived in order not to violate a given sensor-to-sink delay constraint,along with extensive simulation results.

Offloading Mobile Data from Cellular Networks Through Peer-to-Peer WiFi Communication:A Subscribe-and-Send Architecture

Currently cellular networks do not have sufficient capacity to accommodate the exponential growth of mobile data requirements.Data can be delivered between mobile terminals through peer-to-peer WiFi communications(e.g.WiFi direct),but contacts between mobile terminals are frequently disrupted because of the user mobility.In this paper,we propose a Subscribe-and-Send architecture and an opportunistic forwarding protocol for it called HPRO.Under Subscribe-and-Send,a user subscribes contents on the Content Service Provider(CSP) but does not download the subscribed contents.Some users who have these contents deliver them to the subscribers through WiFi opportunistic peer-to-peer communications.Numerical simulations provide a robust evaluation of the forwarding performance and the traffic offloading performance of Subscribe-and-Send and HPRO.

Fault Tolerant Synchronization for a General Complex DynamicalNetwork with Random Delay

A fault tolerant synchronization strategy is proposed to synchronize a complex network with random time delays and sensor faults. Random time delays over the network transmission are described by using Markov chains. Based on the Lyapunov stability theory and stochastic analysis, several passive fault tolerant synchronization criteria are derived,which can be described in the form of linear matrix inequalities. Finally,a numerical simulation example is carried out and the results show the validity of the proposed fault tolerant synchronization controller.

UWB技术在DT-MSNs中的应用

容延迟移动传感器网络(DT-MSNs)是将容延迟技术引入到无线传感器网络(W SNs)而产生的新兴网络模型。它具有节点移动,网络密度稀疏、非持续连接等特点。针对DT-MSNs方法这些特点,分析了其底层基于传统窄带通信所面临的问题,提出了将超宽带(UWB)技术应用到DT-MSNs中的想法,利用UWB的高传输速率、低能耗、高抗干扰能力,提高DT-MSN中的数据传输能力,改善网络性能。采用DCC-MAC协议到已有的DT-MSNs仿真实验平台,通过仿真实验证明:将UWB技术应用在DT-MSNs中是可行的。

一种基于DT-MSN的性能预评估方法

为提高网络的利用率,解决DT-MSN中网络部署问题,运用子图的扩展理论,给出一种判定是否存在和全网同构的样本网络方法。在存在样本网络的前提下,用最小生成树原理提出一种基于节点间最大连接次数的节点分簇算法。该算法可以构建一种样本网络,在投递的数据流上和全网同构。构建一个样本网络场景,并和全网作实验对比分析。结果表明,构建样本网络模型可以代替全网做性能的预评估,能为部署大型网络场景提供可靠的性能评估报告,具有较好的实际应用价值。

OceanRoute: Vessel Mobility Data Processing and Analyzing Model Based on MapReduce

The network coverage is a big problem in ocean communication, and there is no low-cost solution in the short term. Based on the knowledge of Mobile Delay Tolerant Network(MDTN), the mobility of vessels can create the chances of end-to-end communication. The mobility pattern of vessel is one of the key metrics on ocean MDTN network. Because of the high cost, few experiments have focused on research of vessel mobility pattern for the moment. In this paper, we study the traces of more than 4000 fishing and freight vessels. Firstly, to solve the data noise and sparsity problem, we design two algorithms to filter the noise and complement the missing data based on the vessel's turning feature. Secondly, after studying the traces of vessels, we observe that the vessel's traces are confined by invisible boundary. Thirdly, through defining the distance between traces, we design MR-Similarity algorithm to find the mobility pattern of vessels. Finally, we realize our algorithm on cluster and evaluate the performance and accuracy. Our results can provide the guidelines on design of data routing protocols on ocean MDTN.

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.

基于节点紧密度中继转发的移动延迟容忍传感网传输算法

为解决移动延迟容忍传感网存在的时延突出、超宽带传输性能不佳等问题,提出了一种基于节点紧密度中继转发的移动延迟容忍传感网传输算法。引入邻域节点数量作为指标,以评估节点相遇概率,将节点相遇过程优化为邻域节点覆盖问题,以提升网络对节点相遇过程的感知能力。采用邻域节点重复覆盖数量作为判定依据,以评估节点运动性能,设计了基于紧密度的节点相遇感知机制,对节点运动活跃程度进行感知,增强节点对相遇过程的感知能力,有效提高下一跳目标节点的链接质量。基于马尔科夫评估机制,采用连接状态转移矩阵来评估节点链接概率,优选链接性能较高的节点作为下一跳节点,以优化源节点与目的节点间链路,增强链路对高带宽传输环境的适应能力。仿真结果表明,与基于分簇机制的传感网节能传输算法和基于低时延机制的传感网传输编码算法相比,所提算法具有更低的平均端对端时延和链路累计中断次数,以及更高的全网传输带宽。

基于信用度机制的移动延迟容忍传感网中继传输优化算法

为改善移动延迟容忍传感网(MD⁃TSN)的网络传输能力,提出了基于信用度机制的移动延迟容忍传感网传输优化算法。引入副本机制,设计了鉴权信息结构,将源节点与目的节点之间的链路连通程度及身份信息进行量化解析,以提升网络对中继链路的评估能力。采用双线性映射来构建注册鉴权密钥,以此设计了基于身份鉴权机制的中继节点可信度确认机制,通过结合哈希映射对中继节点进行身份鉴权,以降低中继节点的离线率,有效提高所选链路及中继节点的稳定性能。随后,基于信用分级评估模式,采取一级信用值、次级信用值筛选服务能力较强的中继节点作为备选节点,构建了基于信用度机制的节点激励方法,激励具有较强服务能力的节点,惩罚存在拒绝服务行为的中继节点,以进一步优化源节点与目的节点间链路,增强中继节点对源节点的服务覆盖能力。仿真实验表明,与当前常用的基于能量多跳路由机制的传感网传输算法和基于模糊-猫群优化机制的无线传感网多径传输算法相比,所提算法具有更高的网络传输带宽,以及更低的路径抖动频次和中继节点离线率。

Energy Efficient Social Routing Framework for Mobile Social Sensing Networks

Mobile social sensing network is one kind of emerging networks in which sensing tasks are performed by mobile users and sensing data are shared and collected by leveraging the intermittent inter-contacts among mobile users. Traditional ad hoc routing protocols are inapplicable or perform poorly for data collection or data sharing in such mobile social networks because nodes are seldom fully connected. In recent years, many routing protocols （especially social-based routing） are proposed to improve the delivery ratio in mobile social networks, but most of them do not consider the load of nodes thus may lead to unbalanced energy consumption among nodes. In this paper, we propose a simple Energy Efficient framework for Social-based Routing （EE-SR） in mobile social sensing networks to balance the load of nodes while maintaining the delivery ratio within an acceptable range by limiting the chances of forwarding in traditional social-based routing. Furthermore, we also propose an improved version of EE-SR to dynamically adjust the controlling parameter. Simulation results on real-life mobile traces demonstrate the efficiency of our proposed framework.

延迟容忍移动传感器网络中基于选择复制的数据传输

提出了一种基于选择复制的动态数据传输策略SRAD(selective replication-based adaptive data delivery scheme),基本思想是把消息(message)动态的复制给更有可能与汇聚点(sink node)通信的传感器节点.SRAD由数据传输和队列管理两个主要部分组成:前者根据Random Waypoint随机运动模型下不同时刻各传感器节点传输概率的大小进行数据消息的传输;后者通过消息的生存时间ST(survival time)值决定队列中消息传递的优先顺序和丢弃原则,以进一步降低网络传输能耗.模拟实验结果表明,与现有的几种DTMSN(delay tolerant mobile sensor networks)数据传输算法相比,SRAD的网络寿命相对较长,且它能以较低的数据传输能耗和传输延迟获得较高的数据传输成功率.

延迟容忍传感器网络基于相对距离的数据传输

延迟容忍移动无线传感器网络(delay tolerant mobile sensor network,简称DTMSN)用于广泛数据收集.与传统的传感器网络不同,DTMSN具有节点移动性、间歇连通性并且能够容忍适当的延迟,因此传统传感器网络的数据收集算法不能适用.提出了一种基于相对距离感知的动态数据传输策略RDAD(relative distance-aware data delivery scheme).RDAD采用传感器节点到汇聚点(sinknode)的相对距离来计算节点传输概率的大小,并以此作为消息(message)传输时选择下一跳的依据.为优化复本管理,RDAD引入消息的生存时间ST(survival time)和消息最大复制数MR(maximal replication)决定队列中消息传递的优先顺序和丢弃原则.模拟实验表明,与现有的几种DTMSN数据传输算法相比,RDAD能够以较低的数据传输能耗和传输延迟获得较高的数据传输成功率,并且具有相对较长的网络寿命.

基于网络编码的延迟容忍移动传感器网络低时延广播传输机制

针对延迟容忍移动传感器网络(Delay Tolerant Mobile Sensor Networks,DTMSN)提出一种基于网络编码的广播传输机制(Netcoding-based Broadcast Transmission scheme,NBT)。NBT中,基站(Base Station,BS)将原始数据分批进行传输,每个批次包含的原始数据包的数量一定;BS将同一批次数据包以单播方式传输给不同传感器节点时采用的编码向量互不相关,传感器节点之间采用泛洪的机制交换彼此缺少的编码数据包。由于BS对原始数据包进行了编码,因此传感器节点具有相同编码数据包的可能性大大降低,从而减小了节点间的数据相关度,有效降低了广播时延。在随机路点移动模型(Random WayPoint,RWP)下的仿真结果表明,与目前广播时延最小的泛洪机制相比,NBT能够在通信开销基本相同的情况下有效降低广播传输时延。

延迟容忍传感器网络中基于群组运动的事件传输

提出了一种基于分布式群组移动的事件分类传输策略GMED(distributed group mobility adaptive event delivery).通过有效地发现和利用传感器节点在运动过程中形成的群组,建立基于群组的事件分类传输模型,改善数据传输性能.其中,群组的转发是依据各自与汇聚点的机会概率按照多副本方式进行的;而群内的事件传输则是基于各成员的稳定邻居集建立传输路径,并以单副本方式进行.队列管理则根据事件的优先级决定递交的顺序和丢弃原则.此外,引入冗余副本控制机制,优化副本管理,降低网络负载.模拟实验结果表明,与现有的几种DTMSN(delay tolerant mobile sensor networks)数据传输算法相比,GMED能以较低的数据传输能耗和传输延迟获得较高的数据传输成功率,且网络寿命相对较长.

异构延迟容忍移动传感器网络中基于转发概率的数据传输

提出了一种基于转发概率的动态数据转发策略:FPAD(forwarding probability-based adaptive data deliveryalgorithm).FPAD适用于由不同类型传感器节点构成的可监测不同对象的异构延迟容忍移动传感器网络HDTMSN(heterogeneous delay tolerant mobile sensor network).在这种网络中,各类节点拥有不同的通信能力、运动速度与消息存储能力,并且获取的数据消息具有不同的大小和不同的延迟容忍度.针对异构网络的特点,FPAD一方面根据节点能量消耗和消息传输延迟计算出节点的传输概率和转发概率,并以此进行数据消息的传输;另一方面,提出根据消息当前的延迟容忍度作为消息丢弃依据的消息队列管理机制.仿真实验结果表明,与现有的几种数据传输算法相比,FPAD的数据传输成功率更高、传输延迟更小,而且网络寿命相对较长.

基于运动状态的延迟容忍移动传感器网络数据传输策略

针对延迟容忍移动传感器网络(DTMSN,delay tolerant mobile sensor networks)提出一种基于节点运动状态的数据传输(MSD,motion state-based delivery)策略。MSD使用2个通信频率,传感器节点利用基站在频率f1上的广播信号完成自身运动状态和传输概率的计算,并以此作为利用频率f2进行消息转发的依据。为了提高性能,MSD中利用消息生存时间和自身消息优先传输机制来完成消息队列的管理。仿真结果表明,与现有的几种DTMSN数据传输策略相比,MSD能够以较低的通信开销和传输延迟达到较高的数据传输成功率。

VSR:多sink机会移动传感器网络的数据收集

机会移动传感器网络可应用在野生动物监控,或利用手持设备嵌入的传感器收集城市信息等场景,往往需要将数据从源节点传输到多个基站中的任一个.提出了一个基于虚拟空间的路由机制VSR(virtual space-based routing),采用"存储-携带-转发"的传输模式实现数据收集.每个传感器节点根据与多个sink节点的期望传输延迟映射成高维空间中的一个坐标点,消息传输对应于从源节点移动到空间原点的过程.细粒度的转发决策特性,使VSR自适应于网络的动态变化,具有很好的鲁棒性.此外,VSR机制具有很低的计算和存储开销,非常适合资源受限的传感器节点.两种不同随机特性场景下的模拟实验验证了VSR机制比ZebraNet的基于历史的转发机制和随机转发机制的性能更好.

基于社团结构的容迟传感器网络多副本数据传输策略研究

在社团结构网络模型下,建立社团间多副本数据转发策略的传输概率模型,提出一种基于社团结构的多副本数据传输(CMDD)策略。CMDD策略动态计算社团间移动节点的平均相遇间隔时间,并根据传输概率模型估算借助该社团分发副本可获得的成功传输概率。模拟实验表明,CMDD策略能以较低的传输延迟和较低的传输开销获得较高的数据传输成功率。