一种机会网络中节点转发策略的改进

在分析现有机会网络转发策略及机会网络中节点的运动特性的基础上,通过改进节点的转发策略提出一种新的机会网络路由算法(Delayed Spray and Wait,DSW).算法假设的应用场景为节点均沿着预先存在的路径移动,通过延迟发送转发数据包,可以显著减少网络中的低效数据包转发的数量.仿真结果表明,在合适的应用场景下该算法可以显著的降低网络中数据包的转发数量并略微提高传输成功率,这对于减少节点能耗和改善网络拥塞状况都具有实际意义.     

节点状态感知的机会网络分布式协作缓存机制

合理利用节点间的协作关系及相邻节点的缓存资源可有效提高机会网络中节点缓存的利用率与消息的投递率。该文提出一种节点状态感知的分布式协作缓存机制,通过感知消息扩散程度动态估计消息的重要程度,确定消息在缓存操作中的优先级。进而根据节点的活跃度及相对粘度获知给定消息与其目标节点的相遇概率,并针对消息源节点的差异设计分区协作缓存方法,同时在本地缓存处于存满状态时动态选取协作节点,实现本地消息到相邻节点的转移,以达到高效利用缓存资源的目的。结果表明,所提出的协作缓存机制能够有效地利用节点有限的缓存资源,并大幅度地改善消息投递率及节点缓存利用率。     

社区机会网络路由性能提升策略

在社区机会网络中由于网络资源的限制,节点的缓存、能量、带宽等属性会严重影响网络的性能。现有的社区机会网络路由算法往往只根据节点的中心性级别来进行副本的分配,而并没有充分考虑上述属性的影响。针对这一问题,本文提出一种结合节点属性与中心性的路由算法WRACS。该路由算法既考虑了影响节点传输能力的各种属性,又结合了节点的活跃程度。最后通过ONE仿真分析可知,该算法在信息投递率,平均延时和平均缓存时间等性能指标上都体现出良好的性能。     

基于节点社会特征的机会网络最优发送策略

建立了基于节点社会特征的机会网络信息传输模型,使用庞特里亚金极大值定理求得最优发送策略,该策略服从阈值形式,设停止时间为h,当t < h时,节点以最大概率发送信息,当t > h时,节点停止发送信息。实验表明,该策略优于最优静态策略。进一步分析发现,节点的平均朋友数目越多,最优发送策略的停止时间越小,同时,其性能也越好。     

机会网络中基于节点暂态社区的消息转发策略

当前机会网络中消息转发策略大多是基于节点间的历史相遇消息选取与其他节点累积相遇能力强的节点作为中继节点。此类策略对节点能力的估计默认采用均匀量化的方式,但经观察发现节点中继能力并非均匀的,主要体现在节点移动模式在时间和地理位置上呈现出极强的聚集性,我们称之为节点的暂态特性。针对上述问题,本文提出了一种基于节点暂态特性的消息转发策略,将具有相似暂态特性的节点聚合成暂态社区,利用暂态社区内节点间的强连通性和不同暂态社区的时序特性来改善机会网络性能。仿真结果表明本文提出的策略能够有效提升消息的投递率,降低投递延时和网络开销。     

基于社会特征周期演化的机会移动网络路由转发策略

针对分布式k团社区检测引起的超大社区问题,提出了具有节点退出机制的?-window社区检测方法,相应提出了?-window中心性估计。通过实验发现?-window社区和?-window中心性具有周期演化特性,利用该特性,提出TTL(time to live)社区检测和TTL中心性估计,以更准确预测消息生存期上节点的相遇。随后,利用TTL社区和TTL中心性作为转发测度,设计了新的机会移动网络路由算法PerEvo。实验结果表明,与现有的基于社会特征的路由算法比较,PerEvo在保持基本不变的传输开销的同时,有效提高了机会移动网络消息投递的成功率。 关键词：机会移动网络;社区;中心性;周期演化;消息转发     

一种基于节点能量的机会网络概率路由算法

在机会网络中,节点之间可能不存在端到端的路径.为了节省网络中节点消耗的能量,在概率路由算法的基础上提出了一种基于节点能量的概率路由算法(Energy-based Probabilistic Routing Protocol using History of Encounters and Transitivity,EBPROPHET).首先,计算两个节点相遇时节点的通信开销,然后相遇节点的剩余能量作为一个参量引入算法,选择节点剩余能量多的节点作为转发节点,最后,进行消息的转发.仿真表明,EB-PROPHET算法具有良好的路由性能,降低了整个网络的能量消耗,延长了网络的生存周期.     

机会社会网络中一种基于社区的高效路由算法北大核心

针对机会社会网络中RADR(机会社会网络消息传送算法)存在消息传输时延偏大和消息传输成功率偏低的问题,提出一种ECRA(基于社区的高效的机会社会网络路由算法)。ECRA只选取与消息目的节点在同一个社区的邻居节点来计算重要度,并且利用连通拓扑侦听相遇节点,检测相遇节点的邻居节点中是否存在更高重要度的节点,若存在,则利用相遇节点将消息传递给具有更高重要度的邻居节点。理论分析和仿真结果表明,ECRA与RADR及相关对比算法比较,在消息传输成功率、平均端到端时延等方面的性能均得到了提升。     

基于相遇节点跨层感知的机会网络高效低时延路由算法

针对基于epidemic机制的机会网络路由算法未能及时感知相遇节点以及在数据分组交换过程中存在冗余的问题,提出了一种采用跨层感知相遇节点思路的机会网络高效低时延路由算法——ERCES（epidemic routing based on cross-layer encountered-node sensing）,通过在物理层、MAC层和网络层之间的跨层信息共享与协同,实现相遇节点及时感知,并且采用节点相遇后立即广播新数据分组、收到SV（summary vector）分组后优先发送目的节点为对方的数据分组、动态自适应发送HELLO分组、借助SV删除节点缓存中已到达目的节点的分组等新机制,减少控制和存储开销,降低分组时延。理论分析验证了ERCES算法的有效性,仿真结果表明：与经典的Epidemic Routing算法及其多个改进相比,ERCES算法的控制开销和存储开销分别减少8.2%和2.1%以上,数据分组平均端到端时延至少降低了11.3%。     

机会网络中能量有效的副本分布状态感知路由机制

针对机会网络中的节点能耗与消息扩散程度之间存在矛盾,基于节点能耗与副本状态感知的路由机制可以显著地改善资源受限场景的网络性能,综合考虑消息扩散程度与节点剩余能量,并结合节点相遇概率预测方法,提出能量有效的副本分布状态感知路由机制,为消息分布式地选择合理的中继节点。仿真结果表明,所提出的路由机制能够有效降低网络负载,并大幅改善消息投递率和平均时延性能。     

移动传感网中一种基于RSSI的机会主义路由设计

 本文针对移动无线传感网提出一种结合节点移动向量和接收信号强度指示值RSSI(Received Signal Strength Indicator)信息的机会主义路由OR-RSSI,利用Sink节点Beacon报文的RSSI信息建立并更新机会概率值,使用报文广播后所能到达的具有最大机会概率值的最佳节点进行存储转发,完成移动无线传感网信息收集.OR-RSSI是一种良好的后择路由,不以既存路径为基础,不需额外设备支持,具有报文成功传输率高、网络有效吞吐量大以及能耗低等优点.     

PQBCF：一种基于中间中心度的机会网络P2P查询算法

社会机会网络由人携带的带有短距离通信接口的移动设备利用人的移动形成,其数据采用“存储-携带-转发”的模式进行传输,本文针对这类网络,提出了一种基于中间中心度的P2P查询算法（P2P Query based on Between-ness Centrality Forwarding ,PQBCF）。节点的中间中心度描述了节点在信息传输转发过程中的参与度和重要度,PQBCF算法通过选择具有较大中间中心度的节点来实现信息的高效转发。仿真实验表明,与目前该研究领域的SF （Spray and Fo-cus ）等主流算法相比,PQBCF算法能够有效提高查询成功率,并降低查询延时。     

基于社会上下文认知的机会路由算法

无线智能设备的普遍使用促进了机会网络的发展.这类网络处于间歇性连接状态,以自组织方式转发数据.路由协议设计时考虑节点携带者的社会特征和日常行为能够提高机会网络的性能.提出了一种基于社会上下文认知的机会路由算法SCOR,该算法利用网络中的社会上下文信息,通过BP神经网络模型预测节点的移动行为.路由决策过程充分考虑移动节点活动的时间和空间属性,当接收节点与发送节点同时处于网络中的同一连通域时,数据转发采用同步方式,否则采用异步方式.仿真分析和实验结果表明,与其它经典算法相比,SCOR算法提高了数据成功转发的比率,减少了网络的开销.     

A Model for Enhancing Connection Rerouting in Mobile Networks

In active networks (ANs) programs can be injected into routers and switches to extend the functionalities of the network. This allows programmers to enhance existing protocols and enables the rapid deployment of new protocols. The main objective of this paper is to show why ANs are ideal in solving the problem of connection rerouting and how current end-to-end based approaches can be enhanced. In this paper we propose a new model called active connection rerouting (ACR). In the ACR model, programs are dynamically injected into switches/routers in mobile networks to faciliate efficient connection rerouting during mobile host (MH) migration. We show how connection rerouting can be performed efficiently within the network. The ACR model uses a two stage optimization process: (i) path extension and (ii) lazy optimization. Unlike previous work on two stage connection rerouting ACR has the following properties: elimination of loops within switches/routers and incremental optimization which minimizes buffer requirements and maximized path reuse. ACR performs well in all topologies. Our experimental results show that ACR is efficient and scalable and it performs well in all topologies.     

面向服务移动社交网络中基于信任的分布式服务组合方法

针对服务不透明性、信任需求主观性及移动参与者连接机会性对面向服务移动社交网络中可信服务组合带来的问题,提出基于信任的分布式服务组合方法.该方法基于格模型建立分布式服务信任评估框架,分别在组件和组合级评估服务信任度以避免不可信的数据传输;通过分析服务依赖关系,实现满足全局和局部信任约束可信服务选择;基于蒙特卡洛方法建立可信路径选择、优化和容错算法传输服务评估调用信息.实验结果表明所提方法在服务评估开销低,在路径选择成功率和信任度高,是适应面向服务移动社交网络的服务组合方法.     

Sensitivity and Coding of Opportunistic ALOHA in Sensor Networks with Mobile Access

We consider a distributed medium access protocol, Opportunistic ALOHA, for reachback in sensor networks with mobile access points (AP). We briefly discuss some properties of the protocol, like throughput and transmission control for an orthogonal CDMA physical layer. We then consider the incorporation of necessary side information like location into the transmission control and numerically demonstrate the loss in throughput in the absence of such information. Through simulations, we discuss the robustness and sensitivity of the protocol under various modeling errors and propose strategies to allow for errors in estimation of some parameters without reduction in the throughput. For networks, where the sensors are allowed to collaborate, we consider three coding schemes for reliable transmission: spreading code independent, spreading code dependent transmission and coding across sensors. These schemes are compared in terms of achievable rates and random coding error exponents. The coding across sensors scheme has comparable achievable rates to the spreading code dependent scheme, but requires the additional transmission of sensor ID. However, the scheme does not require the mobile AP to send data through the beacon unlike the other two schemes. The use of these coding schemes to overcome sensitivity is demonstrated through simulations. Parvathinathan Venkitasubramaniam was born in India in 1981. He received his B.Tech. degree from the department of Electrical Engineering, Indian Institute of Technology, Madras in 2002. He joined the School of Electrical and Computer Engineering, Cornell University, Ithaca, NY, in 2002 and he is working toward his Ph.D. degree. He is a recipient of the 2004 Leonard G. Abraham Award (with S. Adireddy and L. Tong) from the IEEE Communications Society. His research interests include random-access protocols,sensor networks, and information theory. Srihari Adireddy was born in India in 1977. He received the B.Tech. degree from the Department of Electrical Engineering, Indian Institute of Technology, Madras, and M.S. and Ph. D. degrees from the School of Electrical and Computer Engineering, Cornell University, Ithaca, NY in 2001 and 2003 respectively. Currently, he is working at Silicon Laboratories, Austin, TX. He is a recipient of the 2004 Leonard G. Abraham Award (with P. Venkitasubramaniam and L. Tong) from the IEEE Communications Society. His research interests include signal processing, information theory, and random-access protocols. Lang Tong received the B.E. degree from Tsinghua University, Beijing, China, in 1985, and M.S. and Ph.D. degrees in electrical engineering in 1987 and 1990, respectively, from the University of Notre Dame, Notre Dame, Indiana. He was a Postdoctoral Research Affiliate at the Information Systems Laboratory, Stanford University in 1991. Currently, he is a Professor in the School of Electrical and Computer Engineering, Cornell University, Ithaca, New York. Dr. Tong received Young Investigator Award rom the Office of Naval Research in 1996, and the Outstanding Young Author Award from the IEEE Circuits and Systems Society in 1991, the 2004 IEEE Signal Processing Society Best Paper Award (with M. Dong), the 2004 Leonard G. Abraham Prize Paper Award from the IEEE Communications Society (with P. Venkitasubramaniam and S. Adireddy). His areas of interest include statistical signal processing, adaptive receiver design for communication systems, signal processing for communication networks, and information theory.     

An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks

A mobile ad hoc network (or manet) is a group of mobile, wireless nodes which cooperatively form a network independent of any fixed infrastructure or centralized administration. In particular, a manet has no base stations: a node communicates directly with nodes within wireless range and indirectly with all other nodes using a dynamically-computed, multi-hop route via the other nodes of the manet.Simulation and experimental results are combined to show that energy and bandwidth are substantively different metrics and that resource utilization in manet routing protocols is not fully addressed by bandwidth-centric analysis. This report presents a model for evaluating the energy consumption behavior of a mobile ad hoc network. The model was used to examine the energy consumption of two well-known manet routing protocols. Energy-aware performance analysis is shown to provide new insights into costly protocol behaviors and suggests opportunities for improvement at the protocol and link layers.     

一种机会协作重传协议及其性能分析模型研究

 本文基于机会中继协作通信系统的优良特性,改进了传统的多中继ARQ(Automatic Repeat Request)协作分集机制,联合物理层与数据链路层优化了无线频谱与能量的利用率,并且首次提出了采用Markov(马尔可夫)吸收链方法的端到端性能分析模型.在此分析模型的基础上,对本文改进的机会协作重传协议进行了端到端成功传输概率、丢包率、时延、吞吐量等性能参数的数值分析,最后用仿真实验对此模型进行了验证,详细讨论了最大重传次数、信道衰落参数、总发送功率等对性能的影响.结果表明,本文改进的机会协作重传协议在节能、抗信道衰落方面,表现出了比直接重传协议和传统的多中继协作重传协议具有更优越的性能.     

A Geography-Intimacy-Based Algorithm for Data Forwarding in Mobile Social Networks

Due to uncertain network connectivity,efficiently data forwarding in Mobile social networks (MSNs) becomes challenging.To conquer the problem,an Efficient data forwarding scheme based on geography intimacy (GIDF) for MSNs to achieve higher delivery ratio is proposed.In GIDF,we firstly propose an Intimacy based dynamic community detection algorithm (IDCD),which divide the MSNs into several communities.We propose a novel metric geography intimacy which can quantify the node's geographical information and the friendships between nodes.Based on geography intimacy,we further propose a routing algorithm to forward data.Compared with the geography intimacy between nodes,the next hop is found,further find the route of data forwarding by doing the similar operations.Extensive simulations on real data with the ONE simulator show that GIDF is more efficient than the existing algorithms.     

机会网络中基于摆渡节点与簇节点相互协作的路由机制

机会网络是一种不需要在源节点和目的节点之间存在完整路径,利用节点移动带来的相遇机会实现网络通信的延迟容忍自组织网络,它以“存储-携带-处理-转发”的模式进行.为实现互不相交簇间的信息传输,本文设计了一种带阈值的簇移动模型CMMT,并提出了一种基于摆渡（Ferry）节点与簇节点协作的路由算法（CBSW）.该算法减少了冗余的通信和存储开销,以及在Spray阶段簇节点没有遇到目的节点或摆渡节点,进入Wait阶段携带消息的节点采用直接分发方式只向目的节点传输等问题.仿真实验表明,CBSW算法能够增加传输成功率,减少网络开销和传输延迟.