Topological and Energy Analysis of K- Connected MANETs: A Semi-Analytical Approach

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Geography, Computer Science, Engineering

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Study of Connectivity Index of Graph Relevant to Ad Hoc Networks

  2007cited by this paper
• On the critical total power for asymptotic k-connectivity in wireless networks

  2005cited by this paper
• The Number of Neighbors Needed for Connectivity of Wireless Networks

  2004cited by this paper
• Random waypoint considered harmful

  2003cited by this paper
• Cross-layer design for wireless networks

  2003cited by this paper
• The Structure and Function of Complex Networks

  2003cited by this paper
• The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs

  2003cited by this paper
• A survey of mobility models for ad hoc network research

  2002cited by this paper
• Approximation algorithms for minimum-cost k-vertex connected subgraphs

  2002cited by this paper
• Increasing the throughput of multihop packet radio networks with power adjustment

  2001cited by this paper
• Smooth is better than sharp: a random mobility model for simulation of wireless networks

  2001cited by this paper
• Search in Power-Law Networks

  2001cited by this paper
• A random graph model for massive graphs

  2000cited by this paper
• A group mobility model for ad hoc wireless networks

  1999cited by this paper
• On k-connectivity for a geometric random graph

  1999cited by this paper
• On power-law relationships of the Internet topology

  1999cited by this paper
• Randomized fully dynamic graph algorithms with polylogarithmic time per operation

  1999cited by this paper
• On approximability of the minimum-cost k-connected spanning subgraph problem

  1999cited by this paper
• Critical power for asymptotic connectivity

  1998cited by this paper
• A performance comparison of multi-hop wireless ad hoc network routing protocols

  1998cited by this paper
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

  1998cited by this paper
• Social Network Analysis: Methods and Applications

  1994cited by this paper
• Introduction to Algorithms

  1991cited by this paper
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

  1962cited by this paper

• Design of a Mix Network Using Connectivity Index -- A Novel Privacy Enhancement Approach

  2014cites this paper
• Optimizing BER in Sensor Network by Adding Relay Nodes

  2013cites this paper
• Optimization of Wireless Sensor Network Lifetime by Deploying Relay Sensors

  2012cites this paper
• Empirical Modeling and Simulation of Temporal Based Adaptive Mobility Model for MANET

  2011cites this paper
• Analysis of K-Connected MANETs for QoS Multicasting using EDMSTs Based on Connectivity Index

  2010cites this paper
• A TRANSMISSION RANGE BASED CLUSTERING ALGORITHMFOR TOPOLOGY CONTROL

  2010cites this paper
• A TRANSMISSION RANGE BASED CLUSTERING ALGORITHMFOR TOPOLOGY

  2010cites this paper
• Australian Journal of Basic and Applied Sciences a Transmission Range Based Topology Maintenance Algorithm for Manets

  year unknowncites this paper