Forthcoming articles

 


International Journal of Sensor Networks

 

These articles have been peer-reviewed and accepted for publication in IJSNet, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

 

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

 

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

 

Articles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

 

Register for our alerting service, which notifies you by email when new issues of IJSNet are published online.

 

We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.

 

International Journal of Sensor Networks (58 papers in press)

 

Regular Issues

 

  • Recent Advances in Wireless Sensor Networks with Environmental Energy Harvesting
    by Lei Shu, Wanjiun Liao, Jaime Lloret, Lei Wang 
    Keywords: .

  • A Correlation-based Coverage Aware and Energy Balanced Probabilistic Flooding Algorithm   Order a copy of this article
    by Jianping Wang, Rong Huihui, Wei Sun, Qiyue Li 
    Abstract: Aiming at the costly explicit and implicit acknowledgements (ACKs) and the serious energy imbalance of the existing flooding algorithm, a correlation-based coverage aware and energy balanced probabilistic flooding algorithm (CCEP) is proposed in this paper. CCEP distinguishes previous flooding algorithms with three features: (1) it exploits the link correlation between neighbors; the one-hop neighbors that have high link correlation are assigned to an aggregate explicit or implicit acknowledgement (aggregate ACK), thus effectively ameliorates the ACK implosion problem and saves energy on both data transmit and ACKs; (2) it balances the residual energy of sensor nodes; (3) it achieves target reliability and energy effi-ciency by tracking real-time aggregate ACKs and probabilistically deciding whether or not to retransmit a packet. The simulation results reveal that CCEP saves more than 50% energy on explicit and implicit ACKs in most cases while achieving target reliability; CCEP simultaneously reduces network variance of residual energy, thus prolonging the network lifetime.
    Keywords: Sensor networks; Link correlation; Probabilistic flooding; Target reliability; Energy balance; Coverage aware.
    DOI: 10.1504/IJSNET.2016.10001360
     
  • A Novel Computational Geometry Based Node Deployment Scheme in 3-D Wireless Sensor Network   Order a copy of this article
    by Niharika Anand 
    Abstract: Deployment in Wireless Sensor Network (WSN) is an important aspect and depends on the application, the WSN is designed for. In this research, a deterministic approach for sensor deployment in three- dimensional (3- D) surface has been proposed, in order to maximize the coverage. For this purpose sectoring of the terrain approach is utilized which is based on the Voronoi Diagram and then the Delaunay Triangulation is performed on the sectors to establish the connectivity of the deployed nodes. The basic idea is to give a deployment technique that works for the 3-D terrain. The traditional Voronoi Diagram algorithm is modified for sectoring the terrain and the simulated results validate the proposed algorithm. The performance of the proposed algorithm is compared with other deployment techniques like Territorial Predator Scent Marking Algorithm (TPSMA) and random deployment on the basis of coverage ratio and uniformity and comparison show the enhanced result as compared to other techniques.
    Keywords: Voronoi Diagrams; Delaunay Triangulation; Wireless Sensor Network (WSN).
    DOI: 10.1504/IJSNET.2016.10001538
     
  • EGL: Efficient Geometry-based Localization in Wireless Sensor Networks   Order a copy of this article
    by Ali Sayyed, Gustavo Medeiros De Araujo, Leandro Buss Becker 
    Abstract: Localization of sensor nodes is one of the most challenging issues in wireless sensor networks. Position information of nodes helps in effective coverage, routing, data collection, target tracking and event detection. Several approaches have been proposed in the literature for localization of randomly deployed sensor nodes, including range-based, range-free and mobile beacon based techniques. This paper describes a localization scheme using a mobile node (UAV) for efficient location estimation of the sensor nodes. UAV equipped with a GPS unit, scan the sensing field while broadcasting its current position periodically. The sensor nodes receive UAV messages, find three boundary points on it communication circle and then with the help of simple geometry rules estimate their locations. The scheme does not require extra hardware or data communication and does not require the ordinary sensor nodes to spend energy on any interaction with neighboring nodes. Several enhancements, including beacon scheduling, UAV Speed selection, detection and correction of boundary points errors, are explained for performance and efficiency improvement. This scheme is accurate and efficient enough to tolerate obstacles and only requires broadcasting of beacon messages by the mobile node. The performance of the proposed scheme has been evaluated by simulation using Omnet++. Obtained results show that localization accuracy can be adjusted by properly selecting UAV speed and beacon interval along with the UAV scan pattern.
    Keywords: wireless sensor networks; mobility; localization; positioning; geometry; mobile node; UAV.
    DOI: 10.1504/IJSNET.2016.10001280
     
  • A Novel Route Discovery Procedure for Congestion Avoidance in Multi-hop WSNs   Order a copy of this article
    by Omer Chughtai, Nasreen Badruddin, Azlan Awang, Maaz Rehan 
    Abstract: Due to high data traffic and resource-constrained nature of the Wireless Sensor Network (WSN), congestion occurs which leads to severe packet loss and high energy consumption. Since an efficient route discovery procedure can avoid congestion and balance the traffic load, a reliable congestion-aware routing is important and requires careful design consideration. In this article, a novel route discovery procedure for congestion avoidance (RDCA) in multi-hop WSNs has been proposed. RDCA is based on an objective function that incorporates the implicit behaviour of traffic load and consumed energy of the sensor nodes and signal strength between them along with the hop count. The results show that RDCA has a significant impact over Energy, Traffic Load, and Link Quality Aware Ad Hoc Routing (ETLAODV) and Energy efficient and QoS based routing (EQSR) in terms of Packet Delivery Ratio (PDR), End-to-End (ETE) delay, energy consumption, and average throughput.
    Keywords: Congestion-aware routing; Traffic load balancing; Congestion avoidance; Route discovery; WSNs.
    DOI: 10.1504/IJSNET.2016.10001262
     
  • Transmission Power Control and Sensor Node Reprogramming for Smartphone-WSN Interaction   Order a copy of this article
    by Jeongyeup Paek, JeongGil Ko, Sang Gi Hong, Byung-Bog Lee, Naesoo Kim 
    Abstract: Recent advances in both hardware and software had led the smartphones to become an attractive candidate as a mobile gateway and data-user for wireless sensor networks that have the capability to monitor the physical phenomena in various dimensions. Together, wireless sensing systems and smartphones can enable new services that allow users to gather and process fine-grained local sensor data for improving the quality and user-experience of various applications. In this work, we outline a number of remaining technical challenges before such a system architecture is practically made real. We discuss important consideration points for future system developers, and propose schemes to address two of the general yet critical challenges. Specifically, we propose an empirical link stability scoring algorithm to improve the energy efficiency of active-probing-based transmission power control schemes by 15%, and introduce a method to efficiently exchange sensor nodes' execution binaries using Android and iOS installation packages. These schemes, when included in a system of smart devices interconnecting with locally deployed wireless sensors, can be used to implement a practical and low-power system for personalized sensing applications.
    Keywords: Smartphone-based Sensor Networks; Transmission Power Control; Sensor Network Remote Reprogramming;.
    DOI: 10.1504/IJSNET.2016.10001402
     
  • Energy-Aware Task Scheduling by a True Online Reinforcement Learning in Wireless Sensor Networks   Order a copy of this article
    by Md. Muhidul Islam Khan 
    Abstract: Wireless Sensor Networks (WSNs) are an attractive platform for various pervasive computing applications. A typical WSN application is composed of different tasks which need to be scheduled on each sensor node. However, the severe energy limitations pose a particular challenge for developing WSN applications, and the scheduling of tasks has typically a strong influence on the achievable performance and energy consumption. In this paper, an energy-aware task scheduling method is proposed to achieve better energy consumption/performance trade-off in a target tracking application. Particularly, the proposed method exploits a true online reinforcement learning algorithm. A framework is proposed where it is possible to trade the application performance and the required energy consumption by a weighted reward function and can therefore achieve different energy/performance results of the overall application. By exchanging data among neighboring nodes it is possible to improve this energy/performance trade-off. The proposed method is compared with the existing approaches exploiting online learning: distributed independent reinforcement learning (DIRL), reinforcement learning (RL), cooperative reinforcement learning (CRL) and exponential weight for exploration and exploitation (Exp3), in terms of tracking quality and energy consumption trade-off in a target tracking application. Simulation results show that our proposed method is superior to existing methods for this kind of application.
    Keywords: Wireless sensor networks; Task scheduling; Energy-awareness; True online reinforcement learning; Distributed independent reinforcement learning; Cooperative reinforcement learning; Adversarial Bandit solvers.
    DOI: 10.1504/IJSNET.2016.10001403
     
  • Does the Assumption of Exponential Arrival Distributions in Wireless Sensor Networks Hold?   Order a copy of this article
    by Krishna Doddapaneni, Ali Tasiran, Enver Ever, Fredrick A. Omondi, Purav Shah, Leonardo Mostarda, Orhan Gemikonakli 
    Abstract: Wireless Sensor Networks have seen a tremendous growth in various applicationrnareas despite prominent performance and availability challenges. One of therncommon configurations to prolong the lifetime and deal with the path loss phenomenarnis having a multi-hop set-up with clusters and cluster heads to relay the information.rnAlthough researchers continue to address these challenges, the type of distributionsrnfor arrivals at the cluster head and intermediary routing nodes is still an interestingrnarea of investigation. The general practice in published works is to compare an empiricalrnexponential arrival distribution of wireless sensor networks with a theoreticalrnexponential distribution in a Q-Q plot diagram. In this paper, we show that such comparisonsrnbased on simple eye checks are not sufficient since, in many cases, incorrectrnconclusions may be drawn from such plots. After estimating the Maximum Likelihoodrnparameters of empirical distributions, we generate theoretical distributionsrnbased on the estimated parameters. By conducting Kolmogorov-Smirnov Test Statisticsrnfor each generated inter-arrival time distributions, we find out, if it is possible tornrepresent the traffic into the cluster head by using theoretical distribution. Empiricalrnexponential arrival distribution assumption of wireless sensor networks holds onlyrnfor a few cases. There are both theoretically known such as Gamma, Log-normalrnand Mixed Log-Normal of arrival distributions and theoretically unknown such asrnnon-Exponential and Mixed cases of arrival in wireless sensor networks. The work isrnfurther extended to understand the effect of delay on inter-arrival time distributionsrnbased on the type of medium access control used in wireless sensor networks.
    Keywords: Wireless Sensor Networks; Performance; Maximum-Likelihood Estimates of Empirical Distributions; Exponential Distribution; Non-Exponential Empirical Distributions; Gamma; Log-normal Distributions; Mixed Log-Normal Distributions;Histograms and Empirical Densities; Q-Q Plots; P-values; Kolmogorov-Smirnov Test Statistics; Theoretical and Empirical Densities and Cumulative Distribution Functions.
    DOI: 10.1504/IJSNET.2016.10001413
     
  • Data Estimation with Predictive Switching Mechanism in Wireless Sensor Networks   Order a copy of this article
    by Jyotirmoy Karjee, Martin Kleinsteuber 
    Abstract: In Wireless Sensor Networks (WSN), sink node needs to store data and torntrack data efficiently in a timely manner. As data is stored in a regular time interval, massive data is being collected which results in poor data tracking at a sink node. To overcome this problem, an Online Data Tracking and Estimation (ODTE) algorithm is developed at a sink node. ODTE algorithm does the following operations: (a) captures continuous data and does online data tracking at regular time interval; (b) it measures a Distortion Factor (D.F) which estimates an optimal data from massive data collected at a sink node. Moreover, data transmission overhead is another major issue at a sink node while transmitting continuous data from sensor nodes. To solve this, we develop Data Prediction Systems (DPS) models in WSN. It allows sensor nodes to transmit data to a sink node within a limit, controlled by a switching operation. This make a sink node for predicting data for sensor nodes thereby reducing transmission overhead in WSN. We validate ODTE algorithm and prediction models using simulation results.
    Keywords: Wireless sensor networks; spatial correlation; online tracking; estimation;rndata prediction.
    DOI: 10.1504/IJSNET.2016.10001414
     
  • An Energy Efficient Routing Scheme by using GPS information for Wireless Sensor Networks   Order a copy of this article
    by Byungseok Kang 
    Abstract: A wireless sensor network (or IoT network) is a collection of distributed nodes. These nodes gather data from various sensors and relay that information to a central point through a wireless network. There, the data can be aggregated and have something useful done with it. These types of networks deal primarily with the transmission of small amounts of data that needs to be sent very efficiently. In this paper we propose an energy efficient routing algorithm based on the Global Positioning System (GPS) information. Proposed scheme track the destinations location based on the beacon messages of the main route nodes. Through the experiments, proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as Energy-Efficient Ant-Based Routing Algorithm (EEABR) and Ladder Diffusion.
    Keywords: Energy efficient routing; GPS; Energy Efficiency; WSN.
    DOI: 10.1504/IJSNET.2016.10001447
     
  • In-network Data Processing in Wireless Sensor Networks Using Compressed Sensing   Order a copy of this article
    by Vishal Krishna Singh, Manish Kumar 
    Abstract: One of the major energy consuming tasks in wireless sensor networks (WSNs) is the task of data transmission. The lifetime of such a network can be significantly enhanced by, minimizing the in-network transmissions and dividing the transmission load symmetrically over the network. To overcome the issues of non-uniform energy dissipation and networks lifespan, a novel hierarchical compressive sampling (HCS) scheme is proposed. Based on the well-known hybrid compressed sensing scheme, the proposed HCS aims at minimizing the overall in-network communication during the data gathering process by obtaining correlated sensor readings through a hierarchical clustering scheme. The proposed HCS is able to identify the optimal position for the application of compressed sensing (CS) in the routing structure, to achieve symmetric load distribution in a randomly deployed network. The equal distribution of transmission load is validated through a heat map generated for showing the receiving and transmission activity at each node. An energy consumption model, based on the energy required by the radio, the processor and in the CS process, is proposed and the lifetime of the network is simulated for different sink positions. Simulations prove the efficacy of the proposed HCS over various CS based data processing schemes.
    Keywords: Hybrid CS; Energy conservation; In-network transmissions; Large scale sensor network; Symmetric load distribution.
    DOI: 10.1504/IJSNET.2016.10001449
     
  • Lifetime Maximization of wireless sensor networks with multiple sinks using multiple paths and variable communication range   Order a copy of this article
    by Vasavi Junapudi, Siba Udgata 
    Abstract: Maximizing network life time in a wireless sensor network used for maintainingrncrucial events and parameters is an important research area. In this paper, we define the life time of the network as the number of messages it is able to transfer to the sink node. We consider multiple links and propose three different variants of the algorithm to enhance the network life time in terms of number of messages successfully transmitted to any of the sink. The first algorithm constructs tree with sink node as the root to every other node and the nodes choose the sink based on the shortest path. Sink shifting happens based on the predefined shift rate. In the second approach, we try to find alternate path to reach the same sink before finally shifting to other sink. In the third approach, we increase the communication range in stages such that, it can avoid crucial nodes and reach the sink node by spending more energy. The performance compared and shown that the network life time is enhanced with the help of second and third approach by 8.75% and 33.42% than Cluster based algorithm for sink Selection (CASS). Alternate Path with variable communication range has improved the network life time by 22.90% over Alternate Path approach.
    Keywords: Wireless Sensor Networks; Multiple Sinks; Routing; Adjustable/Variable Communication Range; Network Life Time.
    DOI: 10.1504/IJSNET.2016.10001453
     
  • Clustering algorithm for wireless sensor networks : the honeybee swarms nest-sites selection process based approach   Order a copy of this article
    by Ado Adamou Abba Ari, Nabila Labraoui, Blaise Omer Yenké, Abdelhak Gueroui 
    Abstract: The design of low-power, scalable and energy efficient clustering protocols in order to extend the lifetime of wireless sensor networks remain an active area of research. Cluster-based sensor networks with data aggregation on cluster heads is the most popular approach for optimizing the energy consumption of nodes, in order to maximize the overall network lifetime. Clustering is also used for optimizing QoS and scalability in sensor networks. In the case of large scale networks, the management of nodes becomes a challenge. It is therefore necessary that, these sensors act in a self-organized manner to perform tasks for the overall network. A number of novel protocols, architectures, algorithms and applications has been proposed and implemented. Swarm intelligence provides the most powerful models of social insects that provide a global intelligence through local and simple actions in a self-organized and distributed manner. In this paper, we proposed a distributed clustering approach based on the nest-sites selection process of a honeybee swarm. In the design of our proposed algorithm, we focused on the distribution of load balancing among each cluster member in order to extend network lifetime. The performance of the proposed approach was evaluated by performing extensive experiments and the results demonstrated that our algorithm delivers better performance in terms of network lifetime, amount of packets received by the base station, end-to-end delay, energy consumption and efficiency.
    Keywords: Wireless sensor networks; Clustering; Cluster Head; Swarm Intelligence; Honeybees; NEST.
    DOI: 10.1504/IJSNET.2016.10007395
     
  • Regression Model Based Consensus for Clock Synchronization of Wireless Sensor Network   Order a copy of this article
    by Guoyong Shi 
    Abstract: Consensus is a process of reaching an agreed state throughout a distributed network by exchanging local information. Stochastic averaging matrix operation on a subset of state vectors is an effective and scalable method for arriving at a consensus state in a finite-dimensional space. In this work we extend this principle to a novel modelbased consensus process. The model is a linear regression model that is associated to each network node. Each node updates the regression model coefficients by exchanging locally the model output only. Upon receiving a set of output messages from neighboring nodes, the receiving node makes a consensus operation (typically averaging) and uses the result to update the regression model coefficients. We show that this kind of regression-based averaging scheme is able to synchronize all model parameters throughout the network, consequently, the model outputs of all nodes would have achieved consensus as well. In the second part of this work we apply the developed method to clock synchronization problem of wireless sensor network (WSN). We treat both clock drift and offset uncertainty and model them as the regression model coefficients. By only locally exchanging clock readings between neighboring nodes, each node adjusts its drift and offset parameters. Simulation verifies that the network-wide clock readings can be synchronized gradually. The effectiveness of this synchronization method is compared to other traditional clock synchronization methods. The main advantage of the new method is its robustness and reduced variation of the clock errors, a measure that characterizes the degree of network clock consensus.
    Keywords: Clock synchronization; linear regression; model-based consensus; network coordination; wireless sensor network (WSN).
    DOI: 10.1504/IJSNET.2016.10001461
     
  • Lightweighted and Energy-Aware Mikey-Ticket For E-Health Applications in the Context of Internet of Things   Order a copy of this article
    by Mohammed Riyadh Abdmeziem, Djamel Tandjaoui, Imed Romdhani 
    Abstract: E-health applications have emerged as a promising approach to provide unobtrusive and customizable support to elderly and frail people based on their situation and circumstances. However, due to limited resources available in such systems and data privacy concerns, security issues constitute a major obstacle to their safe deployment. To secure e-health communications, key management protocols play a vital role in the security process. Nevertheless, current e-health systems are unable to run existing standardized key management protocols due to their limited energy power and computational capabilities. In this paper, we introduce two solutions to tailor MIKEY-Ticket protocol to constrained environments. Firstly, we propose a new header compression scheme to reduce the size of MIKEYs header from 12 Bytes to 3 Bytes in the best compression case. Secondly, we present a new exchange mode to reduce the number of exchanged messages from six to four. We have used a formal validation method to evaluate and validate the security properties of our new tailored MIKEY-Ticket protocol. In addition, we have evaluated both communication and computational costs to demonstrate the energy gain. The results show a decrease in MIKEY-Ticket overhead and a considerable energy gain without compromising its security properties.
    Keywords: E-health; Internet of Things; MIKEY-Ticket; Security; Key Management; Data Confidentiality.

  • Gateway Bandwidth Arrangement of Data Transmission in Cyber-Physical System   Order a copy of this article
    by Hao Wang, Jianzhong Li, Hong Gao 
    Abstract: Along with the development of wireless communication technology, different wireless technologies suitable for variety situations have been widely used. Wireless technologies with different characteristics have deeply promoted the development of Cyber-Physical System. Various kinds of devices such as sensors, actuators and data processors in a Cyber-Physical System have been used to complete different tasks and also be equipped with different kinds of wireless communication technologies in order to meet different needs of work. Meanwhile, all these devices have to make communication mutually to keep the whole system effective. Gateways have been used to connect these equipments with different kinds of wireless technologies. Different devoices pack information in data packets, and transmit them to each other through gateways. We propose a dynamic gateway bandwidth allocation algorithm, in order to maximize total packets delivery ratio. Simulation results have shown that this algorithm is efficient.
    Keywords: packet delivery; bandwidth allocation; hybrid wireless network; Cyber-Physical System.
    DOI: 10.1504/IJSNET.2017.10007396
     
  • CACA-UAN: A Context-Aware Communication Approach to Efficient and Reliable Underwater Acoustic Sensor Networks   Order a copy of this article
    by Qi Liu, Xuedong Chen, Xiaodong Liu, Nigel Linge 
    Abstract: Underwater Acoustic Sensor Networks (UANs) have emerged as a promising technology recently which can be applied in many areas such as military and civil, where the communication between devices is crucial and challenging due to the unique characteristics of underwater acoustic-based environment, such as high latency and low bandwidth. In this paper, context awareness is applied to the design of an underwater communication approach, called Context-Aware Communication Approach for a UAN (CACA-UAN), which aims to improve the overall performance of the underwater communication. According to the results, the proposed CACA-UAN can increase the efficiency and reliability of the underwater communication system.
    Keywords: context-aware; underwater acoustic sensor network; context-aware communication; efficiency; reliability.
    DOI: 10.1504/IJSNET.2017.10007398
     
  • A New Compression Algorithm For Small Data Communication in Wireless Sensor Network   Order a copy of this article
    by Ammar Tuama, Mohamad Afendee Mohamed, Abdullah Muhammed, Zurina Hanapi 
    Abstract: Energy consumption is one of the most critical issues in wireless sensor network. For a sensor device, transmission of data is considered as the most energy consuming task, and it mostly depends on the size of the data. Fortunately, data compression can be used to minimize the amount of data that needs to be transmitted and thus extend sensors lifetime. However, existing data compression algorithms are not designed to cope with the specific characteristics and limitations of WSNs. Such algorithms normally require ample resources with high data correlation for good performance. Since the sensor deals with small data communication with less or no data correlation, the performance is still lacking behind. In this paper, we propose a new lossless compression algorithm that can handle small data communication in WSNs. Using compression ratio as a comparison parameter, the proposed algorithm is measured against a set of existing algorithms such as LZ77, LZMA, S-LZW, m-LZO, Gzip, and Huffman coding. Two different datasets have been used for this purpose; namely, self-generated dataset and real sensor dataset from Harvard Sensor Library. As a result, the proposed algorithm not only outclasses other existing algorithms but most importantly produces positive compression ratio throughout the whole test where most existing algorithms experience an expansion in data size when dealing with very small data. Moreover, memory usage, number of instructions and execution speed have been also measured for the proposed solution. The results show that the proposed solution imposes a very low memory requirement, less number of instructions per bit while maintaining a fast execution as compared to existing algorithms.
    Keywords: Lossless compression; Dictionary-based algorithm; Data correlation; m-LZO; Gzip; Huffman coding; LZ77; LZMA; S-LZW; Small Data.
    DOI: 10.1504/IJSNET.2017.10007399
     
  • Optimal Gateway Placement for Hybrid BANETs-Sensor Networks in Urban Areas   Order a copy of this article
    by Chunyan Liu, Hejiao Huang, Hongwei Du, Xiaohua Jia 
    Abstract: For a given urban area, sensors are well deployed in each subareas divided by streets. We apply the existing Bus-based Adhoc Networks (BANETs) to collect and transmit information from subareas to the data center, which can significantly reduce the number of sensors and the information transmissions. WSNs and BANETs are heterogeneous, and minimal number of gateways are required to connect them because of the higher cost of gateways. In this paper, we propose two gateway placement problems: minimum gateways placement and minimal gateways placement with minimum average delay. We present a (1+ln r)-approximation algorithm and r-approximation algorithm to solve the two problems, where r is the maximum number of subareas covered by a gateway candidate. In the geometric topology of the grid urban area, r<= 4. Extensive comparison simulation show the performance of minimum gateways and minimal gateways with minimum average delay achieves significantly.
    Keywords: wireless sensor networks; Bus-based adhoc networks; gateway placement; approximation algorithm.
    DOI: 10.1504/IJSNET.2017.10007401
     
  • System-Level Analysis of IEEE 802.11ah Technology for Unsaturated MTC Traffic   Order a copy of this article
    by Aleksandr Ometov, Nader Daneshfar, Ali Hazmi, Sergey Andreev, Luis Felipe Del Carpio, Parth Amin, Johan Torsner, Yevgeni Koucheryavy, Mikko Valkama 
    Abstract: Enabling the Internet of Things, machine-type communications (MTC) is a next big thing in wireless innovation. In this work, we concentrate on the attractive benefits offered by the emerging IEEE 802.11ah technology to support a large number of MTC devices with extended communication ranges. We begin with a comprehensive overview of the novel features introduced by the latest IEEE 802.11ah specifications following by development of a powerful mathematical framework capturing the essential properties of a massive MTC deployment with unsaturated traffic patterns. Further, we compare our analytical findings for a characteristic MTC scenario against respective system-level simulations across a number of important performance indicators. Our analytical results give adequate performance predictions even when simulations are challenged by the excessive computational complexity. In addition, we study the novel IEEE 802.11ah mechanisms offering improved support for massive device populations and conclude on their expected performance.
    Keywords: IEEE 802.11ah; analytical modelling; simulations; MTC/M2M; unsaturated traffic; throughput; delay; power consumption.
    DOI: 10.1504/IJSNET.2017.10007402
     
  • An Identity based Routing Path Verification Scheme for Wireless Sensor Networks   Order a copy of this article
    by Haibat Khan 
    Abstract: While the ability to express routing policies in Wireless Sensor Networks (WSNs) has been well-studied, unfortunately, the ability to enforce these policies has not been. The core challenge is that if we assume an adversarial, decentralized, and high-speed environment, then how can the receiving node be sure that the path being announced by the incoming packet is the actual path followed by it? In this paper we describe the networking primitive, called Routing Path Verification (RPV), which serves as a tool to enforce routing policies and presents a solution to the defined core challenge. We assess the security of the proposed RPV construction in a formal way. More significantly we augment a suitable key exchange protocol with our proposed RPV construction, to achieve an overall RPV scheme. We also evaluate the computational, communication and storage overhead of our proposed scheme and the experimental results show that the approach is quite scalable.
    Keywords: wireless sensor networks; routing policy control; peer to peer protocols; security protocols; routing security; routing path verification; identity based cryptography.
    DOI: 10.1504/IJSNET.2017.10007403
     
  • An intelligent closed-loop learning automaton for real-time congestion control in wireless body area networks   Order a copy of this article
    by Samia Allaoua Chelloug 
    Abstract: Recently, a considerable literature has grown up around the theme of Wireless Sensor Networks (WSNs) that are investigated in many applications. So far, Wireless Body Area Networks (WBANs) have emerged as a flexible solution for remote monitoring of mobile patients, nurses and elderly people. Nevertheless, WBANs are challenged by the real-time constraints of medical data. By another hand, WBANs have limited communication and computation capabilities. So, the collected physiological data should be aggregated before being sent to the base station. Moreover, the aggregation process may lead to the congestion problem. In this paper, we propose a closed-loop learning automaton that is based on conditional probabilities to assign each packet to the appropriate queue given the criticality of the sensed data. Our Omnet++ simulation results have been analysed using the Z-test. They confirm the performance of our scheme in terms of the drop ratio and the throughput.
    Keywords: WSNs; WBANs; congestion; learning; criticality; real-time; closed-loop; open-loop; drop ratio; throughput; Bayes rule; Omnet++; Z-test.
    DOI: 10.1504/IJSNET.2017.10007404
     
  • The Application of Distributed Fiber Sensors in Determination of Seepage in Derince Dam   Order a copy of this article
    by Ayhan Gurbuz 
    Abstract: Monitoring of civil infrastructure systems has emerged as a powerful tool for condition assessment of infrastructure performance. Structures could be monitored periodically from a central station located several kilometers away from the field with help of widespread use of modern telecommunication technologies. Fiber sensing technology is increasingly used in civil engineering applications. Distributed fiber optic sensing offers the ability to measure temperatures, strain, leakage etc. at thousands of points along a single fiber. A case of seepage along plinth of concrete faced Derince Dam, located in Turkey, is measured continuously and presented in this paper while an application of distributed fiber sensor technology is used. The case helps to disclose potential leakage along the plinth in order to minimize any risk.
    Keywords: Optical Fiber Sensing; Seepage; Derince Dam.
    DOI: 10.1504/IJSNET.2017.10007138
     
  • On Reliable Data Delivery in Stochastic Energy Harvesting Wireless Sensor Networks   Order a copy of this article
    by Zheng Liu, Xinyu Yang, Wei Yu 
    Abstract: In wireless sensor networks (WSNs), sensor nodes with energy harvesting components have motivation to expend additional energy in conditions of excess, since the surplus energy would be wasted due to energy buffer overflow. In this paper, we focus on using such surplus energy to adjust the redundancy level of erasure codes, so that the data delivery reliability can be improved while the network lifetime is still well conserved. For a single flow, we formulate the problem as the maximization of end-to-end packet delivery probability under energy constraints. Considering the energy profile as a stochastic process, we propose a Lyapunov optimization based algorithm called the Erasure Coding Scheduling Algorithm (ECSA) to solve the problem. ECSA jointly manages the energy, adjusts the redundancy level of erasure codes and makes forwarding and receiving decisions for packet transmissions. ECSA does not require any knowledge of the harvestable energy and achieves an end-to-end packet delivery probability within $e^{-varepsilon-C}$ of optimal, while ensuring the required energy buffer size and the network congestion, which are bounded by size $O(1/varepsilon)$ for any $varepsilon>0$. Through a combination of both theoretical analysis and simulation, we show the effectiveness of ESCA in yielding a near-optimal data delivery reliability. We also show that ESCA can be easily adapted to multi-flow cases and implemented in a distributed manner.
    Keywords: Erasure Codes; Stochastic Energy Harvesting; and Lyapunov Optimization.
    DOI: 10.1504/IJSNET.2017.10007405
     
  • Localised Information Fusion Techniques for Location Discovery in Wireless Sensor Networks   Order a copy of this article
    by Adnan Abu-Mahfouz, Gerhard Hancke 
    Abstract: Many wireless sensor network (WSN) applications and techniques require sensor location in order to work correctly. Information fusion in WSNs is crucial for location discovery and many information fusion techniques have been used in several location discovery algorithms. In this paper we provide an overview of information fusion techniques used by localisation algorithms in order to enhance and simplify the position computation process. Further, we analyse several approaches that can be used by localised information fusion algorithms and discuss how these approaches enhance the performance of information fusion and make information fusion play a leading role in localisation algorithms. This article provides an introduction to different localised information fusion methods for node location discovery in WSNs and could be used as starting point for implementing existing proposals or designing new techniques.
    Keywords: Localisation system; location discovery; information fusion; localised algorithms; wireless sensor networks; sensor’s position; nearest references; low-error references; malicious node removal; consistency of references; impact of geometry; noisy distance estimate.
    DOI: 10.1504/IJSNET.2017.10007406
     
  • Data Delivery in Wireless Sensor Networks with Uncontrollable Mobile Nodes   Order a copy of this article
    by Hosam Rowaihy, Ahmed Binsahaq 
    Abstract: Wireless sensor networks (WSNs) consist of low-powered devices that have computation, wireless communication and environment-sensing capabilities. These low-cost sensors are usually deployed in a dense and stationary manner for the periodic sensing of environmental phenomena. WSNs open the door for many monitoring applications in the military, in healthcare, and in environmental and urban studies. Mobile Wireless Sensor Networks (MWSNs) are a subclass of WSNs in which some or all the sensors are mobile. Many environmental applications are designed and deployed on top of MWSNs in which the sensors hosts are uncontrolled by end users (e.g., the OpenSense project for air pollution monitoring in the city of Zurich). MWSNs pose many challenges for newly designed applications. In this paper, we evaluate MWSNs with a location-based application. We test various data delivery schemes used by sensors in MWSNs, including GPRS, Wi-Fi, and Hybrid (both GPRS and Wi-Fi). We perform extensive simulation-based experiments using the ns2 simulator.
    Keywords: WSNs; wireless sensor network; MWSNs; mobile wireless sensor network; mobility; mobile sensors; performance evaluation.
    DOI: 10.1504/IJSNET.2017.10007407
     
  • Quality of Service Control in Proactive Wireless Sensor Networks via Lifetime Planning   Order a copy of this article
    by Peilin Zhang, Mohamed Abdelaal, Oliver Theel 
    Abstract: Successful exploitation of Wireless Sensor Networks (WSNs) is intuitively dependent on the enabling technologies as well as on the provision of application-relevant Quality of Service (QoS) metrics. Current research efforts mostly focus on maximizing the network lifetime without considering the predefined task time. In this article, we firstly provide a survey and a classification of the current state of QoS control methods in WSNs. Subsequently, we propose a novel QoS control method, referred to as lifetime planning. Based on design-time knowledge, lifetime planning provides users/applications with best-effort QoS, while meeting the time span required to complete the assigned task. To this end, an "upper" and a "lower" QoS boundary have to be defined for every QoS metric at the design-time. During run-time, a self-adaptation framework confines the QoS metrics between these boundaries. Lifetime planning outperforms other fixed heuristics and blind adaptation methods. As another proof of concept, we consider an office monitoring scenario with a cluster-tree WSN topology for performance evaluation. The scenario has been designed in the Contiki-OS network simulator, Cooja, using Tmote sky motes. Moreover, a novel QoS model has been engineered to determine the QoS boundaries. Simulation results show that lifetime planning tremendously improves the provided QoS while meeting the task lifetime.
    Keywords: Wireless Sensor Networks; QoS Control; Survey; Energy Management; Lifetime Planning; Self-adaptation.

  • Clustering-Based Energy-Efficient Routing Approach for Underwater Wireless Sensor Networks   Order a copy of this article
    by Gurkan Tuna 
    Abstract: As a result of the time-varying and harsh environment conditions, in underwater wireless sensor network (UWSN) scenarios, along with the excessive error rate of acoustic channels and long propagation delays, one of the most critical issues which must be addressed is to minimize energy consumption of sensor nodes. Moreover, it is hard to replace the batteries of the underwater sensor nodes frequently, therefore extending the lifetime of the nodes is one of the most important design objectives. In UWSNs, although energy dissipation in transmission mainly depends on employed routing algorithms and media access control (MAC) schemes, given the nature and challenges of the acoustic communication in water, all the layers of the protocol stack play an important role on achieving a high energy efficiency. Therefore, novel approaches that handle energy inefficiencies and extend the lifetime of UWSNs are required. In this paper, we propose an energy-efficient routing approach called Clustering-Based Energy-Efficient Routing (CBEER) to prolong the lifetime of UWSNs and evaluate its performance through extensive simulations. Based on a novel clustering-based scheme, the proposed approach can find shortest routing paths to carry data packets and is able to realize uniform network energy consumption profile in the entire underwater sensor network. The simulation based evaluation studies reveal that CBEER performs well in terms of packet delivery ratio and overall network energy consumption.
    Keywords: Clustering; Energy Efficiency; Routing; Underwater Wireless Sensor Network.
    DOI: 10.1504/IJSNET.2017.10007409
     
  • Cooperative Stackelberg Game Based Optimal Allocation And Pricing Mechanism In Crowdsensing   Order a copy of this article
    by Chunchi Liu, Rong Du, Shengling Wang, Rongfang Bie 
    Abstract: Crowdsensing has been earning increasing credits for effectively integrating the mass sensors to achieve significant tasks that one single sensor cannot imagine. However in many existing works in this field, some key information of the participants is incomplete to each other, hence causing the non-optimality result. Noticing that a potential cooperation between the players, we propose the cooperative Stackelberg game based optimal task allocation and pricing mechanism in a crowdsensing scenario. Aiming at different optimizing criteria, we propose two optimal Stackelberg games that are either with no budget constraint (No-Budget OpSt Game) or with budget constraint (Budget- Feasible OpSt Game). Analysis of their corresponding Stackelberg Equilibrium is then presented. Lastly, we perform extensive simulations to test the impact of the parameters on our model. Results of our two proposed games are progressively compared to show their optimizations in their respective criteria.
    Keywords: Crowdsensing; Stackelberg game; Optimal Mechanism; Budget Feasible; KKT conditions.
    DOI: 10.1504/IJSNET.2017.10007410
     
  • Maximizing Influence in Sensed Heterogenous Social Network with Privacy Preservation   Order a copy of this article
    by Meng Han, Qilong Han, Lijie Li, Ji Li, Yingshu Li 
    Abstract: Maximizing influence in a specific scenario to improve the performance of marketing has a significant impact on targeted advertisements and viral product promotion, which has became one of the most fundamental problems in social data analysis. Many attentions have been paid to extensively analyze the influence in social data. However, most of the existing works, unfortunately, neglect the fact that the sensed location data in the cyber physical world could also play an important role in the influence prorogation process. Furthermore, even though a few works consider a little sensed information to enhance the influence maximization, the privacy protection issue of the sensed data (location, social relationship) was directly exposed to the public. This paper considers the problem of maximizing influence in both sensed location Data and Online Social Data with privacy preserving. We firstly merge both the sensed location data from cyber-physical network and relationship data from online social network into a unified framework with one novel model, then an efficient algorithm to solve the influence maximization problem are provided within our resolution. Besides, our model could not only support our influence maximization problem, but also support other applications related to both sensed location data and online social data. Furthermore, our privacy-preserving mechanism could protect the sensitive location and link information during the whole process of data analysis. Real life datasets are empirically tested with our framework and demonstrate the power of sensed and online data combination to influence maximization.rnThe experiment result also suggests that our framework is outperforming most of the existing alternative resolutions and succeeds in preserving privacy while other resolutions not.
    Keywords: Sensed Data; Location; Social Network; Data Privacy; Influence Maximization.
    DOI: 10.1504/IJSNET.2017.10007412
     
  • Rotation Based Coverage Control Algorithm and Protocol for Heterogeneous Sensor Networks   Order a copy of this article
    by Quanlong Li, Qing Yang, Lu Su 
    Abstract: This paper studies the problem of coverage control, one fundamental issue in wireless sensor networks (WSN). In many applications of WSN, the target area is required to be covered for a certain degree. To satisfy coverage requirements, redundant sensors are usually deployed, which may cause unnecessary energy consumption on sensor nodes. To address this challenge, some coverage control methods have been proposed to reduce the number of active sensors and prolong the lifetime of sensor networks. However, none of them can be applied to heterogeneous sensor networks that are composed of different types of sensors with different sensing radii. In the previous work[1], this problem was solved by a novel coverage control mechanism for heterogeneous sensor networks. This mechanism, unfortunately, still suffers from a major limitation. That is, it may exhaust the energy of the active sensors, leading to unbalanced energy consumption among the sensor nodes. To tackle this problem, in this paper, we propose a novel distributed rotation based coverage control strategy for heterogeneous sensor networks. This strategy only needs to analyze a few special points coverage to determine each sensor node's working schedule, and thus can significantly reduce the complexity of coverage computation. Theoretical analysis and simulation results show that the proposed coverage control algorithm and protocol can outperform prior work in terms of not only the energy saving but also the energy balancing.
    Keywords: Rotation-based Coverage; Coverage Control; Wireless Sensor Networks.
    DOI: 10.1504/IJSNET.2017.10007413
     
  • A Novel Task Recommendation Model for Mobile Crowdsourcing Systems   Order a copy of this article
    by Yingjie Wang, Xiangrong Tong, Kai Wang, Baode Fan, Zaobo He, Guisheng Yin 
    Abstract: With the developments of sensors in mobile devices, mobile crowdsourcing systems are attracting more and more attention. How to recommend user-preferred and trustful tasks for users is an important issue to improve efficiency of mobile crowdsourcing systems. This paper proposes a novel task recommendation model for mobile crowdsourcing systems. Considering both user similarity and task similarity, the recommendation probabilities of tasks are derived.\r\nBased on dwell-time, the latent recommendation probability of tasks can be predicted. In addition, trust of tasks is obtained based on their reputations and participation frequencies. Finally, we perform comprehensive experiments towards the Amazon metadata and YOOCHOOSE data sets to verify the effectiveness of the proposed recommendation model.
    Keywords: Mobile crowdsourcing systems; Recommendation model; Similarity; Dwell-time; Trust.
    DOI: 10.1504/IJSNET.2017.10007414
     
  • Minimum Cost Flow Based Approach for Connectivity Restoration in WSN   Order a copy of this article
    by Eman Shaaban 
    Abstract: A WSN consists of resourced-constrained sensor nodes that cooperate to accomplish specific tasks. In many applications, WSNs operate unattended in harsh environments, which make sensor nodes susceptible to failure due to physical damage or depletion of onboard energy supply. Some of the nodes are critical to the network connectivity and their failure may partition the network into multiple disjoint segments. WSN can autonomously recover from this failure through relocation of some nodes. However such a recovery process remains challenging since tolerating the failed nodes individually is not a globally optimal solution and may cause resource conflict. This paper presents a Recovery approach that forms a topology with Increased Robustness against recurrent failure (RIR). RIR tolerates the failure of multiple connectivity-critical nodes through repositioning of non-critical healthy nodes. RIR can handle multiple simultaneous failures of either collocated or scattered nodes. The approach favors substituting a failed node with one with the highest residual energy in order to sustain the network connectivity for the longest time possible. RIR models the recovery as a Minimum Cost Flow (MCF) problem to determine the best set of node relocations for repairing the network topology while minimizing the motion overhead of the recovery process. The performance of RIR is evaluated through extensive simulation experiments. The simulation results have confirmed the effectiveness of the proposed scheme.
    Keywords: wireless sensor networks; connectivity restoration; node relocation; minimum cost flow; WSN recovery.
    DOI: 10.1504/IJSNET.2017.10007415
     
  • Accuracy-aware Data Collection in Wireless Sensor Networks   Order a copy of this article
    by Xu Zheng, Ran Bi, Guozhen Tan 
    Abstract: Data collection is a fundamental task in Wireless Sensor Networks. In many practical applications, approximate results with error bound guarantee can satisfy user requirements. To approximate sensed data, the filter based approach is to maintain the filters of each node at both sensor node and base station. The filter of each node is represented by an interval. For a given filter, the sensor node sends the update to the base station if the sensed data is beyond the range of the filter. In this paper, we investigate the accuracy-aware approach for approximate data collection. The filter assignment for optimizing the average of valid filter time is formalized as an integer optimization problem and the hardness of this problem is proven to be NP-Complete. A greedy heuristic based algorithm with low computation overhead is proposed. Moreover, to balance the valid filter time, the filter assignment for optimizing the minimum valid time is formalized as a general max-min problem. We analyze the hardness of the problem and propose an approximation algorithm. The experimental results show that our algorithms achieve better results in terms of communication cost and expected time of valid filters.\r\n
    Keywords: Data Collection; Sensed Data Model; Approximate Algorithms; Wireless Sensor Networks.
    DOI: 10.1504/IJSNET.2017.10007416
     
  • Energy-Efficient MAC Protocols for Wireless BANs: Comparison, Classification, Applications and Challenges   Order a copy of this article
    by Athar Ali Khan, Nadia N. Qadri, Amna Mahbub, Muhammad Yasir Qadri, Muhammad Iqbal, Muhammad Naeem 
    Abstract: Recent developments in wireless networks, MicroElectroMechanical Systems technology, and integrated circuits has enabled miniaturization of micro/nano sensor nodes. These low-power and intelligent nodes are placed in or around the human body in a strategic manner for numerous new, practical and innovative applications. These applications provide improved data speed, accuracy, and reliable communication of sensors and actuators. This exciting new area of research based on miniaturized sensor nodes is called Body Area Networks. With majority of applications in healthcare, BAN utilizes IEEE 802.15.6 and IEEE 802.15.4j standards. A lot of work is going on to develop communication protocols for BANs. The design of an efficient MAC protocol is an important requirement for BANs applications and a considerable work has been done to achieve this. In this paper, we provide a survey on BAN with special attention given to energy-efficient MAC protocols, its classification, and comparison. This article also discusses an in-depth review on BAN applications and fundamental research challenges.
    Keywords: Body Area Networks; Energy-efficiency; MAC Protocols; Wireless Sensor Networks; Frame Structure.
    DOI: 10.1504/IJSNET.2017.10007417
     
  • GRACO: a geographic GReedy routing with an ACO based void handling technique   Order a copy of this article
    by Mouna Rekik, Nathalie Mitton, Zied Chtourou 
    Abstract: Geographic routing has gained much attention as a basic routing primitive in wireless sensor networks due to its memory-less, scalability, efficiency and low overhead features. Greedy forwarding is the simplest geographic routing scheme, it uses the distance as a forwarding criterion. Nevertheless, it may suffer from communication holes, where no next hop candidate is closer to the destination than the node currently holding the packet. For this purpose, a void handling technique is needed to recover from the void problem and successfully deliver data packets if a path does exist between source and destination nodes. Many approaches have been reported to solve this issue at the expense of extra processing and or overhead. This paper proposes GRACO, an efficient geographic routing protocol with a novel void recovery strategy based on ant colony optimization (ACO). GRACO is able to adaptively adjust the forwarding mechanism to avoid the blocking situation and effectively deliver data packets. Compared to GFG, one of the best performing geographic routing protocols, simulation results demonstrate that GRACO can successfully find shorter routing paths with higher delivery rate, less control packet overhead and shorter end-to-end delay.
    Keywords: wireless sensor networks ; geographic routing ; guaranteed delivery ; swarm intelligence ; ant colony optimization.
    DOI: 10.1504/IJSNET.2017.10007419
     
  • Wideband Open Stub BPF for Cognitive Radio System Applications   Order a copy of this article
    by Seongsoo Cho, Bhanu Shrestha, Jeong Hyun Yi 
    Abstract: In this paper, a compact wideband open stub bandpass filter (BPF) is designed, fabricated, and characterized for cognitive radio system (CRS) application which is an emerging technology in the wireless communication system. The designed bandpass filter can be implemented to a front end of CRS system which can pass the desired signal rejecting all other signals and noise. We fabricated on Teflon substrate with dielectric constant of 2.54 and thickness of 0.54 mm and characterized using vector network analyzer. The experimental results of wideband BPF are found in good agreement with simulated results, showing fractional bandwidth from 4.4 to 8.0 GHz (≈59%), insertion loss (S21) of 33.6 dB, and minimum return loss (S11) of 0.10 dB at 6.2 GHz. The group delay of wide bandpass filter is below 0.19 ns. The features of the design are size reduction, wideband, higher insertion loss, feasibility in implementing to CRS, The designed wide bandpass filter occupied the size of 0.394λg
    Keywords: wireless cognitive radio system; wideband BPF; bandpass filter ; microstrip BPF; CRS; open stub BPF; UWB.
    DOI: 10.1504/IJSNET.2017.10007420
     
  • A Radio Link Reliability Prediction Model for Wireless Sensor Networks   Order a copy of this article
    by Wei SUN, Qiyue Li, Jianping Wang, Liangfeng Chen, Daoming Mu 
    Abstract: The Wireless Sensor Network (WSN) has great prospects in monitoring and control of industrial plants and devices. One of the main challenges of developing WSNs for industrial applications is to satisfy their requirements for reliability with strict bounds. Accurate prediction of a radio links reliability is helpful for upper layer protocols to optimize network level Quality of Service performance. In this paper, to predict the bounds of the confidence interval of the Packet Reception Ratio (PRR), a Radio Link Reliability Prediction (RLRP) model is proposed for describing the relation between the reliability metrics bounds and factors that affect it. Based on the RLRP model, the adaptive extended Kalman filter algorithm is adopted to predict the reliability metric. Real world experiments were performed to demonstrate the proposed model. The results indicate that our RLRP model is accurate in predicting the bounds of link reliability, can better reflect the random characteristic of the radio link, and is more sensitive to dynamic changes of the radio link.
    Keywords: Link Reliability Model; Reliability Prediction; Wireless Sensor Network; Kalman Filter.
    DOI: 10.1504/IJSNET.2017.10007422
     
  • Cross-layer control of wireless sensor network for smart distribution grid   Order a copy of this article
    by Ruju Fang, Jianping Wang, Wei Sun 
    Abstract: This article presents an integrated modeling method providing cross layer control for Wireless Sensor Networks (WSNs) communication which is suitable for Smart Distribution Grid (SDG). There are multiple protocol layers in WSNs communication. In order to meet the Quality of Service (QoS) of application for WSNs, as well as more resource-efficient for the resource-constrained nodes, a cross-layer control algorithm based on theory of Fuzzy Cognitive Map (FCM) is proposed. The cross layer control model of the whole communication system is established by utilizing different influence coefficients among fuzzy cognitive map concepts which represent the subordinate relationships of different protocol layers, such as application layer, network layer, MAC layer and physical layer. Influence coefficients among fuzzy cognitive map concepts can be obtained self-learning and self-training way, which can timely adjust the physical layer,MAC layer,transport layer parameters and routing strategy based on the network environment and control needs.rnFinally, communication performance of cross layer control algorithm is evaluated by received data of WSNs network,the average delay and effective throughput, and so on. Results show that cross layer control scheme based on fuzzy cognitive map proposed in paper can meet the real-time and reliability requirements.rn
    Keywords: Smart distribution grid; Wireless sensor network; Fuzzy cognitive map; Back-off strategy; Cross layer control.

  • Aggregation Aware Early Event Notification Technique for Delay Sensitive Applications in Wireless Sensor Networks   Order a copy of this article
    by Sukhwinder Singh Sran, Jagpreet Singh, Lakhwinder Kaur 
    Abstract: In this paper, an aggregation aware early event notification technique (AAEENT) is proposed for WSNs characterized by unpredictable events. The novelties of the proposed technique are two folds. First, reliable routing policy is proposed to deliver events data over high throughput paths to final destination as early as possible. This reliable routing policy minimizes the number of retransmissions, which in turn reduces network congestion. Second, temporal data aggregation has been used to minimize redundant data at each intermediate node. The proposed technique has been implemented by incorporating proposed policy in Collect protocol of Contiki operating system and is evaluated over Cooja network simulator. For performance analysis, the results are compared with the Constant Delay based aggregation, Random Waiting based aggregation policy and the existing Collect Protocol. From the results, it has been observed that due to reduced network bottlenecks in the proposed technique, the event notification time declined upto 35% and overall power consumption is reduced upto 37% in contrast to existing solutions.
    Keywords: Data Aggregation; Energy Consumption; Energy Efficient Routing; Event Notification Time; Wireless Sensor Networks.
    DOI: 10.1504/IJSNET.2017.10007423
     
  • A Traceable Threshold Attribute-Based Signcryption for mHealthcare Social Network   Order a copy of this article
    by Yanfei Lu, Xu Wang, Chunqiang Hu, Hui Li, Yan Huo 
    Abstract: With the rapid development of wireless sensor technologies, Mobile Healthcare Social Network (MHSN) built upon Wireless Body Sensor Network (WBSN), has evolved into a innovative next-generation healthcare system in our aging society. Nevertheless, it is vital to focus on the security issues and the tradeoff between privacy preserving and traceability. A novel security mechanism named as the Traceable Threshold Attribute-Based Signcryption (TTABSC) can permits patients to be friends and make a proper tradeoff between privacy and traceability. The proposed scheme leverages a four-party model to prevent the leak of a patients sensitive information, including symptom information, identity and patients health information (PHI). Combining the digital signatures and encryption, we provide a series of performance analysis, including correctness, unforgeability, traceability and privacy. Compared with previous works, our most efficient scheme generates a constant signcryption size.
    Keywords: Mobile Healthcare Social Network; Traceability; Attribute-Based Signcryption; Symptoms-Matching.

  • Flooding in 3-Dimensional Mobile Ad Hoc Networks Using 1-Hop Information   Order a copy of this article
    by Xin Bai, Xiaohui Wei, Sen Bai 
    Abstract: Flooding is a fundamental problem in mobile ad hoc networks (MANETs). Traditional pure flooding suffers from excessive redundancy of transmissions, which causes high overhead and severe interference of the network. Therefore, many flooding algorithms have been proposed to reduce the redundancy of messages. However, former works mostly focus on 2-dimensional MANETs, and their approaches are hard to be extended to 3-dimensional wireless networks. In this paper, we consider the flooding problem for 3-dimensional MANETs. We propose an efficient flooding algorithm using only 1-hop neighbours information to optimize running time of the algorithm. Under the premise of ensuring full delivery, the proposed algorithm selects a minimum set of neighbours for each node to forward messages for reducing redundant transmissions. Simulations have been conducted and the results have shown that the proposed algorithm significantly decreases required transmissions for a flooding.
    Keywords: flooding; mobile ad hoc network; 3-dimensional wireless network.
    DOI: 10.1504/IJSNET.2017.10007424
     
  • Design   Order a copy of this article
    by Yanguo Zhou, Hailin Zhang, Ruirui Chen, Tao Zhou 
    Abstract: Full-duplex (FD) wireless communications, which allow the co-time co-frequency transmission and reception, have received significant attentions in recent years. Newly emerged advanced cancellation schemes can efficiently mitigate the self-interference caused by the FD wireless communication, thus achieving high spectrum efficiency in the physical-layer as compared with the traditional half-duplex (HD) communications. However, not only the high spectrum efficiency is highly demanded in the physical-layer, but also the high throughput of the data-link layer is urgently needed, resorting to the efficient full-duplex medium access control (FD-MAC) protocol. In this paper, we propose the two-stage-contention based medium access control protocol for full-duplex wireless networks (TF-MAC) to optimize the throughput of FD wireless networks. First, we design a request to send (RTS)/full-duplex clear to send (FCTS)/clear to send (CTS) based handshaking mechanism. Then, the FD back-off algorithm is proposed to reduce the collisions for FD transmissions among all nodes. Finally, based on the two-dimensional Markov chain, we derive the closed-form expression for the throughput of FD wireless networks. The simulation results demonstrate the performance of our proposed TF-MAC protocol.
    Keywords: full-duplex communication; medium access control protocol; request to send/full-duplex clear to send/clear to send handshaking mechanism; full-duplex back-off algorithm; two-stage-contention.

  • Delay Minimizing Depth Based Routing for Multi-Sink Underwater Wireless Sensor Networks   Order a copy of this article
    by Chaitanya Kumar Karn, C.P. Gupta 
    Abstract: Underwater acoustic network is the enabling technology for number of applications viz. ocean exploration, pollution monitoring, etc. Each application requires appropriate network resources. Routing in such networks is challenging due to longer delays and mobility caused due to ocean currents and tides. Existing routing algorithms focus only on delivery of packets with very little consideration to minimizing delay in packet delivery. In this paper, we propose a new beacon-based routing algorithm for underwater sensor networks using multiple sink architecture. DMDBR (Delay Minimizing Depth Based Routing) attempts to minimize delay and uses depth, hop count and possible energy information for making routing decisions. Novelty of our scheme is in a node accepting packets for forwarding if it has sufficient residual energy to forward all the packets in the packet queue. A node declines acting as a forwarder once the estimated residual energy is not sufficient to forward the new packets. Simulation results show that DMBDR improves packet delivery ratio and minimize end-to-end delay in comparison to Depth Based Routing.
    Keywords: Underwater Wireless Sensor Networks (UWSN); Forwarding Factor (FF); Delay Minimizing Depth Based Routing (DMDBR); Beaconing Interval.

  • Sensor Data Distribution and Knowledge Inference Framework for a Cognitive-Based Distributed Storage Sink Environment   Order a copy of this article
    by Nilamadhab Mishra, Hsien-Tsung Chang, Chung-Chih Lin 
    Abstract: Large-scale sensor data distributions and knowledge inferences are major challenges for cognitive-based distributed storage environments. Cognitive storage sinks play an essential role in addressing these challenges. In a data-concentrated distributed cognitive sensor environment, cognitive storage sinks regulate the data distribution operations and infer knowledge from the large amounts of sensor data that are distributed across the conventional sensors. Embedding cognitive functions in conventional sensors is unreasonable, and the knowledge-processing limitations of conventional sensors create a serious problem. To overcome this problem, we propose a cognitive co-sensor platform across a large-scale distributed environment in which the cognitive storage sinks are the regulating authorities of data distributions and knowledge inferences and the conventional sensors are the data sources. Further, we propose a distributed data distribution framework (DDD-framework) for effective data distribution and storage across the distributed cognitive storage sinks by considering both homogeneous and heterogeneous environmental issues. We also propose a distributed knowledge inference framework (DKI-framework) that infers useful patterns for building knowledge intelligence. The analysis and discussion demonstrate that these frameworks can be adequately instigated for the purpose of optimal data distribution and knowledge inference within the horizon of a real-time distributed environment.
    Keywords: Cognitive storage sinks; conventional sensors; distributed data distribution framework (DDD-framework); distributed knowledge inference framework (DKI-framework); distributed storage environment; distributed knowledge inference.

  • A Representative Node Selection based Data Gathering Method for Compressive Sensing in WSNs   Order a copy of this article
    by Chengyang Xie, Jiancong Zhao, Yugang Niu 
    Abstract: In traditional compressive data gathering (CDG) , many rounds of data gathering are required to make sure the accuracy of reconstruction signal such that most of nodes are required to participate in data gathering. By using the spatial and temporal correlation character of sensor readings, we propose a compressive data gathering method based on representative node selection (RNS-CDG) to collect measurement vector via just one routing tree. By means of principal component analysis (PCA) and frame potential (FP), the proposed method can select fewer representative nodes from all nodes, by which a data gathering tree will be constructed. And then, via this routing tree, a measurement vector composed of M projections will be received by Sink for recovering signal. It is shown via simulation results that the proposed method can ensure the accuracy of data reconstruction and reduce the transmissions of network.
    Keywords: Compressive data gathering; spatiotemporal correlation; representative node selection; wireless sensor networks.

  • A Study of Mobile CDSS for Cardiovascular Disease Diagnosis   Order a copy of this article
    by Young-Keun Lee, Sang-seok Yun, Jae-young Choi, Malrey Lee 
    Abstract: Although cardiovascular diseases are the number one cause of death globally, they are often diagnosed in hospitals during the late stages of life. This paper aims to make a cardiovascular disease diagnose system in the mobile environment using the Artificial Neural Network. Survey data has been collected from public institutions based on characteristics including, gender type, age, height, weight, body mass index, high blood glucose, heart rates, end-systolic and end-diastolic pressure, history of cardiac infarction and angina pectoris. The collected data is manipulated through training functions. The training functions are compared using Bayesian Regulation back propagation and Levenberg-Marquardt back propagation. Subsequently, the computed results are analyzed which show significant performance. Finally, the results are analyzed by using performance functions: Mean Squared Error and Sum Squared Error. Consequently, this study validates the accuracy of cardiovascular disease diagnosis by comparing with error rates, trained results, and the actual data.
    Keywords: Mobile Clinical Decision Supporting System; Cardiovascular Diagnosis; Artificial Neural Network; sensor.

  • A dynamic advertisement interval strategy in bluetooth low energy networks   Order a copy of this article
    by Jihun Seo, Changsu Jung, Bhagya Silva, Kijun Han 
    Abstract: Nowadays, many investigators have examined the effects of Bluetooth Low Energy (BLE) for a wide range of applications due to its low-cost and low-power characteristics. Hence, Performance improvement during the discovery process has become one of major concerns. In BLE networks, advertisement interval of advertiser directly influences the performance factors, such as discovery latency and energy consumption, since the advertiser discovers scanners by transmitting advertising Packet Data Units (PDUs). Frequent transmissions of advertising PDUs may result in collisions and serious energy consumption issues. On the contrary, larger advertisement interval may lead to delayed device discovery. In this paper we propose an improved algorithm to enable advertisers to adjust its advertisement interval with respect to the network conditions based on a Carrier Sensing (CS) scheme. The proposed algorithm acquires the network conditions by listening advertising channels before transmission of advertising PDUs, while allowing the advertisers to adjust their parameters accordingly. Simulation results show that the proposed algorithm has outstanding performance compared with basic CS scheme and BLE standard in crowded BLE networks.
    Keywords: Bluetooth Low Energy (BLE); Device Discovery; Internet of Things (IoT); Dynamic Advertisement Interval.

  • Joint Spectrum Access and Transmission Power Management for Energy Harvesting Cognitive Radio Sensor Networks   Order a copy of this article
    by Fan Zhang, Tao Jing, Yan Huo, Kaiwei Jiang 
    Abstract: In this paper, we investigate the joint optimization of spectrum access and the transmission power for an energy harvesting cognitive sensor node, which operates in time-slotted fashion with causal knowledge of channel conditions along with the energy harvesting states. Allowing for the stochastic behavior of the primary channel status as well as the sensing imperfection, we formulate this joint optimization problem as an infinite-horizon discrete-time Markov decision process, in which the cognitive sensor node aims at maximizing the long-term expected throughput. Through using the value iteration approach, an optimal policy which specifies the spectrum access decision as well as the power level to be used upon the transmission is proposed. A theoretical analysis is conducted for the optimal policy, it is indicated that the optimal long-term expected throughput is non-decreasing with the battery available energy. Moreover, in order to reduce the computational complexity, we introduce a low-complexity policy and prove that the optimal low-complexity policy has a threshold structure with respect to the battery available energy. Based on this threshold structure, an efficient algorithm for deriving the optimal low-complexity policy is introduced. Finally, numerical results are presented to confirm the superiority of our proposed policies to other existing policies, and it demonstrates that the optimal low-complexity policy achieves a comparable performance with the optimal policy.
    Keywords: Energy Harvesting; Cognitive Radio; Markov Decision Process; Sensor Networks.

  • Object Localization through Clustering Unreliable Ultrasonic Range Sensors   Order a copy of this article
    by Lei Pan, Xi Zheng, Philip Kolar, Shaun Bangay 
    Abstract: The increasing popularity and availability of inexpensive ultrasonic sensors facilitates opportunities for tracking moving objects by using a cluster of these sensors. In this paper, we use a cluster of ultrasonic sensors connected to Raspberry Pis. We conduct field tests and discover that their accuracy and reliability of individual sensors depends on the relative position of the tracked object. Hence, we employ data fusion and synchronization techniques for trilateration to improve accuracy using a cluster of sensor nodes. We successfully conduct multiple runs tracking a moving object and report these field test results in this paper. Our average error is in the order of tens of centimeters, and some of our best results match published results for larger clusters.
    Keywords: Ultrasonic Sensor; Sensor Network; Object Tracking; Trilateration; Data Fusion.

  • A Distributed Anomaly Detection Model for Wireless Sensor Networks Based on the One-Class Principal Component Classifier   Order a copy of this article
    by Murad Rassam, Mohd Aizaini Maarof, Anazida Zainal 
    Abstract: The use of Wireless Sensor Networks (WSN) is increasing in various applications with the emergence of the Internet of Things concept which facilitates human life by equipping a sensor for each object/thing to build a network of things. Nonetheless, the sensed data quality and reliability are sometimes affected by factors such as sensors faults, intrusions and unusual events among others. Consequently, the real time and effective detection mechanisms of such anomalous data are necessary to guarantee making reliable decisions. In this paper, we propose a One-Class Principal Component Classifier (OCPCC) based distributed anomaly detection model for WSN. The proposed model utilizes the spatial correlations among sensed data in a closed neighbourhood by distributing the detection process over the nodes in a cluster-based WSN. The feasibility of the proposed model was validated using datasets collected from real world sensor network deployments and compared with local detection and some existing detection approaches from literature. The results show that the proposed distributed model helps to improve the detection rate of anomalous data compared to local model. A comparison with existing distributed models reveals the advantages of the proposed model especially for efficiency metrics while achieving better or comparable detection effectiveness.
    Keywords: Wireless Sensor Networks; Distributed Anomaly Detection; Sensor Data Analysis; Principal Component Analysis.

  • Detecting occupancy and social interaction via energy and environmental monitoring   Order a copy of this article
    by Antonino Crivello, Fabio Mavilia, Paolo Barsocchi, Erina Ferro, Filippo Palumbo 
    Abstract: The demand for human oriented services in indoor environment has received steady interest and it is represent a big challenge for increasing the human well-being. In this work, we present a system able to perform room occupancy detection and social interactions identification, using data coming from both energy consumption information and environmental data. We also study the application of supervised and unsupervised learning techniques to the reference scenario, in order to: i) infer context information related to socialization aspects, by recognizing in real-time social interactions; ii) identify when a room is really occupied by workers or not, for emergencies management. The system has been tested in a real workplace scenario, inside three rooms of the CNR research area in Pisa occupied by different numbers of workers, representing the main core technology for future Active and Assisted Living services.
    Keywords: Occupancy Detection; Social Interactions; Wireless Sensor Network.

  • Passive and Greedy Beaconless Geographic Routing for Real-time Data Dissemination in Wireless Networks   Order a copy of this article
    by Yongbin Yim, Jeongcheol Lee, Euisin Lee, Sang-Ha Kim 
    Abstract: Real-time geographic routing is one of the most popular examples relying on a greedy algorithm to deliver real-time data in wireless networks. In this routing, each sender node decides a next-hop node as a local optimum among one-hop neighbors for achieving the global real-time requirement. However, this sender-side decision paradigm suffers from periodic and network-wide beacon exchange overhead to figure out neighbor nodes. To overcome the limitation, this paper newly suggests a passive and greedy routing algorithm, called PGBR for low-cost real-time data dissemination in beaconless wireless networks. To do this, PGBR forwards real-time data by a receiver-side competition without gathering information of neighbor nodes. To achieve the passive and greedy real-time routing, PGBR focuses on two major challenging issues: a delay estimation procedure and a contention function design. The delay estimation procedure estimates both competition delay and packet transmission delay used as inputs for the contention function design. PGBR also redesigns receiver-side contention function with deliberating the estimated delay and discuss combinations with important performance metrics: residual energy and forward progress. The experimental results show that PGBR could improve the energy-efficiency as well as keeps high delivery deadline success ratio.
    Keywords: Beaconless; Real-time; Delay estimation; Contention function; Routing protocol.

  • A qualitative study of medium access control protocols supporting mobility in wireless sensor networks   Order a copy of this article
    by Zakaria Hamidi-Alaoui, Abdelbaki El Belrhiti El Alaoui 
    Abstract: In many wireless sensor network (WSN) applications, mobility support has been steadily becoming an important factor in achieving specific tasks. Nevertheless, mobile WSNs are facing several challenges and constraints regarding the wireless medium access which have been already addressed by existing Medium Access Control (MAC) protocols. In fact, these protocols were designed to handle node mobility by considering energy-efficiency and ensure medium access for all network nodes. In our work, we propose a decision-support tool enabling to choose adequate MAC protocol(s) that meet the requirements of a specific target mobile WSN application. This tool will be based on a deep analytical and comparative study of MAC protocols in terms of energy consumption and latency in dynamic contexts. Finally, we apply this approach on an application of wild animals monitoring as an example in order to retain, among the studied MAC protocols, the well-suited ones.
    Keywords: wireless sensor network; WSN; mobile WSN; medium access control; MAC; MAC protocol; mobility; mobile node; handover; decision support; latency; energy efficiency.

  • Creating a secure index for distributed data on the sensor network   Order a copy of this article
    by Vandana Bhasin, P.C. Saxena, C.P. Katti 
    Abstract: Wireless sensor networks that are deployed in public, untrusted or hostile environments, are prone to various security vulnerabilities. In this paper, a method has been developed to reduce the security risk of a node from tampering. The sensed data is distributed using the roots of the polynomial equation, thereby reducing the security risk (A & Kak S, 2009). The number of partitions are fixed as specified by the roots of polynomial equation. We propose a security mechanism on a clustered heterogeneous network: Secure Index on distributed data. The index is created for every partition before encryption. The index allows for efficient retrieval of data as it is located on cluster head. In this paper, we provide end-to-end confidentiality is not decrypted at the cluster head. The encrypted data can be decrypted only at the base station which has the key for decryption. It offers single value granularity as index is created for each unique data item in the partition. It provides data confidentiality, authentication and authorization. We have analysed the performance of the algorithm in terms of energy consumption. The energy consumption with the addition of security features has increased. We have found that even though the energy consumption has increased, the network can fulfil the purpose of data collection and can be deployed on large scale networks.
    Keywords: sensor networks; data partitioning; indexing; implicit security.

  • Distance Vector hop localization algorithm based on the limitation by the probability to hops   Order a copy of this article
    by Xin Shi, Yanping Li, Sen Zhang 
    Abstract: Distance Vector-Hop localization algorithm, using flooding routing broadcast anchor node information, is confronted with the problem of communication consumption. Using the product of jump distance correction value and the minimum number of hops to represent the distance between the nodes, can lead to cumulative error. Using maximum likelihood estimation method to determine the unknown nodes, it suffers from the excessive computational consumption. This paper presents a new algorithm. Based on the probability property of random distribution of wireless sensor network, our algorithm limits hops between nodes to reduce the network communication consumption and minimize the cumulative error in distance calculation. Moreover, trilateral positioning method or the extended MIN-MAX algorithm, which is employed to calculate the unknown node coordinates, can decrease the computational consumption. Performance analysis and simulation results show that, the proposed algorithm can achieve multi-objective optimization with higher precision and lower cost.
    Keywords: DV-HOP; probability distribution; limited number of hops; angle threshold; extended MIN-MAX.

  • Energy-Efficient Transmission Approach Using Regionalization Compressed Sensing   Order a copy of this article
    by Hao Yang, Xiwei Wang 
    Abstract: In the process of transmission in wireless sensor network, a vital problem is that a centre region closed to the sink will form in which sensors have to cost vast energy. To energy-efficient communication, Compressive Sensing(CS) has been employed gradually. However, the performance of plain CS deeply depends on the specific data gathering strategy in practice. In this paper, we propose an energy-efficient data gathering scheme based on regionalization CS. Firstly, the network is divided into several blocks randomly with no need for relationships or features among sensors. Furthermore, centre sensors for each region are elected with randomization. Subsequently, CS is implemented in each individual region respectively with divisional measurement matrix to generate parts of samplings. Finally, regional samplings in all regions are transported directly to the sink for reconstruction. Subsequently, two issues for practical applications are considered. Experiments reveal that our scheme outperforms distributed CS, straight forward and the mixed scheme by comparing different parameters of the data package and the considered issues further guarantee its feasibility.
    Keywords: Regionalization Compressed Sensing; Transmission; Wireless Sensor Network.

  • Three Dimensional Power Efficient Distributed Node Localization in Wireless Sensor Networks   Order a copy of this article
    by Reza Shahbazian, Seyed Ali Ghorashi 
    Abstract: Wireless sensor networks are usually used in applications in which information is only applicable when the location of informative node is known. The localization algorithms used to determine node's location are performed in a centralized or distributed manner. Although the high accuracy is the main advantage of centralized algorithms, the distributed ones are more efficient in power consumption, robustness and reliability. In this paper, we first propose a three dimensional (3D) distributed node localization algorithm for wireless sensor networks in which sensor nodes cooperate to estimate the unknown location in a distribute manner. Then, we propose a node selection algorithm by switching off some sensor nodes causing a great reduction in the power consumption and extending the life time of the network. We further propose a weighting function to improve the performance of proposed algorithm by improving the localization accuracy. Simulation results confirm that proposed algorithms are applicable in 3D environments while achieving acceptable performance in case of localization error, improving the robustness and scalability of the network and reducing the power consumption at least by 20 percent.
    Keywords: Localization; Distributed; Wireless Sensor Network; Three Dimensional; Power Efficient; Node Selection; Weighing Function.