1,781 research outputs found
Layered Mobility Model Architecture - LEMMA
This paper presents the
generic layered architecture for mobility
models (LEMMA), which can be used to
construct a wide variety of mobility
models, including the majority of models
used in wireless network simulations. The
fundamental components of the
architecture are described and analyzed,
in addition to its benefits. One of the core
principles stipulates that each mobility
model is divided in five distinct layers that
communicate via interfaces. This allows
their easy replacement and
recombination, which we support by
reviewing 19 layers that can form 480
different mobility models. Some of the
advanced features provided by the
architecture are also discussed, such as
layer aggregation, and creation of hybrid
and group mobility models. Finally, some
of the numerous existing studies of the
different layers are presented
A Model of Layered Architectures
Architectural styles and patterns play an important role in software
engineering. One of the most known ones is the layered architecture style.
However, this style is usually only stated informally, which may cause problems
such as ambiguity, wrong conclusions, and difficulty when checking the
conformance of a system to the style. We address these problems by providing a
formal, denotational semantics of the layered architecture style. Mainly, we
present a sufficiently abstract and rigorous description of layered
architectures. Loosely speaking, a layered architecture consists of a hierarchy
of layers, in which services communicate via ports. A layer is modeled as a
relation between used and provided services, and layer composition is defined
by means of relational composition. Furthermore, we provide a formal definition
for the notions of syntactic and semantic dependency between the layers. We
show that these dependencies are not comparable in general. Moreover, we
identify sufficient conditions under which, in an intuitive sense which we make
precise in our treatment, the semantic dependency implies, is implied by, or
even coincides with the reflexive-transitive closure of the syntactic
dependency. Our results provide a technology-independent characterization of
the layered architecture style, which may be used by software architects to
ensure that a system is indeed built according to that style.Comment: In Proceedings FESCA 2015, arXiv:1503.0437
Cross-layer design of multi-hop wireless networks
MULTI -hop wireless networks are usually defined as a collection of nodes
equipped with radio transmitters, which not only have the capability to
communicate each other in a multi-hop fashion, but also to route each others’ data
packets. The distributed nature of such networks makes them suitable for a variety of
applications where there are no assumed reliable central entities, or controllers, and
may significantly improve the scalability issues of conventional single-hop wireless
networks.
This Ph.D. dissertation mainly investigates two aspects of the research issues
related to the efficient multi-hop wireless networks design, namely: (a) network
protocols and (b) network management, both in cross-layer design paradigms to
ensure the notion of service quality, such as quality of service (QoS) in wireless mesh
networks (WMNs) for backhaul applications and quality of information (QoI) in
wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of
this Ph.D. dissertation, different network settings are used as illustrative examples,
however the proposed algorithms, methodologies, protocols, and models are not
restricted in the considered networks, but rather have wide applicability.
First, this dissertation proposes a cross-layer design framework integrating
a distributed proportional-fair scheduler and a QoS routing algorithm, while using
WMNs as an illustrative example. The proposed approach has significant performance
gain compared with other network protocols. Second, this dissertation proposes
a generic admission control methodology for any packet network, wired and
wireless, by modeling the network as a black box, and using a generic mathematical
0. Abstract 3
function and Taylor expansion to capture the admission impact. Third, this dissertation
further enhances the previous designs by proposing a negotiation process,
to bridge the applications’ service quality demands and the resource management,
while using WSNs as an illustrative example. This approach allows the negotiation
among different service classes and WSN resource allocations to reach the optimal
operational status. Finally, the guarantees of the service quality are extended to
the environment of multiple, disconnected, mobile subnetworks, where the question
of how to maintain communications using dynamically controlled, unmanned data
ferries is investigated
Categorical Foundation for Layer Consistency in AHO-Net Models Supporting Workflow Management in Mobile Ad-Hoc Networks
In this paper we present a layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (MANETs) using algebraic higher order nets (AHO nets). MANETs are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure, e.g. in emergency scenarios, where an effective coordination is crucial among team members, each of them equipped with hand-held devices. Workflows in MANETs can be adequately modeled using a layered architecture, where the overall workflow, the team members' activities and the mobility issues are separated into three different layers, namely the workflow layer, the mobility layer and the team layer. Dividing the AHO net model into layers immediately rises the question of consistency. We suggest a formal notion of layer consistency requiring that the team layer is given by the mapping of the individual member's activities to the gluing of the workflow and the mobility layer. The main results concern the maintenance of the layer consistency when changing the workflow layer, the mobility layer and the team layer independently
A Game Theoretic Analysis for Energy Efficient Heterogeneous Networks
Smooth and green future extension/scalability (e.g., from sparse to dense,
from small-area dense to large-area dense, or from normal-dense to super-dense)
is an important issue in heterogeneous networks. In this paper, we study energy
efficiency of heterogeneous networks for both sparse and dense two-tier small
cell deployments. We formulate the problem as a hierarchical (Stackelberg) game
in which the macro cell is the leader whereas the small cell is the follower.
Both players want to strategically decide on their power allocation policies in
order to maximize the energy efficiency of their registered users. A backward
induction method has been used to obtain a closed-form expression of the
Stackelberg equilibrium. It is shown that the energy efficiency is maximized
when only one sub-band is exploited for the players of the game depending on
their fading channel gains. Simulation results are presented to show the
effectiveness of the proposed scheme.Comment: 7 pages, 3 figures, in Wiopt 201
A Formal Object Model for Layered Networks to Support Verification and Simulation
This work presents an abstract formal model of the interconnection structure of the Open Systems Interconnection Reference Model (OSI-RM) developed using Object-Oriented modeling principles permitting it to serve as a re-usable platform in supporting the development of simulations and formal methods applied to layered network protocols. A simulation of the object model using MODSIM III was developed and Prototype Verification System (PVS) was used to show the applicability of the object model to formal methods by formally specifying and verifying a Global Systems for Mobile communications (GSM) protocol. This application has proved to be successful in two aspects. The first was showing the existence of discrepancies between informal standard protocol specifications, and the second was that communication over the layered GSM network was verified. Although formal methods is somewhat difficult and time consuming, this research shows the need for the formal specification of all communication protocols to support a clear understanding of these protocols and to provide consistency in their implementations.
A domain for the application of this model is mobile cellular telecommunications systems. Mobile Communications is one of the most rapidly expanding sectors of telecommunications. Expectations of what a mobile cellular phone can do have vastly increased the complexity of cellular communication networks, which makes it imperative that protocol specifications be verified before implementation
Network tomography application in mobile ad-hoc networks.
The memorability of mobile ad-hoc network (MANET) is the precondition of its management, performance optimization and network resources re-allocations. The traditional network interior measurement technique performs measurement on the nodes or links directly, and obtains the node or link performance through analyzing the measurement sample, which usually is used in the wired networks measurement based on the solid infrastructure. However, MANET is an infrastructure-free, multihop, and self-organized temporary network, comprised of a group of mobile nodes with wireless communication devices. Not only does its topology structure vary with time, but also the communication protocol used in its network layer or data link layer is diverse and non-standard. Specially, with the limitation of node energy and wireless bandwidth, the traditional interior network measurement technique is not suited for the measurement requirement of MANET. In order to solve the problem of interior links performance (such as packet loss rate and delay) measurement in MANET, this dissertation has adopted an external measurement based on network tomography (NT). Being a new measurement technology, NT collects the sample of path performance based on end-to-end measurement to infer the probability distribution of the network logical links performance parameters by using mathematical statistics theory, which neither need any cooperation from internal network, nor dependence from communication protocols, and has the merit of being deployed exibly. Thus from our literature review it can be concluded that Network Tomography technique is adaptable for ad-hoc network measurement. We have the following contribution in the eld of ad-hoc network performance: PLE Algorithm: We developed the PLE algorithm based on EM model, which statistically infer the link performance. Stitching Algorithm: Stitching algorithm is based on the isomorphic properties of a directed graph. The proposed algorithm concatenates the links, which are common over various steady state period and carry forward the ones, which are not. Hence in the process it gives the network performance analysis of the entire network over the observation period. EM routing: EM routing is based on the statistical inference calculated by our PLE algorithm. EM routing provides multiple performance metric such as link delay and hops of all the possible path in various time period in a wireless mesh network
- …