A simple metric for ad hoc network adaptation

  title={A simple metric for ad hoc network adaptation},
  author={Stephen F. Bush},
  journal={IEEE Journal on Selected Areas in Communications},
  • S. Bush
  • Published 5 December 2005
  • Computer Science
  • IEEE Journal on Selected Areas in Communications
This paper examines flexibility in ad hoc networks and suggests that, even with cross-layer design as a mechanism to improve adaptation, a fundamental limitation exists in the ability of a single optimization function, defined a priori, to adapt the network to meet all quality-of-service requirements. Thus, code implementing multiple algorithms will have to be positioned within the network. Active networking and programmable networking enable unprecedented autonomy and flexibility for ad hoc… 
A Novel Clustering Algorithm for Mobile Ad Hoc Networks Based on Determination of Virtual Links' Weight to Increase Network Stability
A new weight-based algorithm that determines node's weight using its own features, but also considers the direct effect of feature of adjacent nodes and the effect of the weights on determining node's final weight is presented.
Evaluation of Routing Protocols in Ad Hoc Networks
This survey paper provides an overview of DSR, AODV and TORA by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis.
An architecture for wireless networks with SINR constraints and its performance upperbounds
  • S. Kucera, Z. Bing
  • Computer Science
    2009 International Conference on Networking and Media Convergence
  • 2009
The proposed architecture consists of three cross -layer optimized layers, which optimally manage energy and frequency spectrum resources of the network using a purely distributed, asynchronous, and non-cooperative approach.
Stability Emphasizing Cross-Layer Optimization of Transmit Power Allocation in Distributed Wireless Networks
This paper theoretically analyzes cross-layer optimized design of transmit power allocation in distributed interference-limited wireless networks with asynchronously acting links and stochastic
Routing timer self-adaptive regulating algorithm based on MIMD loop control for MANET
Results of simulations showed that adopting RTSAR, no matter based on a table-driven protocol or on a demand one, would reduce the overhead in networks effectively while hardly bring any obvious impacts on metrics of packet successful delivery rate and the average end-to-end delay as well.
The Limits of Motion Prediction Support for Ad hoc Wireless Network Performance
The primary contribution of this paper is quantification of predictive gain for wireless ad hoc routing in terms of both message overhead and update time for non-predictive routing.
Mobile Ad Hoc Networks
  • R. Roy
  • Computer Science, Business
  • 2011
It is described how the random mobility patterns of each autonomous mobile node, broadcast nature of multihop wireless communications, and lack of fixed infrastructure are affecting each networking area of the MANET.
Evaluating medium access control protocols for wireless sensor networks
This thesis focuses on evaluating MAC protocols within the WSN domain by surveying a representative number of MAC protocols and their features, and proposes a holistic application-driven MAC protocol evaluation model that takes into account application emphasis on performance metrics.
The generalization of information entropy to MANET metrics
It is found that the relative motion entropy metric lacks the features to be useful for characterizing MANET node motion predictability, while the maximum energy entropy criterion leads to effective energy use by clusterheads communicating to cluster members.
A Hybrid Network Protocol for Disaster Scenarios
This paper proposes a cost effective and easy to deploy hybrid communication system to achieve rescuers’ requirements and cooperation and uses the Inter-Domain Messaging (IDM) framework to achieve the goal.


Evaluating the communication performance of an ad hoc wireless network
The experimental results obtained revealed that it is feasible to augment existing wireless computers with ad hoc networking capability, and route discovery time in ad hoc wireless networks are more dependent on channel conditions and route length than variations in beaconing intervals.
A survey of programmable networks
A programmable networking model is presented that provides a common framework for understanding the state-of-the-art in programmable networks and a simple qualitative comparison of the surveyed work is presented.
Active virtual network management prediction: complexity as a framework for prediction, optimization, and assurance
  • S. Bush
  • Computer Science
    Proceedings DARPA Active Networks Conference and Exposition
  • 2002
A complexity-based framework for information assurance that attempts to take a holistic view of vulnerability analysis and describes the relationship among algorithmic compression, complexity, and prediction accuracy within an active network.
Low-energy sensor network time synchronization as an emergent property
  • S. Bush
  • Physics
    Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.
  • 2005
The primary contribution of this work is to examine the energy efficiency of pulse coupled oscillation for time synchronization in a realistic wireless network environment and to explore the impact
No free lunch theorems for optimization
A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of "no free lunch" (NFL) theorems are presented which
Minimum Message Length and Kolmogorov Complexity
This work attempts to establish a parallel between a restricted (two-part) version of the Kolmogorov model and the minimum message length approach to statistical inference and machine learning of Wallace and Boulton (1968), in which an ‘explanation’ of a data string is modelled as a two-part message.
An Introduction to Kolmogorov Complexity and Its Applications
The book presents a thorough treatment of the central ideas and their applications of Kolmogorov complexity with a wide range of illustrative applications, and will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics.
Active Networks and Active Virtual Network Management Prediction: A Proactive Management Framework . Norwell, MA: Kluwer
  • Active Networks and Active Virtual Network Management Prediction: A Proactive Management Framework . Norwell, MA: Kluwer
  • 2001
M'03–SM'03) received the B.S. degree in electrical and computer engineering from Carnegie Mellon University
  • the M.S. degree in computer science from Cleveland State University, Cleveland, OH, and the Ph.D. degree from the University of Kansas
A survey of programmable networks (1999),
  • in ACM SIGCOMM Comput. Commun. Rev.,
  • 1999