Remote patient monitoring service using heterogeneous wireless access networks: architecture and optimization

Remote patient monitoring is an eHealth service, which is used to collect and transfer biosignal data from the patients to the eHealth service provider (e.g., healthcare center). A heterogeneous wireless access-based remote patient monitoring system is presented in which multiple wireless technologies are integrated to support continuous biosignal monitoring in presence of patient mobility. A patient-attached monitoring device with a heterogeneous wireless transceiver collects biosignal data from the sensors and transmits the data through the radio access network (RAN) to the eHeath service provider. In this system, the eHealth service provider reserves wireless bandwidth (or connections) from a network service provider in a proactive manner as well as in an on-demand basis. To determine the optimal number of connections to be reserved pro-actively so that the network access cost is minimized, a stochastic programming problem is formulated considering the randomness of service demand due to the mobility of the patients. Since different biosignal data can have different quality-of-service (QoS) requirements, traffic scheduling is used in the patient-attached device which determines whether to transmit and what to transmit over an available wireless connection. To make the optimal scheduling decision, an optimization problem is formulated as a constrained Markov decision process (CMDP). The objective of this formulation is to minimize the connection cost. The proposed system architecture and the optimization formulations will be useful for the eHealth service provider to provide flexible and cost-effective monitoring service to remote/mobile patients.     

MANNA: a management architecture for wireless sensor networks

Wireless sensor networks (WSNs) are becoming an increasingly important technology that will be used in a variety of applications such as environmental monitoring, infrastructure management, public safety, medical, home and office security, transportation, and military. WSNs will also play a key role in pervasive computing where computing devices and people are connected to the Internet. Until now, WSNs and their applications have been developed without considering a management solution. This is a critical problem since networks comprising tens of thousands of nodes are expected to be used in some of the applications above. This article proposes the MANNA management architecture for WSNs. In particular, it presents the functional, information, and physical management architectures that take into account specific characteristics of this type of network. Some of them are restrict physical resources such as energy and computing power, frequent reconfiguration and adaptation, and faults caused by nodes unavailable. The MANNA architecture considers three management dimensions: functional areas, management levels, and WSN functionalities. These dimensions are specified to the management of a WSN and are the basis for a list of management functions. The article also proposes WSN models to guide the management activities and the use of correlation in the WSN management. This is a first step into a largely unexplored research area.     

Dynamic power management in new architecture of wireless sensor networks

Dynamic power management (DPM) technology has been widely used in sensor networks. Though many specific technical challenges remain and deserve much further study, the primary factor currently limiting progress in sensor networks is not these challenges but is instead the lack of an overall sensor network architecture. In this paper, we first develop a new architecture of sensor networks. Then we modify the sleep state policy developed by Sinha and Chandrakasan in (IEEE Design Test Comput. 2001; 18 (2):62–74) and deduce that a new threshold satisfies the sleep‐state transition policy. Under this new architecture, nodes in deeper sleep states consume lower energy while asleep, but require longer delays and higher latency costs to awaken. Implementing DPM with considering the battery status and probability of event generation will reduce the energy consumption and prolong the whole lifetime of the sensor networks. We also propose a new energy‐efficient DPM, which is a modified sleep state policy and combined with optimal geographical density control (OGDC) (Wireless Ad Hoc Sensor Networks 2005; 1 (1–2):89–123) to keep a minimal number of sensor nodes in the active mode in wireless sensor networks. Implementing dynamic power management with considering the battery status, probability of event generation and OGDC will reduce the energy consumption and prolong the whole lifetime of the sensor networks. Copyright © 2008 John Wiley & Sons, Ltd.     

Capacity and service extension for wireless networks using adaptiveantennas

Results highlighting the capacity enhancement and service or range extension of a wireless communication network employing adaptive antenna technology are presented. The picocellular service area was modelled using ray tracing techniques, and it has been shown that the maximum RMS delay spread was reduced from >100 ns to <30 ns by employing a beamformer with an associated array capable of forming multiple 15° wide beams. In addition, a seven-fold increase in the overall spectrum efficiency was predicted     

基于工作流管理和策略管理的下一代互联网IP业务管理系统体系结构及应用

为了实现下一代互联网IP业务的业务流程自动化、业务管理灵活性和动态性,适应新业务的可扩展性和对业务的有效管理,在WfMC工作流参考模型和IETF策略框架的基础上,提出了基于工作流管理和策略管理的下一代互联网IP业务管理系统的体系结构,详细分析了体系结构中的构成组件和相关功能,并给出了基于该体系结构的NGIIP业务开通管理流程场景的应用实例。     

Resource management in wireless networks using intelligent agents

This article relates to the larger‐scale traffic variations and proposes an adaptive resource assignment approach based on the multi‐agent technique which relies on self‐learning. The adaptive resource allocation scheme Channel Segregation (CS) containing inherently a self‐learning attribute was selected to test and validate the concept of using intelligent agents in base stations. Copyright © 2000 John Wiley & Sons, Ltd.     

Secure public administration using wireless blockchain technology with efficient routing policy

Current research works are majorly focused on the security importance and prevention measures in wireless sensor network (WSN). The survey of existing papers states that there are no efficient protocols for achieving secure and reliable peer authentication that ensures trust and confidentiality of the end-users, as public administration worldwide invokes many maximized resources demanding transparency with security. Nowadays, a number of nations have started implementing smart city ideas; new technology should be used to safeguard various public administration services against corruption, intruders rendering an active part, and public transparency. By integrating blockchain (BC) technology with wireless-based public administration process (WBPAP), the challenge of gaining trust, and eliminating corruption can be attained. Auto-metric graph neural network (AGNN) approach is proposed for eliminating data tampering and malicious attack in the peer network. Trust, confidentiality, and integrity can be achieved using the proposed BC-AGNN-WBPAP-WSN approach. The simulation of this model is activated in MATLAB, and its performance is examined using some performance metrics. Finally, the attained outcomes prove that the proposed method is the first wireless-based public blockchain experimental method for public administration analyzed with theoretical methods.     

Distributed resource management in wireless sensor networks using reinforcement learning

In wireless sensor networks (WSNs), resource-constrained nodes are expected to operate in highly dynamic and often unattended environments. Hence, support for intelligent, autonomous, adaptive and distributed resource management is an essential ingredient of a middleware solution for developing scalable and dynamic WSN applications. In this article, we present a resource management framework based on a two-tier reinforcement learning scheme to enable autonomous self-learning and adaptive applications with inherent support for efficient resource management. Our design goal is to build a system with a bottom-up approach where each sensor node is responsible for its resource allocation and task selection. The first learning tier (micro-learning) allows individual sensor nodes to self-schedule their tasks by using only local information, thus enabling a timely adaptation. The second learning tier (macro-learning) governs the micro-learners by tuning their operating parameters so as to guide the system towards a global application-specific optimization goal (e.g., maximizing the network lifetime). The effectiveness of our framework is exemplified by means of a target tracking application built on top of it. Finally, the performance of our scheme is compared against other existing approaches by simulation. We show that our two-tier reinforcement learning scheme is significantly more efficient than traditional approaches to resource management while fulfilling the application requirements.     

Mobility management using dynamic cross-layer signaling in heterogeneous wireless networks

Wireless Networks - Vertical handover cross-layer designs lack automatic adaption with different applications. The upper layers in a cross-layer design need to be aware of the events in the lower...     

Interference management using basestation coordination in broadband wireless access networks

This paper proposes a transmission‐scheduling algorithm for interference management in broadband wireless access networks. The algorithm aims to minimize the cochannel interference using basestation coordination while still maintaining the other quality of service (QoS) requirements such as packet delay, throughput and packet loss. The interference reduction is achieved by avoiding (or minimizing) concurrent transmission of potential dominant interferers. Dynamic slot allocation based on traffic information in other cells/sectors is employed. In order to implement the algorithm in a distributed manner, basestations (BSs) have to exchange traffic information. Both real‐time and non‐real‐time services are considered in this work. Results show that significant reduction in the packet error rate can be achieved without increasing the packet delay at low to medium loading values and with a higher but acceptable packet delay at high loading values. Since ARQ schemes can also be used for packet error rate reduction, we compare the performance of the proposed scheme with that of ARQ. Results indicate that although ARQ is more effective in reducing packet error rate, the proposed algorithm incurs much less packet delay particularly at medium to high loading. Copyright © 2006 John Wiley & Sons, Ltd.     

An autonomic-oriented architecture for wireless sensor networks

Autonomic communication is a new paradigm to enable network self-configuration, self-organization, self-healing, and autonomic behaviour. Emerging networks need this autonomic behaviour in order to ensure mainly quality of service, resilience and reliability of the network which is highly necessary for a long term service operation. Typical environments where such a deployment is extremely important come from wireless sensor networks. Indeed, sensor networks are strongly distributed and need for a self-organized and self-manageable architecture to provide a reliable service support. To come up with these properties, this paper introduces a new autonomic-oriented architecture (AoA) for wireless sensor networks.     

Location management in mobile ad hoc wireless networks using quorums and clusters

Position‐based reactive routing is a scalable solution for routing in mobile ad hoc networks. The route discovery algorithm in position‐based routing can be efficiently implemented only if the source knows the current address of the destination. In this paper, a quorum‐based location management scheme is proposed. Location servers are selected using the minimum dominating set (MDS) approach, and are further organized into quorums for location update and location query. When a mobile node moves, it updates its location servers in the update quorum; when a node requests the location information of another node, it will send a query message to the location servers in the query quorum. We propose to use the position‐based quorum system, which is easy to construct and guarantees that the update quorums always intersect with the query quorums so that at least one location server in the query quorum is aware of the most recent location of the mobile node. Clusters are introduced for large scale ad hoc networks for scalability. Experiment results show that the proposed scheme provides good scalability when network size increases. Copyright © 2005 John Wiley & Sons, Ltd.     

5G网络中异构无线网络和云架构研究

一种应对5G通信中无线流量爆炸的方法,是部署大量小蜂窝来生成异构无线网络(Het Nets)。Het Nets除传统的宏蜂窝外,其蜂窝由发射功率较低的小蜂窝组成。通过部署低功率小型基站,网络容量得到了改善,覆盖范围也扩大到覆盖漏洞。此外,所有小型、微微、毫微微蜂窝与现有宏蜂窝的重叠,导致频率复用的改善和有效性的提高。文章讨论了5G网络中Het Nets的现状,云无线接入网络(C-RAN)和异构C-RAN(H-CRAN),C-RAN的试验和H-CRAN的提案。     

无线移动多媒体通信网的一种切换策略

该文提出了无线移动多媒体通信网中基于宽带呼叫业务和窄带呼叫业务的双向层间切换业务模型(BLHM)和单向层间切换业务模型(SLHM),分别研究了两种业务在模型中的新呼叫阻塞概率和切换呼叫失败概率,对由于层间切换机制带来的呼叫业务质量(QoS)下降的宽带切换呼叫进行了定量分析。另外,该文还提出了基于呼叫业务代价函数和呼叫业务QoS的信道分配算法。最后进行了计算机仿真,将两种模型的性能进行了比较。     

Analysis of cost and quality of service of time-based dynamic mobility management in wireless networks

A key observation of a time-based location management scheme (TBLMS) is that the simple paging method (i.e., the fastest paging method) does not guarantee to find a mobile terminal, no matter how small the location update cycle is and how big the radius of a paging area (PA) is. Therefore, in addition to cost analysis and optimization, there is one extra issue to deal with in a TBLMS, i.e., the quality of service (QoS), which is the probability that a mobile terminal can be found in the current PA. The main contributions of the paper are as follows. First, based on our previous results on random walks among rings of cell structures, we analyze the location distribution of a mobile terminal in a PA and the reachability of a mobile terminal in a PA when a phone call arrives, where the inter-call time and the cell residence time can have an arbitrary probability distribution. Second, using results from renewal processes, we analyze the cost of dynamic mobility management in a TBLMS, where the inter-call time and the cell residence time can have an arbitrary probability distribution. Third, we develop a method to find a TBLMS which has the best combination of the location update cycle and the radius of a PA with the minimum cost of mobility management, while still satisfying the required QoS.     

A policy based framework for quality of service management in software defined networks

Growth in multimedia traffic over the Internet increases congestion in the network architecture. Software-Defined Networking (SDN) is a novel paradigm that solves the congestion problem and allows the network to be dynamic, intelligent, and it centrally controls the network devices. SDN has many advantages in comparison to traditional networks, such as separation of forwarding and control plane from devices, global centralized control, management of network traffic. We design a policy-based framework to enhance the Quality of Service (QoS) of multimedia traffic flows in a potential SDN environment. We phrase a max-flow-min-cost routing problem to determine the routing paths and presented a heuristic method to route the traffic flows in the network in polynomial time. The framework monitors the QoS parameters of traffic flows and identifies policy violations due to link congestion in the network. The introduced approach dynamically implements policy rules to SDN switches upon detection of policy violations and reroutes the traffic flows. The results illustrate that the framework achieves a reduction in end-to-end delay, average jitter, and QoS violated flows by 24%, 37%, and 25%, respectively, as compared to the Delay Minimization method. Furthermore, the proposed approach has achieved better results when compared to SDN without policy-based framework and reduced end-to-end delay, average jitter, and QoS violated flows by 51%, 62%, and 28%, respectively.

     

Mobility management in heterogeneous wireless networks

In heterogeneous wireless networks, mobile users are able to move from their home networks to different foreign networks while maintaining access capability to their subscribed services, which refers to global mobility. One of the key challenges in global mobility management is intersystem location management, which consists of keeping track of mobile users who roam into foreign networks. This paper presents an overview of mobility management in heterogeneous wireless networks and introduces a scheme which improves location management efficiency in terms of total signaling costs and intersystem paging delay. More specifically, cost reduction reaches about 50% when comparing the proposed architecture with conventional architectures.     

Non-repudiable authentication and billing architecture for wireless mesh networks

Wireless mesh networks (WMNs) are a kind of wireless ad hoc networks that are multi-hop where packets are forwarded from source to destination by intermediate notes as well as routers that form a kind of network infrastructure backbone. We investigate the security of the recently proposed first known secure authentication and billing architecture for WMNs which eliminates the need for bilateral roaming agreements and that for traditional home-foreign domains. We show that this architecture does not securely provide incontestable billing contrary to designer claims and furthermore it does not achieve entity authentication. We then present an enhanced scheme that achieves entity authentication and nonrepudiable billing.