Search

After ECN was first added to IP in 2001, it was hit by a succession of deployment problems. Studies in recent years have concluded that path traversal of ECN has become close to universal. In this article, we test whether the performance enhancement called ECN++ will face a similar deployment struggle as did base ECN. For this, we assess the feasibility of ECN++ deployment over mobile as well as fixed networks. In the process, we discover bad news for the base ECN protocol: contrary to accepted beliefs, more than half the mobile carriers we tested wipe the ECN field at the first upstream hop. All packets still get through, and congestion control still functions, just without the benefits of ECN. This throws into question whether previous studies used representative vantage points. This article also reports the good news that, wherever ECN gets through, we found no deployment problems for the "++" enhancement to ECN. The article includes the results of other in-depth tests that check whether servers that claim to support ECN actually respond correctly to explicit congestion feedback. Those interested can access the raw measurement data online. The work of Anna Maria Mandalari has been funded by the EU FP7 METRICS (607728) project. The work of Marcelo Bagnulo has been performed in the framework of the H2020-ICT-2014-2 project 5G NORMA and the 5G-City project funded by MINECO. This work was partially supported by the EU H2020 research and innovation program under grant agreement No. 644399 (MONROE) and grant agreement No. 688421 (MAMI).

In this paper, a novel approach is proposed for investigating the critical elements of distribution systems based on the sensitivity analysis of reliability indices in terms of changes in the failure rate of various system elements. By using the proposed approach, it is possible to determine the impact of distribution network components based on their types (overhead lines, cable, transformers, substation, etc.) on the system reliability. Therefore, the appropriate strategies can be developed to improve the system reliability, corrective actions, and strict repair strategy for critical points. One of the advantages of the proposed method is its flexibility for the existing conditions of the distribution system and it doesn't require specific infrastructure or studies with widespread mathematical complexity. The proposed method is applied to the actual 20 kV distribution network of University of Kashan by using the DIgSILENT, MATLAB, and their interconnection. This feature (link between MATLAB and DIgSILENT) would be very interesting for the engineers of distribution companies, because its implementation is simple. The results illustrate the usefulness of the proposed approach in different situations.

International audience; The Internet of Things (IoT) for agriculture is a rapidly emerging technology where seamless connected sensors device make it possible to monitor and control crop parameters to get quality and quantity of food. This research proposes a new dynamic clustering and data gathering scheme for harnessing the IoT in agriculture. In this paper, an Unmanned Aerial Vehicle (UAV) is used to locate and assist ground IoT devices to form themselves in cluster formation then establishes a reliable uplink communication backbone for data transmission. Use of multifrequency, multi power transmission, and mobile sink make it possible to reduce power utilization of IoT devices as much as possible. The proposed scheme is evaluated by using simulation models and practical experiments. It is found working outclass as compare to all existing systems.

In this study, the authors apply a generalised quantise-and-forward (GQF) relaying scheme for multiple access relay channel (MARC). The authors find achievable rate regions of GQF on MARC for both discrete memoryless case and additive white Gaussian channel. They assume that the relay has no access to channel state information (CSI) of the relay–destination link. Through numerical examples, they show that in the absence of CSI at the relay, the GQF scheme outperforms other relaying schemes. They also show that the outage probability of the individual users is lower than that of classic compress-and-forward scheme.

This paper describes the analysis of methods of providing differentiated resiliency. The gain in cost due to the use of a differentiated approach is evaluated.

In this paper, we propose a new approach for modeling and evaluating reliability of complex public safety network. Based on Bayesian network structure, we develop a general construction methodology for network representation and design. Using probability propagation techniques, the reliability of the system can be obtained in a straightforward manner. To evaluate our model, the proposed method is illustrated through three PSN scenarios that exemplify real emergency situations.

Modern critical infrastructure networks are becoming increasingly interdependent where the failures in one network may cascade to other dependent networks, causing severe widespread national-scale failures. A number of previous efforts have been made to analyze the resiliency and robustness of interdependent networks based on different models. However, communication network, which plays an important role in today's infrastructures to detect and handle failures, has attracted little attention in the interdependency studies, and no previous models have captured enough practical features in the critical infrastructure networks. In this paper, we study the interdependencies between communication network and other kinds of critical infrastructure networks with an aim to identify vulnerable components and design resilient communication networks. We propose several interdependency models that systematically capture various features and dynamics of failures spreading in critical infrastructure networks. We also discuss several research challenges in building reliable communication solutions to handle failures in these models.

Radio Frequency Identification (RFID) has been developed as an important technique for many high security and high integrity settings. In this paper, we study survivability issues for RFID. We first present an RFID survivability experiment to define a foundation to measure the degree of survivability of an RFID system under varying attacks. Then we model a series of malicious scenarios using stochastic process algebras and study the different effects of those attacks on the ability of the RFID system to provide critical services even when parts of the system have been damaged. Our simulation model relates its statistic to the attack strategies and security recovery. The model helps system designers and security specialists to identify the most devastating attacks given the attacker's capacities and the system's recovery abilities. The goal is to improve the system survivability given possible attacks. Our model is the first of its kind to formally represent and simulate attacks on RFID systems and to quantitatively measure the degree of survivability of an RFID system under those attacks.

The paper presents a tutorial on multilayer recovery methods. Emphasis is laid not on their procedural operation, but rather on their quality assessment and differentiation based on reliability parameters (e.g., availability, recovery time) and other relevant features (e.g., affected traffic, state overhead). A brief outline of terminology related to multilayer networks is given. Then, an overview of recovery methods is presented, with focus on multilayer recovery. Next, quality features enabling assessment of multilayer recovery are given along with general approaches to service differentiation based on resilience.

This paper presents a minimal cutsets-based unified framework to evaluate some commonly used reliability measures: g-terminal, 2-terminal, and k-terminal reliability. In doing so, the paper proposes a single algorithm, which generates the network node sets. From these node sets, depending on the reliability measure(s), only those node sets are kept, which contains at least one node from the specified node set. These selected node sets form link-minimal cutsets. These minimal cutsets are used as an input to multi-variable inversion-based sum-of-disjoint product approach to obtain the unreliability expression thereafter. By solving several network examples of varied complexities, the comparison with the existing approach is provided.

The paper derives lower bounds on the redundancy, the protection capacity to working capacity ratio, needed by link-protection or link-restoration. Homogeneity conditions, on which the well-known redundancy bound 1/(dmacr1) holds for a network, are also identified, where dmacr is the average nodal degree.

This article considers the effects of Internet worms on persistently unpatched hosts and hosts for which vulnerabilities are refreshed. Previous models have been homogeneous; that is, all hosts transitioned through the same set of states. The model considered in this article is heterogeneous and more realistic in that subpopulations of hosts are assumed to have inherently different characteristics. Equilibrium conditions are obtained for which an Internet worm will self-propagate indefinitely, which lead to thresholds below which worms will become extinct.

This survey of denial-of-service threats and countermeasures considers wireless sensor platforms' resource constraints as well as the denial-of-sleep attack, which targets a battery-powered device's energy supply. Here, we update the survey of denial-of-service threats with current threats and countermeasures.In particular, we more thoroughly explore the denial-of-sleep attack, which specifically targets the energy-efficient protocols unique to sensor network deployments. We start by exploring such networks' characteristics and then discuss how researchers have adapted general security mechanisms to account for these characteristics.

In this article, we present a study of the design of secure and survivable wireless sensor networks (WSN) that has yet to be addressed in the literature. Our goal is to develop a framework that provides the security and survivability features that are crucial to applications in a WSN, because WSNs are vulnerable to physical and network-based security attacks, accidents, and failures. To achieve such a goal, we first examine the security and survivability requirements. We then propose a security and survivability architecture in a WSN with heterogeneous sensor nodes. To understand the interactions between survivability and security, we also design and analyze a key management scheme. The results of the experiment show that a good design can improve both security and survivability of a WSN; however, in some situations, there is a trade off between security and survivability.

A reliable control plane plays a crucial role in creating high-level services in the next-generation transport network based on the generalized multiprotocol label switching (GMPLS) or automatically switched optical networks (ASON) model. Approaches to control-plane survivability, based on protection, and restoration mechanisms, are examined. Procedures for the control plane state recovery are discussed, including link and node failure recovery

Recently, increasing research attention has been directed toward wireless sensor networks: collections of small low-power nodes, physically situated in the environment, that can intelligently deliver high-level sensing results to the user. As the community has moved into more complex design efforts — large-scale, long-lived systems that truly require self-organization and adaptivity to the environment — a number of important software design issues have arisen. To make software robust, we must carefully observe its behavior and understand its failure modes. However, many of these failures are not manifested until deployment time. Channel and storage limitations make visibility into a deployed system difficult, hindering our understanding of failure modes. Simulation is difficult to apply; the network’s physical situatedness makes it sensitive to subtleties of sensors and wireless communication channels that are difficult to model. In this article we describe EmStar, a PC-based software framework that aims to make development easier by improving system visibility. EmStar’s novel execution environments encompass pure simulation, true in-situ deployment, and hybrid modes that combine simulation with real wireless communication and sensors situated in the environment.

For mobile user equipments (UEs), a careful power management is essential. Despite this fact, quite an amount of energy is wasted in today's UEs' analogue (AFEs) and digital frontends (DFEs). These are engineered for extracting the wanted signal from a spectral envir- onment defined in the corresponding communication standards with their extremely tough requirements. These requirements define a worst- case scenario still ensuring reliable communication. In a typical receiving process the actual requirements can be considered as less critical. Knowledge about the actual environmental spectral conditions allows to reconfigure both frontends to the actual needs and to save energy. In this paper, the authors present a highly efficient generic spectrum sensing approach, which allows to collect information about the actual spec- tral environment of an UE. This information can be used to reconfigure both the AFE and DFE, thus endowing them with increased intelli- gence. A low-complex multiplier free filter bank extended by an efficient power calculation unit will be introduced. They also present simulation results, which illustrate the performance of the spectrum sensing approach and a complexity comparison with different well- known implementations is given. Furthermore, estimates on the chip area and power consumption based on a 65 nm CMOS technology data- base are provided, considering the Smarti4G chip as a reference.

The Internet of Things (IoT) provides a virtual view, via the Internet Protocol, to a huge variety of real life objects, ranging from a car, to a teacup, to a building, to trees in a forest. Its appeal is the ubiquitous generalized access to the status and location of any “thing” we may be interested in. Wireless sensor networks (WSN) are well suited for long-term environmental data acquisition for IoT representation. Application requirements, such as low cost, high number of sensors, fast deployment, long lifetime, low maintenance and high quality of service need to be considered from the beginning to achieve a WSN platform optimized for a range of long-term environmental monitoring IoT applications. Also important, the low-effort platform reuse should be considered through all design levels, for the platform as a whole and for all its components.

In recent years, along with the spread of WiFi-based location estimation service, the privacy problem has been pointed out. For existing WiFi-based location estimation service, users' traces and position information can be obtained fraudulently. Personal privacy may be compromised. This research proposes an algorithm that determines the reliability of the user by considering the probability of both spatial and temporal to resolve the privacy problem in WiFi-based location estimation. Meanwhile, we are operating a portal Locky.jp on location estimation using WiFi. Based on the actual data of base stations stored in the Locky.jp database, we confirm this algorithm. As a result, the percentage of returning position for privacy invasion data and whole data (privacy invasion data is also included) are about 20% and 55% respectively. In summary, we know that this algorithm reduced the privacy invasion to about 20% in the WiFi-based location estimation system.

The transmission of safety/update message aims to inform the nearby vehicles about the senders current status and/or a detected dangerous situation. This type of transmission is designed to help in accident and danger avoidance. Moreover, it requires high message generated rate and high reliability. On the other hand, the transmission of non-safety message aims to increase the comfort on vehicles by supporting several non-safety services, from notifications of traffic conditions to file sharing. Unfortunately, the transmission of non-safety message has less priority than safety messages, which may cause shutting down the comfort services. The goal of this paper is to design a MAC protocol in order to provide the ability of the transmission of non-safety message with little impact on the reliability of transmitting safety message even if the traffic and communication densities are high in a multi-hop cluster. Our protocol is based on modifying TC-MAC which uses TDMA technique for slot reservation based on clustering of vehicles.

In the previous issue, the author disclosed the concurrency features of Erlang, a programming language created at Ericsson more than 20 years ago for implementing telecommunications systems with stringent reliability, distribution, and uptime requirements. In this paper, the author explains that Erlang's concurrency primitives provide more than just a fast way to create threads. They also enable parts of an application to monitor other parts - even if they're running on separate hosts across the network - and restart those other parts should they fail. Erlang's libraries and frameworks take advantage of these capabilities to let developers build systems with extreme availability and reliability.

C-ACTI; International audience; Performance of transport protocols on lossy links is a well researched topic, however there are only a few proposals which make use of the opportunities presented by the use of erasure coding within the transport layer, particularly in the multipath transport protocol context. In this paper, we investigate the improvements in the performance of multipath SCTP transport protocol brought by the novel integration of the on-the-fly erasure code into the congestion control and reliability mechanisms of CMT-SCTP. Our contributions include: integration of transport protocol and erasure codes with regards to congestion control and reliability mechanisms; proposal for a variable retransmission delay parameter in the sender (aRTX) adjustment; evaluation of the performance of CMT-SCTP with erasure coding with simulations. Our results show that we can achieve from 10% to 80% improvements in application goodput under lossy multipath network conditions without a significant penalty i.e. with a minimal (10%) overhead due to the encoding-decoding process. We further evaluate the performance of video streaming using an equivalent of partially reliable CMT-SCTP with erasure coding and again demonstrate a solid performance improvement for our proposal, compared to CMT-SCTP. Finally, we provide an analytical evaluation of CMT-SCTP with erasure codes and validate this with simulation results.

We consider the two-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with message points, in the spirit of Schalkwijk&Kailath's scheme for point-to-point channels or Ozarow&Leung's scheme for BCs with private messages, are strictly suboptimal for this setup. In fact even with perfect feedback, the maximum rate achieved by these schemes is strictly smaller than capacity (which is the same with and without feedback). In contrast, rate-limited feedback suffices for bursty-feedback schemes to achieve double-exponential decay of the probability of error when the feedback rate RFB is at least equal to the forward rate R.

An announcement scheme is a system that facilitates vehicles to broadcast road-related information in vehicular ad hoc networks (VANETs) in order to improve road safety and efficiency. In this paper, we propose a privacy-aware reputation-based announcement scheme that provides message reliability evaluation, auditability, and robustness.

Relay attacks are powerful attacks, since they are easy to set-up and can be performed with very limited resources. Furthermore this type of attack is very hard to detect. This paper proposes a novel approach to defend against amplify and forward relay attacks. The proposed scheme detects relaying attackers by measuring the noise statistic variations. Such information can be collected using the existing Radio-Frequency (RF) front-end equipments, without modifying the protocol and without additional hardware. A campaign of measurements using a contactless RFID system has been conducted to evaluate the effectiveness of the proposed method. The results show that this new scheme is practical and can be used to detect relay attacks.

The application areas for Unmanned Aircraft (UA) Systems (UAS) are constantly expanding. Aside from providing an attractive alternative in applications that are risky for humans, smaller UAS become highly attractive for applications where use of larger aircraft is not practical. This paper presents the UAS Collaboration Wireless Network (UAS-CWN), a secure and reliable UAS communication mesh-network. This solution is proposed for the circumstances where a large number of UAS are deployed to cooperatively accomplish a mission such as surveillance in hostile environments. The proposed UAS-CWN system provides high fault-tolerance through use of information dispersal algorithm and meanwhile reduces the risk of information exposure to the adversaries via security-enhancing mechanisms. Our evaluation shows promising results. Especially, a UAS-CWN with high security-level settings can withstand losing 30% of the total number of unmaned aircrafts while steadily achieving above 96% data recovery rate.

For reliable transport of data in wireless network, Aggressive Packet Combining (APC) scheme is well-established. APC has several limitations including throughput. Several modifications were earlier studied elsewhere for improving the throughput. The throughputs of the proposed new techniques are higher than that of APC. In this paper we propose two new modifications of APC. The performance of proposed modified APC is studied numerically & reported.

We provide optimal virtual network design models with protection against various physical and virtual failures. Our models enable protection against single link, node and sub-network failures with almost the same cost using an intelligent design.

Modem wireless sensor networks require specific and high degree of security due to their limitation and versatility tasks. The absence of permanent infrastructure makes these networks suitable for many civilian applications. But their limited computational ability and battery resources restrictions makes them vulnerable to many kinds of attacks. This paper presents reliability in Wireless Sensor Network (WSN) information transmition, which can be used to exactly estimate the system working quality. The WSN reliability mathematical calculation approach presented in this paper gives insight on how to secure WSN through reliable backbone connectivity, reliable sensor network and data aggregation. Solutions to meet WSN security interconnectivity reliability, network reliability and data aggregation scheme for robust security systems designing also have been introduced.

Large-scale telecommunication networks process millions of transactions daily. The authors present an approach for warehousing data about faulty networks and for mining it to find trends. Applying this approach to AT&T's worldwide network, the authors have identified several patterns, which AT&T can use to improve network reliability.

Infrastructure networks are highly interrelated to the prosperity, security, economy, and public health of the modern world. As such, any disruption in the infrastructure network poses a significant damage to society, therefore this paper presents a resilience analysis approach to evaluate the reliability of infrastructure networks so as to quantitatively determine the ability of a network to cope with complexity under disruption as well as to develop foresight in safety management. Under resilience analysis, an infrastructure network is modeled as an undirected graph with nodes and edges, and the resilience of the whole network can then be evaluated by the weighted sum of the resilience of all the reliable independent connection paths between all pairs of nodes. The proposed approach is also illustrated in a portion of a rail network, and the results indicate that the ability of the network to cope with complexity under disruption can be explicitly known.

In VANETs, how to resistant from collusion attacks are still an open problem. There are more and more attentions in recent years for improving the trust management model to counter collusion attacks. In this paper, we first evaluate beacon based trust management system, BTM, and RSUs aided model, RaBTM, with different combination of collusion attacks. Both of these two systems aim to propagate message opinions quickly while thwart internal attackers in privacy-enhanced VANETs. To evaluate the reliability of these two systems under different combination of collusion attacks effectively, we conducted a set of simulations with colluding alteration attacks and bogus message attacks. The simulation results show that the RaBTM and BTM are highly resilient to collusion attacks and performs at least 15% better than comparison baseline.

This paper is focused on the propagation of failures within a core telecommunication network (i.e. virus or malicious code spreading), which are commonly represented using epidemic models. This work conducts an analysis of the vulnerability of five core telecommunication networks subject to different epidemic attacks. The difference between the attacks relies on the method used to select the initial set of infected nodes. As a novelty, the investigation is focused on the initial stage of the epidemics (first 48 hours). The analysis is carried out taking into account the topological connectivity of the networks. Results are presented in two phases. The first one concerns the first 24 hours of the epidemics evolution and shows the reaction of core networks to different types of epidemic attacks. The second one is focused on the time frame between 24 and 48 hours and presents a study of the repairing times needed to eradicate the epidemics. Results show that the core telecommunication networks react differently depending on the type of epidemics. Thus, different repairing times need to be applied in order to maintain a specific level of connectivity of the networks.

A rate-compatible puncturing scheme for LDPC codes is proposed based on the fact that a one-step recoverable (1-SR) node is more reliable than a k-SR node (k>$) and a 1-SR node with more survived check nodes can be recovered more reliably in a recovery tree, so the scheme tries to obtain 1-SR nodes which have multiple survived check nodes as many as possible. Simulation results show that the puncturing scheme has better performance than both the random puncturing scheme and the novel method in [5].

Ubiquitous uncertainty has great impacts on target tracking accuracy in wireless sensor networks (WSNs). This paper focuses on the uncertainty of pair wise sensor nodes, and analyzes it on unreliable samplings of sensors as well as the uncertain relationship between location points and expected sensing results, qualitatively and quantitatively. The sampling vector, which reflects sensing information, is constructed by multiple grouping samplings, while the tracking area can be divided into patches which are assigned to specific signature vectors. Two target tracking strategies are proposed by matching the two vectors, from the qualitative and quantitative aspect, respectively. Results show that both methods can achieve high tracking reliability and satisfy tracking accuracy and robustness for the uncertainty caused by in-the-field factors.

Inter-vehicle safety communication is a low cost method to improve road traffic safety. This paper surveys the acknowledgement confirmations in broadcasting MAC protocols and their applicability to inter-vehicle safety communication. The characteristics and the key problems of inter-vehicle safety communication are analyzed. Acknowledgement confirmation is an important factor affecting the message reception reliability and the delivery latency. Due to the different reply mechanisms, the broadcasting MAC protocols are classified, the corresponding acknowledgement confirmation and its applicability to intervehicle safety communication are discussed. At last, we conclude the acknowledgement confirmation of inter-vehicle safety communication.

Collaboration among cognitive radios has been extensively studied in the past and widely accepted as a viable approach to improve spectrum sensing reliability. Data fusion in collaborative spectrum sensing rely on the information received from cognitive radios. It has been shown in literature that the performance of collaborative spectrum sensing degrades significantly in the presence of even a single malicious user. In this paper, a new scheme to detect and eliminate malicious users in collaborative spectrum sensing is proposed. Our method is based on the Grubb's test and is able to detect and eliminate observations of multiple malicious users. Simulation results show that the proposed scheme has much higher detection probability in the presence of malicious users especially for the case when the received signal to noise ratio is low.

Spectrum sensing is one of the critical aspects in cognitive radio (CR). CR user must be able to detect the spectrum opportunity reliably and efficiently in order to use the available spectrum. In spectrum sensing, a local radio might fail to monitor the available spectrum holes due to shadowing and hidden terminal problem. Cooperative spectrum sensing can be employed to combat this problem using two approaches; centralized and decentralized (distributed) system. In this paper, we evaluate the performance of both centralized and decentralized cooperative spectrum sensing under several policies; OR and AND rules based on energy detection. The effectiveness of the both centralized and decentralized techniques were investigated and compared in terms of probability of detection and signal-to-noise ratio (SNR). We observe that the OR rule achieve better performance than AND rule in attaining higher detection probability.

Electronic resources purchased by library mostly only allow access of authorized users who own on-campus IP address. Some off-campus users who get on the Internet by dialing, etc and have no fixed IP address cannot access library resources. In this paper, building one secure and reliable virtual private network is presented by utilizing VPN technology on the basis of campus network to be specially used by library management system.

In this paper, we treat the quality of service challenge for publish/subscribe system deployed in MANET. The proposed approach provides monitoring and proactive analysis at the middleware layer for predicting QoS degradations of logical links between brokers. Failure prediction is performed using a statistical method called Auto Regression (AR) which allows to analyze the monitored data in order to avoid failures occurrence. The simulation results which prove the efficiency of the proposed approach are reported.

The Multimedia-over-Coax Alliance (MoCA®) standard is rapidly emerging as the de-facto standard for multimedia home networking. This is driven by the desire to have digital content from various sources such as DVRs, audio devices and PCs reliably available anywhere in the home using the in-home existing coaxial cable wiring. The MoCA technology coexists with other services on the coax such as cable TV, cable modem, and satellite services. This enables it to be used also as a last-mile access technology to effectively and cost efficiently use the existing coax cabling for bringing high speed IP services into the home, GigaCoax®.

Regional failures caused by disasters precipitate huge amount of loss and jeopardize many connections. A risk model for disasters, considering differentiated services, is introduced and a disaster-aware provisioning scheme is proposed to reduce the risk.

The structure of the IOT and transmission property of RFID System is discussed?Cthe reliability and safety of RFID System is particularly important?Cthe methods to solve data collision and security attack is analyzed?DMoreover?Cthe application of RFID Middleware is introduced about the the networking mode on the IoT?D

A wireless sensor network (WSN) is a collection of distributed sensor nodes to work together for monitoring the physical and environmental conditions. Trust in wireless sensor networks is an important issue and it solves the problem of access control, privacy, secure routing scheme and reliable communication. This paper introduces a new approach to calculate the trust in WSN. The proposed algorithm and the evaluation of the trust value of the node in the network depend on the trust attributes, metrics and trust parameters.

Body Area Networks (BANs) are only recently beginning to revolutionize e-healthcare by making monitoring of various patients accessible and convenient for physicians and patients. Past research in BANs has focused on biosensor design, signal processing, power efficiency, and wireless protocols. However, numerous challenges plague its development and implementation to this day. One of these is the dependability — a conjunction of reliability, security and availability — from both an intra-BAN and extra-BAN communications perspective. Using a generic, divided system model (intra-BAN and extraBAN), we identify potential areas of failure. The paper discusses and classifies issues and schemes proposed to increase dependability. Finally, upcoming challenges and new directions of research for improving the dependability of BANs are presented.

While networks have become ubiquitous, fast, and cheap, the carriers and vendors face serious challenges in making networks more reliable and secure. Rapid technical evolution, market pressures, and complexity have contributed to large outages in both data and voice networks in the USA. The unreliable deployment and operation of otherwise fault-tolerant communication technologies and architectures are causing severe disruptions to thousands of users and enterprises. Network reliability growth is difficult in an environment that bundles rapidly emerging services and concentrates infrastructure to realize economies of scale.

The mobility of peers is the main feature of Mobile Peer-to-Peer (MP2P) network, also the greatest challenge it faced. In this paper, we use Cell Division Principle in MP2P Dynamic Structure Model (DSM) and propose a Mobility Management Scheme (MMS). Simulations are conducted to evaluate the performance of DSM and MMS. Compared to the Semi-distributed Model, empirical result shows that DSM has better network scalability. Compared to the Energy-greedy Scheme, MMS has higher peer relocation success rate.

The reinforced security strategy can’t ensure the survivability of command automation system under information warfare. To solve non-standardized and non-practical problems of present survivability analysis, a practical and operational survivability analysis framework of command automation system is presented on basis of survivability requirements, which is useful for survivability design and assessment of command automation system.