Special Issue on Recent Advance on Mobile Sensor Systems

Shu, L.; Vasilakos, AV.; Lloret, J.; Pathan, AK. (2011). Special Issue on Recent Advance on Mobile Sensor Systems. Telecommunication Systems. doi:10.1007/s11235-011-9560-y

Medium access control design for all-IP and ad hoc wireless network

Medium Access Control (MAC) protocol in a wireless network controls the access of wireless medium by mobile terminals, in order to achieve its fair and efficient sharing. It plays an important role in resource management and QoS support for applications. All-IP wireless WAN is fully IP protocol-based and it is a strong candidate beyond 3G (Third Generation Wireless Network). Ad hoc wireless network has recently been the topic of extensive research due to its ability to work properly without fixed infrastructure. This dissertation is composed of two main parts. The first part pursues a Prioritized Parallel Transmission MAC (PPTM) design for All-IP Wireless WAN. Two stages are used and each packet is with a priority level in PPTM. In stage 1, a pretransmission probability is calculated according to the continuous observation of the channel load for a certain period of time. In stage 2, a packet is prioritized and transmitted accordingly. It is modeled and analyzed as a nonpreemptive Head-Of-the-Line prioritized queueing system with Poisson arrival traffic pattern. Its performance is analyzed under three other traffic patterns, which are Constant Bit Rate, Exponential On/Off, and Pareto On/Off, by using a NS-2 simulator, and compared with that of Modified Channel Load Sensing Protocol. PPTM supports dynamic spread code allocation mechanism. A mobile terminal can apply for a spreading code according to the current channel condition. To use the idea of dynamic bandwidth allocation in PPTM for adhoc wireless network, a Dynamic-Rate-with-Collision-Avoidance (DRCA) MAC protocol is proposed in the second part of the dissertation. DRCA is based on spread spectrum technology. In DRCA, a terminal sets the spreading factor for a packet according to the activity level of neighboring nodes. If the total number of usable spreading codes with this spreading factor is less than the total number of mobile terminals in the network, to avoid collision, the spreading code id is broadcast such that other terminals can avoid using it when the packet is being transmitted. The performance of DRCA is theoretically analyzed in a slotted, single-hop, multi-user environment. To evaluate DRCA\u27s performance in an environment closed to a real one, a simulator that supports multi-hop, random mobility pattern is created with OPNET. Both theoretical and simulation results show that DRCA outperforms MACA/CT (Multiple Access with Collision Avoidance with Common Transmitter-based) in case if there are more than one communication pair and the ratio of inactive mobile terminals to active ones is high

Ambiences: on-the-fly usage of available resources through personal devices

In smart spaces such as smart homes, computation is embedded everywhere: in toys, appliances, or the home’s infrastructure. Most of these devices provide a pool of available resources which the user can take advantage, interacting and creating a friendly environment. The inherent composability of these systems and other unique characteristics such as low-cost energy, simplicity in module programming, and even their small size, make them a suitable candidate for dynamic and adaptive ambient systems. This research work focuses on what is defined as an “ambience”, a space with a user-defined set of computational devices. A smart-home is modeled as a collection of ambiences, where every ambience is capable of providing a pool of available resources to the user. In turn, the user is supposed to carry one or several personal devices able to interact with the ambiences, taking advantage of his inherent mobility. In this way, the whole system can benefit from resources discovered in the spatial proximity. A software architecture is designed, which is based on the implementation of low-cost algorithms able to detect and update the system when changes in an ambience occur. Ambience middleware implementation works in a wide range of architectures and OSs, while showing a negligible overhead in the time to perform the basic output operations.Peer ReviewedPostprint (published version

Deadline-Aware Scheduling Perspectives in Industrial Wireless Networks: A Comparison between IEEE 802.15.4 and Bluetooth

In industrial contexts, most of process control applications use wired communication networks. The reliability of wired networks is indisputable and extensively demonstrated by several studies in the literature. However, it is important to consider several disadvantages provided by the use of wired technologies, like high deployment and maintenance costs and low network scalability. Although it is difficult to fully replace wired networks, wireless communication protocols have features which could undeniably affect in positive way the production mechanisms in factories. The wireless networks (WNs) are effectively used to detect and exchange information. The main communication protocols, currently available for WNs, however, do not support real-time periodic traffic flows which, as known, mainly characterize industrial networks. In this paper, we will analyze a real-time scheduling algorithm for both periodic and aperiodic traffic management, applied to networks based on IEEE 802.15.4 and Bluetooth, respectively. The main purpose of this research is to reduce, as much as possible, the packet loss on the channel, increasing at the same time the reliability of the wireless technology. Furthermore, the comparison between IEEE 802.15.4 and Bluetooth will allow to identify the more suitable communication protocol for industrial process control systems

An Occupancy Based Cyber-Physical System Design for Intelligent Building Automation

Cyber-physical system (CPS) includes the class of Intelligent Building Automation System (IBAS) which increasingly utilizes advanced technologies for long term stability, economy, longevity, and user comfort. However, there are diverse issues associated with wireless interconnection of the sensors, controllers, and power consuming physical end devices. In this paper, a novel architecture of CPS for wireless networked IBAS with priority-based access mechanism is proposed for zones in a large building with dynamically varying occupancy. Priority status of zones based on occupancy is determined using fuzzy inference engine. Nondominated Sorting Genetic Algorithm-II (NSGA-II) is used to solve the optimization problem involving conflicting demands of minimizing total energy consumption and maximizing occupant comfort levels in building. An algorithm is proposed for power scheduling in sensor nodes to reduce their energy consumption. Wi-Fi with Elimination-Yield Nonpreemptive Multiple Access (EY-NPMA) scheme is used for assigning priority among nodes for wireless channel access. Controller design techniques are also proposed for ensuring the stability of the closed loop control of IBAS in the presence of packet dropouts due to unreliable network links

Multi-resource management in embedded real-time systems

This thesis addresses the problem of online multi-resource management in embedded real-time systems. It focuses on three research questions. The first question concentrates on how to design an efficient hierarchical scheduling framework for supporting independent development and analysis of component based systems, to provide temporal isolation between components. The second question investigates how to change the mapping of resources to tasks and components during run-time efficiently and predictably, and how to analyze the latency of such a system mode change in systems comprised of several scalable components. The third question deals with the scheduling and analysis of a set of parallel-tasks with real-time constraints which require simultaneous access to several different resources. For providing temporal isolation we chose a reservation-based approach. We first focused on processor reservations, where timed events play an important role. Common examples are task deadlines, periodic release of tasks, budget replenishment and budget depletion. Efficient timer management is therefore essential. We investigated the overheads in traditional timer management techniques and presented a mechanism called Relative Timed Event Queues (RELTEQ), which provides an expressive set of primitives at a low processor and memory overhead. We then leveraged RELTEQ to create an efficient, modular and extensible design for enhancing a real-time operating system with periodic tasks, polling, idling periodic and deferrable servers, and a two-level fixed-priority Hierarchical Scheduling Framework (HSF). The HSF design provides temporal isolation and supports independent development of components by separating the global and local scheduling, and allowing each server to define a dedicated scheduler. Furthermore, the design addresses the system overheads inherent to an HSF and prevents undesirable interference between components. It limits the interference of inactive servers on the system level by means of wakeup events and a combination of inactive server queues with a stopwatch queue. Our implementation is modular and requires only a few modifications of the underlying operating system. We then investigated scalable components operating in a memory-constrained system. We first showed how to reduce the memory requirements in a streaming multimedia application, based on a particular priority assignment of the different components along the processing chain. Then we investigated adapting the resource provisions to tasks during runtime, referred to as mode changes. We presented a novel mode change protocol called Swift Mode Changes, which relies on Fixed Priority with Deferred preemption Scheduling to reduce the mode change latency bound compared to existing protocols based on Fixed Priority Preemptive Scheduling. We then presented a new partitioned parallel-task scheduling algorithm called Parallel-SRP (PSRP), which generalizes MSRP for multiprocessors, and the corresponding schedulability analysis for the problem of multi-resource scheduling of parallel tasks with real-time constraints. We showed that the algorithm is deadlock-free, derived a maximum bound on blocking, and used this bound as a basis for a schedulability test. We then demonstrated how PSRP can exploit the inherent parallelism of a platform comprised of multiple heterogeneous resources. Finally, we presented Grasp, which is a visualization toolset aiming to provide insight into the behavior of complex real-time systems. Its flexible plugin infrastructure allows for easy extension with custom visualization and analysis techniques for automatic trace verification. Its capabilities include the visualization of hierarchical multiprocessor systems, including partitioned and global multiprocessor scheduling with migrating tasks and jobs, communication between jobs via shared memory and message passing, and hierarchical scheduling in combination with multiprocessor scheduling. For tracing distributed systems with asynchronous local clocks Grasp also supports the synchronization of traces from different processors during the visualization and analysis

Software-defined Networking enabled Resource Management and Security Provisioning in 5G Heterogeneous Networks

Due to the explosive growth of mobile data traffic and the shortage of spectral resources, 5G networks are envisioned to have a densified heterogeneous network (HetNet) architecture, combining multiple radio access technologies (multi-RATs) into a single holistic network. The co-existing of multi-tier architectures bring new challenges, especially on resource management and security provisioning, due to the lack of common interface and consistent policy across HetNets. In this thesis, we aim to address the technical challenges of data traffic management, coordinated spectrum sharing and security provisioning in 5G HetNets through the introduction of a programmable management platform based on Software-defined networking (SDN). To address the spectrum shortage problem in cellular networks, cellular data traffic is efficiently offloaded to the Wi-Fi network, and the quality of service of user applications is guaranteed with the proposed delay tolerance based partial data offloading algorithm. A two-layered information collection is also applied to best load balancing decision-making. Numerical results show that the proposed schemes exploit an SDN controller\u27s global view of the HetNets and take optimized resource allocation decisions. To support growing vehicle-generated data traffic in 5G-vehicle ad hoc networks (VANET), SDN-enabled adaptive vehicle clustering algorithm is proposed based on the real-time road traffic condition collected from HetNet infrastructure. Traffic offloading is achieved within each cluster and dynamic beamformed transmission is also applied to improve trunk link communication quality. To further achieve a coordinated spectrum sharing across HetNets, an SDN enabled orchestrated spectrum sharing scheme that integrates participating HetNets into an amalgamated network through a common configuration interface and real-time information exchange is proposed. In order to effectively protect incumbent users, a real-time 3D interference map is developed to guide the spectrum access based on the SDN global view. MATLAB simulations confirm that average interference at incumbents is reduced as well as the average number of denied access. Moreover, to tackle the contradiction between more stringent latency requirement of 5G and the potential delay induced by frequent authentications in 5G small cells and HetNets, an SDN-enabled fast authentication scheme is proposed in this thesis to simplify authentication handover, through sharing of user-dependent secure context information (SCI) among related access points. The proposed SCI is a weighted combination of user-specific attributes, which provides unique fingerprint of the specific device without additional hardware and computation cost. Numerical results show that the proposed non-cryptographic authentication scheme achieves comparable security with traditional cryptographic algorithms, while reduces authentication complexity and latency especially when network load is high