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.     

Meta-Path-Based Search and Mining in Heterogeneous Information Networks

Information networks that can be extracted from many domains are widely studied recently. Different functions for mining these networks are proposed and developed, such as ranking, community detection, and link prediction. Most existing network studies are on homogeneous networks, where nodes and links are assumed from one single type. In reality, however, heterogeneous information networks can better model the real-world systems, which are typically semi-structured and typed, following a network schema. In order to mine these heterogeneous information networks directly, we propose to explore the meta structure of the information network, i.e., the network schema. The concepts of meta-paths are proposed to systematically capture numerous semantic relationships across multiple types of objects, which are defined as a path over the graph of network schema. Meta-paths can provide guidance for search and mining of the network and help analyze and understand the semantic meaning of the objects and relations in the network. Under this framework, similarity search and other mining tasks such as relationship prediction and clustering can be addressed by systematic exploration of the network meta structure. Moreover, with user’s guidance or feedback, we can select the best meta-path or their weighted combination for a specific mining task.     

Visualization of Biomolecular Networks’ Comparison on Cytoscape

Similarities and dissimilarities between biomolecular networks cannot be intuitively recognized even after the development of several comparison algorithms because of the lack of visualization tools. In this paper, an integrated tool kit named Biomolecular Network Match（BNMatch） is designed and developed based on Cytoscape—a popular and open-source tool for analyzing and visualizing networks. BNMatch integrates the comparison of the outputs of algorithms used for processing biomolecular networks and expresses the matching data between them by defining similar vertices and links with similar attributes. Moreover, in order to maintain consistency, their counterparts in other networks change when the nodes and edges in one of the compared networks are changed. It becomes easy for users to analyze similar networks by invoking comparison algorithms and visualizing the matching data between the networks using BNMatch.     

Trust Evaluation Model Based on Behavior Space Classification for Ad Hoc Networks

Trust management frameworks are used to evaluate and manage trust relationships between network nodes and enhance network security.However,trust management frameworks themselves are vulnerable to attacks.Attacks against trust management frameworks are described in this paper with a trust management framework to resist them.The trustworthiness between nodes is evaluated to classify node behavior using a three-dimensional classifier based on a fuzzy integral.Different behaviors are mapped to different behavioral spaces to detect malicious nodes and identify their behavior types.The security of ad hoc networks is then improved by various measures to handle different types of malicious behavior.Simulations of the model on the System In The Loop (SITL) platform show that this trust management framework can separate normal nodes and malicious nodes and can distinguish different types of malicious nodes.     

Multi-Axis Projection Based Giant Component Formation in Random Unit-Disk Graphs

This paper proposes a multi-axis projection (MAP) based giant component formation strategy via the Maximal Independent Set (MIS) in a random unit-disk graph.We focus on the problem of virtual back-bone construction in wireless ad hoc and sensor networks,where the coverage areas of the nodes are disks with identical radii.In the simulation,we show that the MAP-based giant component has the ability to connect most nodes and serves as a backbone in the network.The algorithm is localized and may play an important role in efficiently constructing a virtual backbone for ad hoc and sensor networks.     

Grid-based directed diffusion for wireless sensor networks

Directed diffusion is a data dissemination protocol for wireless sensor networks. In directed diffusion, flooding is used for dissemination of interest and exploratory data, which will bring broadcast storm resulting in substantial energy consumption of networks. A grid-based directed diffusion is presented to improve the energy efficiency of directed diffusion. Virtual geographic grid clusters are constructed by self-organization of nodes using geographic location information. The flooding of interest and exploratory data of original directed diffusion is limited in cluster head nodes. The simulation results and testbed experiments show that the method effectively reduces the network energy consumption. This gain is not achieved at the cost of either delivery ratio or the delay. Importantly, the decreased load also leads to a better delivery ratio and lower delay.     

Efficient and power-awareness query over sensor networks

Sensor networks consisted of low-cost, low-power, muhifunctional miniature sensor devices have played an important role in our daily life. Light and humidity monitoring, seismic and animal activity detection, environment and habitat monitoring are the most common applications. However, due to the limited power supply, ordinary query methods and algorithms can not be applied on sensor networks. Queries over sensor networks should be power-aware to guarantee the maximum power savings. The minimal power consumption by avoiding the expensive communication of the redundant sensor nodes is concentrated on. A lot of work have been done to reduce the participated nodes, but none of them have considered the overlapping minimum bounded rectangle （MBR） of sensors which make them impossible to reach the optimization solution. The proposed OMSI-tree and OMR algorithm can efficiently solve this problem by executing a given query only on the sensors involved. Experiments show that there is an obvious improvement compared with TinyDB and other spatial index, adopting the proposed schema and algorithm.     

A hybrid cache placement scheme for multi-hop wireless service network

In this paper,a hybrid cache placement scheme for multihop wireless service networks is proposed. In this scheme,hot nodes in data transferring path are mined up by means of rout-ing navigation graph,and whole network is covered with network clustering scheme. A hot node has been chosen for cache place-ment in each cluster,and the nodes within a cluster access cache data with no more than two hops. The cache placement scheme reduces data access latency and workload of the server node. It also reduces the average length of data transferring,which means that fewer nodes are involved. The network system energy con-sumption decreased as involved relay nodes reduced. The per-formance analysis shows that the scheme achieves significant system performance improvement in network environment,with a large number of nodes.     

An Efficient Key Management Protocol for Wireless Sensor Networks

Key management is a fundamental security service in wireless sensor networks. The communication security problems for these networks are exacerbated by the limited power and energy of the sensor devices. In this paper, we describe the design and implementation of an efficient key management scheme based on low energy adaptive clustering hierarchy（LEACH） for wireless sensor networks. The design of the protocol is motivated by the observation that many sensor nodes in the network play different roles. The paper presents different keys are set to the sensors for meeting different transmitting messages and variable security requirements. Simulation results show that our key management protocol based-on LEACH can achieve better performance. The energy consumption overhead introduced is remarkably low compared with the original Kerberos schemes.     

HEAD:A Hybrid Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks

Mobile ad hoc networks rely on the cooperation of nodes for routing and forwarding. However, it may not be advantageous for individual nodes to cooperate. In order to make the mobile ad hoc network more robust, we propose a scheme called HEAD (a hybrid mechanism to enforce node cooperation in mobile ad hoc networks) to make the misbehavior unattractive. HEAD is an improvement to OCEAN (observation-based cooperation enforcement in ad hoc networks). It employs only first hand information and works on the top of DSR (dynamic source routing) protocol. By interacting with the DSR, HEAD can detect the misbehavior nodes in the packet forwarding process and isolate them in the route discovery process. In order to detect the misbehavior nodes quickly, HEAD introduces the warning message. In this paper, we also classify the misbehavior nodes into three types:malicious nodes, misleading nodes, and selfish nodes. They all can be detected by HEAD, and isolated from the network.     

多Sink无线传感器网络鲁棒路由协议

针对多Sink无线传感器网络中由Sink节点失效引起的局部数据拥塞,进而导致网络鲁棒性减弱的问题,提出基于侦听机制和模糊控制的多Sink无线传感器网络鲁棒路由协议．该协议采用侦听机制．建立并维护多维树状拓扑路由,避免了采用泛洪方式组网而造成的资源浪费;加入以负载、丢包和跳数为目标的模糊控制算法,进行路由选择,均衡了网络负载．仿真结果表明,该路由协议在一定程度上缓解了网络中Sink节点失效造成的大量丢包以及数据拥塞问题．增强了网路的鲁棒性．     

能量高效与移动预测的路由算法分析

传统的无线移动自组网路由协议无法实现能量均衡消耗,也不能很好的适应网络拓扑动态变化,为此提出了一种新的基于能量高效与移动预测的按需路由算法。该路由算法在路由发现时排除不稳定链路,让能量较多的节点优先参与路由请求分组的转发,同时通过预测链路连接时间采用主动式局部路由修复策略,在路径实际失效之前就完成修复工作。仿真实验表明,和传统的AODV协议相比,文中提出的算法在路由控制开销略有增加的情况下,提高了分组平均投递率,降低了数据分组端到端平均时延,同时能够实现网络中的能量高效,延长了网络寿命,因此具有较强的实用性。     

基于移动预测的DSR路由缓存管理改进

Ad Hoc网络动态的拓扑结构变化使得路由经常失效从而造成网络性能的下降,本文对DSR(Dynamic Source Routing) 由协议的缓存管理进行了研究,提出了通过GPS(GlobalPositioning System)系统获得移动结点的位置及速度信息,预测路由的生存期,并基于该生存期对路由缓存进行管理,该算法可以提高缓存中路由信息的准确率,较好的适应了Ad Hoc网络动态的网络拓扑结构变化.通过仿真实验,验证了该方法可以有效提高分组投递率,同时降低路由开销及传输延迟.     

抗毁式移动无线路由协议的研究

研究和实现在移动分组无线网中的抗毁式路由协议。基于链路－状态算法,采用距离－矢量算法的传播方法和全局的路由拓扑表,实现了移动分组无组网的抗毁式路由协议。协议的实现充分考虑了无线信道的有限宽和移动性,提高了网络性能的抗毁性。此无线路由协议适用于移动分组无线网的抗毁性要求。     

基于交叉层设计的能量负载平衡自组网路由技术

针对已有无线自组网能量平衡路由研究缺少对无线链路信道状态考虑的问题,提出了绕过繁忙区域的能量负载平衡路由技术,采用交叉层设计方法,将M AC层提取的物理信道繁忙程度与节点剩余能量、路径跳数相结合,形成路由度量,并基于改进AODV(ad hoc on dem and d istancevector)路由协议基础上实现路由策略。通过N S-2环境中仿真实验,该技术比传统AODV协议对成功递交分组数、分组成功递交率提高10%的同时,很好地控制了分组延迟的增加,在网络负载增加时甚至更低。     

混合式无线传感器网络能量有效路由协议研究

针对LEACH和PEGASIS两个经典路由协议在节点节能方面存在的不足,且只适用于小规模无线传感器网络,提出一种可应用于大规模网路中的混合式路由算法。该算法综合了LEACH和PEGASIS路由协议,它先根据LEACH分簇,并选举能量较多的节点充当簇头,属于同一簇内的节点形成一个链,簇内节点只和邻居节点通信,从而减少了簇...     

移动Ad Hoc网络拓扑控制研究

概述了Ad Hoc网络拓扑控制的研究现状和一些典型的拓扑控制方法，并提出了一种适用于移动Ad Hoc网络的分布式拓扑控制算法，它通过寻找网络的不同划分(panitions)之间最近的结点对，以最小的能量维护连接的拓扑．该算法与某种路由协议(如优化的链路状态协议)相结合，从而该拓扑控制机制几乎没有额外的控制开销．通过对网络拓扑的控制，可显著增加多步(multihop)移动无线网络的性能和网络寿命。     

应用于移动节点行为检测的基于PPM中继路径构造

在无线接入网环境下,移动节点采用AODV路由协议,提出一种基于PPM(Probabilistic packet marking)的中继路径构造方法。移动节点以一定概率标记它中继的包,无线接入点收集被标记的包,1个专门服务器根据一定数量的被标记的包头中所含信息,依据一定算法构造中继路径。该方法的关键是一旦前1个节点标记了包,随后若干节点将针对被标记的包增添自身标记信息,以加快构造算法的收敛速度。研究结果表明:不同标记概率和标记次数对收敛包数和收敛时间有影响,当标记概率为0.2以及标记次数为4时可获得较好的仿真结果;与利用DSR(Dynamic source routing)的源路由信息来获得中继路径的方法相比,本文方法的IP包头开销明显降低。     

基于基站辅助定位的无线传感器网络通信协议

无线传感器网络受应用场合和节点结构的限制，要求算法具有低功耗和低复杂度等特点．为此提出了一种基于基站辅助定位的组网算法和路由协议，利用基站对抛撒区域扫描完成网络节点定位和分簇，节点只需接收基站发送的控制信息，节省了通信和计算开销，根据节点剩余能量和信号强度选举簇头、网关，形成以基站为根节点的路由树，减小了成员节点与簇头、簇头与簇头间的通讯耗能，路由协议中定义了源数据包和转发数据包两种数据格式，以实现数据从节点到基站的传输．在此基础上，研究了不同场景下网络的生存期和节点剩余能量、仿真结果表明提出的组网和路由协议能够均衡节点能耗，有效延长网络的生存期．     

小规模无线传感器网络中GEAR协议的改进

无线传感器网络中基于地理位置的能量感知路由协议（GEAR）在发送数据分组的过程中,由于缺乏足够的网络拓扑信息以及传感器节点能量有限等问题,会遭遇路由空洞,出现短暂路由环现象.针对特定场景下的小规模网络中GEAR路由协议进行优化,提出一种改进的路由机制（SGEAR）.机制基于节点的剩余能量进行选择,对代价函数进行调整,使被选择过的节点、空洞节点、节点能量值低于阈值这3种情况的节点不会再被选择作为下一跳节点.改进算法避免了节点修改自身代价值后,广播消息的不及时造成的短暂路由环现象,提高了时效性,达到更好的性能.仿真结果表明：改进的路由算法能够减少路由空洞个数,进一步降低网络能量消耗,延长网络的生命周期.