Sharif Digital Repository

Wireless Body Area Networks (WBANs) are one of the emerging technological trends that have gained a lot of attention both from academic and industrial domains. WBAN, as standardized by IEEE 802.15.6, is a network composed of intelligent, miniaturized, low power nodes that are implanted in, placed on or in close proximity of human body for certain healthcare applications. Sensors send their acquired data to a central hub wirelessly for further processing. In this paper, based on a publicly available channel data set, we investigate the applicable channel models in a typical WBAN. Considering various scenarios with different carrier frequencies, bandwidths, body movements, and transceiver... 

Wireless body area networks (WBANs) are receiving significant interest as the next generation of wireless networks and emerging technology in the field of health monitoring. One of the most important factors for the acceptance of WBANs is the provision of appropriate security and access control mechanisms. Due to its nature in transferring the patients' sensitive data, WBAN has both classical and specific security requirements. In this paper, we survey such requirements and propose a new security scheme for satisfying them in WBANs. The proposed scheme deals with the overall network architecture, including intra- and inter-WBAN tiers, and proposes two mutual authentication and key exchange... 

The key features of wireless body area networks are limited energy resources of the sensor nodes and the need for highly reliable packet transmission. Therefore, designing a suitable algorithm that schedules transmission of the nodes is very important. Although an optimal algorithm has been previously reported based on a partially observable Markov decision process (POMDP), its complexity is high. In this study, the authors propose a suboptimal algorithm for scheduling the transmissions, i.e. a semi-myopic algorithm, with a performance close to the optimal, albeit with much lower complexity. To this end, they modify the structure of the cost function of the optimal algorithm such that the... 

In this paper, we propose an approach for routing in SPEED protocol considering residual energy in routing decisions. Due to the limited energy of a sensor node, energyefficient routing is a very important issue in sensor networks. This approach finds energy-efficient paths for delayconstrained data in real-time traffic. The SPEED protocol does not consider any energy metric in its routing. In our approach, routing is based on a weight function, which is a combination of the three factors: Delay, Energy & Speed. Here, the node with the greatest value in the weight function is to be selected as the next hop forwarding. We increase the network lifetime by considering energy metric in routing... 

Although several analytical models have been proposed for wireless sensor networks (WSNs) with different capabilities, very few of them consider the effect of general service distribution as well as design constraints on network performance. This paper presents a new analytical model to compute message latency in a WSN with loop-free Bellman Ford routing strategy. The model considers limited buffer size for each node using M/G/1/k queuing system. Also, contention probability and resource utilization are suitably modeled. The results obtained from simulation experiments confirm that the model exhibits a high degree of accuracy for various network configurations. © 2009 IEEE  

The use of cooperative schemes in wireless networks has recently attracted much attention in scenarios where application of multipleantenna systems is impractical. In such scenarios, the requirement of having full channel state information (CSI) at the receiver side can be relaxed by using differential distributed (DD) transmission schemes. However, in the DD schemes proposed so far, the decoding complexity as well as the delay requirements increase with the number of relays. In this paper, we propose a low-rate feedback-based DD approach (with one-bit feedback per relay) that enjoys full diversity, linear maximum likelihood (ML) decoding complexity, and unrestrictive delay requirements. In... 

Motivated by applications of sensor networks, there has been growing interest in monitoring large scale distributed systems. In these applications, we usually wish to monitor a global system condition defined as a function of local network elements parameters. In this paper, we study Reactive Monitoring in sensor networks, which has the benefit of operating in a decentralized manner. Our primary concern in adopting such a monitoring paradigm is reducing the communication cost which is the dominant factor of energy drain in wireless sensor networks. In this study, we address the reactive aggregate monitoring problem by casting the underlying threshold assignment as an optimization problem.... 

Wireless sensor networks (WSNs) are a new technology, foreseen to be used increasingly in the near future, and security is an important issue for them. However because of the nodes resource limitations, other schemes proposed for securing general ad hoc networks, are not appropriate for WSNs. Usually some nodes act maliciously and they are able to do different kinds of DoS attacks. In order to make the network more secure, malicious nodes should be isolated from the network. In this paper, we model the interaction of nodes in WSN and intrusion detection system (IDS) as a Bayesian game formulation and use this idea to make a secure routing protocol. By this approach nodes are motivated to act... 

Rumor routing is a classic routing algorithm based on agents' random walk. This paper proposes a novel approach based on this routing algorithm. Here, we try to improve the latency and energy consumption of the traditional algorithm using propagation of query and event agents within straight lines, instead of using purely random walk paths. As can be seen in our results, this method improves the delivery ratio of the queries which is a drawback of traditional rumor routing. Due to the reduction of final path length between source and destination, we introduce a second layer geographical routing. Moreover, a method is proposed to reduce the cost of localization equipments by using cheaper... 

Although many Medium Access Control (MAC) protocols have been specifically designed for WSNs where energy awareness is an essential consideration, only a few of them have considered the presence of mobile nodes or dynamic network topology in their protocols. However, they have usually considered occasional mobility, in which a few number of nodes may start moving at very low speeds and then remained immobile for a long period of time. In this paper, we propose a modified version of LMAC as Mobile-LMAC (MLMAC) to improve its performance in the scenarios include continuous mobility. The protocol is compared to SMAC and LMAC by simulation. The results show that the proposed MLMAC protocol has... 

Execution speed seriously bothers application developers and users for wearable devices such as Google Glass. Intensive applications like 3D games suffer from significant delays when CPU is busy. Energy is another concern when the devices are in low battery level, but users need them for urgency use. To ease such pains, one approach is to expand the computational power by cloud offloading. This paradigm works well when the available Internet access has enough bandwidth. Another way is to leverage nearby devices for computation-offloading, which is known as device-to-device (D2D) offloading. In this paper, we present Dandelion, a unified code offloading system for wearable computing. Such... 

This paper proposes a decentralized algorithm to organize an ad-hoc sensor network into clusters. Each sensor operates independently, monitoring communication among others. Those sensors which have many neighbors that are not already part of a cluster are likely candidates to creating a new cluster by declaring themselves to be a new cluster-head. The Clustering Algorithm via Deadline Timer (CADT) provides a protocol whereby this can be achieved and the process continues until all sensors are part of a cluster. Because of the difficulty of analyses simplified models are used to study and abstract its performance. A simple formula to estimate the number of clusters which will be formed in an... 

An stochastic version of the classical shortest path problem whereby for each node of a graph, a probability distribution over the set of successor nodes must be chosen so as to reach a certain destination node with minimum expected cost. In this paper, we propose a new algorithm based on Particle Swarm Optimization (PSO) for solving Stochastic Shortest Path Problem (SSPP). The comparison of our algorithm with other algorithms indicates that its performance is suitable even by the less number of iterations. © 2008 Springer-Verlag Berlin Heidelberg  

In this paper, a hierarchical routing protocol for wireless sensor networks is introduced that aims at reducing the energy imbalance among sensor nodes by integrating the distance of the nodes from the base station into clustering policies. Moreover, the proposed routing protocol does not need any centralized support from a certain node which is at odds with aiming to establish a scalable routing protocol. Mobility management is a salient feature of this protocol that guarantees reliable communications between mobile and static nodes. A simulator was developed in the MATLAB environment to evaluate the performance of this protocol. Simulations on two different network configurations are used... 

Energy consumption is one of the most important design criteria in Wireless Sensor Networks. Sensor nodes are expected to be battery-equipped. Due to their working environments, recharging or replacing batteries for each node is difficult and uneconomical. So prolonging the service lifetime of sensor nodes is a critical issue. The MAC protocol for WSNs plays a very important role in the control of energy consumption. Many of proposed MAC protocols attempt only to prolong the network lifetime for energy-efficiency. In this paper, we are going to reduce end-to-end latency in addition to extending the network lifetime. To reach this purpose, we propose a new adaptively ProLong MAC protocol... 

In this paper, we propose an energy-aware node-eentric load balancing algorithm that constructs a load balanced tree in sensor networks of asymmetric architecture. We show that the proposed energy-aware algorithm creates routing trees with better load balancing across the network and longer network life time compared to the other proposed algorithms. We also introduce a network information gathering (NIG) protocol that can collect the required information (load and neighboring information) from nodes and forward them to the base station. This protocol can be used by all centralized systems that require some additional information about nodes in the network. ©2007 IEEE  

Sensor networks are systems of many small units that work together to monitor a given environment. A mixed sensor network is composed of a collection of static and mobile nodes that has sensing, computation, communication, and locomotion capabilities. Sensor mobility can be used to compensate for the lack of sensors and improve network coverage. This paper aims to describe an algorithm called Coin for mixed sensor network deployment in an unknown environment by using a small number of mobile sensors. It allows the network to achieve maximum coverage with minimum energy consumption. Our solution includes distributed schemes for: 1) determining the exact size of a coverage hole; 2) determining... 

In this paper, a learning-aided content-based image transmission scheme is proposed, where a multi-antenna source wishes to securely deliver an image to a legitimate destination in the presence of randomly-distributed passive eavesdroppers (Eves). We take into account the fact that not all regions of an image have the same importance from the security perspective. Hence, we employ a hybrid method to realize both the error-free data delivery of public regions—containing less-important pixels; and an artificial noise (AN)-aided transmission scheme for securing the confidential packets. To reinforce system’s security, fountain-based packet delivery is also adopted, where the source node encodes... 

Due to the highly dynamic nature of Wireless Sensor Networks (WSN), Software-Defined Network (SDN) is a promising technology to ease network management by providing a logically centralized control plane. It is a common approach to employ multiple SDN controllers to form a physically distributed SDN to achieve better fault tolerance, boost scalability, and enhance performance. Despite physical distribution, since the notion behind SDN is to logically centralize network management, it is essential to provide a consistent view of the network's state for all controllers. Deploying multiple controllers result in higher synchronization and deployment cost. Since network performance and... 

This paper presents a cycle by cycle Frequency Shift Keying (FSK) demodulator, able to demodulate a FSK signal with 1% frequency modulation index (MI), in a single cycle. Based on the proposed demodulation scheme, a high rate data transmission link can be established through a high-Q inductive coupling link, breaking the basic tradeoff between the power transfer efficiency (PTE) and data rate in single carrier wireless power and data transfer systems. Designed and simulated with 0.18μ m CMOS process, the proposed FSK demodulator, detects successfully a 5Mbps data with a carrier frequency of 5MHz. A test chip is fabricated in 180nm CMOS technology. Measurement results shows that the...