1-4hit |
Celimuge WU Juan XU Yusheng JI Satoshi OHZAHATA Toshihiko KATO
Cognitive radio ad hoc networks can be used to solve the problems of limited available spectrum and inefficient spectrum usage by adaptively changing their transmission parameters. Routing protocol design has a significant impact on the network performance. However, an efficient protocol that takes account of primary user flows and the long-term channel assignment issue in route selection is still missing. In this paper, we propose AODV-cog, a cognitive routing protocol for CSMA/CA ad hoc networks based on AODV. AODV-cog chooses a route by considering the effect on the primary users, available channel bandwidth and link reliability. AODV-cog also takes account of future channel utilization which is an important but underexplored issue. AODV-cog switches channels for secondary user flows when network congestion occurs. We use theoretical analysis and computer simulations to show the advantage of AODV-cog over existing alternatives.
Seng-Phil HONG Gail-Joon AHN Wenjuan XU
The information technology revolution has transformed all aspects of our society including critical infrastructures and led a significant shift from their old and disparate business models based on proprietary and legacy environments to more open and consolidated ones. Supervisory Control and Data Acquisition (SCADA) systems have been widely used not only for industrial processes but also for some experimental facilities. Due to the nature of open environments, managing SCADA systems should meet various security requirements since system administrators need to deal with a large number of entities and functions involved in critical infrastructures. In this paper, we identify necessary access control requirements in SCADA systems and articulate access control policies for the simulated SCADA systems. We also attempt to analyze and realize those requirements and policies in the context of role-based access control that is suitable for simplifying administrative tasks in large scale enterprises.
Juan XU Xingxin XU Xu DING Lei SHI Yang LU
In wireless sensor networks (WSN), communication interference and the energy limitation of sensor nodes seriously hamper the network performance such as throughput and network lifetime. In this paper, we focus on the Successive Interference Cancellation (SIC) and Wireless Energy Transmission (WET) technology aiming to design a heuristic power control algorithm and an efficient cross-layer strategy to realize concurrency communication and improve the network throughput, channel utilization ratio and network lifetime. We realize that the challenge of this problem is that joint consideration of communication interference and energy shortage makes the problem model more complicated. To solve the problem efficiently, we adopt link scheduling strategy, time-slice scheduling scheme and energy consumption optimization protocol to construct a cross-layer optimization problem, then use an approximate linearization method to transform it into a linear problem which yields identical optimal value and solve it to obtain the optimal work strategy of wireless charging equipment (WCE). Simulation results show that adopting SIC and WCE can greatly improve communication capability and channel utilization ratio, and increase throughput by 200% to 500% while prolonging the network lifetime.
Benhong ZHANG Yiming WANG Jianjun ZHANG Juan XU
The flexibility of wireless communication makes it more and more widely used in industrial scenarios. To satisfy the strict real-time requirements of industry, various wireless methods especially based on the time division multiple access protocol have been introduced. In this work, we first conduct a mathematical analysis of the network model and the problem of minimum packet loss. Then, an optimal Real-time Scheduling algorithm based on Backtracking method (RSBT) for industrial wireless sensor networks is proposed; this yields a scheduling scheme that can achieve the lowest network packet loss rate. We also propose a suboptimal Real-time Scheduling algorithm based on Urgency and Concurrency (RSUC). Simulation results show that the proposed algorithms effectively reduce the rate of the network packet loss and the average response time of data flows. The real-time performance of the RSUC algorithm is close to optimal, which confirms the computation efficiency of the algorithm.