Mobile Ad Hoc Networks (MANET) are characterized by a highly dynamic topology as a consequence of the frequent and unpredictable changes in the link states. Routing protocols must cope withthis eventuality so when ro...
详细信息
Mobile Ad Hoc Networks (MANET) are characterized by a highly dynamic topology as a consequence of the frequent and unpredictable changes in the link states. Routing protocols must cope withthis eventuality so when routes in use break, they should discover alternative paths to keep the on-going communications active. the procedures to discover new routes commonly provoke a significant amount of control packets which may induce losses and delay to the data packets. therefore, the network performance could benefit from the techniques that avoid these route discovery procedures. In this sense, a practical strategy is the use of the links that are expected to endure longer. Basing on an analytical model, this paper presents a technique to identify the most stable links. the evaluation in an autonomous MANET connected to the Internet shows the goodness of the proposed criterion.
Optimal capacity analysis in multi-radio multichannel wireless networks by nature incurs the formulation of a mixed integer programming, which is NP-hard in general. the current state of the art mainly resorts to heur...
详细信息
ISBN:
(纸本)9781424472611;9780769540597
Optimal capacity analysis in multi-radio multichannel wireless networks by nature incurs the formulation of a mixed integer programming, which is NP-hard in general. the current state of the art mainly resorts to heuristic algorithms to obtain an approximate solution. In this paper, we propose a novel concept of multi-dimensional conflict graph (MDCG). Based on MDCG, the capacity optimization issue can be accurately modeled as a linear programming (LP) multi-commodity flow (MCF) problem, augmented with maximal independent set (MIS) constraints. the MDCG-based solution will provide not only the maximum throughput or utility, but also the optimal configurations on routing, channel assignment, and scheduling. Moreover, the MDCG-based optimal capacity planning can exploit dynamic channel swapping, which is difficult to achieve for those existing heuristic algorithms. A particular challenge associated withthe MDCG-based capacity analysis is to search exponentially many possible MISs. We theoretically show that in fact only a small set of critical MISs, termed as critical MIS set, will be scheduled in the optimal resource allocation. We then develop a polynomial computing method, based on a novel scheduling index ordering (SIO) concept, to search the critical MIS set. Extensive numerical results are presented to demonstrate the efficiency of the MDCG-based resource allocation compared to well-known heuristic algorithm presented in [1], and the efficiency of SIO-based MIS computing compared to the widely adopted random algorithm for searching MISs.
Every application of a Wireless Sensor Network (WSN) requires the data collected from sensor nodes to be reachable from the outside, in order to allow its processing and to obtain information from the monitored phenom...
详细信息
Every application of a Wireless Sensor Network (WSN) requires the data collected from sensor nodes to be reachable from the outside, in order to allow its processing and to obtain information from the monitored phenomena. Environmental protection and agriculture are examples of areas most likely to benefit from the deployment of WSNs. Devices equipped with temperature, humidity and light sensors could play a role in preserving the environment by providing early alerts and useful status information in real-time. Since such networks usually provide a huge amount of raw data, an easy way to organize, store and retrieve useful information is also needed. In this work we present REnvDB (RESTful Environmental DataBase), a novel database for Wireless Sensor Networks specifically designed for pervasive monitoring applications. the data model of the database is flexible enough to fulfill the requirements of most of the typical environmental monitoring systems. We also provided the database a RESTful interface, which can be used to expose the data collected by heterogeneous WSNs using the standard protocols of the World Wide Web. thanks to its modular design and the use of metadata, the behavior of our RESTful interface can also be easily extended or modified according to the requirements and constraints of a specific context. Finally, the entire system has been implemented and tested in a real environment as part of a bigger project for the monitoring of an intensive agricultural field.
In wireless mesh networks (WMNs), a station (STA) often has a group of candidate access points (APs) to be associated with. How to select the most appropriate AP has been an open problem. In IEEE 802.11 standards, the...
详细信息
In wireless mesh networks (WMNs), a station (STA) often has a group of candidate access points (APs) to be associated with. How to select the most appropriate AP has been an open problem. In IEEE 802.11 standards, the STA simply chooses the one withthe strongest RSSI. Since this AP selection strategy can cause severe network load unbalance, many new methods have been proposed. However, these solutions mainly focus on the WLAN environment and are not applicable for WMNs. the unique wireless multi-hop backbone in WMN will introduce higher latency, which must be considered during the AP selection process. In this paper, we propose a cross-layer AP selection scheme based on the information of both link layer and routing layer aiming at reducing the network transmission delay. the problem is formulated as a nonlinear programming problem, and a heuristic search algorithm is given. Experiment results show that the cross-layer scheme can reduce the mean delay of the whole network by about 30% and can benefit real-time applications.
We define an extension of forest algebra for omega-forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To prove its usefulness, we use the...
详细信息
ISBN:
(数字)9783642040818
ISBN:
(纸本)9783642040801
We define an extension of forest algebra for omega-forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To prove its usefulness, we use the framework to get an effective characterization of the omega-forest;languages that are definable in the temporal logicthat uses the operator EF (exists finally).
We introduce a general approach to cryptographic protocol verification based oil answer set programming. In our approach, cryptographic protocols are represented as extended logic programs where the answer Sets corres...
详细信息
ISBN:
(纸本)9783642042379
We introduce a general approach to cryptographic protocol verification based oil answer set programming. In our approach, cryptographic protocols are represented as extended logic programs where the answer Sets correspond to traces of protocol runs. Using queries, we can find attacks on a protocol by finding the answer sets for the corresponding logic program. Our encoding is modular, with different modules representing the message passing environment, the protocol Structure and the intruder model. We can easily tailor each module to suit a specific application, while keeping the rest of the encoding constant. As such. our approach is more flexible and elaboration tolerant than related formalizations. the present system is intended as a first step towards the development of a compiler from protocol specifications to executable programs: such a compiler would make verification a completely automated process. this work is also part of a larger project in which we are exploring the advantages of explicit, declarative representations of protocol verification problems.
We define a logic, called CSL, for the specification of complex data structures, and we show its use in program verification. Our framework allows to handle programs with dynamic linked structures and arrays carrying ...
详细信息
ISBN:
(数字)9783642040818
ISBN:
(纸本)9783642040801
We define a logic, called CSL, for the specification of complex data structures, and we show its use in program verification. Our framework allows to handle programs with dynamic linked structures and arrays carrying unbounded data, as well as the composition of these structures. the formulas in CSL allow a limited form of alternation between existential and universal quantifiers and they can express (1) constraints on reachability between positions in the heap following some pointer fields, (2) linear constraints on the lengths of the lists and the indexes of the arrays, and (3) constraints on the values of the data attached to these positions. For data constraints, the logic CSL is parameterized by a first-order logic over the considered data domain. We prove that the satisfiability problem of CSL is decidable whenever the underlying data logic is decidable and that CSL is closed under the computation of the strongest post-condition in the considered class of programs.
the proceedings contain 30 papers. the topics discussed include: the state of hash functions and the NIST SHA-3 competition;key evolution systems in untrusted update environments;secure and privacy-preserving informat...
ISBN:
(纸本)9783642014390
the proceedings contain 30 papers. the topics discussed include: the state of hash functions and the NIST SHA-3 competition;key evolution systems in untrusted update environments;secure and privacy-preserving information brokering;provably secure convertible nominative signature scheme;cryptanalysis of two ring signcryption schemes;efficient signcryption key encapsulation without random oracles;security analysis of multivariate polynomials for hashing;SPVT-II: an efficient security protocol verifier based on logicprogramming;batch ZK proof and verification of OR logic;constructing variable-length PRPs and SPRPs from fixed-length PRPs;impossible differential analysis of reduced round CLEFIA;chosen ciphertext secure certificateless threshold encryption in the standard model;further observations on certificateless public key encryption;and efficient hardware architecture of SHA-256 algorithm for trusted mobile computing.
the existing discourse on IT-enabled enterprise agility views the internal organizational processes of IT capability development and organizational learning as the primary means of attaining agility, but has neglected...
详细信息
the existing discourse on IT-enabled enterprise agility views the internal organizational processes of IT capability development and organizational learning as the primary means of attaining agility, but has neglected the new dynamics of competition in the present networked economy. As Digital Business Ecosystems (DBEs) may be crucial to enterprise agility for organizations engaged in intense, inter-network competition, we apply the literature on business ecosystems to analyze the case of ***, a B2B portal that organizes one of the largest DBEs worldwide. In doing so, a process model of how a DBE may be developed and leveraged for enterprise agility is inductively derived that sheds light on the antecedents, nature and implications of DBE development in three distinct phases. With its findings, this study contributes to a networked perspective of IT-enabled enterprise agility, and provides practitioners with a comprehensive and empirically-supported framework for the development and subsequent leverage of a DBE.
A modeling approach to study advanced floating body Z-RAM memory cells is developed. In particular, the scalability of the cells is investigated. First, a Z-RAM cell based on a 50nm gate length double-gate structure c...
详细信息
A modeling approach to study advanced floating body Z-RAM memory cells is developed. In particular, the scalability of the cells is investigated. First, a Z-RAM cell based on a 50nm gate length double-gate structure corresponding to state of the art technology is studied. A bi-stable behavior essential for Z-RAM operation is observed even in fully depleted structures. It is demonstrated that by adjusting the supply source-drain and gate voltages the programming window can be adjusted. the programming window is appropriately large in voltage as well as in current. We further extend our study to a Z-RAM cell based on an ultra-scaled double-gate MOSFET with 12.5nm gate length. We demonstrate that the cell preserves its functionality by providing a wide voltage operating window with large current differences. An appropriate operating window is still observed at approximately 25-30% reduced supply voltage, which is an additional benefit of scaling. the relation of the obtained supply voltage to the one anticipated in an ultimate MOSFET with quasi-ballistic transport is discussed.
暂无评论