Operating System Issues in Wireless Ad-Hoc Networks

合集下载

移动自组织网络(1)

移动自组织网络(1)
Error control and failure
Error correction and retransmission, deployment of back-up systems
Network coding
Reduce number of transmissions
Issues to be Covered
“six degree of separation”
Characteristics
Self-organizing: without centralized control
Scarce resources: bandwidth and batteries
Dynamic network topology
Networks resource allocation and energy efficiency
QoS management*
Dynamic advance reservation and adaptive error control techniques
Major Issues (Cont’d.)
Unit Disk Graph
Figure 1: A simple ad hoc wireless network of five wireless mobile hosts.
Applications
Defense industry (battlefield) Law enforcement Academic institutions (conference and
移动自组织网络(1)
2020/8/15
Table of C Infrastructured networks
Handoff location management (mobile IP) channel assignment

无线Ad hoc网络的连通性与抗摧毁性

无线Ad hoc网络的连通性与抗摧毁性

A s r c :F rt e p r o e o e ss e tc n e to fAd h c n t r b ta t o h u p s fp r it n o n c i n o o e wo k,o e l y a d wih t n e k mu t v ra n t s a d wr c s b a e n o c n i e a i n e t k n i t o sd r to .S p o e t a n wo n d s h d t s h ub i r n mitn o e n o d r u p s h ta y t o e a o u e t e p l t a s t i g n d s i r e c
摘 要 :为 了使 Adh c网络 能持 续保 持连 通 , 盖性 与抗 摧 毁性 必 须加 以考 虑 。在任 何 两个一 跳覆 盖 区必 o 覆 须通过 公 用信 道传 输信 息 的前提 下 , 过分 析给 定 区域 内信道 节 点的 特征 , 出 了网络 覆 盖优化 模 型和 规划 通 提
维普资讯
第 8 第 2 卷 期 20 年 4 07 月
解 放 军 理 工 大 学 学 报 ( 然 科 学 版) 自
J u n lo o r a fPLA nv riy o ce c n c n lg U ie st fS in ea d Te h oo y
方法 , 完成 了区域 的 完全覆 盖 。 对模 型的抗 摧 毁性 能 , 出了利 用频 率代 替 直接计 算概 率 的算 法 , 针 提 并在 此基
础上 分析 了随机 抽 取 若干信 道 节点后 整个 网络 的抗 摧 毁性 。 拟 实验 结果证 明 , 用这 种 划分 方法 可 以利 用 模 采 较 少的信道 完成对 网络 的覆 盖 , 能够得 到较 好 的 网络 连 通性 和抗 摧 毁性 能 。 并

基于单片机的无线自组网技术研究

基于单片机的无线自组网技术研究

*********本科毕业设计(论文)学院电子信息学院专业*******************学生姓名********班级学号***********指导教师***二零一三年六月****大学本科毕业论文基于单片机的无线自组网技术研究Research of Wireless Ad hoc Network Technology Based on Microcontroller摘要随着Internet技术的飞速发展,网络技术日趋多样,Wired Network已不能满足人们对随时、随地、可靠、快速通信的需求,无线网络技术应运而生。

无线Ad Hoc网络就是新型无线网络之一。

不同于其他无线网络,Ad Hoc网络并不依赖固定基础设施,具有通信、自组织、自管理等特点。

随着我国电子技术的不断提高,以单片机为核心处理器,进行无线自组网的技术,无疑已成为通信技术的发展趋势之一。

本文采用CC430F5137作为微处理器,配合其内部集成的CC1101无线收发器以及一些基本接口电路构成节点硬件系统。

网络系统包括中心节点和终端节点,介绍了无线自组网的特点以及讨论了低功耗应用方法。

分别对SimpliciTI网络协议及其拓扑结构进行了分析,并在此基础上进行软件设计,最终实现了基于SimpliciTI网络协议的网络通信系统。

关键词:CC430 F5137;无线自组网;低功耗;AbstractWith the rapid development of Internet technology, network technology increasingly becomes diverse, and Wired Network has been unable to satisfy people‟s needs who want to have reliable and fast communication in anytime or anywhere. As a result ,wireless network technology came into being. Wireless Ad Hoc network is one of the new wireless networks. Unlike other wireless networks, Ad Hoc network has many features including communication, self-organization, self-management, which does not rely on fixed infrastructure.With the continuous development of China's electronic technology ,the communication technology of wireless ad hoc network based on the microcontroller which works as the core processor , has undoubtedly become one of the trends of Communication .In this paper,CC430F5137 is adopted as the microprocessor,coordinating with its embedded CC1101 wireless transceiver and some of the basic interfacing circuits;the node hardware system is composed.The network system includes centrer node and terminal node,The characteristics of wireless Ad Hoc networks and the application method for the low-power is discussed. SimpliciTI network protocol and its topological structure are analyzed,and the software is designed based on the analysis.Thus,the network communication system based on SimpliciTI network protocol is implemented.Keywords:CC430 F5137; Wireless ad hoc network; low-power;目录第一章绪论................................................. 错误!未定义书签。

Ad Hoc无线网络及其路由协议分析

Ad Hoc无线网络及其路由协议分析
个 网络 是 以簇 为子 网组 成 , 个 簇 又 由 一 个 簇 头 和 多 个 簇 成 员 每
美国军 事研 究领域 , 是一种在不依靠任何 中心管理 的情况下 , 在
有 限 的 范 围 内 实 现 多 个 移 动 终 端 的 临 时 互 联 。A o dH c无 线 网 络 组 网灵 活 、 捷 , 受 有 线 网 络 的影 响 , 广 泛 应 用 于 军 事 通 快 不 可
1 引 言
A o 无线 网络是 一种 移动通 信和 计算 机 网络 相结 合的 dH c
网 络 , 称 移 动 自组 多 跳 网络 。最 初 起 源 于 2 也 0世 纪 7 0年 代 的
定的层面上来说 , 其结构可以、 为两种 : 分 平面结 构和 阶梯 结构 。
在平面结 构 中, 所有 网络 节点地位平 等 ; 在阶梯结构结 构 中, 整
Ab t a t sr c Ad Ho r ls ew r si a t mp r r ewo k ih fr d o o f r ls o t a d b s d o o c n e t t g if c wi e s n t o k s e o a y n t r swh c ome fa lto ee sh s n a e n n o c n r i n m— e wi s an
l s ewo k e o sy e s n t r ss r u l . i Ke ywo ds r Ad Ho W ie e snewo ks Ro tngprt c l c r ls t r u i oo os
结点动态且任意分 布, 结点 之间通 过无线 方式互 连。但是在 一
组成 , 头形成 高一级网络 , 簇 高一级 网络又 可分簇形 成更 高一级 网络 。这 两 种 结 构 的优 缺 点 如表 1 。

10-自组织网络课件

10-自组织网络课件
Beacon机制 Heartbeat机制
本课件仅供北邮学生授课使用,禁止传播
27
Ad Hoc网络的分簇结构与算法
适用于规模大、节点多的网络中 分簇算法
根据系统要求按照某种规则将网络划分成可以相互 连通并覆盖所有节点的多个簇
在网络结构发生变化时更新簇结构以维护网络的正 常功能
在拓扑探测的同时完成分簇形成和分簇连接的工作
Internet
WLAN
Cellular
本课件仅供北邮学生授课使用,禁止传播
4
Ad Hoc网络的定义
Ad hoc 一词源自拉丁语,中文含义是“临时的 、特别的”
Ad hoc网络是由一组带有无线收发装置的移动 终端组成的一个多跳的临时的网络
Ad hoc网络的终端具有路由和报文转发功能 可以通过无线连接构成任意的网络拓扑 网络可以独立工作,也可以接入Internet或者蜂窝
Wireless sensor networks
17
MANET
MANET特点
No infrastructure Self organizing networks Communications via
mobile nodes Dynamic topology Heterogeneity
bandwidth-constrained variable-capacity links Limited physical security Nodes with limited battery life and storage capabilities
现代通信网络
张冬梅 ()
2021/3/17
1
主要内容
Ad hoc网络的概念 Ad hoc网络体系结构 Ad hoc的信道接入技术 Ad hoc网络的路由技术 Ad hoc网络的分簇算法 Ad hoc网络的节能问题

在动态Ad hoc网络下 服务组合和服务恢复的研究

在动态Ad hoc网络下 服务组合和服务恢复的研究

Minimum disruption service composition and recovery in mobile ad hoc networksShanshan Jiang *,Yuan Xue,Douglas C.SchmidtInstitute for Software Integrated Systems,Department of Electrical Engineering and Computer Science,Vanderbilt University,Nashville,TN 37027,United Statesa r t i c l e i n f o Article history:Available online 5November 2008Keywords:Mobile ad hoc network Service composition Reliabilitya b s t r a c tThe dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can satisfy the end-to-end quality of service require-ments and minimize the effect of service disruptions caused by dynamic link and node fail-ures.Although existing research on mobile ad hoc networks has focused on improving reliability,little existing work has considered service deliveries spanning multiple compo-nents.Moreover,service composition strategies proposed for wireline networks (such as the Internet)are poorly suited for highly dynamic wireless ad hoc networks.This paper proposes a new service composition and recovery framework designed to achieve minimum service disruptions for mobile ad hoc networks.The framework consists of two tiers:service routing ,which selects the service components that support the service path,and network routing ,which finds the optimal network path that connects these ser-vice components.Our framework is based on the disruption index ,which is a novel concept that characterizes different service disruption aspects,such as frequency and duration,that are not captured adequately by conventional metrics,such as reliability and ing the definition of disruption index,we formulate the problem of minimum-disrup-tion service composition and recovery (MDSCR)as a dynamic programming problem and analyze the properties of its optimal solution for ad hoc networks with known mobility plan.Based on the derived analytical insights,we present our MDSCR heuristic algorithm for ad hoc networks with uncertain node mobility.This heuristic algorithm approximates the optimal solution with one-step lookahead prediction,where service link lifetime is pre-dicted based on node location and velocity using linear regression.We use simulations to evaluate the results of our algorithm in various network environments.The results validate that our algorithm can achieve better performance than conventional methods.Ó2008Elsevier B.V.All rights reserved.1.IntroductionMobile ad hoc networks are self-organized wireless net-works formed dynamically through collaboration among mobile nodes [1].Since ad hoc networks can be deployed rapidly without the support of a fixed networking infra-structure,they can be applied to a wide range of application scenarios,such as disaster relief and homeland security operations.These diverse application needs have fueled anincreasing demand for new functionalities and services.To meet these demands,component-based software develop-ment [2]has been used to ensure the flexibility and main-tainability of software systems.Service composition [3–5]is a promising technique for integrating loosely-coupled distributed service components into a composite service that provides end users with coordinated functionality,such as web services and multimedia applications.There is an extensive literature on service composition techniques over wireline networks.For example,[4,6,7]fo-cus on finding a service path over wireline networks that satisfies various quality of service (QoS)requirements.Likewise,[8,9]consider how to provide highly available1389-1286/$-see front matter Ó2008Elsevier B.V.All rights reserved.doi:10.1016/net.2008.10.017*Corresponding author.Tel.:+16152943571.E-mail addresses:shanshan.jiang@ (S.Jiang),yuan.xue@ (Y.Xue),d.schmidt@ (D.C.Schmidt).Computer Networks 53(2009)1649–1665Contents lists available at ScienceDirectComputer Networksj o ur na l h om e pa ge :w w w.e ls e v ie r.c om /lo c at e/c om ne tservices.While these results have made critical steps to-wards constructing high quality service paths in a variety of networking environments,they do not extend directly to service composition in mobile ad hoc networks since intermittent link connectivity and dynamic network topol-ogy caused by node mobility is not considered.To address this open issue,this paper studies service composition over mobile ad hoc networks.In particular, we investigate the impact of node mobility and dynamic network topology on service composition.Our goal is to provide dynamic service composition and recovery strategies that enable highly reliable service delivery and incur the min-imum disruptions to end users in mobile ad hoc networks.We focus on two important factors of service disruption—fre-quency and duration—that characterize the disruption experienced by end users.To achieve this goal,we address the following three challenges:How to quantitatively characterize and measure the impact of service disruptions.Reliability and availability are two common metrics that quantify the ability of a system to deliver a specified service.For example,the reliability metric helps guide and evaluate the design of many ad hoc routing algorithms[10,11]and component deploy-ment mechanisms[12]using the path with maximum reliability for data/service delivery.There are two prob-lems,however,with using reliability as a metric for ser-vice composition and recovery design:(1)it does not account for service repair and recovery and(2)reliabil-ity is a dynamic metric that is usually estimated based on the signal strength of a wireless link or the packet loss ratio along a path.Its constantly changing value may cause repeated service adjustments,especially if an application wants to use the path with maximum reliability.Availability is also insufficient to evaluate the effect of disruptions since it can not characterize the impact of disruption frequency.How to deal with the relation between service routing and network routing.In an ad hoc network,a service link that connects two service components is supported by the underlying network routing.Its ability to deliver a ser-vice therefore depends on the network path in use,i.e., the transient and enduring wireless network link and path failures can constantly change the service delivery capability of a service link.Conversely,service routing determines the selection of service components,which in turn defines the source and destination nodes for net-work routing.These interdependencies between service routing and network routing complicate the design of service composition and recovery schemes.To maintaina service with minimum disruption,therefore,routingoperations must be coordinated at both the service and network levels.How to realistically integrate the knowledge of node mobil-ity in the service composition and recovery strategies.Node mobility is a major cause of service failures in ad hoc networks.To ensure highly reliable service delivery and reduce service disruptions,therefore,we need to predict the sustainability of service links based on node mobility patterns.Accurate prediction is hard,however, for two reasons:(1)the mobility-caused link failures arehighly dependent and(2)the sustainability of a service link is also affected by the network path repairs and the new nodes emerging in its vicinity.To address these challenges,this paper presents a new service composition and recovery framework for mobile ad hoc networks to achieve minimum service disruptions. This framework consists of two tiers:(1)service routing, which selects the service components that support the ser-vice delivery,and(2)network routing,whichfinds the net-work path that connects these service components.Our framework is based on the disruption index.This novel con-cept characterizes different service disruption aspects, such as frequency and duration,that are captured inade-quately by conventional metrics,such as reliability and availability.For ad hoc networks with known mobility plan,we for-mulate the problem of minimum-disruption service compo-sition and recovery(MDSCR)as a dynamic programming problem and analyze the properties of its optimal solution. Based on the derived analytical insights,we present our MDSCR heuristic algorithm for ad hoc networks with uncertain node mobility.This heuristic algorithm approxi-mates the optimal solution with one-step lookahead pre-diction,where the sustainability of a service link is modeled through its lifetime and predicted via an estima-tion function derived using linear regression.This paper makes three contributions to research on service composition and recovery in mobile ad hoc net-works.First,it creates a theoretical framework for service composition and recovery strategies for ad hoc networks that characterize the effect of service disruption.Second, it uses dynamic programming techniques to present the optimal solution to MDSCR problem,which provides important analytical insights for MDSCR heuristic algo-rithm design.Third,it presents a simple yet effective statis-tical model based on linear regression that predicts the lifetime of a service link in the presence of highly corre-lated wireless link failures and network path repairs.This paper significantly extends our prior work in [13,14].In particular,this paper provides a detailed theo-retical analysis of the optimal solution of our two-tier MDSCR algorithm.Likewise,we present a comprehensive ns-2simulation study of disruption indices and the throughput of our MDSCR algorithm and compare it with common algorithms.In addition,[13]is a work-in-progress paper that simply motivates the service disruption issues in dynamic networking environments,whereas this paper provides a detailed analytical and experimental study on mobile ad hoc networks.The remaining of this paper is organized as follows:Sec-tion2provides our network and service model;Section3 describes our service composition and recovery framework for ad hoc networks.Section4formulates the MDSCR prob-lem and provides its optimal solution;Section5explains our MDSCR heuristic algorithm;Section6presents our simulation results and evaluates the performance of our MDSCR algorithm;Section7discusses the limitations of our approach in this paper;Section8compares MDSCR with related work;and Section9presents concluding remarks.1650S.Jiang et al./Computer Networks53(2009)1649–16652.System model2.1.Mobile ad hoc network modelWe consider a mobile ad hoc network consisting of a setof nodes N.In this network,link connectivity and networktopology change with node movement.To model such adynamic network environment,wefirst decompose thetime horizon T¼½0;1Þinto a set of time instances T0¼f s1;s2;...g so that during the time interval½s i;s iþ1Þ,the network topology remains unchanged,i.e.,the same asthe topology at s i.We then model this mobile ad hoc network using a ser-ies of graphs indexed by time instances in T0,i.e.,G T0¼f GðsÞ;s2T0g.At time s,the network topology graph is represented by GðsÞ¼ðN;LðsÞg,where LðsÞrepresents the set of wireless links at time s,i.e.,for link l¼ðn;n0Þ2LðsÞ,nodes n and n0are within the transmis-sion range of each other.1We further denote a network paththat connects node n s and n d in this graph as Pðns;n dÞðsÞ¼ðn1;n2;...;n mÞ,whereðn j;n jþ1Þ2LðsÞfor j¼1;...;mÀ1, and n1¼n s,n m¼n d.We also use j PðsÞj to denote the path length of PðsÞ(i.e.,the number of links in PðsÞ).To simplifythe notation,we use G;L;P and omit s to represent the net-work topology,link set,and network path at a particular time instance.Fig.1shows an example mobile ad hoc network based on the terms defined above.Two snapshots of the network topologies at time instances s1and s2are shown in Fig.1(i) and(ii),respectively.Due to the mobility of node f,links ðf;dÞandðf;bÞin Gðs1Þare no longer available in Gðs2Þ.2.2.Service modelTo characterize the structure of distributed applications that are expected to run in the mobile computing environ-ments,we apply a component-based software model[2]. All application components are constructed as autonomous services that perform independent operations(such as transformation andfiltering)on the data stream passing through them.These services can be connected to form a directed acyclic graph,called a service graph.This paper focuses on so-called uni-cast service connec-tivity,i.e.,service components are linked in a sequence or-der with only one receiver.We call such a composed service a service path and denote it as S¼ðs1!s2!ÁÁÁ!s rÞ,where s kðk¼1;...;rÞis a service component,and s r is the service receiver.Moreover,we call one hop in a service pathðs k!s kþ1Þa service link.In a mobile ad hoc network,each service component s k can be replicated at multiple nodes to improve the service availability[15].We denote the set of nodes that can pro-vide services s k as N k#N and the service s k that resides on node n as s k½n ;n2N k.Fig.2shows an example of ser-vice deployment and service composition.A service link is an overlay link that may consist of several wireless links in the network,i.e.,a network path.In Fig.2,ðs1½a !s2½b !s2½c !s r½r Þis a service path;the service linkðs1½a !s2½b Þis supported by the network path P¼ðl1;l2Þ.The composed service usually needs to satisfy certain QoS requirements.To focus the discussion on the impact of service failures caused by node mobility,this paper con-siders a simple QoS metric—called the service link length—that is defined as the number of wireless links traversed by a service link.In particular,we require that the service link length is bounded by H hops.Table1summarizes the notations used in this paper.3.Service composition and recovery framework for mobile ad hoc networksThis section describes our service composition and recovery framework for ad hoc networks.3.1.Service compositionService composition refers to the process offinding a ser-vice path that satisfies designated QoS requirements in the network.As shown in Fig.3,service composition in a mo-bile ad hoc network involves the following two inherently related processes:Service routing,which selects the service components(out of many replicas)for the service path.This routing process relies on service component discovery[16,17]to find the candidate service components,then selects the appropriate ones to compose a service path that satisfies the QoS requirement.Formally,a service routing scheme is represented as p S¼ðs1½n1 ;s2½n2 ;...;s r½n r Þ,where n k2N k is the hosting node for the selected servicecomponent s k.Network routing,whichfinds the network path thatconnects the hosting nodes for selected service compo-nents.Formally,the network routing scheme can be1For simplicity,we only consider bi-directional wireless links in thiswork.S.Jiang et al./Computer Networks53(2009)1649–16651651represented as a set of routes p N ¼f P ðn k ;n k þ1Þ;k ¼1;...;r À1g where P ðn k ;n k þ1Þrepresents the network route that supports the service link ðs k ½n k !s k þ1½n k þ1 Þ.These two processes interact with each other closely.On one hand,the component selection in the service rout-ing determines the source and destination nodes in the network routing.On the other hand,the path quality in the network routing also affects the selection of servicecomponents in the service routing.Collectively,a service composition scheme is represented as p ¼ðp S ;p N Þ.In an ad hoc network,service failures may occur for multiple reasons.For example,end-to-end QoS require-ments of a service may be violated due to network over-load;service links may break due to failure of the underlying wireless communication path.This paper fo-cuses on service failures caused by node mobility .3.2.Service recoveryTo sustain service delivery,the service path must be re-paired.This repair process essentially recomposes the ser-vice path and is called service recovery .Service recovery is triggered by service failure detection at either link,net-work,or service level.For example,a wireless link failure could be detected at the link-level via IEEE 802.11ACK frame,or at the network-level through HELLO messages in the routing protocol,such as AODV [18].Similar to service composition,service recovery also in-volves two processes:(1)network-level recovery ,which re-pairs the data path between two components,and (2)service-level recovery ,which replaces one or more service components.The network-level path repair usually de-pends on the specific ad hoc routing protocol used and re-lies on the route repair mechanism built within the routing protocol.The service-level recovery involves discovery of new components and establishment of a new service path.Service recovery differs from service composition since it must consider not only the quality of the recomposed (i.e.,repaired)path,but also the service path used previ-ously (i.e.,the one that just failed).Intuitively,to reduce the repair overhead and recovery duration,we prefer a ser-vice path that could maximally reuse the current nodes/components.For example,network-level recovery may be attempted first without changing any service components.If this recovery fails,then a service-level recovery is initi-ated.The limitation with using this service recovery strat-Table 1Key notations.Notation Descriptiont 2T Continuous real times 2T 0Discrete time instance,when topology is changedN Set of mobile nodesG ðs ÞNetwork topology graph at time s L ðs ÞSet of wireless links at time s P ¼ðn 1;n 2;...;n m ÞNetwork path S ¼ðs 1!s 2!ÁÁÁ!s r ÞService pathHService link length requirement p S Service routing scheme p NNetwork routing schemep ¼ðp S ;p N ÞService composition and recovery scheme P ¼ðp ðt 1Þ;p ðt 2Þ;...;p ðt l ÞÞService composition and recovery policy U ðG T 0ÞThe set of all feasible service composition policies over G T 0F ð t ÞDisruption penalty function D Disruption indexe DDisruption index estimationN P !P 0Number of link substitutions from path P to path P 0N p S !p 0S Number of component substitutions from p S to p 0SJ ðp ðt w ÞÞMinimum disruption index for the service disruption experienced the service from time instance t w 2T where composition scheme p ðt w Þis used~d n !n 0ðt þD t ÞPredicted distance of a service link ðn !n 0ÞL n !n 0Lifetime of service link ðn !n 0Þ1652S.Jiang et al./Computer Networks 53(2009)1649–1665egy,however,is that the new service path may have a poor QoS and/or may fail again soon.Alternatively,we may wish to use service-level recovery directly without trying net-work-level recovery.Such a strategy,however,will incur more overhead in repairing the failed service links.Though node mobility can cause service failures,it may provide better service paths by bringing new service com-ponents into their vicinity,i.e.,within their transmission range.Service adjustment is the process of modifying the current service path for better QoS or higher reliability by using a new network path or new component(s)that ap-pear in the vicinity through node mobility.Similar to the dilemma faced by service recovery,however,such changes can disrupt the service,even though they improve the new path’s reliability and quality.4.Theoretical frameworkA fundamental research challenge for service recovery ishow to best tradeoff the time and overhead involved in service recovery and adjustment and the sustainability of composed service path so that end users will perceive minimum disrup-tions to the service during its lifetime .To address this chal-lenge,we need a theoretical framework that allows us to analytically study the service composition,adjustment,and recovery strategies to achieve minimum service disrup-tions.This section quantitatively characterizes the impact of service disruption and establishes an optimization-based theoretical framework based on dynamic programming.4.1.Service disruption modelDuring the service failure and recovery processes,the service is unavailable to the end user,thereby causing ser-vice disruption.To analytically investigate service compo-sition and recovery strategies that could provide the most smooth and reliable service delivery,we first need to char-acterize the impact of service disruption quantitatively.A classical way to model service disruption is service availability ,which is defined as the fraction of service avail-able time during the service lifetime T :A ¼T ÀP qi ¼1ð t iÞ,where q is the number of service disruptions and t 1; t 2;...;t q is the sequence of disruption ing availability as the metric to characterize the impact of service disrup-tion,however,we face the following two problems: Service availability cannot characterize the impact of ser-vice failure frequency ,i.e.,it cannot differentiate between one scenario with higher service failure frequency but shorter disruption durations from the other scenario with lower service failure frequency but longer disrup-tion durations.Fig.4shows an example of two service disruption processes.In this figure,scenario (i)and (ii)have the same service availability ð24Þ.User-perceived disruption could be different,however,since scenario (ii)has a higher service failure frequency but smaller disruption durations.To model the effect of service dis-ruption precisely,therefore,we need a new metric that characterizes both failure durations and failure frequency.Service availability is hard to compute .The calculation of service availability is based on the calculation of disrup-tion durations,which include the service failure time and recovery time.Such durations are determined by many factors,such as network topology,routing proto-col,and system conditions,which are dynamic and thus hard to be incorporated into service composition and recovery decisions.To establish a theoretical framework that provides realistic insight to implementation of ser-vice composition and recovery strategy,we need a met-ric that is stable,easily computed,and can provide a good estimation of disruption durations.To address the problem of measuring the impact of ser-vice failure frequency,we associate a disruption penalty function F ð t Þdefined over the disruption duration t with an end user.The shape of F ð t Þreflects its relative sensitivity to disruption duration and frequency.Fig.5shows three basic types of failure penalty functions (i.e.,convex,linear,and concave).We further define disruption index D as a metric to characterize the impact of service disruption dur-ing the entire service lifetime T :S.Jiang et al./Computer Networks 53(2009)1649–16651653D¼1TX qi¼1Fð t iÞ:ð1ÞTo show how the disruption index D characterizes different user-specific disruption effects by choice of Fð tÞ,we calcu-late the disruption indices for the two service disruption processes in Fig.4using the different failure penalty func-tions Fð tÞshown in Fig.5.The results are summarized in Table2.Table2shows that if Fð tÞis a convex function then dis-ruption process(ii)has a higher disruption index than pro-cess(i),i.e.,its end user is more sensitive to failure frequency.When Fð tÞis a concave function,disruption pro-cess(i)has a higher disruption index than process(ii),i.e., its end user is more impatient with disruptions with long duration.For a linear disruption penalty function the user is neutral and the disruption index depends on the service availability.To address the second problem of computing service availability,we present simple and stable estimations of disruption durations for network-level recovery and ser-vice-level recovery,respectively.4.1.1.Estimation for network-level recoveryFor network-level recovery,the service components re-main the same,i.e.,we only need to repair the network path that connects them.A typical network-level recovery pro-cess in repairing a network path in ad hoc networks[18]in-volves discovering an alterative route to replace the broken link/path and restarting the data delivery.Here we use the number of wireless link substitutions in the repair as a sim-ple estimate for the disruption duration introduced by net-work-level recovery.Formally,let P and P0be the paths before and after recovery.We use N P!P0to denote the num-ber of link substitutions from P to path P0.Let P\P0be the set of common links in these two paths,thenN P!P0¼j P0jÀj P\P0j:ð2ÞUsing the number of wireless link substitutions as an esti-mate for disruption duration introduced by network-level recovery is consistent with typical network repair opera-tions.For example,there are usually two repair mecha-nisms in wireless ad hoc routing:local repair and global repair.For local repair,when a link fails,one of its end nodes will try tofind an alternative path in the vicinity to replace this link.Local repair therefore involves fewer link substitutions and less recovery time.For global repair, the source node initiates a new route discovery,which takes more time than local repair and involves more linksubstitutions.24.1.2.Estimation for service-level recoveryA service-level recovery involves three operations:(1)finding the appropriate substitution components,(2)start-ing the new components and restoring the service states,and(3)finding a network path that supports the connec-tivity between the new components.Service-level recoverythus takes much more time than network-level recovery.Similar to network-level recovery,the duration of ser-vice-level recovery depends largely on the searching/replacing scope of the service components.We can there-fore use the number of substituted components to esti-mate its recovery duration.Formally,let p S and p0S be the service routing schemes before and after recovery.We use N pS!p0Sto represent the number of componentsubstitutions from p S to p0S,thenN pS!p0S¼j p0S jÀj p S\p0S j;ð3Þwhere j p0S j¼r is the number of components in p0S and j p S\p0S j is number of common nodes in these two sets.Based on the recovery duration estimation,we now pro-ceed to refine the definition of disruption index.Consider aservice S that starts at time instance0and ends at T.Let pðt1Þ;pðt2Þ;...;pðt lÞbe the sequence of service composi-tion schemes used during the service lifetime,and l be the length of this sequence.The disruption duration t k from service composition pðt vÞto pðt vþ1Þis estimated astk¼bÂN pðtvÞ!pðt vþ1Þð4Þ¼bÂðN N pðt vÞ!pðt vþ1Þþa N S pðtvÞ!pðt vþ1ÞÞ;ð5Þwhere N N pðt vÞ!pðt vþ1Þand N S pðt vÞ!pðt vþ1Þdenote the number of substituted wireless links in network-level recovery(if any)and the number of substituted components in ser-vice-level recovery(if any)incurred by the service compo-sition transition from pðt vÞto pðt vþ1Þ,respectively.b is the parameter that converts the number of substitutions to disruption time.a>1,denotes the relative weight be-tween service component substitution and link substitu-tion on disruption duration.Based on the discussions above,the disruption index D could be estimated via the component and wireless link substitutions.We denote the estimation of disruption in-dex as e D:e D¼1X lÀ1v¼1FðbÂN pðtvÞ!pðt vþ1ÞÞð6Þ¼1TX lÀ1v¼1FðbÂðN N pðt vÞ!pðt vþ1Þþa N S pðtvÞ!pðt vþ1ÞÞÞ:ð7Þ4.2.MDSCR problem formulationBased on the definition of disruption index,we now for-mulate the minimum disruptive service composition and recovery(MDSCR)problem.First,we define a service com-Table2Disruption indices under different penalty functions.Fi Fi(4)Fi(8)D ProcðiÞD ProcðiiÞF1(convex) 6.08617.23760.40210.6762F2(convex) 5.80887.31860.40660.6454F3(convex) 5.29157.48330.41570.5879F4(linear) 4.00008.00000.44440.4444F5(concave) 2.28579.14290.50790.2540F6(concave) 1.306110.44900.58050.1451F7(concave)0.746411.94170.66340.08292For simple estimation,we do not consider the impact of route cacheshere.1654S.Jiang et al./Computer Networks53(2009)1649–1665。

具有保护区域的无线Ad-hoc网络传输性能研究

具有保护区域的无线Ad-hoc网络传输性能研究唐菁敏;倪晨泉;杨孟;陈昌海;赵坤【期刊名称】《电子科技大学学报》【年(卷),期】2014(43)4【摘要】对现有抑制网络中干扰信号强度的方法进行了研究,针对抑制干扰的同时也限制了网络的传输容量的问题,提出在无线Ad-hoc网络中设置保护区域来抑制干扰,并推导了最优保护区域的半径。

理论分析和仿真结果表明,设置保护区域能够极大程度降低网络中的干扰信号强度,合理地设置保护区域大小能有效提高传输容量,并且保护区域半径存在一个最优值,能使得网络的传输容量达到最大值。

%The existing methods for suppressing the strength of interference signals in the networks can suppress interference signals effectively but they cause a limit to the transmission capacity of the networks at the same time. To solve this problem, a method of setting guard zone in wireless Ad-hoc network is proposed to suppress interference and the optimum radius of guard zone is derived. Theoretical analysis and simulation results show that the proposed method could greatly reduce the level of interference signal and reasonable radius of guard zone could increase the transmission capacity. The transmission capacity will reach maximum due to an optimum radius of guard zone.【总页数】5页(P519-523)【作者】唐菁敏;倪晨泉;杨孟;陈昌海;赵坤【作者单位】昆明理工大学信息工程与自动化学院昆明 650000;昆明理工大学信息工程与自动化学院昆明 650000;昆明理工大学信息工程与自动化学院昆明650000;四川工程职业技术学院电气信息工程系四川德阳 618000;昆明理工大学信息工程与自动化学院昆明 650000【正文语种】中文【中图分类】TN911.22【相关文献】1.多跳协作分集无线网络传输性能研究 [J], 郭赛球;胡奇光;唐菁敏2.Ad-hoc网络传输控制协议研究 [J], 吴彬;拱长青;杨者青3.基于跨层的认知无线网络传输性能增强研究 [J], 薛亚运;周刘蕾4.无线多跳传感器网络传输性能研究 [J], 杨凡5.无线网络传输性能改进研究 [J], 刘佳因版权原因,仅展示原文概要,查看原文内容请购买。

指导老师舒炎泰教授

between channels Fast switch from
Mobility (potentially high-speed)
Link adaptation Variable
transmission power Multiple channels Link quality feedback
考虑开发具有TDMA或CDMA的分布和协作的MAC协议的复杂性和成本; 是具有现有MAC协议的TDMA(或CDMA)MAC的兼容性。如在802.16中,
原来的MAC协议是一个集中的TDMA方案, 但对于802.16 mesh,一个 分布式的TDMA MAC仍然是空缺。在802.11WMNs中,如何设计一个覆盖 CSMA/CA的分布式的TDMA MAC协议是一个有趣但具有挑战的问题。
要大量的研究努力; 虽然已经建议的Adaptive/smart天线等的多天线系统,以及MIMO系
统能增加容量和减轻由于衰退、通道干扰引起的损害,但对WMNs 而言,开发这种技术是一个更具挑战的问题; 为了更好的利用物理层提供的先进技术,尤其MAC层协议需要和 物理层交互的工作。因此,设计物理层的一些组件时,应使高层能 访问或控制它们。这就使得硬件的设计更具挑战性,同时,也触发低 成本软件radio技术的创新。
Tianjin University
Computer Department
Design Approaches of a Single-channel MAC protocol
Modifying Existing MAC Protocols
例如,在一个802.11 mesh网中, MAC层协议可以通过调整CSMA/CA的参 数得到改善(如CW的大小,修改backoff程序)。但该方法仅能实现低的 端到端的吞吐率,因为它不能大量的减少邻居节点间竞争的概率。

无线网络安全第1章



无中心、自组织网络


10
Wireless Networks
Ad-Hoc Networks
Infrastructure-based Networks 2G/3G WiMAX
Single-Hop
Multi-Hop
Bluetooth
802.11 IBSS
Static
Dynamic
Wireless Mesh Networks
Wireless Sensor Networks
其他
Vehicular Ad Hoc Mobile Ad Hoc Networks (VANET) Networks (MANET)
基于网络拓扑结构的无线网络分类
11
无线网络概述

网络终端设备按功能分为

智能手机 平板电脑(笔记本电脑) 具有通信能力的传感器节点 RFID标签和读卡器 可穿戴计算机
22
无线网络安全概述

信息系统的安全需求
当前在已有信息系统安全需求的基础上增加了真 实性(Authenticity)、实用性(Utility)、占有性 (Possession)等。 真实性:是指信息的可信度,主要是指信息的完整性、 准确性和对信息所有者或发送者身份的确认。 实用性 :是指信息加密密钥不可丢失(不是泄密),丢 失了密钥的信息也就丢失了信息的实用性,成为垃圾。
32
无线网络安全概述

信息系统安全的发展

早期信息保密阶段

安全性评价准则 1985年美国开发了可信信息系统评估准则(TCSEC) 把信息系统安全划分为7个等级: D,C1,C2,B1,B2,B3,A1 为信息系统的安全性评价提供了概念、方法与思路, 是开创性的。为后来的通用评估准则(CC标准)打下基础

无线Ad hoc网络中干扰感知的拓扑管理


frne a aetp lg n ae n g rh bsd o oepi 哆 (- MP .B t tend tr rnead nd pe e ee c— w r o oyma gme t o tm ae nn d f o l a i I T O) o h o ei e e c oesed w r h n fe n e
中图分 类号 :P0 . T3 16 文献标 识码 : A 文章编 号 : 7 — 2 X 2 1 )1 03 —4 1 3 69 (02 0 — 13 0 6
I e f r n e Awa e To lg a a e e n W iee s nt re e c - r poo y M n g m nti r ls
郭 静 禹继 国 , , 王光辉
(. 1 曲阜师范大学 计算机科 学学院, 山东 日 26 2 ; 照 7 86
2 山 东大 学 数 学 学院 , 东 济 南 20 0 ) . 山 5 10
摘 要 : 问题 是无 线 网络 中的一 个普 遍现 象 。干扰影 响 网 络 总能 耗 、 吐量 、 干扰 吞 网络 寿 命等 , 少 干 扰可 以优化 网络性 减
o n o ma n b r i f r to +Th o e n M DS c n t u e a c n c e o n tn tt r u h i t r e i t o e .Th oT c n s f te ag r h i e n d si o s t t o ne td d mi a g s h o g n e i i e m d ae n d s e c ie t e s o l o i m h t i r v d.Si a o s l h w a e ag rt m a et rp r o ma c . spo e mult n r u t s o t t o ih h s b t f r n e i e s h t l h e e Ke r s: r l s o e o k c u trn y wo d wiee sAd h c n t r s; l se g;CDS;VBN ;i e e e e w i ntr r nc f
  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

IWWAN 2005 1

Abstract—Traditional monolithic operating systems have conceptually remained almost unchanged since the UNIX, that is, since the late 70s. Several experimental operating systems from the research community have been based on alternative paradigms. Today we are facing the dawn of mobile or wireless Internet. This new operational environment calls for new solutions. A paradigm shift in operating system design, as demonstrated by some experimental operating systems, can help us to lay the software foundation for reconfigurable end-user systems.

Index Terms—mobile computing, operating systems, wireless communication.

I. INTRODUCTION PERATING systems have been in the core of computer science from the very beginning. Therefore, one can ask is there some issues still open. If the answer is yes then one can ask why fifty years have not been enough in solving all relevant issues. Clearly operating systems have evolved a lot during the years. However, changes in operational requirements have changed so that today we need to reconsider even the fundamentals of operating systems. The need of this reconsideration has its roots in the fundamental changes in usage patterns. Communication and computing devices move; users move and change their devices; (sub)networks in cars, trains and airplanes move; software moves from one execution environment to another. In this paper we discuss some research challenges in operating systems for future wireless ad-hoc systems. We start by stating our assumptions about future mobile applications. In Section III we take a look at some milestones in operating systems. In Section IV we discuss the architectural challenge arising from the fundamental requirement of holistic solutions. In Section V we elaborate some fundamental research issues for future generations of operating systems.

Kimmo Raatikainen is a professor at the Helsinki University Computer Science Department, P.O. Box 68 (Gustaf Hällströmin katu 2b), FIN-00014 UNIVERSITY OF HELSINKI, Finland (kimmo.raatikainen@cs.helsinki.fi).

He also works as a part-time research fellow at Nokia Research Center, P.O. Box 407 (Itämerenkatu 11-13), FIN-00045 NOKIA GROUP, Finland (kimmo.raatikainen@nokia.com) and s part-time principal scientist at Helsinki Institute for Inofrmation Technology, P.O. Box 9800 (Tamma-saarenkatu 3), FIN-02015 TKK, Finland (kimmo.raatikainen@hiit.fi).

II. FUNCTIONALITY IN FUTURE MOBILE SYSTEMS In reconsideration we have taken into account various mission papers [1]-[7]. These visions can be summarized as follows: Future applications will be context-sensitive, adaptive and personalized, and the systems will be reconfigurable. Until recent years, the computing and communication have been mainly driven by technology. Engineers have developed technologies that consumers have figured out how to use. It has worked, we have got positive surprises, but this path is close to an end. We believe that in the next ten years we must move from gadget (and technology) centricity to user-centricity. Producers want to be sure that their products will sell well enough. The studies of end-user expectations set the requirements of infrastructure research. However, this is not a one-way road. The feedback loop gives cost estimates: how expensive certain features are when deployed locally, nation-wide, world-wide. In the forthcoming years we need to take a radically new attitude in order to realize Mark Wiser's vision of ubiquitous computing [1]: the computing and communication is here but you do not need to bother. In bringing the dream of invisible computing into reality for mass markets, that is for hundreds of millions of people, we still have a lot to do. In fact our claim is that we must go back to the fundamentals; to reconsider the foundations of mobile computing and communications. As stated in the Introduction, the need of this reconsideration has its roots in the fundamental changes in usage patterns. These properties have been examined by WWRF [7] in details. Below we briefly elaborate the functional requirements behind the concepts of reconfigurability. In essence reconfigurability means that system’s hardware and software configurations can seamlessly change in run-time. A personal trusted device will be the core of the personal networking system. It probes its surrounding looking for suitable peripheral devices such as displays, input devices, processors, fast access memories and access points to communication channels. It dynamically builds up the most appropriate end-user system that can be autoconfigured. The device also probes for other similar devices in order to establish suitable ad-hoc communities and different kinds of

相关文档
最新文档