Nested Circular Directional MAC, a modified medium access control protocol of DMAC protocol, is proposed in this paper to support both directional antennas and omni-directional antennas simultaneously in one Ad Hoc ne...
详细信息
Nested Circular Directional MAC, a modified medium access control protocol of DMAC protocol, is proposed in this paper to support both directional antennas and omni-directional antennas simultaneously in one Ad Hoc network. Omni-directional antennas follow the RTS/CTS mechanism which is multi-hop and directional antennas follow the DRTS/DCTS mechanism, ensuring the asymmetric communication effectively. In order to resolve new deafness problem and hidden terminal problem, the directional antennas also use circular DRTS and nested antenna circumrotation. Simulation results show that NCDMAC supports hybrid antennas effectively and is better than MMAC and Circular-MAC in terms of increasing throughput, but it also increases the communication delay.
We present a novel parallel auction algorithm implementation for solving the linear sum assignment problem. It is implemented using the message passing interface (MPI) on a computer cluster. Our approach enables dynam...
详细信息
ISBN:
(纸本)9781424458288;9789774033964
We present a novel parallel auction algorithm implementation for solving the linear sum assignment problem. It is implemented using the message passing interface (MPI) on a computer cluster. Our approach enables dynamic computational load balancing over all processors throughout all steps of the algorithm's execution. We show that the performance of our approach is superior to existing approaches in the literature.
We consider a network of distributed sensors which simultaneously measure a physical parameter of interest, subject to a certain sensing error probability. the sensed information at each of such nodes is forwarded to ...
详细信息
We consider a network of distributed sensors which simultaneously measure a physical parameter of interest, subject to a certain sensing error probability. the sensed information at each of such nodes is forwarded to a central receiver through parallel independent AWGN channels. In this scenario the signals from different sensors can arrive at the central receiver at different instants of time each subject to a different time delay. In order to properly fuse the streams of data arriving from different sensors these streams need to be synchronized. In this paper we propose and compare, via numerical simulations, several new synchronization mechanisms specifically tailored for this setup.
the high-performance computing domain is enriching withthe inclusion of Networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while ...
详细信息
Self-organization is a key factor for the future evolution of mobile networks, especially for introduction of the new radio standard LTE. Reasons are the increasing complexity, heterogeneity and management effort. Bas...
详细信息
Self-organization is a key factor for the future evolution of mobile networks, especially for introduction of the new radio standard LTE. Reasons are the increasing complexity, heterogeneity and management effort. Based on an overview about the current state of the art, the self-organization potential for enabling real plug and play functionality, automatic network optimization, improved end-to-end QoS and new energy saving technologies is highlighted. this is especially true for the upcoming trend towards small cell deployments. Our vision is an essentially simplified network management architecture relying on a distributed self-organization functionality which enables large steps towards autonomous operation of network elements.
A public-key encryption algorithm and a practical hybrid scheme are proposed in this paper. this algorithm uses the advanced transform techniques, i.e. the Number theoretic Transforms (NTTs) to diffuse data, and uses ...
详细信息
A public-key encryption algorithm and a practical hybrid scheme are proposed in this paper. this algorithm uses the advanced transform techniques, i.e. the Number theoretic Transforms (NTTs) to diffuse data, and uses a non-linear technique based on the Elliptic Curve Discrete Logarithm Problem (ECDLP) to confuse data. the main advantage of the proposed algorithm is its high efficiency and capability. the plaintext can be encrypted in blocks in parallel, thus saves computational time. the proposed algorithm also can be easily applied in a hybrid scheme for practical applications.
the multi-objective integer programming problems in large scale are considered time consuming. In the past, mathematical structures were used that can get benefits of high processing powers and parallel processing. th...
详细信息
ISBN:
(纸本)9781424458288;9789774033964
the multi-objective integer programming problems in large scale are considered time consuming. In the past, mathematical structures were used that can get benefits of high processing powers and parallel processing. the Branch and Bound (B&B) algorithm is one of the most used methods to solve combinatorial optimization problems. A general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem is developed. In this paper, a supervisor-master-sub-master-worker algorithm to solve large scale integer multi-objective problems that can get the benefits of mathematical structures and high processing powers has been proposed. this approach addresses several issues related to the characteristics of the algorithm itself and the properties of parallelcomputing systems. From the solved benchmark example this algorithm proved to provide a considerable high performance. Results show that a consistently better efficiency can be achieved in solving integer equations, providing reduction of time.
the scheduling and mapping of the precedence-constrained task graphs of parallel programs to processors is considered one of the most crucial NP-complete problems in parallel and distributedcomputing systems. In this...
详细信息
ISBN:
(纸本)9781424458288;9789774033964
the scheduling and mapping of the precedence-constrained task graphs of parallel programs to processors is considered one of the most crucial NP-complete problems in parallel and distributedcomputing systems. In this paper, a dynamic task scheduling model based on fuzzy logic is proposed. the main objective of this technique is to improve the fuzzy decision which is used in task scheduling on a network of processing elements by introducing new input parameters to an existing fuzzy model and, in the same time, improving the load balance on the network in a dynamic environment. the proposed Fuzzy Model is capable of processing inputs from on the fly data that arises from the current state of the processors. According to the proposed model, tasks are generated randomly and are served based on the First-Come-First-Serve rule. When the task is ready to be assigned, its information is passed to the processors for bidding. Each processor has a local scheduler for managing its own activities, which supplies information on its current state and follows whatever decision is given where the fuzzy logic mechanism is used in making decision on the task assignment. A comparative study between the existed fuzzy model and our modified fuzzy model has been done. the comparative results show that our modified fuzzy model outperforms the existed one.
JiST/SWANS is a wireless network simulator gaining increasing popularity for ad-hoc wireless, wireless sensor network, and vehicular network evaluations. Typical published results using this tool show node counts on t...
详细信息
JiST/SWANS is a wireless network simulator gaining increasing popularity for ad-hoc wireless, wireless sensor network, and vehicular network evaluations. Typical published results using this tool show node counts on the order of hundreds of nodes. However, realistic sensor and vehicular networks may contain many more nodes than that. One reason for this discrepancy is the computational cost of evaluation via simulation. Currently, cluster computers are becoming preferred over expensive multi-processor supercomputers for improving computational output. We present the design and implementation of a parallelization of JiST, the discrete event simulator core of JiST/SWANS. JiST uses unique dynamic byte-code rewriting to simplify the development of applications and has been shown to perform well running small- or medium-scale wireless network simulations on single processor systems. We propose an optimistic cluster-based architecture and apply it to JiST. Simulation entity memory is distributed evenly across all nodes in the cluster, resulting in linear memory growth. Details of the simulation engine including the complex event execution synchronization are hidden entirely from the application, easing development and debug time. Since JiST is the simulation backend of the SWANS wireless network simulator, this result is the first step in simulating large networks using SWANS in reasonable periods of time. Results presented show the performance of our parallelization of JiST is in line withthe performance of other existing parallel discrete event simulators.
暂无评论