Loading...
Search for: network-lifetime
0.007 seconds
Total 31 records

    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... 

    Long lifetime real-time routing in unreliable wireless sensor networks

    , Article IFIP Wireless Days ; Volume 1, Issue 1 , 2011 ; 21569711 (ISSN); 9781457720277 (ISBN) Alinaghipour, N ; Yousefi, H ; Yeganeh, M. H ; Movaghar, A ; Sharif University of Technology
    Abstract
    Lifetime is the mos important concern in Wireless Sensor Networks (WSNs) due to limited battery power of sensor nodes. Moreover, a WSN should be capable of timely fulfilling its mission without losing important information in event-critical applications. In this paper, we focus on designing an energy-efficient and energy-aware real-time routing algorithm aiming to explore the long lifetime routing schemes in which delay constraint is satisfied in the presence of lossy communication links. To achieve this goal, our energy-aware forwarding protocol utilizes an optimum distance real-time routing algorithm to minimize energy consumption in unreliable WSNs. Simulation results reveal that the... 

    An effective approach for determining IDS agent nodes in manet

    , Article Proceedings of the 3rd International Conference on Internet Technologies and Applications, ITA 09, 8 September 2009 through 11 September 2009, Wrexham, Wales ; 2009 , Pages 458-465 ; 9780946881659 (ISBN) Kuchaki Rafsanjani, M ; Khavasi, A. A ; Movaghar, A ; Sharif University of Technology
    Abstract
    Mobile Ad hoc NETworks (MANET) due to different characteristics from wired networks are more vulnerable to security attacks. Construction of Intrusion Detection Systems (IDS) for MANETs is complicated by the fact that they are lack of fixed infrastructure and lack of central management for authentication and distribution of cryptographic keys. On the other hand, the network lifetime is an important issue in MANETs because of the energy power of mobile nodes is limited. In this paper is presented a proposed Method that in the first step, authorized nodes are detected by non-interactive zero knowledge technique and in the second step, nodes with the highest battery power from among authorized... 

    Using Clustering for Routing in Sensor Network

    , M.Sc. Thesis Sharif University of Technology Aliyan, Somayeh (Author) ; Beigy, Hamid (Supervisor)
    Abstract
    Wireless sensor networks consist of many small sensor nodes which suffer from some limitations like energy level, band width, processing ability and memory; therefore, decreasing energy consumption, increasing network lifetime and scalability are the main challenges in the area of routing in wireless sensor networks. In the field of routing in sensor networks, many algorithms have been suggested, one group of which is clusterbased hierarchical algorithms. The main goals of such algorithms are reducing energy consumption, distributing consumed energy within whole network and increasing scalability of algorithm. There are some problems in most of cluster-based routing algorithms which cause... 

    Long Lifetime Multipath Routing in Unreliable Wireless Multimedia Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Nikseresht, Ilnaz (Author) ; Movaghar Rahimabadi, Ali (Supervisor) ; Mehri, Bahman (Co-Advisor)
    Abstract
    Most of the current routing protocols in the WMSNs only consider the inter-path interference and not necessarily intra-path interference factor which is considered as one of the main causes of energy consumption in these networks. Among those protocols that consider this factor, none of them has ever come up with an algorithm capable of performing the routing without the need to use either the special hardware in the nodes (referred to as the GPS or directional antennas) or with the unrealistic assumption that the interference range is equal to the transmission range. The previously mentioned factors are critical in the sense that the former assumption results in more expensive sensor nodes... 

    Increasing the Life-time of Wireless Sensor Networks Using Data Prediction

    , M.Sc. Thesis Sharif University of Technology Inanloo, Mahdieh (Author) ; Hemmatyar, Afshin (Supervisor)
    Abstract
    Wireless sensor networks (WSNs) can be used in a variety of applications. The prime shortcoming of these networks is their energy constraint. The main energy consumer in a sensor node is its radio transmitter. Therefore data prediction is one of the most effective methods to reduce the data transmission rate. By data prediction, a large amount of energy is saved; which results in the longevity of the network life. Environmental variations almost have similar effects on different sensor sources in a sensor device. So, considering the correlation between different sources reduces the noise impact and increases data prediction accuracy. In this thesis, we use temporal and multisource... 

    Designing and Implementing a Cluster-based Energy-aware Routing Algorithm for Wireless Sensor Network

    , M.Sc. Thesis Sharif University of Technology Mohseni, Mina (Author) ; Miremadi, Ghasem (Supervisor)
    Abstract
    Wireless Sensor Networks (WSNs) consist of sensor nodes that are connected to each other and are widely used in many applications to acquire and process information. WSN nodes are battery powered, therefore energy management is a key factor for long live network. Node radio transceiver unit uses the most part of energy resource of the node and as a result limits the network lifetime. One way to prolong lifetime of network is to utilize routing protocols to manage energy consumption. To have an energy efficient protocol, we can apply cluster organization on the network, where sensor nodes are partitioned into groups called cluster. Then, the whole cluster data is sent through Cluster Head... 

    Mutual_effect Evaluation of Energy Consumption and Realtimeness in Wireless Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Hajisheykhi, Reza (Author) ; Jahangir, Amir Hossein (Supervisor)
    Abstract
    Nowadays Wireless Sensor Networks (WSNs) are found in a variety of applications such as environmental monitoring, military surveillance and medical systems. These applications interface with the real world environments and the delivery of data is subject to certain timing constraints. Most of the protocols being used in the WSNs do not satisfy real-time requirements and only deliver data in a best-effort fashion. However, real-time support in the WSNs remains an open research topic. This dissertation first studies real-time application and then real-time approaches in WSNs. Real-time applications are applications that require bounded service time. Normally in WSNs, communication delays are... 

    Distance-based segmentation: An energy-efficient clustering hierarchy for wireless microsensor networks

    , Article CNSR 2007: 5th Annual Conference on Communication Networks and Services Research, Fredericton, NB, 14 May 2007 through 17 May 2007 ; 2007 , Pages 18-25 ; 076952835X (ISBN); 9780769528359 (ISBN) Amini, N ; Fazeli, M ; Miremadi, S. G ; Manzuri, M. T ; Sharif University of Technology
    2007
    Abstract
    This paper presents an energy-efficient communication protocol which distributes a uniform energy load to the sensors in a wireless microsensor network. This protocol, called Distance-Based Segmentation (DBS), is a clusterbased protocol that divides the entire network into equalarea segments and applies different clustering policies to each segment to reduce total energy dissipation and hence prolong the lifetime of the network. To evaluate the DBS protocol, a simulator was implemented using the MATLAB software. Simulation results show that the DBS can achieve as much as 16% reduction in total dissipated energy as compared with conventional protocols. In addition this protocol is able to... 

    Swarm intelligent compressive routing in wireless sensor networks

    , Article Computational Intelligence ; Volume 31, Issue 3 , 2015 , Pages 513-531 ; 08247935 (ISSN) Mehrjoo, S ; Sarrafzadeh, A ; Mehrjoo, M ; Sharif University of Technology
    Blackwell Publishing Inc  2015
    Abstract
    This article proposes a novel algorithm to improve the lifetime of a wireless sensor network. This algorithm employs swarm intelligence algorithms in conjunction with compressive sensing theory to build up the routing trees and to decrease the communication rate. The main contribution of this article is to extend swarm intelligence algorithms to build a routing tree in such a way that it can be utilized to maximize efficiency, thereby rectifying the delay problem of compressive sensing theory and improving the network lifetime. In addition, our approach offers accurate data recovery from small amounts of compressed data. Simulation results show that our approach can effectively extend the... 

    An efficient method for identifying IDS agent nodes by discovering compromised nodes in MANET

    , Article 2009 International Conference on Computer and Electrical Engineering, ICCEE 2009, 28 December 2009 through 30 December 2009, Dubai ; Volume 1 , 2009 , Pages 625-629 ; 9780769539256 (ISBN) Kuchaki Rafsanjani, M ; Khavasi, A. A ; Movaghar, A ; Sharif University of Technology
    Abstract
    Intrusion Detection Systems (IDS) for Mobile Ad hoc NETworks (MANETs) are necessary when they are deployed in reality. In This paper, we have presented a combined method of selecting IDS agent nodes in mobile ad hoc networks. Since, the IDS agents in MANET due to more activities need to more battery power. In our method, first, compromised nodes are detected and then the nodes with the highest energy power from among valid nodes as IDS agent nodes are considered. So, with this method, some valid nodes contribute in intrusion detection activities and costs of the network monitoring will be reduced and the network lifetime will be increased. © 2009 IEEE  

    Distributed Cross-layer Optimization in Wireless Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Mirghasemi, Hamed (Author) ; Pakravan, Mohammad Reza (Supervisor)
    Abstract
    In this thesis, our aim was to assess the resource allocation problem in wireless sensor netowroks and to optimize network utility and lifetime. To achieve these aims, it is nesseccary to solve resource allocation problem through optimization methods. Since the central methods need a central node to manage resource allocation, they can not be implemented in sensor networks because the nodes neighbors to this central node drain energy very quickly. Also, since central methods require transmission of all information about network topology to this central node, every change in network topology result in transmission of new network topology informations and therefore, overload for frequent... 

    Efficient Data Collection in Wireless Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Samimi, Ghasem (Author) ; Hemmatyar, Ali Mohammad Afshin (Supervisor)
    Abstract
    Wireless Sensor Networks (WSNs) consist of few hundred to thousand sensor nodes that are usually deployedrandomly in a sensing field. The duty of sensor nodes is to sense the environment for data collection and sending these data to a sink node for future processes. Sensor nodes are equipped with a non-rechargeable battery. Hence, network lifetime is an important issue in WSNs. When a static sink node is used in a WSN, sensor nodes that are located in the neighborhood of the sink node willdrain out of energy faster than other sensor nodes which are farther away from the sink node, because traffic load is heavier on sensor nodes which are closer to the sink node. This problem is named “the... 

    A Heuristic Method for Optimization of Node Placement in Wireless Sensor Network

    , M.Sc. Thesis Sharif University of Technology Esfandeh, Sepideh (Author) ; Hemmatyar, Ali Mohammad Afshin (Supervisor)
    Abstract
    As the applications of wireless sensor networks are expanding at an increasing rate, design of these networks so that they conform to the requirements of a specific application is considered to be a major challenge. Regarding to the specific application, network designers consider various suitable parameters to improve and then to enhance the efficiency of the network. Parameters included are such as area coverage, lifetime, reliability and etc which can significantly improve with the precise placement of nodes. Node localization problem in wireless sensor networks aiming at improvement of the performance parameters has been solved by different methods. In this thesis, in order to solve this... 

    Error control schemes in solar energy harvesting wireless sensor networks

    , Article 2012 International Symposium on Communications and Information Technologies, ISCIT 2012 ; 2012 , Pages 979-984 ; 9781467311571 (ISBN) Jalali, F ; Khodadoustan, S ; Ejlali, A ; Sharif University of Technology
    2012
    Abstract
    To scavenge the energy from the environment and extend the network lifetime, some wireless sensor networks (WSNs) have been equipped with energy harvesters recently. However, the variable amount of environmental energy can affect the reliability of energy harvesting wireless sensor networks (EH-WSNs). In addition, data transmission over a wireless media is vulnerable. Hence, utilizing suitable error control schemes are necessary to improve the reliability. Regarding this point, Automatic Repeat Request (ARQ) and Cooperative ARQ (C-ARQ) schemes are applied in this generation of WSNs. Conventional ARQ as well as C-ARQ scheme are considered and examined through simulation. A comparative... 

    Distributed QoS routing algorithm in large scale wireless sensor networks

    , Article IEEE International Symposium on Industrial Electronics ; 2012 , Pages 826-830 ; 9781467301589 (ISBN) Kordafshari, M. S ; Pourkabirian, A ; Meybodi, M. R ; Movaghar, A ; Sharif University of Technology
    IEEE  2012
    Abstract
    This paper presents a novel routing protocol based on the Learning Automata method for large scale Wireless Sensor Networks (WSNs) codenamed DRLR (distributed reinforcement learning routing). In this method, each node is equipped with learning automata so that it can learn the best path to transmit data toward the sink. The approach proved to be efficient, reliable, and scalable. It also prevents routing hole by considering network density and average of energy levels available. The approach also increases network lifetime by balancing energy consumption. We compared our approach to two other methods (MMSPEED and EESPEED) and the simulation results show our algorithm to better meet... 

    A price-based optimal routing algorithm in Wireless Sensor Networks

    , Article 7th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2011, 23 September 2011 through 25 September 2011 ; September , 2011 , Page(s): 1 - 6 ; ISSN : 2161-9646 ; 9781424462520 (ISBN) Emamjomeh, M ; Arisian, B ; Sharif University of Technology
    2011
    Abstract
    Routing methods and algorithms in "Wireless Sensor Networks" attract researchers' attention a lot recently. In order to find the optimal path in WSNs depending on their type and application, various algorithms are proposed. In this paper, an optimal path finding algorithm based on "Game Theory" is discussed and improved. This algorithm finds a path witch is optimizing network lifetime, load distribution, and path reliability simultaneously  

    EACHP: Energy Aware Clustering Hierarchy Protocol for Large Scale Wireless Sensor Networks

    , Article Wireless Personal Communications ; Volume 85, Issue 3 , December , 2015 , Pages 765-789 ; 09296212 (ISSN) Barati, H ; Movaghar, A ; Rahmani, A. M ; Sharif University of Technology
    Springer New York LLC  2015
    Abstract
    Wireless sensor networks (WSNs) comprise a large number of small sensor nodes scattered across limited geographical areas. The nodes in such networks carry sources of limited and mainly unchangeable energy. Therefore, it is necessary that these networks operate under energy efficient protocols and structures. Energy efficient clustering algorithms have been developed to reduce the networks energy consumption and extend its lifetime. This paper presents an innovative cluster-based communication protocol for WSNs. In order to reduce communication overhead, the authors propose an Energy Aware Clustering Hierarchy Protocol that creates a multi-level hierarchical structure to adequately route and... 

    A Game Theory approach for optimal routing: In Wireless Sensor Networks

    , Article 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010, 23 September 2010 through 25 September 2010 ; September , 2010 ; 9781424437092 (ISBN) Arisian, B ; Eshghi, K ; Sharif University of Technology
    2010
    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  

    The addition of data aggregation to non cluster based SPEED routing algorithm while keeping the functionality of available techniques inorder to increase QoS

    , Article ; Volume 2 , April , 2010 , Pages V2696-V2700 ; ICCET 2010 - 2010 International Conference on Computer Engineering and Technology, Proceedings, 16 April 2010 through 18 April 2010 ; 9781424463503 (ISBN) Yousefi Fakhr, F ; Roustaei, R ; Movaghar, A ; Sharif University of Technology
    2010
    Abstract
    Data aggregation is a technique that is used to decrease extra and repetitive data in cluster based routing protocols. As we know SPEED routing algorithm is based on service quality and dose not perform data aggregation. In this article, we try to add an data aggregation technique to the available techniques without interfering with the functions of previous ones. The idea involves virtual configuration of sensors and specification of an individual ID to the created data by the sensors in each region, then data aggregation in relay node is done by this ID, resulting in less energy consumption, lower traffic and repeated data, an increase in network lifetime and better quality of service