相关论文
2007 - Computer
iMouse: An Integrated Mobile Surveillance and Wireless Sensor System

Incorporating the environment-sensing capability of wireless sensor networks into video- based surveillance systems can provide advanced services at a lower cost than traditional surveillance systems.The integrated mobile surveillance and wireless sensor system (iMouse) uses static and mobile wireless sensors to detect and then analyze unusual events in the environment.

2015 - IEEE Transactions on Industrial Informatics
Improving Reliability of Particle Filter-Based Localization in Wireless Sensor Networks via Hybrid Particle/FIR Filtering

The need for accurate, fast, and reliable indoor localization using wireless sensor networks (WSNs) has recently grown in diverse areas of industry. Accurate localization in cluttered and noisy environments is commonly provided by means of a mathematical algorithm referred to as a state estimator or filter. The particle filter (PF), which is the most commonly used filter in localization, suffers from the sample impoverishment problem under typical conditions of real-time localization based on WSNs. This paper proposes a novel hybrid particle/finite impulse response (FIR) filtering algorithm for improving reliability of PF-based localization schemes under harsh conditions causing sample impoverishment. The hybrid particle/FIR filter detects the PF failures and recovers the failed PF by resetting the PF using the output of an auxiliary FIR filter. Combining the regularized particle filter (RPF) and the extended unbiased FIR (EFIR) filter, the hybrid RP/EFIR filter is constructed in this paper. Through simulations, the hybrid RP/EFIR filter demonstrates its improved reliability and ability to recover the RPF from failures.

2012 - IEEE Transactions on Computers
Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks

Sensing coverage is an essential functionality of wireless sensor networks (WSNs). However, it is also well known that coverage alone in WSNs is not sufficient, and hence network connectivity should also be considered for the correct operation of WSNs. In this paper, we address the problem of k-coverage in WSNs such that in each scheduling round, every location in a monitored field (or simply field) is covered by at least k active sensors while all active sensors are being connected. Precisely, we study sensors duty-cycling strategies for generating k-coverage configurations in WSNs. First, we model the k-coverage problem in WSNs. Second, we derive a sufficient condition of the sensor spatial density for complete k-coverage of a field. We also provide a relationship between the communication and sensing ranges of sensors to maintain both k-coverage of a field and connectivity among all active sensors. Third, we propose four configuration protocols to solve the problem of k-coverage in WSNs. We prove that our protocols select a minimum number of sensors to achieve full k-coverage of a field while guaranteeing connectivity between them. Then, we relax some widely used assumptions for coverage configuration in WSNs, to promote the use of our proposed protocols in real-world sensing applications. Our simulation results show that our protocols outperform an existing distributed k-coverage configuration protocol.

2009 - IEEE INFOCOM 2009
Barrier Coverage of Line-Based Deployed Wireless Sensor Networks

Barrier coverage of wireless sensor networks has been studied intensively in recent years under the assumption that sensors are deployed uniformly at random in a large area (Poisson point process model). However, when sensors are deployed along a line (e.g., sensors are dropped from an aircraft along a given path), they would be distributed along the line with random off- sets due to wind and other environmental factors. It is important to study the barrier coverage of such line- based deployment strategy as it represents a more realistic sensor placement model than the Poisson point process model. This paper presents the first set of results in this direction. In particular, we establish a tight lower-bound for the existence of barrier coverage under line-based deployments. Our results show that the barrier coverage of the line-based deployments significantly outperforms that of the Poisson model when the random offsets are relatively small compared to the sensor's sensing range. We then study sensor deployments along multiple lines and show how barrier coverage is affected by the distance between adjacent lines and the random offsets of sensors. These results demonstrate that sensor deployment strategies have direct impact on the barrier coverage of wireless sensor networks. Different deployment strategies may result in significantly different barrier coverage. Therefore, in the planning and deployment of wireless sensor networks, the coverage goal and possible sensor deployment strategies must be carefully and jointly considered. The results obtained in this paper will provide important guidelines to the deployment and performance of wireless sensor networks for barrier coverage.

2011 - IEEE Transactions on Parallel and Distributed Systems
A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks

Data aggregation is a key functionality in wireless sensor networks (WSNs). This paper focuses on data aggregation scheduling problem to minimize the delay (or latency). We propose an efficient distributed algorithm that produces a collision-free schedule for data aggregation in WSNs. We theoretically prove that the delay of the aggregation schedule generated by our algorithm is at most 16R + Δ - 14 time slots. Here, R is the network radius and Δ is the maximum node degree in the communication graph of the original network. Our algorithm significantly improves the previously known best data aggregation algorithm with an upper bound of delay of 24D + 6Δ + 16 time slots, where D is the network diameter (note that D can be as large as 2R). We conduct extensive simulations to study the practical performances of our proposed data aggregation algorithm. Our simulation results corroborate our theoretical results and show that our algorithms perform better in practice. We prove that the overall lower bound of delay for data aggregation under any interference model is max{log n,R}, where n is the network size. We provide an example to show that the lower bound is (approximately) tight under the protocol interference model when rI = r, where rI is the interference range and r is the transmission range. We also derive the lower bound of delay under the protocol interference model when r <; rI <; 3r and rI ≥ 3r.

2010
A Survey of Energy-Efficient Hierarchical Cluster-Based Routing in Wireless Sensor

----------------------------------------------------------------------ABSTRACT--------------------------------------------------------------Recent technological advances in communications and computation have enabled the development of low-cost, low-power, small in size, and multifunctional sensor nodes in a wireless sensor network. Since the radio transmission and reception consumes a lot of energy, one of the important issues in wireless sensor network is the inherent limited battery power within network sensor nodes. Therefore, battery power is crucial parameter in the algorithm design to increase lifespan of nodes in the network. In addition to maximizing the lifespan of sensor nodes, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to maximize overall network performance. Much research has been done in recent years, investigating different aspects like, low power protocols, network establishments, routing protocol, and coverage problems of wireless sensor networks. There are various routing protocols like location-aided, multi-path, datacentric, mobility-based, QoS based, heterogeneity-based, hierarchical routing, hybrid routing, etc., in which optimal routing can be achieved in the context of energy. In this paper, the focus is mainly driven over the survey of the energy-efficient hierarchical cluster-based available routings for Wireless Sensor Network.

2005 - TOSN
Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols

A typical wireless sensor node has little protection against radio jamming. The situation becomes worse if energy-efficient jamming can be achieved by exploiting knowledge of the data link layer. Encrypting the packets may help prevent the jammer from taking actions based on the content of the packets, but the temporal arrangement of the packets induced by the nature of the protocol might unravel patterns that the jammer can take advantage of even when the packets are encrypted. By looking at the packet interarrival times in three representative MAC protocols, S-MAC, LMAC and B-MAC, we derive several jamming attacks that allow the jammer to jam S-MAC, LMAC and B-MAC energy-efficiently. The jamming attacks are based on realistic assumptions. The algorithms are described in detail and simulated. The effectiveness and efficiency of the attacks are examined. Careful analysis of other protocols belonging to the respective categories of S-MAC, LMAC and B-MAC reveal that those protocols are, to some extent, also susceptible to our attacks. The result of this investigation provides new insights into the security considerations of MAC protocols.

2006 - Underwater Networks
Deployment analysis in underwater acoustic wireless sensor networks

In this paper, different deployment strategies for two-dimensional and three-dimensional communication architectures for UnderWater Acoustic Sensor Networks (UW-ASNs) are proposed, and statistical deployment analysis for both architectures is provided. The objectives of this paper are to determine the minimum number of sensors needed to be deployed to achieve the optimal sensing and communication coverage, which are dictated by the application; provide guidelines on how to choose the optimal deployment surface area, given a target region; study the robustness of the sensor network to node failures, and provide an estimate of the number of redundant sensors to be deployed to compensate for possible failures.

2005 - 19th IEEE International Parallel and Distributed Processing Symposium
PMAC: an adaptive energy-efficient MAC protocol for wireless sensor networks

We propose a novel adaptive MAC protocol for wireless sensor networks. In existing protocols such as SMAC, the sensor nodes are put to sleep periodically to save energy. As the duty cycle is fixed in such protocols, the network throughput can degrade under heavy traffic, while under light loads, unwanted energy consumption can occur. In the proposed pattern-MAC (PMAC) protocol, instead of having fixed sleep-wakeups, the sleep-wakeup schedules of the sensor nodes are adaptively determined. The schedules are decided based on a node's own traffic and that of its neighbors. Our analytical and experimental results show that in comparison to SMAC, PMAC achieves more power savings under light loads, and higher throughput under heavier traffic loads. Furthermore, unlike SMAC, only the sensor nodes involved in communication wake up frequently in PMAC and hence energy is conserved in other sensor nodes.

2006 - IEEE Communications Magazine
Mobility-based communication in wireless sensor networks

Wireless sensor networks are proposed to deliver in situ observations at low cost over long periods of time. Among numerous challenges faced while designing WSNs and protocols, maintaining connectivity and maximizing the network lifetime stand out as critical considerations. Mobile platforms equipped with communication devices can be leveraged to overcome these two problems. In this article existing proposals that use mobility in WSNs are summarized. Furthermore, a new approach to compute mobile platform trajectories is introduced. These solutions are also compared considering various metrics and design goals.

2017 - IEEE Wireless Communications Letters
Energy-Efficient Data Collection in UAV Enabled Wireless Sensor Network

In wireless sensor networks, utilizing the unmanned aerial vehicle (UAV) as a mobile data collector for the sensor nodes (SNs) is an energy-efficient technique to prolong the network lifetime. In this letter, considering a general fading channel model for the SN-UAV links, we jointly optimize the SNs’ wake-up schedule and UAV’s trajectory to minimize the maximum energy consumption of all SNs, while ensuring that the required amount of data is collected reliably from each SN. We formulate our design as a mixed-integer non-convex optimization problem. By applying the successive convex optimization technique, an efficient iterative algorithm is proposed to find a sub-optimal solution. Numerical results show that the proposed scheme achieves significant network energy saving as compared to benchmark schemes.

2014 - IEEE Transactions on Industrial Informatics
An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks

As an important part of industrial application (IA), the wireless sensor network (WSN) has been an active research area over the past few years. Due to the limited energy and communication ability of sensor nodes, it seems especially important to design a routing protocol for WSNs so that sensing data can be transmitted to the receiver effectively. An energy-balanced routing method based on forward-aware factor (FAF-EBRM) is proposed in this paper. In FAF-EBRM, the next-hop node is selected according to the awareness of link weight and forward energy density. Furthermore, a spontaneous reconstruction mechanism for local topology is designed additionally. In the experiments, FAF-EBRM is compared with LEACH and EEUC, experimental results show that FAF-EBRM outperforms LEACH and EEUC, which balances the energy consumption, prolongs the function lifetime and guarantees high QoS of WSN.

2001 - Center for Embedded Network Sensing
Scalable Coordination for Wireless Sensor Networks: Self-Configuring Localization Systems

Pervasive networks of micro-sensors and actuators offer to revolutionize the ways in which we understand and construct complex physical systems. Sensor networks must be scalable, long-lived and robust systems, overcoming energy limitations and a lack of pre-installed infrastructure. We explore three themes in the design of self-configuring sensor networks: tuning density to trade operational quality against lifetime; using multiple sensor modalities to obtain robust measurements; and exploiting fixed environmental characteristics. We illustrate these themes through the problem of localization, which is a key building block for sensor systems that itself requires coordination.

2009 - 2009 1st International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology
Wireless sensor networks powered by ambient energy harvesting (WSN-HEAP) - Survey and challenges

Wireless sensor networks (WSNs) research has pre-dominantly assumed the use of a portable and limited energy source, viz. batteries, to power sensors. Without energy, a sensor is essentially useless and cannot contribute to the utility of the network as a whole. Consequently, substantial research efforts have been spent on designing energy-efficient networking protocols to maximize the lifetime of WSNs. However, there are emerging WSN applications where sensors are required to operate for much longer durations (like years or even decades) after they are deployed. Examples include in-situ environmental/habitat monitoring and structural health monitoring of critical infrastructures and buildings, where batteries are hard (or impossible) to replace/recharge. Lately, an alternative to powering WSNs is being actively studied, which is to convert the ambient energy from the environment into electricity to power the sensor nodes. While renewable energy technology is not new (e.g., solar and wind) the systems in use are far too large for WSNs. Those small enough for use in wireless sensors are most likely able to provide only enough energy to power sensors sporadically and not continuously. Sensor nodes need to exploit the sporadic availability of energy to quickly sense and transmit the data. This paper surveys related research and discusses the challenges of designing networking protocols for such WSNs powered by ambient energy harvesting.

2005 - Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005.
Real-time forest fire detection with wireless sensor networks

In this paper, we propose a wireless sensor network paradigm for real-time forest fire detection. The wireless sensor network can detect and forecast forest fire more promptly than the traditional satellite-based detection approach. This paper mainly describes the data collecting and processing in wireless sensor networks for real-time forest fire detection. A neural network method is applied to in-network data processing. We evaluate the performance of our approach by simulations.

2012 - J. Netw. Comput. Appl.
A survey on coverage and connectivity issues in wireless sensor networks

A wireless sensor network (WSN) is composed of a group of small power-constrained nodes with functions of sensing and communication, which can be scattered over a vast region for the purpose of detecting or monitoring some special events. The first challenge encountered in WSNs is how to cover a monitoring region perfectly. Coverage and connectivity are two of the most fundamental issues in WSNs, which have a great impact on the performance of WSNs. Optimized deployment strategy, sleep scheduling mechanism, and coverage radius cannot only reduce cost, but also extend the network lifetime. In this paper, we classify the coverage problem from different angles, describe the evaluation metrics of coverage control algorithms, analyze the relationship between coverage and connectivity, compare typical simulation tools, and discuss research challenges and existing problems in this area.

2005 - IEEE Transactions on Vehicular Technology
Localization with mobile anchor points in wireless sensor networks

Localization is one of the substantial issues in wireless sensor networks. Several approaches, including range-based and range-free, have been proposed to calculate positions for 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 coarse positioning accuracy with the less expense. This paper describes a range-free localization scheme using mobile anchor points. Each anchor point equipped with the GPS moves in the sensing field and broadcasts its current position periodically. The sensor nodes obtaining the information are able to compute their locations. With the scheme, no extra hardware or data communication is needed for the sensor nodes. Moreover, obstacles in the sensing fields can be tolerated. The localization mechanism has been implemented in the network simulator ns-2. The simulation results show that our scheme performed better than other range-free mechanisms.

2013 - IEEE Communications Surveys & Tutorials
The Evolution of MAC Protocols in Wireless Sensor Networks: A Survey

Wireless Sensor Networks (WSNs) have become a leading solution in many important applications such as intrusion detection, target tracking, industrial automation, smart building and so on. Typically, a WSN consists of a large number of small, low-cost sensor nodes that are distributed in the target area for collecting data of interest. For a WSN to provide high throughput in an energy-efficient way, designing an efficient Medium Access Control (MAC) protocol is of paramount importance because the MAC layer coordinates nodes' access to the shared wireless medium. To show the evolution of WSN MAC protocols, this article surveys the latest progresses in WSN MAC protocol designs over the period 2002-2011. In the early development stages, designers were mostly concerned with energy efficiency because sensor nodes are usually limited in power supply. Recently, new protocols are being developed to provide multi-task support and efficient delivery of bursty traffic. Therefore, research attention has turned back to throughput and delay. This article details the evolution of WSN MAC protocols in four categories: asynchronous, synchronous, frame-slotted, and multichannel. These designs are evaluated in terms of energy efficiency, data delivery performance, and overhead needed to maintain a protocol's mechanisms. With extensive analysis of the protocols many future directions are stated at the end of this survey. The performance of different classes of protocols could be substantially improved in future designs by taking into consideration the recent advances in technologies and application demands.

2003 - Comput. Commun. Rev.
Wireless sensor networks: a new regime for time synchronization

Wireless sensor networks (WSNs) consist of large populations of wirelessly connected nodes, capable of computation, communication, and sensing. Sensor nodes cooperate in order to merge individual sensor readings into a high-level sensing result, such as integrating a time series of position measurements into a velocity estimate. The physical time of sensor readings is a key element in this process called data fusion. Hence, time synchronization is a crucial component of WSNs. We argue that time synchronization schemes developed for traditional networks such as NTP [23] are ill-suited for WSNs and suggest more appropriate approaches.

2005 - ACM Trans. Inf. Syst. Secur.
A pairwise key predistribution scheme for wireless sensor networks

To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating parties. Due to resource constraints, however, achieving key agreement in wireless sensor networks is nontrivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and other public-key based schemes, are not suitable for wireless sensor networks due to the limited computational abilities of the sensor nodes. Predistribution of secret keys for all pairs of nodes is not viable due to the large amount of memory this requires when the network size is large.In this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of our scheme in terms of network resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is close to zero. This desirable property lowers the initial payoff of smaller-scale network breaches to an adversary, and makes it necessary for the adversary to attack a large fraction of the network before it can achieve any significant gain.

Dynamic Power Management in Wireless Sensor Networks: State-of-the-Art

W. Dargie
|
W. Dargie

Abstract:In the last few years, interest in wireless sensor networks has increased considerably. These networks can be useful for a large number of applications, including habitat monitoring, structural health monitoring, pipeline monitoring, transportation, precision agriculture, supply chain management, and many more. Typically, a wireless sensor network consists of a large number of simple nodes which operate with exhaustible batteries, unattended. Manual replacement or recharging the batteries is not an easy or desirable task. Hence, how energy is utilized by the various hardware subsystems of individual nodes directly affects the scope and usefulness of the entire network. This paper provides a comprehensive assessment of state-of-the-art of dynamic power management (DPM) in wireless sensor networks. It investigates aspects of power dissipation in a node and analyses the strength and limitations of selective switching, dynamic frequency, and voltage scaling.

参考文献

[1]  Luca Benini,et al.  Dynamic voltage scaling and power management for portable systems , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[2]  David E. Culler,et al.  An architecture for energy management in wireless sensor networks , 2007, SIGBED.

[3]  Ramesh R. Rao,et al.  Improving energy saving in wireless systems by using dynamic power management , 2003, IEEE Trans. Wirel. Commun..

[4]  The TinyOS 2.x Working Group.  TinyOS 2.0 , 2005, SenSys.

[5]  Antonio Mauro Saraiva,et al.  From wireless sensors to field mapping: Anatomy of an application for precision agriculture , 2007 .

[6]  Massoud Pedram,et al.  Dynamic voltage and frequency scaling based on workload decomposition , 2004, Proceedings of the 2004 International Symposium on Low Power Electronics and Design (IEEE Cat. No.04TH8758).

[7]  Saibal Mukhopadhyay,et al.  Leakage current mechanisms and leakage reduction techniques in deep-submicrometer CMOS circuits , 2003, Proc. IEEE.

[8]  Sukun Kim,et al.  Health Monitoring of Civil Infrastructures Using Wireless Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[9]  Katherine Shu-Min Li,et al.  Temperature-aware dynamic frequency and voltage scaling for reliability and yield enhancement , 2009, 2009 Asia and South Pacific Design Automation Conference.

[10]  Robert Szewczyk,et al.  System architecture directions for networked sensors , 2000, ASPLOS IX.

[11]  Carla Schlatter Ellis,et al.  Memory controller policies for DRAM power management , 2001, ISLPED '01.

[12]  Luca Benini,et al.  A survey of design techniques for system-level dynamic power management , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[13]  David E. Culler,et al.  Telos: enabling ultra-low power wireless research , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[14]  L. Nachman,et al.  PIPENET: A Wireless Sensor Network for Pipeline Monitoring , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[15]  R. M. Swanson,et al.  Ion-implanted complementary MOS transistors in low-voltage circuits , 1972 .

[16]  Eric Anderson,et al.  X-MAC: a short preamble MAC protocol for duty-cycled wireless sensor networks , 2006, SenSys '06.

[17]  Massoud Pedram,et al.  Leakage current reduction in CMOS VLSI circuits by input vector control , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[18]  Muneeb Ali,et al.  Protothreads: simplifying event-driven programming of memory-constrained embedded systems , 2006, SenSys '06.

[19]  Erol Gelenbe,et al.  Energy-Efficient Cloud Computing , 2010, Comput. J..

[20]  Deborah Estrin,et al.  A wireless sensor network For structural monitoring , 2004, SenSys '04.

[21]  Frank Bellosa,et al.  Application Characterization for Wireless Network Power Management , 2004, ARCS.

[22]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[23]  Joseph A. Paradiso,et al.  CargoNet: a low-cost micropower sensor node exploiting quasi-passive wakeup for adaptive asychronous monitoring of exceptional events , 2007, SenSys '07.

[24]  Matt Welsh,et al.  Deploying a wireless sensor network on an active volcano , 2006, IEEE Internet Computing.

[25]  Omer Gurewitz,et al.  RI-MAC: a receiver-initiated asynchronous duty cycle MAC protocol for dynamic traffic loads in wireless sensor networks , 2008, SenSys '08.

[26]  Margaret Martonosi,et al.  Runtime Power Monitoring in High-End Processors: Methodology and Empirical Data , 2003, MICRO.

[27]  Frank Bellosa,et al.  Task activity vectors: a new metric for temperature-aware scheduling , 2008, Eurosys '08.

[28]  Anantha Chandrakasan,et al.  Dynamic Power Management in Wireless Sensor Networks , 2001, IEEE Des. Test Comput..

[29]  Frank Bellosa,et al.  Process cruise control: event-driven clock scaling for dynamic power management , 2002, CASES '02.

[30]  Upkar Varshney,et al.  Pervasive Healthcare and Wireless Health Monitoring , 2007, Mob. Networks Appl..

[31]  D. Doerffel,et al.  A critical review of using the peukert equation for determining the remaining capacity of lead-acid and lithium-ion batteries , 2006 .

[32]  Jenna Burrell,et al.  Vineyard computing: sensor networks in agricultural production , 2004, IEEE Pervasive Computing.

[33]  Adam Dunkels,et al.  Contiki - a lightweight and flexible operating system for tiny networked sensors , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

引用
IO-Link Field Parameterization for Data Collection Based on RFID Technology
2020 Cybernetics & Informatics (K&I)
2020
Reducing charge redistribution loss for supercapacitor-operated energy harvesting wireless sensor nodes
ENSsys@SenSys
2014
Energy aware adaptive sampling algorithm for energy harvesting wireless sensor networks
2015 IEEE Sensors Applications Symposium (SAS)
2015
An Energy Aware Adaptive Sampling Algorithm for Energy Harvesting WSN with Energy Hungry Sensors
Sensors
2016
Attack-resistant power management scheme for wireless sensor network
2015 International Conference on Advanced Robotics and Intelligent Systems (ARIS)
2015
A Novel Secure IoT-Based Smart Home Automation System Using a Wireless Sensor Network
Sensors
2016
WIRELESS SENSOR NODE WITH LOW-POWER SENSING
2014
A Critical Review on Energy-Efficient Medium Access Control for Wireless and Mobile Sensor Networks
2016
Low latency and energy efficient cluster based routing design for wireless sensor network
2019
Energy Efficient WSN by Optimizing the Packet Failure in Network
2017
Typical and atypical hierarchical routing protocols for WSNs : A review
2016 International Conference on Computing, Communication and Automation (ICCCA)
2016
Introduction to Wireless Sensor Networks
2015
Availability assessment of wireless visual sensor networks for target coverage
Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA)
2014
An analytic approach towards restoring communicational path in a WSN
2012 20th Telecommunications Forum (TELFOR)
2012
Power Allocation Algorithm for Target Tracking in Unmodulated Continuous Wave Radar Network
IEEE Sensors Journal
2015
Graceful Performance Modulation for Power-Neutral Transient Computing Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
2016
Dynamic Voltage-Frequency and Workload Joint Scaling Power Management for Energy Harvesting Multi-Core WSN Node SoC
Sensors
2017
Power efficient, bandwidth optimized and fault tolerant sensor management for IOT in Smart Home
2015 IEEE International Advance Computing Conference (IACC)
2015
Energy Efficient Solutions in Wireless Sensor Systems for Water Quality Monitoring: A Review
IEEE Sensors Journal
2019
Fully Autonomous Wireless Sensor Network for Freight Wagon Monitoring
2016