Distributed patching for mobile wireless sensor networks

Mobile wireless sensor networks (MWSNs), the continuous movement of sensor nodes, may cause complete disconnection of the network or at best a part of it. The design of such networks should guarantee that all sensor nodes at all times have a path to the sink node(s). Prolonging the lifetimes of the MWSNs is a crucial design issue but should not be at the expense of other essential functions such as connectivity. In this paper, we propose an energy efficient distributed framework for connectivity maintenance of MWSNs. In the proposed framework, sensor nodes of the MWSNs schedule and control their radio frequency (RF) modules based on dynamic coordinated reconstruction mechanism, some senor nodes may lose their connectivity with the network due to mobility, depletion of energy and/or incurred faults. Two protocols are developed to patch up the disconnection of the MWSNs. The first protocol reestablishes the network connection consuming far less energy than state-of-the-art alternatives. However, it is capable of reestablishing the connection when no more than 20% of the MWSN backbone nodes lose connection concurrently. The second protocol extends this limit to operate when up to 35% of the MWSN backbone nodes lose connection simultaneously.     

Gossip-based cooperative caching for mobile applications in mobile wireless networks

Cooperative caching is an efficient way to improve the performance of data access in mobile wireless networks, by cache nodes selecting different data items in their limited storage in order to reduce total access delay. With more demands on sharing a video or other data, especially for mobile applications in an Internet-based Mobile Ad Hoc Network, considering the relations among data items in cooperative caching becomes more important than before. However, most of the existing works do not consider these inherent relations among data items, such as the logical, temporal, or spatial relations. In this paper, we present a novel solution, Gossip-based Cooperative Caching (GosCC) to address the cache placement problem, and consider the sequential relation among data items. Each mobile node stores the IDs of data items cached locally and the ID of the data item in use into its progress report. Each mobile node also makes use of these progress reports to determine whether a data item should be cached locally. These progress reports are propagated within the network in a gossip-based way. To improve the user experience, GosCC aims to provide users with an uninterrupted data access service. Simulation results show that GosCC achieves better performance than Benefit-based Data Caching and HybridCache, in terms of average interruption intervals and average interruption times, while sacrificing message cost to a certain degree.     

Energy and delay optimized contention for wireless sensor networks

In wireless sensor network (WSN) studies, the main objective is minimizing the energy consumption so that the lifetime is maximized under the limited battery capacity constraints. Additionally, in most event-driven WSN applications, the end-to-end delay, and hence, the medium access delay should be minimized. Majority of the WSN MAC protocols are contention-based wherein contention window size setting involves an important trade-off between the collision probability and idle listening durations in contentions where both are aimed to be lowered for efficient network operation. In this paper, the energy optimizing and the delay optimizing contention window sizes are derived as a function of the number of contending nodes. For this purpose, we present separate analyses for the contention delay and for the energy consumed which are verified with detailed simulations. In order to obtain close to optimal performance values in a distributed manner, we propose a method for estimating the number of contending nodes since the individual wireless sensor nodes do not have this information readily. Simulations of an event-driven WSN application verify that the proposed method successfully improve both delay and energy efficiency of the contention-based medium access. The end-to-end network performance is also investigated by employing a geographical routing protocol. Results show that using the heuristic method proposed that use the optimum contention window size analyses presented, the overall network performance can be improved without incurring any overhead to the system.     

延迟容忍移动无线传感器网络路由分析

延迟容忍移动无线传感器网络DTMSN（Delay Tolerant Mobile Sensor Networks）用于广泛数据收集,传统传感器网络的数据收集方法在DTMSN中并不适用。为此研究了DTMSN的特性,分析了目前常用的几种DTMSN路由算法的特点,并通过详细的仿真实验给出了这几种算法的性能指标,如数据的平均传输成功率,传输能耗、传输延迟及网络寿命。     

适合无线传感器网络的自适应动态电压调节算法*

对于能量有限的传感器网络,在计算复杂度较高的应用中,节省CPU的能耗具有重要意义。针对以事件为驱动的无线传感器网络的任务模式,提出一种基于零散任务模型的自适应DVS算法——ADVS。ADVS算法根据CPU的任务量实时调整工作频率和电压,能在很大程度上降低CPU能耗的同时,保证任务的实时性要求。理论分析和实验结果表明,ADVS算法的实际节能效果接近理论分析值的80%左右,可在很大程度上延长节点的生命周期。     

Enhanced cooperative communication MAC for mobile wireless networks

In this paper, we propose a new MAC (medium access control) protocol called enhanced cooperative communication MAC (ECCMAC) based on IEEE 802.11. The major objective of ECCMAC is to maximize the benefits of cooperative communication. We first propose a scheme for selecting and maintaining the best relay node. Second, since both cooperative communication and network coding rely on the selection of a relay node, we consider exploiting a network coding technique for additional throughput improvement. Third, to accommodate asymmetric link rates between a sender and a relay node, we employ ECCMAC to measure forward and reverse link rates, whereas prior works have simply assumed symmetric rates. ECCMAC is evaluated in this paper through theoretical analysis, extensive simulation, and simulation with measured data, and the results show that ECCMAC effectively improves wireless network performance.     

Designing dependable agent systems for mobile wireless networks

A mobile ad hoc network (MANET) is a wireless network of mobile devices-such as PDAs, laptops, cell phones, and other lightweight, easily transportable computing devices-in which each node can act as a router for network traffic rather than relying on fixed networking infrastructure. As mobile computing becomes ubiquitous, MANETS becomes increasingly important. As a design paradigm, multiagent systems (MASs) can help facilitate and coordinate ad hoc-scenarios that might include security personnel, rescue workers, police officers, firefighters, and paramedics. On this network, mobile agents perform critical functions that include delivering messages, monitoring resource usage on constrained mobile devices, assessing network traffic patterns, analyzing host behaviors, and revoking access rights for suspicious hosts and agents. Agents can effectively operate in such environments if they are environment aware - if they can sense and reason about their complex and dynamic environments. Altogether, agents living on a MANET must be network, information, and performance aware. This article fleshes out how we apply this approach to populations of mobile agents on a live MANET.     

移动性无线传感器网络吞吐量跨层优化

采用跨层优化方法,分析了移动性无线传感器网络点对点链路的吞吐量优化问题。首先推导出吞吐量的理论表达式;以最大化吞吐量为目标,采用一种基于分层优化的数学框架,分别得到物理层最优符号速率、最优调制星座体积和MAC层最优数据包长;在此基础上,通过联合优化物理层参数和MAC层参数实现了链路吞吐量的最大化;最后提出了一种基于节点间通信距离的自适应跨层优化策略。仿真结果表明,与传统的分层优化相比,跨层优化后链路的吞吐量性能得到了明显提高。     

Mobility prediction in mobile wireless networks

In realistic mobile ad-hoc network scenarios, the hosts usually travel to the pre-specified destinations, and often exhibit non-random motion behaviors. In such mobility patterns, the future motion behavior of the mobile is correlated with its past and current mobility characteristics. Therefore, the memoryless mobility models are not capable of realistically emulating such a mobility behavior. In this paper, an adaptive learning automata-based mobility prediction method is proposed in which the prediction is made based on the Gauss–Markov random process, and exploiting the correlation of the mobility parameters over time. In this prediction method, using a continuous-valued reinforcement scheme, the proposed algorithm learns how to predict the future mobility behaviors relying only on the mobility history. Therefore, it requires no a prior knowledge of the distribution parameters of the mobility characteristics. Furthermore, since in realistic mobile ad hoc networks the mobiles move with a wide variety of the mobility models, the proposed algorithm can be tuned for duplicating a wide spectrum of the mobility patterns with various randomness degrees. Since the proposed method predicts the basic mobility characteristics of the host (i.e., speed, direction and randomness degree), it can be also used to estimate the various ad-hoc network parameters like link availability time, path reliability, route duration and so on. In this paper, the convergence properties of the proposed algorithm are also studied and a strong convergence theorem is presented to show the convergence of the algorithm to the actual characteristics of the mobility model. The simulation results conform to the theoretically expected convergence results and show that the proposed algorithm precisely estimates the motion behaviors.     

一种容迟移动传感器网络的MAC协议

根据容迟移动传感器网络中节点的能量消耗和传输延迟特性,提出一种减少能量消耗的媒体接入控制协议(ESMAC协议)。通过实验证明,依靠在MAC协议的帧结构中加入模式判别标识,减少了节点由于串音和竞争引起的能量消耗;通过节点发送的寻访报文,减少了由于空闲侦听引起的节点能量消耗,延长了网络的生命周期。     

Power and delay optimisation in multi-hop wireless networks

In this paper, we study the optimisation problem of transmission power and delay in a multi-hop wireless network consisting of multiple nodes. The goal is to determine the optimal policy of transmission rates at various buffer and channel states in order to minimise the power consumption and the queueing delay of the whole network. With the assumptions of interference-free links and independently and identically distributed (i.i.d.) channel states, we formulate this problem using a semi-open Jackson network model for data transmission and a Markov model for channel states transition. We derive a difference equation of the system performance under any two different policies. The necessary and sufficient condition of optimal policy is obtained. We also prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate and the optimal transmission rate can be either maximal or minimal. That is, the ‘bang-bang’ control is an optimal control. This optimality structure greatly reduces the problem complexity. Furthermore, we develop an iterative algorithm to find the optimal solution. Finally, we conduct the simulation experiments to demonstrate the effectiveness of our approach. We hope our work can shed some insights on solving this complicated optimisation problem.     

事件驱动型无线传感器网络最小时延路由协议

针对事件驱动型无线传感器网络对时延性能的要求,提出了一种最小时延路由(MDR)协议.该协议利用RTS/CTS消息机制建立路由,避免了复杂的路由算法所带来计算开销,并在此基础上通过控制节点的下一跳可达区域的子区域的数量和对应的后退窗口时间长度来最小化节点的感应数据包到达汇聚节点的时延.实验结果表明:所提路由协议有效提高了事件驱动型传感器网络的时延性能.     

Reliability and survivability of wireless and mobile networks

The world is becoming more dependent on wireless and mobile services, but the ability of wireless network infrastructures to handle the growing demand is questionable. As wireless and mobile services grow, weaknesses in network infrastructures become clearer. Failures not only affect current voice and data use but could also limit emerging wireless applications such as e-commerce and high-bandwidth Internet access. As wireless and mobile systems play greater roles in emergency response, including 911 and enhanced 911 services, network failures take on life-or-death significance. Therefore, in addition to directing some attention to designing survivable wireless and mobile networks, developers must also keep in mind that increasingly pervasive and demanding services will further escalate the importance of reliability and survivability requirements. The authors explain several options providers must consider to decrease the number of network failures and to cope with failures when they do occur     

Distributed network control for mobile multi-modal wireless sensor networks

A sensor network operates on an infrastructure of sensing, computation, and communication, through which it perceives the evolution of events it observes. We propose a fusion-driven distributed dynamic network controller, called MDSTC, for a multi-modal sensor network that incorporates distributed computation for in-situ assessment, prognosis, and optimal reorganization of constrained resources to achieve high quality multi-modal data fusion. For arbitrarily deployed sensors, a certain level of data quality cannot be guaranteed in sparse regions. MDSTC reallocates resources to sparse regions; reallocation of network resources in this manner is motivated by the fact that an increased density of sensor nodes in a region of interest leads to better quality data and enriches the network resilience. Simulation results in NS-2 show the effectiveness of the proposed MDSTC. ¹     

基于簇首移动的无线传感器网络路由算法

以往的无线传感器网络分簇算法中,簇首位置固定无法移动,缺乏针对网络实时变化的灵活性,在均衡网络节点能量消耗的问题上存在着缺陷。鉴于此,提出一种簇首移动的无线传感器网络路由算法（MCHCA）。MCHCA算法将簇首设置为移动节点,通过网络区域大小及节点传输半径确定合理的移动簇首数目;根据簇内成员的位置坐标和剩余能量的信息,确定簇首每轮所需移动到的最佳位置;移动簇首收集簇内成员的数据并将其融合,传递给Sink节点。仿真结果表明,该算法可以有效地均衡网络节点负载的能耗,提高了网络的生命周期。     

移动sinks无线移动传感器网络时延性能分析*

结合mWSNs体系结构,分析了移动sinks无线传感器网络的时延组成和时延特性,并通过仿真实验分析了移动性对时延的影响。该分析结果既能用于mWSNs时延系统性能评价,又可为mWSNs系统参数（如移动sinks数量、速度、传输半径及数据包长度等）优化提供理论依据。同时,时延性能要与能量消耗综合考虑。     

An inexpensive unstructured platform for wireless mobile peer-to-peer networks

In this paper, we propose an unstructured platform, namely I nexpensive P eer-to- P eer S ubsystem (IPPS), for wireless mobile peer-to-peer networks. The platform addresses the constraints of expensive bandwidth of wireless medium, and limited memory and computing power of mobile devices. It uses a computationally-, memory requirement- and communication- wise inexpensive gossip protocol as the main maintenance operation, and exploits location information of the wireless nodes to minimize the number of link-level messages for communication between peers. As a result, the platform is not only lightweight by itself, but also provides a low cost framework for different peer-to-peer applications. In addition, further enhancements are introduced to enrich the platform with robustness and tolerance to failures without incurring any additional computational and memory complexity, and communication between peers. In specific, we propose schemes for a peer (1) to chose a partner for a gossip iteration, (2) to maintain the neighbors, and (3) to leave the peer-to-peer network. Simulation results are given to demonstrate the performance of the platform.

A secure routing scheme for mobile wireless sensor networks

Frequency-hopping (FH) is a well-known spread-spectrum method of transmitting radio signals by hopping frequency channels along a predefined hopping sequence known to both transmitter and receiver. Although FH is resistant to jamming by external malicious nodes which have no knowledge of the sequence, it is of no effect against attacks by internal compromised nodes which know the sequence. In this article, we propose a secure scheme for creating the hopping sequence for mobile wireless sensor networks. The proposed scheme is based on the idea of a statistical en-route filtering (SEF). SEF exploits collective decision making by multiple detecting nodes in the dense deployment of large sensor networks. We demonstrate the effectiveness of our scheme thorough simulations.     

移动无线传感器网络中基于过渡带思想的贪婪转发策略

针对移动无线传感器网络采用贪婪转发策略的地理路由协议中使用周期性信标交换所引起的通信暂盲现象,提出了一种基于过渡带思想的贪婪转发策略.其主要思想是在节点通信范围的边缘引入一个半径大小合适的过渡带,转发节点首先剔除过渡带内的邻居节点,然后选择离目的节点最近的且比转发节点离目的节点距离更近的邻居节点作为下一跳节点.仿真结果表明采用该转发策略的贪婪地理路由协议,在小量增加数据传输平均时延的情况下,能够有效地消除通信暂盲现象,大大提高数据传送成功率,具有很好的可靠性.