The Experts below are selected from a list of 7701 Experts worldwide ranked by ideXlab platform

Tahiry Razafindralambo - One of the best experts on this subject based on the ideXlab platform.

  • Scalable Address Allocation Protocol for Mobile Ad Hoc Networks
    2009
    Co-Authors: Yu Chen, Eric Fleury, Tahiry Razafindralambo
    Abstract:

    In this paper, we present for mobile ad hoc networks an efficient distributed address allocation protocol which is immune to topology changes caused by node's mobility. Contrary to the common belief that mobility makes protocol design more difficult, we show that node's mobility can, in fact, be useful to provide efficient address allocation in ad hoc networks. In our protocol, each node that has been assigned an address manages a Disjoint Subset of free addresses independently. By taking advantage of node mobility, we can achieve roughly even distribution of free addresses amongst nodes in the system, which enables a new joining node to be configured by its neighbors via only local communication. Theoretical analysis and extensive simulation results are presented. We show that most of the address allocation requests can be processed in a timely fashion via local communication in the requester's neighborhood with time and message complexity in the order of node's degree, regardless of the network size.

  • MSN - Scalable Address Allocation Protocol for Mobile Ad Hoc Networks
    2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks, 2009
    Co-Authors: Yu Chen, Eric Fleury, Tahiry Razafindralambo
    Abstract:

    In this paper, we present for mobile ad hoc networks an efficient distributed address allocation protocol which is immune to topology changes caused by node's mobility. Contrary to the common belief that mobility makes protocol design more difficult, we show that node's mobility can, in fact, be useful to provide efficient address allocation in ad hoc networks. In our protocol, each node that has been assigned an address manages a Disjoint Subset of free addresses independently. By taking advantage of node mobility, we can achieve roughly even distribution of free addresses amongst nodes in the system, which enables a new joining node to be configured by its neighbors via only local communication. Theoretical analysis and extensive simulation results are presented. We show that most of the address allocation requests can be processed in a timely fashion via local communication in the requester's neighborhood with time and message complexity in the order of node's degree, regardless of the network size.

Yu Chen - One of the best experts on this subject based on the ideXlab platform.

  • Scalable Address Allocation Protocol for Mobile Ad Hoc Networks
    2009
    Co-Authors: Yu Chen, Eric Fleury, Tahiry Razafindralambo
    Abstract:

    In this paper, we present for mobile ad hoc networks an efficient distributed address allocation protocol which is immune to topology changes caused by node's mobility. Contrary to the common belief that mobility makes protocol design more difficult, we show that node's mobility can, in fact, be useful to provide efficient address allocation in ad hoc networks. In our protocol, each node that has been assigned an address manages a Disjoint Subset of free addresses independently. By taking advantage of node mobility, we can achieve roughly even distribution of free addresses amongst nodes in the system, which enables a new joining node to be configured by its neighbors via only local communication. Theoretical analysis and extensive simulation results are presented. We show that most of the address allocation requests can be processed in a timely fashion via local communication in the requester's neighborhood with time and message complexity in the order of node's degree, regardless of the network size.

  • MSN - Scalable Address Allocation Protocol for Mobile Ad Hoc Networks
    2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks, 2009
    Co-Authors: Yu Chen, Eric Fleury, Tahiry Razafindralambo
    Abstract:

    In this paper, we present for mobile ad hoc networks an efficient distributed address allocation protocol which is immune to topology changes caused by node's mobility. Contrary to the common belief that mobility makes protocol design more difficult, we show that node's mobility can, in fact, be useful to provide efficient address allocation in ad hoc networks. In our protocol, each node that has been assigned an address manages a Disjoint Subset of free addresses independently. By taking advantage of node mobility, we can achieve roughly even distribution of free addresses amongst nodes in the system, which enables a new joining node to be configured by its neighbors via only local communication. Theoretical analysis and extensive simulation results are presented. We show that most of the address allocation requests can be processed in a timely fashion via local communication in the requester's neighborhood with time and message complexity in the order of node's degree, regardless of the network size.

Eric Fleury - One of the best experts on this subject based on the ideXlab platform.

  • Scalable Address Allocation Protocol for Mobile Ad Hoc Networks
    2009
    Co-Authors: Yu Chen, Eric Fleury, Tahiry Razafindralambo
    Abstract:

    In this paper, we present for mobile ad hoc networks an efficient distributed address allocation protocol which is immune to topology changes caused by node's mobility. Contrary to the common belief that mobility makes protocol design more difficult, we show that node's mobility can, in fact, be useful to provide efficient address allocation in ad hoc networks. In our protocol, each node that has been assigned an address manages a Disjoint Subset of free addresses independently. By taking advantage of node mobility, we can achieve roughly even distribution of free addresses amongst nodes in the system, which enables a new joining node to be configured by its neighbors via only local communication. Theoretical analysis and extensive simulation results are presented. We show that most of the address allocation requests can be processed in a timely fashion via local communication in the requester's neighborhood with time and message complexity in the order of node's degree, regardless of the network size.

  • MSN - Scalable Address Allocation Protocol for Mobile Ad Hoc Networks
    2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks, 2009
    Co-Authors: Yu Chen, Eric Fleury, Tahiry Razafindralambo
    Abstract:

    In this paper, we present for mobile ad hoc networks an efficient distributed address allocation protocol which is immune to topology changes caused by node's mobility. Contrary to the common belief that mobility makes protocol design more difficult, we show that node's mobility can, in fact, be useful to provide efficient address allocation in ad hoc networks. In our protocol, each node that has been assigned an address manages a Disjoint Subset of free addresses independently. By taking advantage of node mobility, we can achieve roughly even distribution of free addresses amongst nodes in the system, which enables a new joining node to be configured by its neighbors via only local communication. Theoretical analysis and extensive simulation results are presented. We show that most of the address allocation requests can be processed in a timely fashion via local communication in the requester's neighborhood with time and message complexity in the order of node's degree, regardless of the network size.

Javaid Aslam - One of the best experts on this subject based on the ideXlab platform.

  • a characterization of polynomial time enumeration collapse of the polynomial hierarchy mathbf np p
    arXiv: Computational Complexity, 2008
    Co-Authors: Javaid Aslam
    Abstract:

    We resolve the $\mathbf{NP =P?}$ question by providing an existential proof to the following conjecture on the characterization of polynomial time enumeration: A sufficient condition for the existence of a P-time algorithm for any enumeration problem is the existence of a polynomially bounded partition hierarchy of the exponentially decreasing solution spaces, where each Disjoint Subset in each partition is P-time enumerable for each $n \ge 1$, n being the problem size. The existential proof is a P-time counting algorithm for perfect matchings, obtained by extending the basic enumeration technique for permutation groups to the set of perfect matchings in a bipartite graph. The sequential time complexity of this $\mathbf{\#P}$-complete problem is shown to be $O(n^{45}\log n)$. And thus we prove a result even more surprising than $\mathbf{NP = P}$, that is, $\mathbf{\#P}=\mathbf{FP}$, where $\mathbf{FP}$ is the class of functions, $f: \{0, 1\}^* \rightarrow \mathbb{N} $, computable in polynomial time on a deterministic model of computation such as a deterministic Turing machine or a RAM.

Lin Bmt - One of the best experts on this subject based on the ideXlab platform.

  • Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem 
    TAYLOR & FRANCIS LTD, 2020
    Co-Authors: Lin Bmt
    Abstract:

    [[abstract]]The ant colony optimization is a meta-heuristic inspired by knowledge sharing amongst ants using pheromone, which serves as a kind of collective memory. Since the past few years, there have been several successful applications of this new approach for finding approximate solutions for computationally difficult problems in reasonable times. In this paper, we study the generalized minimum spanning tree problem that involves the design of a minimum weight connected network spanning at least one node out of every Disjoint Subset of the nodes in a graph. This problem has a wealth of pertinence to a wide range of applications in different areas. As the problem is known as computationally challenging, we adopt the ant colony optimization strategy and present a new solution method, called Ant-Tree, to develop approximate solutions. As an initial attempt, our study aims to provide an investigation of the ant colony optimization approach for coping with tree optimization problems. Through computational experiments, we compare the performances of our approach and the method available in the literature. Numerical results indicate that the proposed method is effective in producing quality approximate solutions.[[note]]SC