Filters








15,185 Hits in 15.5 sec

Spread-based Heuristic for Sensor Selection in Sensor Networks

V. Sadaphal, Bijendra Jain
2006 1st International Conference on Communication Systems Software & Middleware  
In this paper we propose a method for selecting an appropriate subset of sensors with a view to minimize estimation error while tracking a target with sensors spread across in a 2dimensional plane.  ...  In this paper, we have proposed that the sensors be selected based on three measures viz. (a) collinearity, (b) spread, and (c) proximity to the target.  ...  Proximity of sensors to target Having established one heuristic based on collinearity of sensors for selecting a subset of sensors, we now discuss how far the sensors are preferably placed.  ... 
doi:10.1109/comswa.2006.1665213 dblp:conf/comsware/SadaphalJ06 fatcat:afunujiavbdcxe54dnnjb3hhpu

Forecasting the Flu: Designing Social Network Sensors for Epidemics [article]

Huijuan Shao, K.S.M. Tozammel Hossain, Hao Wu, Maleq Khan, Anil Vullikanti, B. Aditya Prakash, Madhav Marathe, Naren Ramakrishnan
2016 arXiv   pre-print
We formally pose the problem of designing social network sensors for flu epidemics and identify two different objectives that could be targeted in such sensor design problems.  ...  Most importantly, we demonstrate the use of surrogates or proxies for policy makers for designing social network sensors that require from nonintrusive knowledge of people to more information on the relationship  ...  We give an efficient heuristic based on the notion of graph dominators which solves one variant of the social sensor selection problems. 3.  ... 
arXiv:1602.06866v3 fatcat:rvvviknlsja27j5prl37yazebi

An Evolutionary Algorithm to a Multi-Objective Deployment and Power Assignment Problem in Wireless Sensor Networks

Andreas Konstantinidis, K. Yang, Qingfu Zhang
2008 IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference  
Wireless Sensor Networks design requires high quality location assignment and energy efficient power assignment for maximizing the network coverage and lifetime.  ...  Additionally, unique problem-specific, parameter-rising, genetic operators and local search heuristics were designed specifically for the DPAP.  ...  In this paper, we have adopted a tournament selection-based operator [6] , which is simple and fast.  ... 
doi:10.1109/glocom.2008.ecp.98 dblp:conf/globecom/KonstantinidisYZ08 fatcat:ebawx32bmfak7och3tiw4ewx3e

Problem-Specific Encoding and Genetic Operation for a Multi-Objective Deployment and Power Assignment Problem in Wireless Sensor Networks

A. Konstantinidis, K. Yang, Q. T. Zhang
2009 2009 IEEE International Conference on Communications  
Wireless Sensor Networks Deployment and Power Assignment Problems (DPAPs) for maximizing the network coverage and lifetime respectively, have received increasing attention recently.  ...  Problem-specific encoding representation and genetic operators are designed for the DPAP and a Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is specialized.  ...  j P i j , transmit power level of sensor j For the benefit of our approach the set is ordered and named "dense-to-spread" representation as follows: the sensor nodes j in Y i are sorted based on their  ... 
doi:10.1109/icc.2009.5199369 dblp:conf/icc/KonstantinidisYZ09 fatcat:pj6ldcdku5hdfkakxr6go5c7cy

Applications and Routing Management of Wireless Sensor Networks

Subhankar Dhar
2005 Americas Conference on Information Systems  
In this paper, we first describe some current and future applications of sensor networks. We present the conceptual framework of distributed routing strategies for wireless sensor networks.  ...  We show that under reasonable assumptions, this routing scheme guarantees ' shortest path property' which is quite desirable for sensor networks.  ...  The purpose of LEACH is to randomly select sensor nodes as cluster-heads, so the high energy dissipation in communicating with the base station is spread to all sensor nodes in the sensor network.  ... 
dblp:conf/amcis/Dhar05 fatcat:kuoquafiezcgpmz4c73sxsbm3u

Secure wireless sensor network using cryptographic technique based hybrid genetic firefly algorithm

Iman Mohammed Burhan, Sura khalil Ibrahim, Zainab Taha Jebur, Musaddak Maher Abdul Zahra, Mohanad Ahmed Salih, Refed Adnan Jaleel
2021 Periodicals of Engineering and Natural Sciences (PEN)  
Wireless sensor networks (WSNs) are formed of self-contained nodes of sensors that are connected to one base station or more.  ...  The identification of effective cryptography for WSNs is a significant problem because of the limited energy of the sensor nodes, compute capability, and storage resources.  ...  In the measuring field, a sensor that is wireless is spread according to protocol [9] [10] .  ... 
doi:10.21533/pen.v10i1.2608 fatcat:jqeliu6v3nhfzkkp6kwmsr7sxq

Multiobjective K-Connected Deployment and Power Assignment in WSNs Using Constraint Handling

Andreas Konstantinidis, Kun Yang, Qingfu Zhang, Fernando Gordejuela-Sanchez
2009 GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference  
The K-connected Deployment and Power Assignment Problem (DPAP) in WSNs aims at deciding both the sensor locations and transmit power levels, for maximizing both the network coverage and lifetime under  ...  Simulation results have shown that the MOEA/D-RH performs better than the popular constrained NSGA-II in several network instances.  ...  The amount of violation is measured based on the percentage of sensors in the network that violate the K-connectivity constraint.  ... 
doi:10.1109/glocom.2009.5425328 dblp:conf/globecom/KonstantinidisYZG09 fatcat:uzwwdxbzvjd4folmxfz5bgpare

A DATA COLLECTION PROTOCOL WITH ENERGY EFFICIENCY AND DELAY AWARE IN WIRELESS SENSOR NETWORKS

Md Masood Huzaif .
2015 International Journal of Research in Engineering and Technology  
The various researches on open vehicle routing (OVR) problems endeavour that it is based on same assumptions and constraints as that of sensor networks.  ...  Therefore, both a centralized heuristic to reduce its computational overhead and a distributed heuristic to make the algorithm scalable for large-scale network operations is defined.  ...  Optimal Node Selection for Target Localization in Wireless Camera Sensor Networks.  ... 
doi:10.15623/ijret.2015.0417024 fatcat:axqcawj6crcj5byq7cv7jvxxte

A Heuristic Methodology for Optimal Deployment of Radar Systems in a Constrained Area of Operation

Babloo Saha, D. Vijay Rao
2020 Defence Science Journal  
In emerging network-centric warfare scenarios, the location of sensors in the sensor-grid plays a dominant role in determining the effectiveness of air defence against enemy air threats.  ...  In this paper, a novel methodology that uses a heuristic technique (genetic algorithms) to compute the optimal or near-optimal deployment locations for a given set of sensors in a constrained area of operation  ...  Iyer 12 , et al. proposed a GA based technique for identifying the optimal locations of acoustic sensors in under water sensor networks.  ... 
doi:10.14429/dsj.70.15066 fatcat:ja2tbhr23fh45k37bwdjt74cnq

A Study of Maximum Lifetime Routing in Sparse Sensor Networks

Ewa Hansen, Mikael Nolin, Mats Björkman
2008 2008 International Conference on Complex, Intelligent and Software Intensive Systems  
In this paper we present an initial study of maximum lifetime routing in sparse sensor networks.  ...  A major issue in wireless sensor networks is to prolong network lifetime by efficient energy management.  ...  These nodes can be considered as either ordinary sensor nodes or cluster head nodes in a cluster-based sensor network, e.g. as in the AROS project [7] .  ... 
doi:10.1109/cisis.2008.53 dblp:conf/cisis/HansenNB08 fatcat:oxdcmt5merhrfathrjsjaqijau

An Exhaustive Survey on Physical Node Capture Attack in WSN

Bhavana Butani, Piyush Kumar Shukla, Sanjay Silakari
2014 International Journal of Computer Applications  
Our survey provides deep insights of existing modeling techniques of node capture attack in wireless sensor network.  ...  So, Security of wireless sensor network is an important issue for maintaining confidentiality and integrity of wireless links.  ...  De et al. proposed in [6] proposed the spreading process of node compromise in large-scale sensor networks.  ... 
doi:10.5120/16577-6265 fatcat:umstipzwtzcfpdwqj4myexq2fe

A piggybacking approach to reduce overhead in sensor network gossiping

Ercan Ucan, Nathanael Thompson, Indranil Gupta
2007 Proceedings of the 2nd international workshop on Middleware for sensor networks - MidSens '07  
We are concerned with emerging systems in stationary sensor networks that are multiple-source with each message targeted at every recipient, such as query and code propagation.  ...  Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead.  ...  INTRODUCTION Gossip based systems are becoming more and more popular in wireless sensor networks.  ... 
doi:10.1145/1376860.1376864 dblp:conf/middleware/UcanTG07 fatcat:o2q4oo2kyjdhrfvwnro3k3us4e

A survey on natural computing techniques

2017 International Journal of Latest Trends in Engineering and Technology  
The algorithm can be used for optimized routing in the wireless sensor network.  ...  The paper describes the moth flame optimization algorithm (MFOA) in detail along with the modified MFOA for routing in the wireless sensor network.  ...  In future this algorithm can be implemented for optimized routing in wireless sensor network.  ... 
doi:10.21172/1.91.38 fatcat:ymphmvydsrc43mairh6oefrccm

A Subproblem-dependent Heuristic in MOEA/D for the Deployment and Power Assignment Problem in Wireless Sensor Networks

Andreas Konstantinidis, Qingfu Zhang, Kun Yang
2009 2009 IEEE Congress on Evolutionary Computation  
In this paper, we propose a Subproblem-dependent Heuristic (SH) for MOEA/D to deal with the Deployment and Power Assignment Problem (DPAP) in Wireless Sensor Networks (WSNs).  ...  The goal of the DPAP is to assign locations and transmit power levels to sensor nodes for maximizing the network coverage and lifetime objectives.  ...  In network topologies with low density, NSGA-II provides a more uniform spread of solutions.  ... 
doi:10.1109/cec.2009.4983286 dblp:conf/cec/KonstantinidisZY09 fatcat:t6na6rt7h5f5bi344hkh2zuqcu

A Heuristic Crossover Enhanced Evolutionary Algorithm for Clustering Wireless Sensor Network [chapter]

Muyiwa Olakanmi Oladimeji, Mikdam Turkey, Sandra Dudley
2016 Lecture Notes in Computer Science  
In this paper, a Heuristic-Crossover Enhanced Evolutionary Algorithm for Cluster Head Selection is proposed.  ...  Our protocol shows improved performance compared with state-of-the-art protocols like LEACH, TCAC and SEECH in terms of improved network lifetime for wireless sensor networks deployments.  ...  The proposed HEECHS protocol is developed for the CH selection task using a heuristic-based GA.  ... 
doi:10.1007/978-3-319-31204-0_17 fatcat:bx5on2gg3rasfelyzbi5euplpe
« Previous Showing results 1 — 15 out of 15,185 results