A novel approach based on bio-inspired efficient clustering algorithm for large-scale heterogeneous wireless sensor networks

In large-scale heterogeneous wireless sensor networks (WSNs), clustering is particularly significant for lowering sensor nodes (SNs) energy consumption and creating algorithm more energy efficient. The selection of cluster heads (CHs) is a crucial task in the clustering method. In this paper, optimised K-means clustering algorithm and optimised K-means based modified intelligent CH selection based on BFOA for large-scale network (lar-OK-MICHB) is hybridised for CH selection process. Here, we utilised the extended capabilities of OK-MICHB algorithm for large-scale network. Furthermore, in many applications where energy is a primary constraint, such as military surveillance and natural disaster prediction, the stability region is also a significant factor, with a longer network lifespan being a primary requirement. In the proposed approach, only the CH selection is made after every round in place of cluster and CH change as done in conventional hierarchical algorithm. The simulation results reveal that, while keeping the distributive structure of WSNs, suggested lar-OKMIDEEC can locate real greater leftover energy nodes for selection of CH without utilising randomise or estimated procedures. Furthermore, as compared with the multi-level MIDEEC protocol, this offers a larger stability region with 68.96% increment, more consistent selection of CH in every round, and greater packets (i.e., in numbers) received at the base station (BS) with a longer network lifetime with 327% increment.     

Statistical reliability for energy efficient data transport in wireless sensor networks

Typical wireless sensor network deployments are expected to be in unattended terrains where link packet error rate may be as high as 70% and path length could be up to tens of hops. In coping with such harsh conditions, we introduce a new notion of statistical reliability to achieve a balance between data reliability and energy consumption. Under this new paradigm, the energy efficiency of a comprehensive set of statistically reliable data delivery protocols are analyzed. Based on the insight gained, we propose a hybrid system which combines the energy efficient and statistically reliable transport (eESRT) protocol with the implicit and explicit ARQ (ieARQ) protocol. This hybrid system adaptively switches between eESRT and ieARQ machanisms according to a dynamic hop threshold H_sw proposed in this work. Simulation and experiment results confirm our theoretical findings and demonstrate the advantages the hybrid system in boosting energy efficiency, reducing end to end delay, and in overcoming the “avalanche” effect.     

A novel scheme for mobility management in heterogeneous wireless networks

In this paper, we present a mobility management scheme for real-time multimedia sessions over heterogeneous wireless networks. Most approaches in the current literature use Mobile IP (MIP) or Session Initiation Protocol (SIP) to maintain real-time sessions during mobility. In this paper, we analyze MIP and SIP in terms of the mobility rate, packet loss and packet overheads in the user plane and propose a mechanism by which the network can choose the optimum protocol for mobility management. We perform the analysis for constant bit rate (CBR) as well as for variable bit rate (VBR) traffic. We show that for CBR traffic, the proposed mechanism leads to 12–35% improvement in the system capacity, while for VBR traffic, capacity improvements ranging from about 35–50% can be obtained. Our proposed approach and the analysis are applicable to handovers between different IP domains both in homogeneous as well as in heterogeneous wireless networks.     

An efficient data rate maximization algorithm for OFDM based wireless networks

In this paper we present a computationally efficient, suboptimal integer bit allocation algorithm that maximizes the overall data rate in multiuser orthogonal frequency division multiplexing (OFDM) systems implemented in wireless networks. Assuming the complete knowledge of a channel and allowing a subchannel to be simultaneously shared by multiple users we have solved this data rate maximization problem in two steps. The first step provides subchannel assignment to users considering the users’ requests on quality of service (QoS) expressed as the minimum signal-to-noise ratio (SNR) on each subchannel. The second step provides transmit power and bit allocation to subchannels in order to maximize the overall data rate. To reduce computational complexity of the problem we propose a simple method which assigns subchannels to users and distributes power and bits among them. We have analyzed the performance of our proposed algorithm by simulation in a multiuser frequency selective fading environment for various signal-to-noise ratios and various numbers of users in the system. We have concluded that our algorithm, unlike other similar algorithms, is suitable for OFDM wireless networks, especially when signal-to-noise ratio in the channel is low. Also, the results have shown that the total data rate grows with the number of users in the system.     

A novel efficient clustering protocol for energy harvesting in wireless sensor networks

Wireless Networks - The utilization of wireless sensor networks (WSNs) is proliferating in our daily life. It depends on the environmental monitoring such as weather tracking, battled field, etc....     

A novel media independent handover‐based approach for vertical handover over heterogeneous wireless networks

The key purpose for seamless mobility and service continuity between heterogeneous wireless networks is the handover. Vertical handover management is one of key challenges in such environment. To deal with some of these challenges, an IEEE 802.21 media independent handover (MIH) framework has been standardized. The main purpose of this standard is to offer a general interface for the handover by abstracting the link layer intelligence to higher layers. However, there still exist a number of limitations in MIH architecture. In this paper, a new architecture of improved MIH is presented to perform vertical handover between wireless heterogeneous networks. We focused on interworking architecture between wireless local area network and long term evolution advanced network with the use of MIH signaling to define an efficient vertical handover. A performance analysis model for the proposed MIH‐based vertical handover is derived. Analysis results show that the proposed method can be easily deployed in present multimedia service networks. Copyright © 2013 John Wiley & Sons, Ltd.     

An efficient data dissemination model for wireless sensor networks

Wireless Networks - In a wireless sensor network, one of the most important constraints on sensor nodes is their power source, which is a battery. Sensor nodes carry a limited and generally...     

An image processing inspired mobile sink solution for energy efficient data gathering in wireless sensor networks

Wireless Networks - This paper presents a gradient-based multi-hop clustering protocol combined with a mobile sink (MS) solution for efficient data gathering in wireless sensor networks. The main...     

A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks

We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The distributed co-operation of such nodes may lead to the accomplishment of large sensing tasks, having useful applications in practice. We present a new protocol for data propagation towards a control center (“sink”) that avoids flooding by probabilistically favoring certain (“close to optimal”) data transmissions. Motivated by certain applications (see [I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey, Journal of Computer Networks 38 (2002) 393–422], [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: 6th ACM/IEEE Annual International Conference on Mobile Computing (MOBICOM 2000), 2000, pp. 56–67]) and also as a starting point for a rigorous analysis, we study here lattice-shaped sensor networks. We however show that this lattice shape emerges even in randomly deployed sensor networks of sufficient sensor density. Our work is inspired and builds upon the directed diffusion paradigm of [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: 6th ACM/IEEE Annual International Conference on Mobile Computing (MOBICOM 2000), 2000, pp. 56–67].This protocol is very simple to implement in sensor devices, uses only local information and operates under total absence of co-ordination between sensors. We consider a network model of randomly deployed sensors of sufficient density. As shown by a geometry analysis, the protocol is correct, since it always propagates data to the sink, under ideal network conditions (no failures). Using stochastic processes, we show that the protocol is very energy efficient. Also, when part of the network is inoperative, the protocol manages to propagate data very close to the sink, thus in this sense it is robust. We finally present and discuss large-scale simulation findings validating the analytical results.     

A distributed data storage protocol for heterogeneous wireless sensor networks with mobile sinks

This paper presents ProFlex, a distributed data storage protocol for large-scale Heterogeneous Wireless Sensor Networks (HWSNs) with mobile sinks. ProFlex guarantees robustness in data collection by intelligently managing data replication among selected storage nodes in the network. Contrarily to related protocols in the literature, ProFlex considers the resource constraints of sensor nodes and constructs multiple data replication structures, which are managed by more powerful nodes. Additionally, ProFlex takes advantage of the higher communication range of such powerful nodes and uses the long-range links to improve data distribution by storage nodes. When compared with related protocols, we show through simulation that Proflex has an acceptable performance under message loss scenarios, decreases the overhead of transmitted messages, and decreases the occurrence of the energy hole problem. Moreover, we propose an improvement that allows the protocol to leverage the inherent data correlation and redundancy of wireless sensor networks in order to decrease even further the protocol’s overhead without affecting the quality of the data distribution by storage nodes.     

AORS: adaptive mobile data offloading based on attractor selection in heterogeneous wireless networks

The unforeseen mobile data explosion poses a major challenge to the performance of today’s cellular networks, and is in urgent need of novel solutions to handle such voluminous mobile data. Obviously, data offloading through third-party WiFi access points (APs) can effectively alleviate the data load in the cellular networks with a low operational and capital expenditure. In this paper, we propose and analyze an attractor-aware offloading ratio selection (AORS) algorithm, which can adaptive select an optimum offloading ratio based on attractor selection for the current networks environment. In the proposed algorithm, the throughput of AP and the cellular load corresponding to the coverage area of the AP, are mapped into the cell activity, which is the reflector of the current network environment. When the current attractor activity is low, the network is dominated by the noise. Then, the noise triggers the controller to select adaptive attractor for each users, the optimal offloading ratio \(\phi \), to adapt to the dynamic network environment. Hence, according to the offloading ratio \(\phi \), the part of the cellular traffic will be transmitted via WiFi networks. Through simulation, we show that the proposed AORS algorithm outperforms the existing ones with 42 % higher heterogeneous network throughput in a dense traffic environment.     

A novel software‐defined networking approach for vertical handoff in heterogeneous wireless networks

We propose a novel vertical handoff scheme with the support of the software‐defined networking technique for heterogeneous wireless networks. The proposed scheme solves two important issues in vertical handoff: network selection and handoff timing. In this paper, the network selection is formulated as a 0‐1 integer programming problem, which maximizes the sum of channel capacities that handoff users can obtain from their new access points. After the network selection process is finished, a user will wait for a time period. Only if the new access point is consistently more appropriate than the current access point during this time period, will the user transfer its inter‐network connection to the new access point. Our proposed scheme ensures that a user will transfer to the most appropriate access point at the most appropriate time. Comprehensive simulation has been conducted. It is shown that the proposed scheme reduces the number of vertical handoffs, maximizes the total throughput, and user served ratio significantly. Copyright © 2016 John Wiley & Sons, Ltd.     

A novel approach for designing delay efficient path for mobile sink in wireless sensor networks

In the recent years, the use of mobile sink has drawn enormous attention for data collection in wireless sensor networks (WSNs). Mobile sink is well known for solving hotspot or sinkhole problem. However, the design of an efficient path for mobile sink has tremendous impact on network lifetime and coverage in data collection process of WSNs. This is particularly an important issue for many critical applications of WSNs where data collection requires to be carried out in delay bound manner. In this paper, we propose a novel scheme for delay efficient trajectory design of a mobile sink in a cluster based WSN so that it can be used for critical applications without compromising the complete coverage of the target area. Given a set of gateways (cluster heads), our scheme determines a set of rendezvous points for designing path of the mobile sink for critical applications. The scheme is based on the Voronoi diagram. We also propose an efficient method for recovery of the orphan sensor nodes generated due to the failure of one or more cluster heads during data collection. We perform extensive simulations over the proposed algorithm and compare its results with existing algorithms to demonstrate the efficiency of the proposed algorithm in terms of network lifetime, path length, average waiting time, fault tolerance and adaptability etc. For the fault tolerance, we simulate the schemes using Weibull distribution and analyze their performances.     

博弈论方法在混合无线网络中网络选择问题研究中的应用

随着无线网络技术的日益发展以及人们对无线互联的需求,各种适用于不同工作环境的无线网络技术往往共同应用于人们的日常活动区域中.为了提高网络的利用率与最大化自身收益,用户往往会在不同的无线网络中切换,选择最合适网络的进行连接.这种情况下,一个无线网络用户的行为变化会对其他用户的网络环境带来严重的影响.博弈论在分析研究这类情况具有很大的优势.本文简单介绍了博弈论的基本概念,并总结了当前采用博弈论的方法研究解决混合无线网络中网络选择问题的代表的工作.     

Energy efficient rendezvous points based routing technique using multiple mobile sink in heterogeneous wireless sensor networks

Wireless Networks - In recent decades, Sensor nodes (SNs) are used in numerous uses of heterogeneous wireless sensor networks (HWSNs) to obtain a variety of sensing data sources. Sink mobility...     

一种无线异构网络中的分步协作基站分簇方法

为抑制小区间干扰提高系统性能,基于异构网络提出了一种分步基站分簇方法。该方法首先依据期望用户受到的除主服务基站之外的其余基站的信号干扰强度,确定待分簇基站集合;然后根据期望用户接收到待选集合中各个基站的信号强度,确定最终参与协作的基站集合。分步基站分簇方法通过缩小用户选择范围,同时综合考虑用户所在小区的信号强度和周围基站的干扰信号强度进行协作基站分簇。仿真结果表明：相对于现有功率最大法和阈值法,基于分步的基站分簇方法具有更高的用户端传输速率,更好地提升了系统性能。     

Belief based data cleaning for wireless sensor networks

Wireless sensor network (WSN) data is often subjected to corruption and losses due to wireless medium of communication and presence of hardware inaccuracies in the nodes. For a WSN application to deduce an appropriate result it is necessary that the data received is clean, accurate, and lossless. WSN data cleaning systems exploit contextual associations existing in the received data to suppress data inconsistencies and anomalies. In this work we attempt to clean the data gathered from WSN by capturing the influence of changing dynamics of the environment on the contextual associations existing in the sensor nodes. Specifically, our work validates the extent of similarities among the sensed observations from contextually (spatio‐temporally) associated nodes and considers the time of arrival of data at the sink to educate the cleaning process about the WSN's behavior. We term the data cleaning technique proposed in this work as time of arrival for data cleaning (TOAD). TOAD establishes belief on spatially related nodes to identify potential nodes that can contribute to data cleaning. By using information theory concepts and experiments on data sets from a real‐time scenario we demonstrate and establish that validation of contextual associations among the sensor nodes significantly contributes to data cleaning. Copyright © 2010 John Wiley & Sons, Ltd.     

A QoE handover architecture for converged heterogeneous wireless networks

The convergence of real-time multimedia applications, the increasing coverage of heterogeneous wireless networks and the ever-growing popularity of mobile devices are leading to an era of mobile human-centric multimedia services. In this scenario, heterogeneous communications will co-exist and ensure that the end-user is always best connected. The rigorous networking demands of wireless multimedia systems, beyond quality-oriented control strategies, are necessary to guarantee the best user experience over time. Therefore, the Quality of Experience (QoE) support, especially for 2D or 3D videos in multi-operator environments, remains a significant challenge and is crucial for the success of multimedia systems. This paper proposes a QoE Handover Architecture for Converged Heterogeneous Wireless Networks, called QoEHand. QoEHand extends the Media Independent Handover (MIH)/IEEE 802.21 with QoE-awareness, seamless mobility and video adaptation by integrating a set of QoE-based decision-making modules into MIH, namely a video quality estimator, a dynamic class of service mapping and content adaptation schemes. The QoEHand video estimator, mapping and adaptation components operate by coordinating information about video characteristics, available wireless resources in IEEE 802.11e and IEEE 802.16e service classes, and QoE-aware human experience. The video quality estimator works without the need for any decoding, which saves time and minimises processing overheads. Simulations were carried out to show the benefits of QoEHand and its impact on user perception by using objective and subjective QoE metrics.     

A data transmission scheme for CDMA wireless networks based onIS-95

Data integration into the existing cellular voice systems is an attractive approach since it can reduce an initial implementation cost of the data network and can provide voice/data integrated services. In this paper, we propose a data transmission scheme for code-division multiple-access (CDMA) cellular voice systems. The CDMA systems under consideration include IS-95 digital cellular systems using the 800-900-MHz band and J-STD-008 personal communications systems using the 1.8-2.0-GHz band. The proposed protocol and control schemes are designed for real systems based on IS-95 rather than conceptual systems and require no modifications to the existing voice mobile stations (MSs). Using computer simulation, the performance of voice and data users is evaluated. As a result, we show that the proposed scheme well meets our design goals, which are that the data transmission scheme should not only provide a good data performance, but also have little effect on the voice performance