Loading...
Search for: sensor-networks
0.008 seconds
Total 325 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  

    Fitness function improvement of evolutionary algorithms used in sensor network optimisations

    , Article IET Networks ; Volume 7, Issue 3 , 2018 , Pages 91-94 ; 20474954 (ISSN) Hoseinpour, A ; Jafari Lahijani, M ; Hoseinpour, M ; Kazemitabar, J ; Sharif University of Technology
    Institution of Engineering and Technology  2018
    Abstract
    Recent advances in wireless sensor network (WSN) technology are enabling the deployment of large-scale and collaborative sensor networks. WSNs face several challenges such as security, localisation, and energy consumption. To resolve these issues, evolutionary algorithms can be helpful. The core of every evolutionary algorithm is its fitness function. The drawbacks of fitness functions used in the literature will be investigated and some solutions will be suggested. The simulation results clearly show the improvement due to suggested solutions. © The Institution of Engineering and Technology 2017  

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

    An efficient MAC protocol for sensor network considering energy consumption and information retrieval pattern

    , Article DSD'2005: 8th Euromicro Conference on Digital System Design, Porto, 30 August 2005 through 3 September 2005 ; Volume 2005 , 2005 , Pages 261-266 ; 0769524338 (ISBN); 9780769524337 (ISBN) Ghiassi, Y ; Malekane Rad, M. M ; Mohammad Nikjoo, S ; Mohseni, A. H ; Khalaj, B. H ; Sharif University of Technology
    2005
    Abstract
    A SEnsor Network with Mobile Agents (SENMA) is an architecture proposed for large scale sensor networks in which the access point moves above the network and gathers information from a limited number of nodes. However, the performance of such system is limited by estimation errors and packet errors due to collision. In this paper, we first derive the equations of distortion in a general scenario and use this model to obtain four best node positions in order to achieve min-max estimation error in a square. In addition, an opportunistic MAC is proposed that considers both collision effects and estimation error based on Channel State Information (CSI). As the simulation results show the... 

    Weighted coupling for geographical networks: Application to reducing consensus time in sensor networks

    , Article Physics Letters, Section A: General, Atomic and Solid State Physics ; Volume 374, Issue 38 , 2010 , Pages 3920-3925 ; 03759601 (ISSN) Jalili, M ; Mazloomian, A ; Sharif University of Technology
    2010
    Abstract
    Although many complex real-world networks are weighted, unweighted networks are used in many applications such as sensor networks. In this Letter it is shown using properly weighted networks the performance can be greatly enhanced by reducing the time necessary for the average consensus. Random geographical models are adapted as network models and a method based on mutually coupled phase oscillators is used for providing average consensus over the network. The consensus time is calculated by numerically solving the network's differential equations and monitoring the average error. The simulation results on some sample networks show that the consensus time is dramatically reduced when the... 

    Near-optimal velocity control for mobile charging in wireless rechargeable sensor networks

    , Article IEEE Transactions on Mobile Computing ; Volume 15, Issue 7 , 2016 , Pages 1699-1713 ; 15361233 (ISSN) Shu, Y ; Yousefi, H ; Cheng, P ; Chen, J ; Gu, Y. J ; He, T ; Shin, K. G ; Sharif University of Technology
    Institute of electrical and electronics engineers Inc  2016
    Abstract
    Limited energy in each node is the major design constraint in wireless sensor networks (WSNs). To overcome this limit, wireless rechargeable sensor networks (WRSNs) have been proposed and studied extensively over the last few years. In a typical WRSN, batteries in sensor nodes can be replenished by a mobile charger that periodically travels along a certain trajectory in the sensing area. To maximize the charged energy in sensor nodes, one fundamental question is how to control the traveling velocity of the charger. In this paper, we first identify the optimal velocity control as a key design objective of mobile wireless charging in WRSNs. We then formulate the optimal charger velocity... 

    Token-based function computation with memory

    , Article IEEE Transactions on Parallel and Distributed Systems ; Volume 27, Issue 6 , 2016 , Pages 1811-1823 ; 10459219 (ISSN) Salehkaleybar, S ; Golestani, S. J ; Sharif University of Technology
    IEEE Computer Society  2016
    Abstract
    In distributed function computation, each node has an initial value and the goal is to compute a function of these values in a distributed manner. In this paper, we propose a novel token-based approach to compute a wide class of target functions to which we refer as "token-based function computation with memory" (TCM) algorithm. In this approach, node values are attached to tokens and travel across the network. Each pair of travelling tokens would coalesce when they meet, forming a token with a new value as a function of the original token values. In contrast to the coalescing random walk (CRW) algorithm, where token movement is governed by random walk, meeting of tokens in our scheme is... 

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

    Finding the sensors location and the number of sensors in sensor networks with a genetic algorithm

    , Article Proceedings of the 2008 16th International Conference on Networks, ICON 2008, 12 December 2008 through 14 December 2008, New Delhi ; 2008 ; 9781424438051 (ISBN) Robatmili, M ; Mohammadi, M ; Movaghar, A ; Dehghan, M ; Sharif University of Technology
    2008
    Abstract
    Sensor networks have recently emerged as a premier research topic. Sensor networks pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. While designing the sensor networks according to performed computation, the limited number of sensors to cover an area will be considered, so the proper placing of this limited number of sensors will cause costs to reduce regarding to coverage and development of the network in the next stage. In this paper we will present a genetic algorithm to solve the designing issue of the sensor network. The most important... 

    Reduction of sensor population in a camera sensor network

    , Article 2008 International Symposium on Telecommunications, IST 2008, Tehran, 27 August 2008 through 28 August 2008 ; 2008 , Pages 349-353 ; 9781424427512 (ISBN) Sanjabi, M ; Samavi, S ; Ashori, M ; Karimi, N ; Fotohi, M ; Kasiri, K ; Sharif University of Technology
    2008
    Abstract
    The problem of surveillance for intrusion detection in a camera sensor network is addressed in this paper. In order to save limited resources, a sensing task should involve just the right number of sensors. For a wide enough coverage area random and uniform distribution can be applied. We propose a novel method which allows reduction of number of sensors and guarantees a desired surveillance against aerial intrusion. Enhancement of the method is also offered to further reduce the number of sensors and improve the performance. ©2008 IEEE  

    Secure consensus averaging for secure information fusion in sensor networks

    , Article 2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Sharjah, 12 February 2007 through 15 February 2007 ; 2007 ; 1424407796 (ISBN); 9781424407798 (ISBN) Kefayati, M ; Talebi, M. S ; Rabiee, H. R ; Khalaj, B. H ; Sharif University of Technology
    2007
    Abstract
    In this work, we have examined the problem of distributed consensus averaging over senor networks from a novel point of view considering the need for security. We have proposed a method for incorporating privacy into the scalable average consensus mechanisms. Our proposed method, Random Projections Method (RPM), is lightweight and transparent since it is not based on cryptography and does not require any change in the fusion system. RPM is based on introducing a simple, yet effective pre-fusion algorithm. We mathematically derived the correctness of RPM and analyzed its effect on convergence of the system through simulation. Robustness of RPM against honest-but-curious adversaries is... 

    A flexible approach to interference cancellation in distributed sensor networks

    , Article IEEE Communications Letters ; Volume 25, Issue 6 , 2021 , Pages 1853-1856 ; 10897798 (ISSN) Shamsi, M ; Haghighi, A. M ; Bagheri, N ; Marvasti, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2021
    Abstract
    In a distributed algorithm several processing nodes communicate with each other and incorporate in order to reach a common goal. Each unit has its own locally-observed environment while it can either help or mislead other units when sharing its information. This could be either intentional or simply due to the observation noise. Previous works mainly focus on locating the agents properly and assigning weights based on stationary environment in order to minimize the impact of noisy nodes. We, however, propose a method capable of assigning combination weights in accordance with momentary performance of the neighboring nodes. In order to demonstrate this capability, the proposed algorithm has... 

    Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks

    , Article Journal of Systems and Software ; Vol. 83, issue. 8 , 2010 , p. 1310-1317 ; ISSN: 1641212 Nayebi, A ; Sarbazi-Azad, H ; Karlsson, G ; Sharif University of Technology
    Abstract
    This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay-tolerant wireless sensor networks (DTWSN). These networks inherit their characteristics from both delay tolerant networks (DTN) and traditional wireless sensor networks. After introducing DTWSNs, three main problems in the design space of these networks are discussed: routing, data gathering, and neighbor discovery. A general protocol is proposed for DTWSNs based on opportunistic broadcasting in delay-tolerant networks with radio device on-off periods. Three performance measures are defined in the study: the energy for sending queries to ask for data from... 

    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  

    Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks

    , Article Journal of Systems and Software ; Volume 83, Issue 8 , 2010 , Pages 1310-1317 ; 01641212 (ISSN) Nayebi, A ; Sarbazi Azad, H ; Karlsson, G ; Sharif University of Technology
    2010
    Abstract
    This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay-tolerant wireless sensor networks (DTWSN). These networks inherit their characteristics from both delay tolerant networks (DTN) and traditional wireless sensor networks. After introducing DTWSNs, three main problems in the design space of these networks are discussed: routing, data gathering, and neighbor discovery. A general protocol is proposed for DTWSNs based on opportunistic broadcasting in delay-tolerant networks with radio device on-off periods. Three performance measures are defined in the study: the energy for sending queries to ask for data from... 

    Cellular underwater wireless optical CDMA network: potentials and challenges

    , Article IEEE Access ; Volume 4 , 2016 , Pages 4254-4268 ; 21693536 (ISSN) Akhoundi, F ; Jamali, M. V ; Bani Hassan, N ; Beyranvand, H ; Minoofar, A ; Salehi, J. A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    Underwater wireless optical communications are an emerging solution to the expanding demand for broadband links in oceans and seas. In this paper, a cellular underwater wireless optical code division multiple-access network is proposed to provide broadband links for commercial and military applications. The optical orthogonal codes are employed as signature codes of underwater mobile users. Fundamental key aspects of the network, such as its backhaul architecture, its potential applications, and its design challenges, are presented. In particular, a promising underwater localization and positioning scheme based on this cellular network is presented. Furthermore, the proposed network is used... 

    A thermal-aware shortest hop routing algorithm for in vivo biomedical sensor networks

    , Article ITNG 2009 - 6th International Conference on Information Technology: New Generations, 27 April 2009 through 29 April 2009, Las Vegas, NV ; 2009 , Pages 1612-1613 ; 9780769535968 (ISBN) Tabandeh, M ; Jahed, M ; Ahourai, F ; Moradi, S ; Sharif University of Technology
    Abstract
    Implanted biomedical sensor networks provide a major application of sensor networks in the near future. Their high temperature due to wireless communication, might damage the surrounding tissues. This paper presents an efficient thermal-aware routing. Our proposed protocol states that when some nodes in the shortest path have a high temperature, ignores this path. The simulation results indicate the superiority of the proposed method compared to other thermal-aware routing protocols in terms of reducing temperature without a significant increase in packet delivery delay and power consumption of nodes. © 2009 IEEE  

    A survey on underwater wireless sensor networks routing algorithms

    , Article 2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation, KBEI 2017 ; Volume 2018-January , 2018 , Pages 0373-0378 ; 9781538626405 (ISBN) Fazeli, M ; Nasehi Basharzad, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    Considering their special features and numerous applications, sensor networks are noticed so much nowadays. A sub-group of these applications is underwater sensor networks, which encounter some challenges like reliable transportation, routing, MAC, positioning, limited bandwidth, high and variable propagation delay, defective underwater channels and low battery capacity. Acoustic technologies are a particular technology which can make strong underwater communications for Civilian and military applications. These networks are used in oceans for environmental monitoring, under sea discovery, unexpected events prevention, ships assisting, tactical monitoring and naval mine detection, but there... 

    Geographic routing with energy constraint in wireless multimedia sensor networks

    , Article 27th Iranian Conference on Electrical Engineering, ICEE 2019, 30 April 2019 through 2 May 2019 ; 2019 , Pages 2028-2032 ; 9781728115085 (ISBN)https://ieeexplore.ieee.org/document/8786606 Zeynali Gargary, D ; Osali, F ; Afshin Hemmatyar, A. M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    Energy distribution to get more lifetime and noninterfering multipath are two major challenges in Wireless Multimedia Sensor Networks (WMSNs) routing. The Greedy Perimeter Stateless Routing (GPSR) is a simple routing protocol which uses minimum geographic distance to forward packets toward sink node. However it does not consider energy level and uses single path. Geographic energy-aware non-interfering multipath Routing (GEAM) overcomes this problem by multipath routing and energy consideration, but keeping state of the multiple non-interfering areas has an overhead. In our proposed routing protocol which is called Energy Aware Greedy Stateless Geographic Routing (EAGSGR) we will introduce...