Loading...
Search for:
sensor-networks
0.008 seconds
Total 325 records
Efficient Multicasting in Cognitive Wireless Sensor Networks
, M.Sc. Thesis Sharif University of Technology ; Movaghar Rahimabadi, Ali (Supervisor)
Abstract
Today with growth of wireless communications and progress of small and cheap sensors which have capability of communication and calculation, wireless sensor networks are important and useful topic. But due to energy restrictions, efficient use of resources and increasing network lifetime, have been considered as key factors in network design. In this regard, using efficient multicast routing in energy consumption, for an efficient data transmission to specific number of nodes instead of all nodes code updates, information requests, task assignments and etc., is necessary.On the other hand these networks use unlicensed spectrum and suffer from collision due to congestion caused by other...
Energy Aware Data Compression in WSN by Signal Processing
, M.Sc. Thesis Sharif University of Technology ; Manzuri Shalmani, Mohammad Taghi (Supervisor)
Abstract
Wireless sensor networks (WSNs) consume energy for their sensing, computation, and communication. To extend the lifetime of the network, sensor nodes are equipped with energy storage devices. Recharging their batteries is impossible in most applications. Therefore, energy consumption needs to be monitored and be limited to extend the high performance operation of the network. In this network, the communication module consumes the highest amount of energy. While several methods are proposed to reduce the energy consumption, data compression is one of the most effective ways for energy management by reducing the number of bits to be broadcast. To determine the energy efficiency of the...
Location Finding in Wireless Sensor Network Based on Range-Free Schemes
, M.Sc. Thesis Sharif University of Technology ; Manzuri, Mohammad Taghi (Supervisor)
Abstract
Sensor Localization is a crucial part of many location‐dependent applications that utilize wireless sensor networks (WSNs). Several approaches, including range‐based and range‐free, have been proposed to calculate the position of randomly deployed sensor nodes. With specific hardware, the range‐based schemes typically achieve high accuracy based on either node‐to-node distances or angles. On the other hand, the range‐free mechanisms support less positioning accuracy with less expense. The proposed scheme is based on range‐free localization, which utilizes the received signal strength (RSS) from the anchor nodes. In this work, genetic fuzzy and neuro-fuzzy systems are used to yield more...
Reliability Analysis of Energy Harvesting Wireless Sensor Networks
, M.Sc. Thesis Sharif University of Technology ; Miremadi, Ghassem (Supervisor)
Abstract
Wireless Sensor Networks (WSN) are wildly utilized in surveillance and controling applications, and because of their remote and standalone operation, lifetime and reliability of a typical WSN are two main concerns in these networks. One of the reliability threatening issues in a WSN is residual accessible energy for each node. Nowadays, energy harvesting systems are used in WSN nodes to catch environmental energy, and reduce the energy limitation. However, because of inherent uncertainty of energy harvesting systems, the networks that operate using environmental energy have new reliability issues. Different rate of energy harvesting, according to environmental conditions, is one of the most...
Mutual effect of Security and Realtimeness in Wireless Sensor Networks
, M.Sc. Thesis Sharif University of Technology ; Jahangir, Amir Hossein (Supervisor)
Abstract
With improving of technology, using of Wireless Sensor Networks (WSN) is rapidly increasing. In some application, wireless sensor network do need to supply realtimeness. In the other hand, in many cases, sensor networks are in risky environments distributed. Therefore, security is a key factor in sensor networks to performing their works properly optimized and maximum. Hence, both security and realtimeness features are important features of sensor networks. But because of common resource use, increasing efficiency of a feature will result in decreasing efficiency of other feature. In this thesis, we indicated to study mutual effect of security and realtimeness in Wireless Sensor Networks in...
Modeling and Evaluating Reliability in Wireless Sensor Networks
,
M.Sc. Thesis
Sharif University of Technology
;
Jahangir, Amir Hossein
(Supervisor)
Abstract
Recent advancement in wireless communications, electronics, low power design and also tendency to use high performance low cost products have led to emergence of Wireless Sensor Networks (WSNs). As the main purpose of a WSN is information gathering and it’s transmission to the sink node, the main problem is to deliver information correctly with minimum energy consumption. Besides, whereas the majority of developed applications for WSNs are event-critical applications, achieving reliable data transfer as the main factor of dependability and quality of service seems vital. However, data transmission is unreliable over multi-hop WSN due to the unreliability of wireless links and node failures. ...
A game theory approach for optimal routing: in wireless sensor networks [electronic resource]
, Article Published in: Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on ; (2013), Vol. 3, No. 3, pp. 62-75 ; Eshghi, Kourosh ; Sharif University of Technology
Abstract
In this paper, a "Game Theory" approach for finding an optimal path in a "Wireless Sensor Network" is discussed. WSN is one of the most interesting research fields in the communication networks, and is the center of attention in recent years. In our model, a pricing and payment technique is presented to obtain an optimal path in a WSN by considering reliability, energy and traffic load. The proposed algorithm is able to find a path which improves network lifetime, load distribution and path reliability
Task migration in mesh NOCs over virtual point-to-point connections
, Article Proceedings - 19th International Euromicro Conference on Parallel, Distributed, and Network-Based Processing, PDP 2011 ; 2011 , p. 463-469 ; ISBN: 9780769543284 ; Sarbazi-Azad, H ; Sharif University of Technology
Abstract
Processor allocation in todays many core MPSoCs is a challenging task, especially since the order and requirements of incoming applications are unknown during design stage. To improve network performance, balance the workload across processing cores, or mitigate the effect of hot processing elements in thermal management methodologies, task migration is a method which has attracted much attention in recent years. Runtime task migration was first proposed in multicomputer with load balancing as the major objective. However, specific NoC properties such as limited amount of communication buffers, more sensitivity to implementation complexity, and tight latency and power consumption constraints...
Maximum WSN coverage in environments of heterogeneous path loss
, Article International Journal of Sensor Networks ; Volume 16, Issue 3 , 1 January , 2014 , Pages 185-198 ; ISSN: 17481279 ; Salehe, M ; MacGregor, M. H ; Sharif University of Technology
Abstract
We study wireless sensor network (WSN) node placement in an environment where RF signal losses vary with position. This reflects real-world outdoor environments where vegetation and topography cause nonuniform path loss. Many techniques that solve for a variety of objective functions subject to various constraints have previously been proposed for node placement. However, many of these methods make simplifying assumptions such as all nodes having the same transmission range. Our goal is to take the insights and approaches of this previouswork and extend it to real-world environments. The present work assumes we have a map that quantifies the path loss behaviour of the real environment. Based...
Mathematical analysis of optimal tracking interval management for power efficient target tracking wireless sensor networks
, Article Iranian Journal of Electrical and Electronic Engineering ; Volume 8, Issue 3 , 2012 , Pages 195-205 ; 17352827 (ISSN) ; Abolhassani, B ; Abdizadeh, M ; Sharif University of Technology
2012
Abstract
We study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects; however, they do not ensure an optimal performance for moving objects with acceleration. Towards an optimal performance, first, we derive a closed-form mathematical expression for the estimation of the minimal achievable power consumption by an optimal adaptive tracking interval management algorithm. This can be used as...
A joint duty cycle scheduling and energy aware routing approach based on evolutionary game for wireless sensor networks
, Article Iranian Journal of Fuzzy Systems ; Volume 14, Issue 2 , 2017 , Pages 23-44 ; 17350654 (ISSN) ; Movaghar, A ; Meybodi, M. R ; Sharif University of Technology
University of Sistan and Baluchestan
2017
Abstract
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off cand network throughput, the proposed approach prolongs the network lifetime. The paper is divided into the following sections: Initially, the discussion is presented on how the sensor nodes can be scheduled to sleep or wake up in order to reduce energy consumption in idle listening. The sensor...
Semantic data gathering of physical entities in semantic sensor networks using software agents
, Article Information Technology and Control ; Volume 47, Issue 2 , 2018 , Pages 167-183 ; 1392124X (ISSN) ; Movaghar, A ; Rahmani, A. M ; Sharif University of Technology
Kauno Technologijos Universitetas
2018
Abstract
In a wireless sensor network, with numerous sensor nodes, a huge volume of data is produced. For the massive data generated by sensor networks to be understood by the machine, semantic web technologies such as ontology need to be applied. On the other hand, since the end users intend to access the high-level physical entities information monitored by the sensor network, the applicability of sensor networks can be enhanced through proposing a strategy to extract the data based on entities instead of extracting the raw sensor data. Hence, in this paper firstly, ontology will be presented for physical entities semantic modelling (PESM). Secondly, an appropriate strategy will be offered to...
An efficient fitness function for clustering of wireless sensor networks
, Article International Journal of Sensors, Wireless Communications and Control ; Volume 10, Issue 3 , 2020 , Pages 318-324 ; Jafari Lahijani, M. J ; Hosseinpour, M ; Kazemitabar, J ; Sharif University of Technology
Bentham Science Publishers
2020
Abstract
Background & Objective: A sensor network is composed of a large number of sensor nodes that are deployed to perform measurement and/or command and control in a field. Sensor nodes are battery powered devices and replacement or recharging of their batteries may not be feasible. One of the major challenges with sensory wireless networks is excessive energy consumption in nodes. Clustering is one of the methods that has been offered for resolving this issue. In this paper, we pursue evolutionary clustering and propose a new fitness function that har-nesses multiple propagation indices. Methods: In this paper we develop an efficient fitness function by first selecting the best clusters, and then...
Notice of violation of IEEE publication principles: a new automatic clustering algorithm via deadline timer for wireless ad-hoc sensor networks
, Article 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA, 7 April 2008 through 11 April 2008, Damascus ; 2008 ; 9781424417513 (ISBN) ; Movaghar, A ; Barati, A ; Eslami Nejhad, M. R ; Barati, H ; Sharif University of Technology
2008
Abstract
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...
RCCT: Robust clustering with cooperative transmission for energy efficient wireless sensor networks
, Article International Conference on Information Technology: New Generations, ITNG 2008, Las Vegas, NV, 7 April 2008 through 9 April 2008 ; 2008 , Pages 761-766 ; 0769530990 (ISBN); 9780769530994 (ISBN) ; Jahanbakhsh, S. K ; Sanaei, E ; Sharif University of Technology
2008
Abstract
Data gathering is a common but critical operation in many applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks, which can increase scalability and lifetime. These networks require robust wireless communication protocols that are energy efficient and provide low latency. In this paper, we develop and analyze an efficient cooperative transmission protocol with robust clustering (RCCT) for sensor networks that considers a fault-tolerant and energy-efficient distributed clustering with minimum overhead. RCCT distributes...
On secure consensus information fusion over sensor networks
, Article 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, Amman, 13 May 2007 through 16 May 2007 ; 2007 , Pages 108-115 ; 1424410312 (ISBN); 9781424410316 (ISBN) ; Talebi, M. S ; Rabiee, H. R ; Khalaj, B. H ; Sharif University of Technology
2007
Abstract
In this work we have examined the problem of consensus information fusion from a novel point of view, challenging the fundamental assumption of mutual trust among the fusion parties. In quest for a method to make information fusion possible while preserving the mutual confidentiality and anonymity of the fused information even in case of collusion of the malicious nodes, we propose the Blind Information Fusion Framework (BIFF). In BIFF, which is a secure information fusion framework, the nodes are not aware of the actual information they are processing, yet converging to the intended result(s). We formulate BIFF according to the anonymization transform and discuss its robustness against...
Guest editorial introduction to the special issue on large-scale visual sensor networks: Architectures and applications
, Article IEEE Transactions on Circuits and Systems for Video Technology ; Volume 31, Issue 4 , 2021 , Pages 1249-1252 ; 10518215 (ISSN) ; Aghajan, H ; Bebis, G ; Gong, S ; Loutfi, A ; Sigal, L ; Zheng, W. S ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Distributed recovery units for demodulation in wireless sensor networks
, Article First IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2005, Marina del Rey, CA, 30 June 2005 through 1 July 2005 ; Volume 3560 , 2005 , Pages 417-419 ; 03029743 (ISSN) ; Sedghi, V ; Sharif University of Technology
Springer Verlag
2005
Abstract
In this paper, the distributed recovery units for FM and PPM demodulation in wireless sensor networks is proposed and is showed that, the method introduces very little amount of distortion to recovered signal. With simulations, we have examined several different parameters. Besides, two different filtering schemes are simulated. Effect of iteration coefficient (X) on stability and convergence rate is investigated for different sampling and filtering methods. Next, we have studied the noise effect in demodulation with this method. Simulations results are included to verify convergence. © Springer-Verlag Berlin Heidelberg 2005
Performance modeling of the LEACH protocol for mobile wireless sensor networks
, Article Journal of Parallel and Distributed Computing ; Vol. 71, issue. 6 , 2011 , p. 812-821 ; ISSN: 07437315 ; Sarbazi-Azad, H ; Sharif University of Technology
Abstract
In many wireless sensor network applications, nodes are mobile, while many protocols proposed for these networks assume a static network. Thus, it is important to evaluate if a traditional protocol designed for a static network can tolerate different levels of mobility. This paper provides an analytic model to investigate the effect of mobility on a well-known cluster-based protocol, LEACH. The model evaluates data loss after construction of the clusters due to node mobility, which can be used to estimate a proper update interval to balance the energy and data loss ratio. Thus, the results can help the network designer to adjust the topology update interval given a value of acceptable data...
A localization algorithm for large scale mobile wireless sensor networks: A learning approach
, Article Journal of Supercomputing ; Vol. 69, issue. 1 , July , 2014 , p. 98-120 ; Beigy, H ; Sharif University of Technology
Abstract
Localization is a crucial problem in wireless sensor networks and most of the localization algorithms given in the literature are non-adaptive and designed for fixed sensor networks. In this paper, we propose a learning based localization algorithm for mobile wireless sensor networks. By this technique, mobility in the network will be discovered by two crucial methods in the beacons: position and distance checks methods. These two methods help to have accurate localization and constrain communication just when it is necessary. The proposed method localizes the nodes based on connectivity information (hop count), which doesn't need extra hardware and is cost efficient. The experimental...