Hyper-Erlang Distribution Model and its Application in Wireless Mobile Networks

To provide ubiquitous services and the same real-time services as those available on the wired networks for mobile users, this paper proposes an efficient and intelligent QoS-aware mobility scheme, coined dynamic point forwarding scheme under mobility scenario in future all-IP wireless networks. Considering dynamic channel characteristics and user mobility in wireless networks, the proposed scheme takes advantage of both the point forwarding scheme in mobility management and dynamic RSVP (DRSVP) in QoS guarantee. Moreover, in order to overcome deficiencies in conventional point forwarding scheme, we develop a new decision criterion for performing forwarding chain update, which achieves a better trade-off between network resource consumed by routing path and signaling load for forwarding chain updates. Based on the performance analyses, our proposed scheme can substantially reduce more resource reservation than the conventional pointer forwarding scheme, thus it can achieve efficient resource utilization and guarantee QoS requirements of multimedia applications in the future wireless all-IP networks.

Fractional Link scheduling is one of the most fundamental problems in wireless networks. The prevailing approach for shortest fractional link scheduling is based on a reduction to the maximum-weighted independent set problem, which itself may not admit efficient approximation algorithms. In addition, except for the wireless networks under the protocol interference model, none of the existing scheduling algorithms can produce a link schedule with explicit upper bounds on its length in terms of the link demands. As the result, the polynomial approximate capacity regions in these networks remain blank. This paper develops a purely combinatorial paradigm for fractional link scheduling in wireless networks. In addition to the superior efficiency, it is able to provide explicit upper bounds on the lengths of the produced link schedule. By exploiting these upper bounds, polynomial approximate capacity regions are derived. The effectiveness of this new paradigm is demonstrated by its applications in wireless networks under the physical interference model and wireless MIMO networks under the protocol interference model.

Blockchain technology is finding applications in wireless networks, in particular vehicular networks, for the purposes of establishing trust. A certain set of network resources in terms of communication and computation requirements is also necessary for successful blockchain deployment. Moreover, heterogeneity in wireless networks and changing radio conditions at the physical layer, make it even more challenging to guarantee steady block generation latency. In this work, we study the possible denial of blockchain service attacks where malicious nodes threaten to slow down the block generation latency. We propose a novel Proof-of-Communication-Capability (PoCC) authentication framework that acts as a defense against communication capability spoofing over wireless networks. Our PoCC authentication framework utilizes physical properties such as distance between nodes, channel state information (CSI), and communication puzzle latency to establish the communication capabilities of nodes in the wireless network. Results from a simulated AV network under three different variations of the proposed PoCC framework are encouraging and demonstrate that such attacks can be effectively mitigated.

The communication network indicators are analyzed and cryptographic analysis is considered to ensure information security of wireless communication networks using the application. Exploring fundamental principles and key algorithms like Advanced Encryption Standard and Rivest-Shamir-Adleman, this article equips readers with practical insights. This paper examines the challenges of researching cryptographic analysis to ensure the security of wireless communication networks using the application By understanding cryptographic algorithms and their application in wireless networks, readers can enhance the security their digital communications. A wireless network is used to connect various wired organizational structures and provide connectivity within the organization for employees to move freely by avoiding the hurdle of a physical network. Subsequent sections offer theoretical insights and performance analysis of cryptographic algorithms using the Java programming language.

Channel assignment and its applications in wireless networks by Yanyan Yang thesis 2010 x, 90 p. : ill. ; 30 cm Wireless technologies grow rapidly and benefit almost every aspect of our daily lives. To fulfill various application requirements, researchers…Read more ›

The theoretical analysis of a cross-layer mechanism for improving the quality of service of real-time applications in wireless networks is presented. The mechanism coordinates adaptations of the modulation order at the Physical layer and the media encoding mode at the Application layer, to improve packet loss rate, throughput and mean delay. With the use of Continuous Flow Modeling, the system is considered as a "fluid" queue with inflow and outflow rates representing its traffic generation and service rates, respectively. Each data source is modeled as a Markov chain, from the steady-state of which the optimal adaptation thresholds of the cross-layer mechanism are derived. Extensive performance evaluation results show that the optimized operation of the mechanism attains a significant performance improvement compared to both the sub-optimal case, and a legacy system, which adjusts the modulation order and encoding mode separately and independently of each other.

Many wireless sensor network applications must resolve the inherent conflict between energy efficient and nodes of coverage in wireless sensor networks to achieve desired quality of service (QoS). The wireless sensor networks (WSNs) have been the main focus in the past few years, and it is becoming a special issue. We study the problem of controlling the node locations and energy within ad-hoc sensor networks. Network survivability is a very important measure for deciding the efficiency of network protocols. It includes a measure of the network lifetime as well as the quality of service. In fact, these dynamics are very important in evaluating networks. The wireless network applications can be found in battlefield communication, homeland security, pollution sensing and traffic monitoring. As such, there has been an increasing need for defining and developing simulation frameworks for carrying out high-fidelity WSN simulation. In this cause, we present a simulation by including factors such as energy-consumption, Bandwidth, nodes, and coverage and provides an object-oriented definition of target, sensor and sink nodes, sensor and wireless communication nodes, and physical radio such as relating of nodes, mobility model and power model both energy-producing and energy-consuming components, the simulation was developed using C#.

A bandwidth and effective hit optimal cache scheme for wireless data access networks with client injected updates

The convergence of wireless systems with multimedia services is the challenge of future generation wireless networks. The large variety of QoS requirements of different media as well as the maintenance of synchronization of the different streams to be presented at receiver, demand from the Data link layer some extra functionalities. In this paper, we present an enhanced approach for the efficient management of multimedia applications in third-generation wireless networks. We advocate the use of multiple connections, one for each traffic component of the application, as the effective solution for the transport of multimedia applications in future-generation wireless networks. The effectiveness of this scheme is guaranteed by providing a new link control technique that works on top of a PRMA-type access protocol which jointly manages different streams of a multimedia application. For this purpose, we propose a two-level priority mechanism (static and dynamic priorities) specified by higher protocol layers for link activation, channel access, and admission control procedures specific to a multimedia application and for optimizing the sharing of radio channel resources and management of the reservation queue at the base station. We expect this priority-based mechanism to perform well, especially during periods in which system traffic load is high, and to react well to the deterioration of multimedia service quality, in terms of both QoS parameters and the synchronization of its traffic components.

The unique characteristics of wireless networks pose a number of nontrivial challenges to multimedia applications with security and rigorous QoS requirements. Lack of adequate security protection is incapable of meeting security requirements of applications, whereas enabling excessive security services inevitably leads to further degradation in QoS due to additional computation and payload encapsulation. Early work, e.g. LAP, achieves balance by adjusting security policy according to QoS metrics; but none of them are security guaranteed. In this paper, we present an efficient risk-aware QoP (Quality of Protection) and QoS optimization algorithm for multimedia applications in wireless networks. It can achieve an optimization for QoP/QoS performance metrics through offering hierarchical security services and QoS support. Experiment demonstrates that even in high risk environments our scheme can efficiently balance QoP and QoS requirements.

Many applications in wireless networks impose locally distributed traffic on the network. We consider the effect of traffic localization on throughput of large wireless networks in the scaling sense. We show that by careful exploitation of traffic localization, one can enhance the throughput of various schemes in wireless networks. Also, the important case of Small World traffic distribution in wireless networks is addressed. In this type of traffic, in addition to the local traffic, a non-negligible amount of global traffic should be handled by the network. It is shown that a non-negligible amount of network-wide traffic can be tolerated by network without any performance degradation in the scaling sense.

There are numerous military, commercial, and scientific applications for mobile wireless networks which are able to self-organize without recourse to any pre-existing infrastructure. We present the self-organizing wireless adaptive network (SWAN) protocol, a distributed networking protocol capable of managing such networks. The SWAN approach is based on dynamic topology management with power control, allowing it to adapt gradually to the changing environment instead of periodically discarding the network topology information and rebuilding the network from scratch. In addition, under SWAN information is distributed instead of being concentrated in a control phase. This provides significant savings when the acquisition times of the modems are high.

We present a case study that considers the application of runtime verification technology to a wireless sensor application. The case study is performed using the SURGE TinyOS application for multi-hop routing, which executes on the Avrora TinyOS simulator. We discuss the problems we have encountered in the course of case study. The problems include unclear correctness properties for wireless network applications (indicating ad hoc development process) and inadequate tool support. A wireless sensor network usually comprises of a collection of tiny devices with built-in processors that can gather physical and environment information such as temperature, light, sound, etc., and communicate with one another over radio. Many wireless sensor network applications sit on top of an operating system called TinyOS and are mostly written in nesC, an extension of C that provides a component-based programming paradigm. Most of wireless sensor network applications are developed and tested on a simulator before they are deployed in the environment because testing and debugging directly on physical devices are very difficult, especially when the network consists of many nodes, and may not provide enough information for debugging. A simulator usually produces detailed execution information and can help find errors. However, even with the simulator and nesC, the current state of development tools for wireless sensor network still requires very low-level programming, which makes it hard for the developers to maintain a high-level view of the system operation. During the validation stage, lack of sophisticated debugging tools for sensor networks makes it difficult to make the connection between a high-level functional or performance requirement and a particular aspect of system implementation. This paper investigates a high-level approach to examine execution data from a simulator and analyze it using runtime verification. The technique 1) identifies and formally specifies high-level requirements for the system under development, 2) monitors a distributed wireless sensor network application using data provided by the simulator, and 3) checks for timing and dynamic properties to gain understanding of the relevant behaviors of wireless sensor nodes and to provide a systematic approach in finding bugs and errors. A particular runtime verification used inthis paper is MaC. MaC provides specification languages capable of expressing functional, timing, and probabilistic properties to specify requirements or patterns of errors. Properties can, for example, examine periodic behaviors or identify a faulty node. MaC then monitors and checks a wireless sensor network application against its specification by observing data produced by a simulator. The motivation for applying the monitoring and checking technique to check wireless sensor network applications is threefold: 1) raise the development level for wireless sensor network, 2) provide a mechanism for understanding high-level behaviors of the system in terms of low-level observation, and 3) provide a tool based on the acceptance of the state of the art development tool for sensor networks.

The construction of interconnection wired networks (or wireless networks) from smaller components often leaves the fundamental problem of assigning address to stations. In general, the address of a station for algorithms in wired or wireless networks is either permanently stored in its local memory or is received at start-up time from a master station. In another words it is assumed that initially each station knows its address. This assumption is not always appropriate in some situations: according to the topology we want to use in the transputer reconfigurable network, the addresses of the transputers may be different. The problem of assigning addresses to stations is somehow fundamental and it is called the initialization problem. The mobile ad hoc wireless network is a dynamical system in which some channels or stations can be removed and new channels or stations can be added during the life of the system. The capability of whole system to handle these changes is crucial. The initialization of the mobile ad hoc network of n stations must then be dynamic by handling all these changes in particular the variation of the number of stations in time. In most applications in wireless networks, it is often supposed that the stations are partitioned into equal groups and that a channel is assigned to each group. But it is never shown how this partition is initially done. This paper addresses all these points and shows how a self organization of the mobile ad hoc system can be carried out dynamically.

To provide uninterrupted service to all subscribers in a wireless network, we need to incorporate a low cost, flexible Heterogeneous network which will be able to link with any kind of network for efficient spectrum utilization, hence improved system capacity.In this connection, Wi-Fi/ Wi MAX integrated network seems to be an ideal solution as it is able to provide easy deployment, high speed data rate and wide range coverage with high throughput, low end to end delay, flat and low jitter.Wi-Fi/ WiMAX integrated network provides Quality of Service (QoS) that can support all kinds of real-time application in wireless networks that includes priority scheduling and queuing for bandwidth allocation that is based on traffic scheduling algorithms within wireless networks.In this paper, we have designed a Wi-Fi/ WiMAX integrated network and analyze the performance of different scheduling algorithms for that integrated network and highlight our findings on the scheduling algorithm which will give the best performance for a heterogeneous network.