A novel multi functional multi parameter concealed cluster based data aggregation scheme for wireless sensor networks (NMFMP-CDA)

Data aggregation is a promising solution for minimizing the communication overhead by merging redundant data thereby prolonging the lifetime of energy starving Wireless Sensor Network (WSN). Deployment of heterogeneous sensors for measuring different kinds of physical parameter requires the aggregator to combine diverse data in a smooth and secure manner. Supporting multi functional data aggregation can reduce the transmission cost wherein the base station can compute multiple statistical operations in one query. In this paper, we propose a novel secure energy efficient scheme for aggregating data of diverse parameters by representing sensed data as number of occurrences of different range value using binary encoded form thereby enabling the base station to compute multiple statistical functions over the obtained aggregate of each single parameter in one query. This also facilitates aggregation at every hop with less communication overhead and allows the network size to grow dynamically which in turn meets the need of large scale WSN. To support the recovery of parameter wise elaborated view from the multi parameter aggregate a novelty is employed in additive aggregation. End to end confidentiality of the data is secured by adopting elliptic curve based homomorphic encryption scheme. In addition, signature is attached with the cipher text to preserve the data integrity and authenticity of the node both at the base station and the aggregator which filters out false data at the earliest there by saving bandwidth. The efficiency of the proposed scheme is analyzed in terms of computation and communication overhead with respect to various schemes for various network sizes. This scheme is also validated against various attacks and proved to be efficient for aggregating more number of parameters. To the best of our understanding, our proposed scheme is the first to meet all of the above stated quality measures with a good performance.

     

A spare bandwidth sharing scheme based on network reliability

Spare bandwidth is required for recovering the network service from network faults. However, it degrades the efficiency of network utilization. Spare bandwidth demand can be reduced significantly by letting spare bandwidth be shared among several network services. Spare bandwidth reserved on a network element can be shared by a set of network services for a network fault if they are not simultaneously affected by the network fault. A new, and more practical spare bandwidth sharing scheme, which is based on the network reliability, is proposed in this paper. In the proposed scheme, multiple link failures are allowed with a given link failure rate, and a reasonable restoration level of near 100%; while in the conventional scheme, only a single link failure, and 100% restoration level are considered. To develop the spare bandwidth sharing scheme, we first investigate the framework for evaluating the reliability of path-based network services, and then we explain the proposed spare bandwidth sharing scheme with decision parameters such as lifetime of the path, restoration level, and the maximum number of working paths which can be protected by a backup link. Simulation results show that the proposed spare bandwidth sharing scheme requires a smaller amount of spare bandwidth than the conventional scheme.     

Addressing the interdependence in providing fair and efficient bandwidth distribution in hybrid optical‐wireless networks

The convergence of optical and wireless technologies may offer a compelling network access infrastructure because these technologies combine major benefits such as large coverage in the wireless part and huge bandwidth in the optical part of the converged access network. The convergence of the passive optical networks with 4G wireless standards, such as the Worldwide Interoperability for Microwave Access and the Long Term Evolution, constitutes a quite attractive solution to meet the challenges of the modern bandwidth‐hungry access networks. One of the most important objective a modern access network has to address is the adequate bandwidth distribution to the final users. In addition, several other aims are emerged towards this goal, such as fairness and quality of service provisioning. The adversity of designing an efficient bandwidth distribution scheme for hybrid optical‐wireless access networks lies in the interdependence of both domains: the bandwidth distribution in the wireless domain depends on the optical transmission grant opportunities, while the bandwidth coordinator in the optical part has to be aware of the mobile user heterogeneity in the wireless domain. Moreover, the bandwidth decision‐making module in both networks has to be aware of providing a fair allocation independently of the number of mobile users or the traffic requests in the network. In this work, we endeavor to address the aforementioned challenges. A novel, fair, and efficient bandwidth distribution scheme is proposed for hybrid optical‐wireless access networks. By using weighted fairness provisioning techniques, the proposed scheme intends to alleviate the interdependence of the two domains, offering a fair and efficient bandwidth distribution to the mobile users. The weights are properly defined, by utilizing suitable optimization techniques such as the Lagrange multiplies, so as to incorporate the underlying features of each traffic requests, such as the population density and the propagation delay. Extensive simulation results indicate the capability of the proposed scheme, compared with other competitive allocation schemes, in provisioning a more efficient and fair bandwidth distribution in terms of latency, throughput, and packet drop ratio. Copyright © 2015 John Wiley & Sons, Ltd.     

Active intra-ONU scheduling with proportional guaranteed bandwidth in long-reach EPONs

The unused slot remainder (USR) problem in Ethernet Passive Optical Networks and long-reach Passive Optical Networks (LR-PONs) results in both a lower bandwidth utilization and a greater packet delay. In a previous study by the current group, an Active intra-ONU Scheduling with predictive queue report scheme was proposed for resolving the USR problem by predicting the granted bandwidth in advance based on the arrival traffic estimates of the optical network units (ONUs). However, it was found that the higher bandwidth prediction error in the proposed scheme prevents the network performance from being improved. Accordingly, the present study proposes a non-predictive-based ONU scheduling method designated as Active intra-ONU Scheduling with proportional guaranteed bandwidth (ASPGB) to improve the performance of LR-PONs. In the proposed method, the maximum guaranteed bandwidth of each ONU is adapted dynamically in accordance with the ratio of the ONU traffic load to the overall system load. Importantly, the proposed dynamic bandwidth allocation approach reduces the dependence of the network performance on the granted bandwidth prediction since the maximum guaranteed bandwidth determined by the Optical Line Terminal more closely approaches the actual bandwidth demand of each ONU. To solve the idle time problem arising in the event of an excess bandwidth reallocation, ASPGB is integrated with an improved early allocation (IEA) algorithm (a kind of Just-In-Time scheduling). The simulation results show that the IEA-ASPGB scheme outperforms previously published methods in terms of bandwidth utilization and average packet delay under both balanced and unbalanced traffic load conditions.     

Aggregate History of User Mobility Pattern for QoS Provisioning in Multimedia Wireless Networks

Multimedia traffic is expected to be included in the next generation of wireless networks. As in wireline networks, the wireless network must also be capable of providing guaranteed quality-of-service (QoS) over the lifetime of mobile connections. In this paper, a bandwidth reservation scheme incorporating a user mobility prediction is proposed to manage the QoS of the networks. The mobility prediction scheme is developed based on the aggregate history of mobile users. Based on the mobility prediction, bandwidth is reserved to guarantee the uninterrupted handoff process. Simulation results demonstrate that the proposed scheme can guarantee the required QoS requirements in terms of handoff call dropping probability and new call blocking probability while maintaining efficient bandwidth utilization.     

一种基于市场模型的网络带宽分配方法

价格手段最近被用来控制网络拥塞和管理网络资源的分配,而价格手段的一个重要特点是可以促进资源的合理分配和利用。本文提出一种基于市场模型的网络带宽分配方法,该方法根据用户的宽带需求和网络系统带宽的使用状况,计算出网络带宽的市场价格,并通过用户有的价格参数进行带宽资源的协凋与分配,分析表明,该方法可以达到优化系统效率和提高用户满意度的目标。     

一个利用模糊预测的ATM广域网流量控制算法

本文提出了一个采用模糊预测的ＡＴＭ广域网流量控制算法，该算法包括二个部分，即非受控业务量的模糊预测和网络带宽的动态分配，在预测部分，提出了一组模糊判决规则和相关的隶属函数，在带宽分配地对ＡＴＭ广域网传输时延长的特点，把模糊预测与本文作者在文献「１」中所提出的ＳＥＲ流量控制机制相结合，保证了带分配的公平性和链路的高利用率，仿真结果表明，带宽分配具有公平性，链路利用率达到设计目标、交换节点处缓冲队列很     

An optimal bandwidth allocation and data droppage scheme for differentiated services in a wireless network

This paper presents an optimal proportional bandwidth allocation and data droppage scheme to provide differentiated services (DiffServ) for downlink pre‐orchestrated multimedia data in a single‐hop wireless network. The proposed resource allocation scheme finds the optimal bandwidth allocation and data drop rates under minimum quality‐of‐service (QoS) constraints. It combines the desirable attributes of relative DiffServ and absolute DiffServ approaches. In contrast to relative DiffServ approach, the proposed scheme guarantees the minimum amount of bandwidth provided to each user without dropping any data at the base‐station, when the network has sufficient resources. If the network does not have sufficient resources to provide minimum bandwidth guarantees to all users without dropping data, the proportional data dropper finds the optimal data drop rates within acceptable levels of QoS and thus avoids the inflexibility of absolute DiffServ approach. The optimal bandwidth allocation and data droppage problems are formulated as constrained nonlinear optimization problems and solved using efficient techniques. Simulations are performed to show that the proposed scheme exhibits the desirable features of absolute and relative DiffServ. Copyright © 2009 John Wiley & Sons, Ltd.     

Optimized BS assignment and resource allocation in cooperative OFDM networks

Cooperative transmission (CT) and orthogonal frequency division multiple (OFDM) are promising technologies for extending coverage and increasing throughput in broadband wireless access (BWA) networks. Therefore, we propose a novel BWA network architecture, that can set up inter-cell collaboration using physical layer cooperative transmissions among distributed wired access networks with a powerful coordination capability at the central office. However, conventional base station (BS) assignment and resource allocation schemes cannot be used directly because a user can be serviced by more than one BS with cooperative transmission technology. This study proposes a novel framework of BS assignment and resource allocation in a cooperative OFDM network. We provide three approaches of resource allocation for minimizing bandwidth usage, minimizing transmission power consumption, and balancing resource costs respectively. An optimized resource allocation scheme can be implemented by flexibly choosing one of these approaches based on network load. The simulation results show the efficiency of the proposed mathematical formulations and linearization approach of our scheme. The performance benefit of CT technology on the bandwidth saving is demonstrated by comparing the new BS assignment and resource allocation scheme with conventional non-cooperative transmission.     

Dynamic bandwidth allocation and buffer dimensioning under equal segment scheme to support video‐on‐demand services

This paper focuses on the optimization of network bandwidth allocation and buffer dimensioning to transport pre‐stored MPEG video data from source to playback destination across ATM networks. This is one of the most important issues in the support of video‐on‐demand (VoD) service. This paper provides a novel scheme in the dynamic allocation of bandwidth to segments of video using ABR mode. The dynamic bandwidth allocation is based on a new concept, called playback tunnel which is obtained from the traffic characteristics of the pre‐stored MPEG video trace to determine the optimum of transmission bandwidth as well as the buffer capacity to ensure that the playback buffer neither underflows nor overflows. The proposed scheme is tested with real‐life MPEG video traces. The obtained results have shown its significant performance improvement in terms of the capacity of playback buffer, the start‐up playback delay, the size of video segment and the network multiplexing gain. Copyright © 2001 John Wiley & Sons, Ltd.     

Research on crowd flows prediction model for 5G demand

The deployment and planning for ultra-dense base stations,multidimensional resource management,and on-off switching in 5G networks rely on the accurate prediction of crowd flows in the specific areas.A deep spatial-temporal network for regional crowd flows prediction was proposed,by using the spatial-temporal data acquired from mobile networks.A deep learning based method was used to model the spatial-temporal dependencies with different scales.External factors were combined further to predict citywide crowd flows.Only data from local regions was applied to model the closeness of properties of the crowd flows,in order to reduce the requirements for transmitting the globe data in real time.It is of importance for improving the performance of 5G networks.The proposed model was evaluated based on call detail record data set.The experiment results show that the proposed model outperforms the other prediction models in term of the prediction precision.     

A Novel Mobility Management Scheme for Integration of Vehicular Ad Hoc Networks and Fixed IP Networks

Integration of vehicular ad hoc network and fixed IP network is important to provide Internet connection and mobile data service for vehicles. However, the unique characteristics of vehicular networks, such as linear topology and constrained movements of vehicles, are not considered in the conventional mobility management schemes. Using conventional schemes, unnecessary management messages are generated and the connections to roadside-installed base stations are not fully utilized. As the results, bandwidth is wasted and data delivery ratio is not maximized. In this paper, we propose a novel mobility management scheme to integrate vehicular ad hoc network and fixed IP networks more efficiently. The proposed scheme manages mobility of vehicles based on street layout as well as the distance between vehicles and base stations. Utilizing the unique characteristics of vehicular networks, the proposed scheme has substantially less mobility management overhead and higher data delivery ratio. The proposed scheme is simulated by SUMO (a vehicular traffic simulator) and QualNet (a data network simulator). The simulation results show that the proposed scheme reduced the mobility management overhead up to 63% and improved the data delivery ratio up to 90%.     

Dynamic-Grouping bandwidth reservation scheme for multimedia wireless networks

In wireless networks carrying multimedia traffic (voice, video, data, and image), it becomes necessary to provide a quality-of-service(QoS) guarantee for multimedia traffic connections supported by the network. In order to provide mobile hosts with high QoS in the next-generation wireless networks, efficient and better bandwidth reservation schemes must be designed. This paper presents a novel dynamic-grouping bandwidth reservation scheme as a solution to support QoS guarantees in the next-generation wireless networks. The proposed scheme is based on the probabilistic resource estimation to provide QoS guarantees for multimedia traffic in wireless cellular networks. We establish several reservation time sections, called groups, according to the mobility information of mobile hosts of each base station. The amount of reserved bandwidth for each base station is dynamically adjusted for each reservation group. We use the dynamic-grouping bandwidth reservation scheme to reduce the connection blocking rate and connection dropping rate, while increasing the bandwidth utilization. The simulation results show that the dynamic-grouping bandwidth reservation scheme provides less connection-blocking rate and less connection-dropping rate and achieves high bandwidth utilization.     

Dynamic Bandwidth Allocation in WDM Passive Star Networks with Asymmetric Traffic

When asymmetric traffic is offered to a WDM passive star network, the offered bandwidth must be allocated is such a way that each station takes a portion of the available bandwidth proportional to its needs. When the traffic characteristics are fixed and a priori known, then, the bandwidth allocation scheme can be based on these characteristics. Unfortunately, the traffic characteristics are often unknown and time-variable. In this paper, a dynamic bandwidth allocation scheme is presented, which is based on the network feedback information in order to be capable of adapting to the changing traffic characteristics. According to the proposed scheme, a set of learning automata processes the network feedback information and dynamically allocates the available bandwidth to the stations according to their needs.     

Variable segmentation based on intrinsic video rate characteristics to transport pre‐stored video across networks

A variable segmentation scheme based on intrinsic video rate characteristics (VSIVRC) is proposed for efficient dynamic bandwidth allocation to transport pre‐stored variable bit rate (VBR) video across networks. The proposed scheme is evaluated with a set of real‐life MPEG video traces and also compared with two fixed segmentation schemes: equal data segmentation (EDS) and equal frame segmentation (EFS). The obtained results show that the proposed VSIVRC scheme significantly outperforms both EDS and EFS in terms of range of selective bandwidth, matchness between arrival stream and playback stream, buffer occupancy and bandwidth allocation as well. Copyright © 2003 John Wiley & Sons, Ltd.     

Bandwidth borrowing‐based QoS approach for adaptive call admission control in multiclass traffic wireless cellular networks

This paper proposes a QoS approach for an adaptive call admission control (CAC) scheme for multiclass service wireless cellular networks. The QoS of the proposed CAC scheme is achieved through call bandwidth borrowing and call preemption techniques according to the priorities of the traffic classes, using complete sharing of the available bandwidth. The CAC scheme maintains QoS in each class to avoid performance deterioration through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on min–max and max–min policies for fair resource deallocation and reallocation, respectively. The proposed adaptive CAC scheme utilizes a measurement‐based online monitoring approach of the system performance, and a prediction model to determine the amount of bandwidth to be borrowed from calls, or the amount of bandwidth to be returned to calls. The simulation‐based performance evaluation of the proposed adaptive CAC scheme shows the strength and effectiveness of our proposed scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

An optimized QoS scheme for IMS‐NEMO in heterogeneous networks

The network mobility (NEMO) is proposed to support the mobility management when users move as a whole. In IP Multimedia Subsystem (IMS), the individual Quality of Service (QoS) control for NEMO results in excessive signaling cost. On the other hand, current QoS schemes have two drawbacks: unawareness of the heterogeneous wireless environment and inefficient utilization of the reserved bandwidth. To solve these problems, we present a novel heterogeneous bandwidth sharing (HBS) scheme for QoS provision under IMS‐based NEMO (IMS‐NEMO). The HBS scheme selects the most suitable access network for each session and enables the new coming non‐real‐time sessions to share bandwidth with the Variable Bit Rate (VBR) coded media flows. The modeling and simulation results demonstrate that the HBS can satisfy users' QoS requirement and obtain a more efficient use of the scarce wireless bandwidth. Copyright © 2011 John Wiley & Sons, Ltd.     

PRNN/ERLS-based predictive QoS-promoted DBA scheme for upstream transmission in EPON

This article proposes a PRNN/ERLS-based predictive QoS-promoted dynamic bandwidth allocation (PQ-DBA) scheme for upstream transmission in Ethernet passive optical network (EPON) systems. The proposed PQ-DBA scheme originally divides incoming packets of voice, video, data service traffic into six priorities, where packets having less room before QoS requirements violation or being in starvation situation will be dynamically promoted to high priority cycle-by-cycle. It predicts packets arriving at prediction interval for ONUs using pipeline recurrent neural network (PRNN)/extended recursive least squares (ERLS) so that the bandwidth allocation can be more up-to-date and then accurate. Simulation results show that the proposed PQ-DBA scheme achieves higher system utilization and lower average voice, video, data packet delay time than the DBAM scheme [Luo and Ansari, OSA J Opt Netw 4(9):561–572] by 4, and 21, 90, 43%, respectively, and the PQ-DBA scheme but without prediction by 2, and 26, 29, 34%, respectively.     

Wireless Ad Hoc Multicast Routing with Mobility Prediction

An ad hoc wireless network is an infrastructureless network composed of mobile hosts. The primary concerns in ad hoc networks are bandwidth limitations and unpredictable topology changes. Thus, efficient utilization of routing packets and immediate recovery of route breaks are critical in routing and multicasting protocols. A multicast scheme, On-Demand Multicast Routing Protocol (ODMRP), has been recently proposed for mobile ad hoc networks. ODMRP is a reactive (on-demand) protocol that delivers packets to destination(s) on a mesh topology using scoped flooding of data. We can apply a number of enhancements to improve the performance of ODMRP. In this paper, we propose a mobility prediction scheme to help select stable routes and to perform rerouting in anticipation of topology changes. We also introduce techniques to improve transmission reliability and eliminate route acquisition latency. The impact of our improvements is evaluated via simulation.     

Effective bandwidth of multimedia traffic in packet wireless CDMA networks with LMMSE receivers: a cross-layer perspective

We propose a novel concept of cross-layer effective bandwidth that characterizes the unified resource usage taking into account both physical layer linear minimum mean square error (LMMSE) receivers and statistical characteristics of the packet traffic in code division multiple access (CDMA) networks. Based on the concept of cross-layer effective bandwidth, we develop an optimal connection admission control (CAC) scheme for variable bit rate packet traffic with QoS constraints at both physical and network layers. By introducing a small signal-to-interference ratio (SIR) outage probability using the concept of cross-layer effective bandwidth, the capacity of CDMA networks in the proposed CAC scheme can be increased significantly compared to some existing schemes. The effectiveness of the proposed approaches is demonstrated by numerical examples.