Loading...
Search for: wireless-sensor-networks
0.008 seconds
Total 248 records

    An efficient data collection approach for wireless sensor networks

    , Article World Academy of Science, Engineering and Technology ; Volume 5, Issue8 , 2011 , Pages 1619-1622 ; 2010376X (ISSN) Alipour, H ; Pour, A. N ; Sharif University of Technology
    Abstract
    One of the most important applications of wireless sensor networks is data collection. This paper proposes as efficient approach for data collection in wireless sensor networks by introducing Member Forward List. This list includes the nodes with highest priority for forwarding the data. When a node fails or dies, this list is used to select the next node with higher priority. The benefit of this node is that it prevents the algorithm from repeating when a node fails or dies. The results show that Member Forward List decreases power consumption and latency in wireless sensor networks  

    Distributed algorithms for power saving optimization in sensor network

    , Article Proceedings of the 8th WSEAS International Conference on Data Networks, Communications, Computers, DNCOCO '09, 7 November 2009 through 9 November 2009 ; 2009 , Pages 109-115 ; 9789604741342 (ISBN) Ghani, S ; Mousavi, M ; Movaghar, A ; Sharif University of Technology
    Abstract
    Sensor networks have a wide range of potential and practical application. A sensor network consists of a large number of tiny, low power and short-living sensors. Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this dissertation, an algorithm proposed which groups sensors in to disjoint subsets. Every subset cans k-cover the whole area. The subsets are scheduled to work successively. Therefore, the network lifetime is prolonged. Furthermore, sensing range is fixed. Also another algorithm, proposed which constructs some non-disjoint subsets, and in each active subset, each sensor... 

    Fast aggregation scheduling in wireless sensor networks

    , Article IEEE Transactions on Wireless Communications ; Volume 14, Issue 6 , 2015 , Pages 3402-3414 ; 15361276 (ISSN) Yousefi, H ; Malekimajd, M ; Ashouri, M ; Movaghar, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    Data aggregation is a key, yet time-consuming functionality introduced to conserve energy in wireless sensor networks (WSNs). In this paper, to minimize time latency, we focus on aggregation scheduling problem and propose an efficient distributed algorithm that generates a collision-free schedule with the least number of time slots. In contrast to others, our approach named FAST mainly contributes to both tree construction, where the former studies employ Connected 2-hop Dominating Sets, and aggregation scheduling that was previously addressed through the Competitor Sets computation. We prove that the latency of FAST under the protocol interference model is upper-bounded by 12R+Δ-2, where R... 

    Key splitting: Making random key distribution schemes resistant against node capture

    , Article Security and Communication Networks ; Volume 8, Issue 3 , 2015 , Pages 431-445 ; 19390114 (ISSN) Ehdaie, M ; Alexiou, N ; Ahmadian Attari, M ; Aref, M. R ; Papadimitratos, P ; Sharif University of Technology
    John Wiley and Sons Inc  2015
    Abstract
    A large number of random key pre-distribution (RKD) schemes have been proposed in the literature to secure wireless sensor network applications, relying on symmetric key cryptography. However, sensor nodes are exposed to physical compromise by adversaries, who target the symmetric keys stored at each node. With the stolen keys in their possession, the adversaries are then able to compromise communication links between benign nodes. Here, the big challenge arises: how to increase resilience of RKD schemes for wireless sensor networks to node capture, while maintaining the flexibility and low-cost features of RKD? We propose the idea of key splitting to address this problem, without the need... 

    A new method for coverage in wireless sensor networks

    , Article 8th IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2009, 12 December 2009 through 14 December 2009, Chengdu ; 2009 , Pages 369-372 ; 9780769539294 (ISBN) Attarzadeh, N ; Barati, A ; Movaghar, A ; Sharif University of Technology
    Abstract
    The manner of organizing the sensors in the wireless sensor network for increasing the capability and optimized using of the sensors is of great importance. Hence considering coverage parameter in every Wireless Sensor Network (WSN) is extremely essential and critical. The matter of overlapping covered area by sensors in 2D space had been considered until now. This paper is suggested a pattern in which no more are the sensors located at the same surface, but using the 3D geometrical figures like cube, pyramid and etc, in which the sensors were spreading about the different surfaces. Locating the sensors on the different surfaces can be useful under conditions where the space is not in same... 

    Compensating for the latency of data acquisition for localization in mobile wireless sensor networks

    , Article ISSNIP 2009 - Proceedings of 2009 5th International Conference on Intelligent Sensors, Sensor Networks and Information Processing, 7 December 2009 through 10 December 2009 ; 2009 , Pages 7-12 ; 9781424435180 (ISBN) Rahimian, M. A ; Ohyama, S ; Sharif University of Technology
    Abstract
    The problem of latency in data acquisition, which is specific to the case of mobile wireless sensor networks, has been introduced and investigated. In this regard, the properties of the so-called Data Acquisition Latency Error, and the way it affects the performance of the respective localization schemes in a mobile network were discussed through both theoretical analysis and simulations. Moreover, a weighted version of lateration scheme was introduced and shown to outperform the traditional one, while tracking a mobile node. This work is to the best of our knowledge the first to have addressed the aforementioned problem in mobile wireless sensor networks, and to have offered a solution for... 

    Wireless Sensor Network in Biosystem

    , M.Sc. Thesis Sharif University of Technology Ahourai, Fereidoun (Author) ; Tabandeh, Mahmoud (Supervisor) ; Jahed, Mehran (Supervisor)
    Abstract
    This research presents an efficient thermal-aware routing protocol based on Shortest Hop Routing algorithms for implanted bi medical sensor network. Implanted biomedical sensor networks provide a major application of sensor networks in the near future. These in-vivo sensor nodes collect desired biometric data and communicate the data wirelessly to a base-station through a multi-hop network. They generate the heat due to wireless communication and circuitry power consumption. A high temperature of the in-vivo nodes for a prolonged period might damage the surrounding tissues. Most of the protocols for sensor networks don’t take the thermal issue as a factor in the routing of packets. In its... 

    Optimization of Coverage in Wireless Sensor Networks in Uneven Environment

    , M.Sc. Thesis Sharif University of Technology Kakvan, Mojtaba (Author) ; Manzuri Shalmani, Mohammad Taghi (Supervisor)
    Abstract
    Wireless sensor networks (WSNs) have recently achieved a great deal of attention due to its numerous attractive applications in many different fields. Sensors and WSNs possesses a number of special characteristics that make them very promising in many applications, but also put on them lots of constraints that make issues in sensor network particularly difficult. These issues may include topology control, routing, coverage, security, and data management. In this thesis, we focus our attention on the coverage problem. Firstly, we study the best current solutions in the literature. We choose one of them as the basis of our work and study it thoroughly as the core model of our coverage model.... 

    Opportunistic Routing in Mobile Wireless Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Mohammadkhan, Ali (Author) ; Movaghar Rahimabadi, Ali (Supervisor)
    Abstract
    Routing is one of the most challenging areas in wireless sensor networks because it has a significant impact on energy usage, transmit delay and network fault tolerance. In many situations, network nodes move around and it cause numerous challenges, namely changes in routing paths, failure in sending packets or maybe there is no end-to-end path. Opportunistic routing is one of the best solutions to these problems in mobile wireless sensor networks, thus it provides more efficient routing and less energy consumption in comparison with traditional routings.
    In opportunistic routing, nodes try to utilize every opportunity to send their packets to sink. When two nodes are encountered, the... 

    Efficient Data Aggregation in Mobile Wireless Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Mohammadmoradi, Hessam Aldin (Author) ; Habibi, Jafar (Supervisor)
    Abstract
    Due to the advances in wireless communications and electronics over the last few years, the development of networks of low-cost, low-power, and multifunctional sensors has received increasing attention. Most important constraints of this network are energy and bandwidth. Data aggregation is one of the effective approaches for reducing energy consumption in wireless sensor networks. Recent research on data collection reveals that, rather than reporting data through long, multi-hop and error-prone routes to a static sink using tree or cluster network structure, allowing and leveraging sink mobility is more promising for energy efficient data gathering. In this work we proposed an effective... 

    A Multi-Weight Based Clustering Algorithm for Mobility Wireless Sensor Network

    , M.Sc. Thesis Sharif University of Technology Sepehriyan, Ali (Author) ; Hemmatyar, Ali Mohammad Afshin (Supervisor)
    Abstract
    Wireless sensor network (WSN) is a wireless network composed of spatially distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions data such as temperature, pressure, humidity, and so on[1-4]. In recently years, WSN has been applied to widely various areas. Since sensors are equipped with small batteries, which are costly if not impossible to recharge or replace, sensor network operations must be energy efficient in order to maximize the network lifetime. Given the power constraints in sensors, investigations into routing protocols in order to extend the... 

    Efficient Multicasting in Cognitive Wireless Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Farzan Heydari, Mohammad (Author) ; 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 Izadian, Roshanak (Author) ; 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 Nekooei, Mohammad (Author) ; 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 Mirbaha, Elaheh (Author) ; 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 Rasifard, Hamed (Author) ; 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 Yousefi, Hamed (Author) ; 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 Arisian, B. (Babak) ; 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 Goodarzi, B ; 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... 

    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) Jamali-Rad, H ; 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...