相关论文
2015 - Inf. Sci.
A secure temporal-credential-based mutual authentication and key agreement scheme with pseudo identity for wireless sensor networks

With an advancement of wireless communication technology, wireless sensor network (WSN) has emerged as one of the most powerful technologies which can be used in various applications, such as military surveillance, environment monitoring, industrial control, and medical monitoring. WSNs are vulnerable to large collection of attacks than traditional networks because they transmit data using a wireless channel and are deployed in unattended environments. So, in this environment, how to ensure secure communications between different communication parties becomes a challenging issue with respect to the constraints of energy consumption, and large overhead generated during various operations performed. In this direction, the mutual authentication and key agreement (MAAKA) scheme attracts much attention in recent years. In literature, MAAKA schemes were presented in last several years. However, most of these schemes cannot satisfy security requirements in WSNs. Recently, Xue et al. proposed a temporal-credential-based MAAKA scheme for WSNs and proved that it could withstand various types of attacks. However, this paper points out that Xue et al.'s MAAKA scheme is vulnerable to the off-line password guessing attack, the user impersonation attack, the sensor node impersonation attack and the modification attack. Moreover, this paper also points out that Xue et al.'s MAAKA scheme cannot provide user anonymity. To overcome weaknesses in Xue et al.'s MAAKA scheme, this paper proposes a new temporal-credential-based MAAKA scheme for WSNs. Security analysis shows the proposed MAAKA scheme could overcome the weaknesses in Xue et al.'s MAAKA scheme. Performance analysis shows the proposed MAAKA scheme has better performance than the existing benchmarked schemes in literature. Therefore, the proposed MAAKA scheme is more suitable for providing security for various applications in WSNs.

2015 - IEEE Communications Surveys & Tutorials
A Survey on Radio Resource Allocation in Cognitive Radio Sensor Networks

Wireless sensor networks (WSNs) use the unlicensed industrial, scientific, and medical (ISM) band for transmissions. However, with the increasing usage and demand of these networks, the currently available ISM band does not suffice for their transmissions. This spectrum insufficiency problem has been overcome by incorporating the opportunistic spectrum access capability of cognitive radio (CR) into the existing WSN, thus giving birth to CR sensor networks (CRSNs). The sensor nodes in CRSNs depend on power sources that have limited power supply capabilities. Therefore, advanced and intelligent radio resource allocation schemes are very essential to perform dynamic and efficient spectrum allocation among sensor nodes and to optimize the energy consumption of each individual node in the network. Radio resource allocation schemes aim to ensure QoS guarantee, maximize the network lifetime, reduce the internode and internetwork interferences, etc. In this paper, we present a survey of the recent advances in radio resource allocation in CRSNs. Radio resource allocation schemes in CRSNs are classified into three major categories, i.e., centralized, cluster-based, and distributed. The schemes are further divided into several classes on the basis of performance optimization criteria that include energy efficiency, throughput maximization, QoS assurance, interference avoidance, fairness and priority consideration, and hand-off reduction. An insight into the related issues and challenges is provided, and future research directions are clearly identified.

2011 - J. Netw. Comput. Appl.
A survey on cross-layer solutions for wireless sensor networks

Ever since wireless sensor networks (WSNs) have emerged, different optimizations have been proposed to overcome their constraints. Furthermore, the proposal of new applications for WSNs have also created new challenges to be addressed. Cross-layer approaches have proven to be the most efficient optimization techniques for these problems, since they are able to take the behavior of the protocols at each layer into consideration. Thus, this survey proposes to identify the key problems of WSNs and gather available cross-layer solutions for them that have been proposed so far, in order to provide insights on the identification of open issues and provide guidelines for future proposals.

2008 - IEEE Transactions on Mobile Computing
Interference-Minimized Multipath Routing with Congestion Control in Wireless Sensor Network for High-Rate Streaming

High-rate streaming in WSN is required for future applications to provide high-quality information of battlefield hot spots. Although recent advances have enabled large-scale WSN to be deployed supported by high-bandwidth backbone network for high-rate streaming, the WSN remains the bottleneck due to the low-rate radios used and the effects of wireless interferences. First, we propose a technique to evaluate the quality of a pathset for multipath load balancing, taking into consideration the effects of wireless interferences and that nodes may interfere beyond communication ranges. Second, we propose an interference- minimized multipath routing (I2MR) protocol that increases throughput by discovering zone-disjoint paths for load balancing, requiring minimal localization support. Third, we propose a congestion control scheme that further increases throughput by loading the paths for load balancing at the highest possible rate supportable. Finally, we validate thepath-set evaluation technique and also evaluate the I2MR protocol and congestion control scheme by comparing with AODV protocol and node-disjoint multipath routing (NDMR) protocol. Simulation results show that I2MR with congestion control achieves on average 230% and 150% gains in throughput over AODV and NDMR respectively, and consumes comparable or at most 24% more energy than AODV but up to 60% less energy than NDMR.

2006 - J. Comput.
Mobile Agent Based Wireless Sensor Networks

Recently, mobile agents have been proposed for efficient data dissemination in sensor networks. In the traditional client/server-based computing architecture, data at multiple sources are transferred to a destination; whereas in the mobile-agent based computing paradigm, a task specific executable code traverses the relevant sources to gather data. Mobile agents can be used to greatly reduce the communication cost, especially over low bandwidth links, by moving the processing function to the data rather than bringing the data to a central processor. This paper proposes to use the mobile agent paradigm for reducing and aggregating data in a planar sensor network architecture. The proposed architecture is called mobile agent based wireless sensor network (MAWSN). Extensive simulation shows that MAWSN exhibits better performance than client/server communications in terms of energy consumption and the packet delivery ratio. However, MAWSN has a longer end-to-end latency than client/server communications in certain conditions.

2014 - J. Comput. Syst. Sci.
Management and applications of trust in Wireless Sensor Networks: A survey

Wireless Sensors Networks (WSNs) are susceptible to many security threats, and because of communication, computation and delay constraints of WSNs, traditional security mechanisms cannot be used. Trust management models have been recently suggested as an effective security mechanism for WSNs. Considerable research has been done on modeling and managing trust. In this paper, we present a detailed survey on various trust models that are geared towards WSNs. Then, we analyze various applications of trust models. They are malicious attack detection, secure routing, secure data aggregation, secure localization and secure node selection. In addition, we categorize various types of malicious attacks against trust models and analyze whether the existing trust models can resist these attacks or not. Finally, based on all the analysis and comparisons, we list several trust best practices that are essential for developing a robust trust model for WSNs.

2004 - ESORICS
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks

Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor deployment scenario, there will be no prior knowledge of post deployment configuration. For security solutions requiring pairwise keys, it is impossible to decide how to distribute key pairs to sensor nodes before the deployment. Existing approaches to this problem are to assign more than one key, namely a key-chain, to each node. Key-chains are randomly drawn from a key-pool. Either two neighboring nodes have a key in common in their key-chains, or there is a path, called key-path, among these two nodes where each pair of neighboring nodes on this path has a key in common. Problem in such a solution is to decide on the key-chain size and key-pool size so that every pair of nodes can establish a session key directly or through a path with high probability. The size of the key-path is the key factor for the efficiency of the design. This paper presents novel, deterministic and hybrid approaches based on Combinatorial Design for key distribution. In particular, several block design techniques are considered for generating the key-chains and the key-pools.

2013 - IEEE Transactions on Cybernetics
An Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Networks

Sensor networks have a lot of applications such as battlefield surveillance, environmental monitoring, and industrial diagnostics. Coverage is one of the most important performance metrics for sensor networks since it reflects how well a sensor field is monitored. In this paper, we introduce the maximum coverage deployment problem in wireless sensor networks and analyze the properties of the problem and its solution space. Random deployment is the simplest way to deploy sensor nodes but may cause unbalanced deployment and therefore, we need a more intelligent way for sensor deployment. We found that the phenotype space of the problem is a quotient space of the genotype space in a mathematical view. Based on this property, we propose an efficient genetic algorithm using a novel normalization method. A Monte Carlo method is adopted to design an efficient evaluation function, and its computation time is decreased without loss of solution quality using a method that starts from a small number of random samples and gradually increases the number for subsequent generations. The proposed genetic algorithms could be further improved by combining with a well-designed local search. The performance of the proposed genetic algorithm is shown by a comparative experimental study. When compared with random deployment and existing methods, our genetic algorithm was not only about twice faster, but also showed significant performance improvement in quality.

2013 - IEEE Sensors Journal
Load-Balanced Clustering Algorithm With Distributed Self-Organization for Wireless Sensor Networks

Wireless sensor networks (WSNs) are composed of a large number of inexpensive power-constrained wireless sensor nodes, which detect and monitor physical parameters around them through self-organization. Utilizing clustering algorithms to form a hierarchical network topology is a common method of implementing network management and data aggregation in WSNs. Assuming that the residual energy of nodes follows the random distribution, we propose a load-balanced clustering algorithm for WSNs on the basis of their distance and density distribution, making it essentially different from the previous clustering algorithms. Simulated tests indicate that the new algorithm can build more balanceable clustering structure and enhance the network life cycle.

2005 - DCOSS
Macro-programming Wireless Sensor Networks Using Kairos

The literature on programming sensor networks has focused so far on providing higher-level abstractions for expressing local node behavior. Kairos is a natural next step in sensor network programming in that it allows the programmer to express, in a centralized fashion, the desired global behavior of a distributed computation on the entire sensor network. Kairos’ compile-time and runtime subsystems expose a small set of programming primitives, while hiding from the programmer the details of distributed-code generation and instantiation, remote data access and management, and inter-node program flow coordination. In this paper, we describe Kairos’ programming model, and demonstrate its suitability, through actual implementation, for a variety of distributed programs—both infrastructure services and signal processing tasks—typically encountered in sensor network literature: routing tree construction, localization, and object tracking. Our experimental results suggest that Kairos does not adversely affect the performance or accuracy of distributed programs, while our implementation experiences suggest that it greatly raises the level of abstraction presented to the programmer.

2005 - Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005.
Design of an application-cooperative management system for wireless sensor networks

This paper argues for the usefulness of an application-cooperative interactive management system for wireless sensor networks and presents SNMS, a sensor network management system. SNMS is designed to be simple and have minimal impact on memory and network traffic, while remaining open and flexible. The system is evaluated in light of issues derived from real deployment experiences.

2004 - SenSys '04
Hardware design experiences in ZebraNet

The enormous potential for wireless sensor networks to make a positive impact on our society has spawned a great deal of research on the topic, and this research is now producing environment-ready systems. Current technology limits coupled with widely-varying application requirements lead to a diversity of hardware platforms for different portions of the design space. In addition, the unique energy and reliability constraints of a system that must function for months at a time without human intervention mean that demands on sensor network hardware are different from the demands on standard integrated circuits. This paper describes our experiences designing sensor nodes and low level software to control them. In the ZebraNet system we use GPS technology to record fine-grained position data in order to track long term animal migrations [14]. The ZebraNet hardware is composed of a 16-bit TI microcontroller, 4 Mbits of off-chip flash memory, a 900 MHz radio, and a low-power GPS chip. In this paper, we discuss our techniques for devising efficient power supplies for sensor networks, methods of managing the energy consumption of the nodes, and methods of managing the peripheral devices including the radio, flash, and sensors. We conclude by evaluating the design of the ZebraNet nodes and discussing how it can be improved. Our lessons learned in developing this hardware can be useful both in designing future sensor nodes and in using them in real systems.

2009 - MobiCom '09
Compressive data gathering for large-scale wireless sensor networks

This paper presents the first complete design to apply compressive sampling theory to sensor data gathering for large-scale wireless sensor networks. The successful scheme developed in this research is expected to offer fresh frame of mind for research in both compressive sampling applications and large-scale wireless sensor networks. We consider the scenario in which a large number of sensor nodes are densely deployed and sensor readings are spatially correlated. The proposed compressive data gathering is able to reduce global scale communication cost without introducing intensive computation or complicated transmission control. The load balancing characteristic is capable of extending the lifetime of the entire sensor network as well as individual sensors. Furthermore, the proposed scheme can cope with abnormal sensor readings gracefully. We also carry out the analysis of the network capacity of the proposed compressive data gathering and validate the analysis through ns-2 simulations. More importantly, this novel compressive data gathering has been tested on real sensor data and the results show the efficiency and robustness of the proposed scheme.

2001 - Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001
Time synchronization for wireless sensor networks

Recent advances in miniaturization and low-cost, low-power design have led to active research in large-scale networks of small, wireless, low-power sensors and actuators. Time synchronization is a critical piece of infrastructure in any distributed system, but wireless sensor networks make particularly extensive use of synchronized time. Almost any form of sensor data fusion or coordinated actuation requires synchronized physical time for reasoning about events in the physical world. However, while the clock accuracy and precision requirements are often stricter in sensor networks than in traditional distributed systems, energy and channel constraints limit the resources available to meet these goals. New approaches to time synchronization can better support the broad range of application requirements seen in sensor networks, while meeting the unique resource constraints found in such systems. We first describe the design principles we have found useful in this problem space: tiered and multi-modal architectures are a better fit than a single solution forced to solve all problems; tunable methods allow synchronization to be more finely tailored to problem at hand; peer-to-peer synchronization eliminates the problems associated with maintaining a global timescale. We propose a new service model for time synchronization that provides a much more natural expression of these techniques: explicit timestamp conversions . We describe the implementation and characterization of several synchronization methods that exemplify our design principles. Reference-Broadcast Synchronization achieves high precision at low energy cost by leveraging the broadcast property inherent to wireless communication. A novel multi-hop algorithm allows RBS timescales to be federated across broadcast domains. Post-Facto Synchronization can make systems significantly more efficient by relaxing the traditional constraint that clocks must be kept in continuous synchrony. Finally, we describe our experience in applying our new methods to the implementation of a number of research and commercial sensor network applications.

2014 - Appl. Soft Comput.
A novel differential evolution based clustering algorithm for wireless sensor networks

The proposed work is a novel DE based clustering scheme for WSNs.The algorithm incorporates an additional step to enhance the performance.Experimental results demonstrate the superiority over existing algorithms.The performance is shown in terms of network life, energy consumption, etc. Clustering is an efficient topology control method which balances the traffic load of the sensor nodes and improves the overall scalability and the life time of the wireless sensor networks (WSNs). However, in a cluster based WSN, the cluster heads (CHs) consume more energy due to extra work load of receiving the sensed data, data aggregation and transmission of aggregated data to the base station. Moreover, improper formation of clusters can make some CHs overloaded with high number of sensor nodes. This overload may lead to quick death of the CHs and thus partitions the network and thereby degrade the overall performance of the WSN. It is worthwhile to note that the computational complexity of finding optimum cluster for a large scale WSN is very high by a brute force approach. In this paper, we propose a novel differential evolution (DE) based clustering algorithm for WSNs to prolong lifetime of the network by preventing faster death of the highly loaded CHs. We incorporate a local improvement phase to the traditional DE for faster convergence and better performance of our proposed algorithm. We perform extensive simulation of the proposed algorithm. The experimental results demonstrate the efficiency of the proposed algorithm.

2006 - SASN '06
How public key cryptography influences wireless sensor node lifetime

In this paper we try to estimate the real influence of public key cryptography (PKC) to the lifetime of a sensor node in wireless sensor networks. We investigate four types of nodes; MICA2DOT, MICA2, MICAz and TelosB. For all these nodes we estimate the power consumption for most common RSA and ECC operations, i.e., signature generation and verification as well as key exchange mechanisms. We also estimate the power consumed by the transmission of their results. Our results show that the application of strong cryptography is feasible. Even for the most constrained node performing the ECC-160 signature once every 10 minutes increases the duty cycle only by about 0.5 per cent, i.e., the influence to the lifetime is not significant. Nevertheless, the public key cryptography shall be used with care.

2006 - SenSys '06
Run-time dynamic linking for reprogramming wireless sensor networks

From experience with wireless sensor networks it has become apparent that dynamic reprogramming of the sensor nodes is a useful feature. The resource constraints in terms of energy, memory, and processing power make sensor network reprogramming a challenging task. Many different mechanisms for reprogramming sensor nodes have been developed ranging from full image replacement to virtual machines.We have implemented an in-situ run-time dynamic linker and loader that use the standard ELF object file format. We show that run-time dynamic linking is an effective method for reprogramming even resource constrained wireless sensor nodes. To evaluate our dynamic linking mechanism we have implemented an application-specific virtual machine and a Java virtual machine and compare the energy cost of the different linking and execution models. We measure the energy consumption and execution time overhead on real hardware to quantify the energy costs for dynamic linkin.Our results suggest that while in general the overhead of a virtual machine is high, a combination of native code and virtual machine code provide good energy efficiency. Dynamic run-time linking can be used to update the native code, even in heterogeneous networks.

2008 - IEEE Wireless Communications
Security in wireless sensor networks

Recent advances in electronics and wireless communication technologies have enabled the development of large-scale wireless sensor networks that consist of many low-power, low-cost, and small-size sensor nodes. Sensor networks hold the promise of facilitating large-scale and real-time data processing in complex environments. Security is critical for many sensor network applications, such as military target tracking and security monitoring. To provide security and privacy to small sensor nodes is challenging, due to the limited capabilities of sensor nodes in terms of computation, communication, memory/storage, and energy supply. In this article we survey the state of the art in research on sensor network security.

2004 - IEEE Wireless Communications
The design space of wireless sensor networks

In the recent past, wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics. As a consequence, it is becoming increasingly difficult to discuss typical requirements regarding hardware issues and software support. This is particularly problematic in a multidisciplinary research area such as wireless sensor networks, where close collaboration between users, application domain experts, hardware designers, and software developers is needed to implement efficient systems. In this article we discuss the consequences of this fact with regard to the design space of wireless sensor networks by considering its various dimensions. We justify our view by demonstrating that specific existing applications occupy different points in the design space.

2020 - Wireless Sensor Network
Security in Sensor Networks

This chapter identifies the vulnerabilities associated with the operational paradigms currently employed by Wireless Sensor Networks. A survey of current WSN security research is presented. The security issues of Mobile Ad-Hoc Networks and infrastructure supported wireless networks are briefly compared and contrasted to the security concerns of Wireless Sensor Networks. A framework for implementing security in WSNs, which identifies the security measures necessary to mitigate the identified vulnerabilities is defined.

An approach to increase the wireless sensor network lifetime

N. Marriwala
|
P. Rathee
|
P. Rathee
|
Dr Nikhil Kumar Marriwala

Abstract:A wireless sensor network consist of small devices, called sensor nodes that are equipped with sensors to monitor the physical and environmental conditions such as pressure, temperature, humidity, motion, speed etc. The nodes in the wireless sensor network were battery powered, so one of the important issues in wireless sensor network is the inherent limited battery power within network sensor nodes. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of sensor networks so if the power exhausted node would quit from the network, and it overall affect the network lifetime. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of applications and protocols for sensor networks. In this paper there is improvement of lifetime of wireless sensor network in terms increasing alive nodes in network by using a different approach to select cluster head. The cluster head selection is based on the basis of maximum residual energy and minimum distance and chooses a optimal pat between the cluster heads to transmit to the base station.

参考文献

[1]  Qiang Gao,et al.  Consumed Energy as a Factor for Cluster Head Selection in Wireless Sensor Networks , 2010, 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).

[2]  A.T. Haghighat,et al.  A new energy-efficient clustering algorithm for Wireless Sensor Networks , 2007, 2007 15th International Conference on Software, Telecommunications and Computer Networks.

[3]  Rajashekhar C. Biradar,et al.  A survey on routing protocols in Wireless Sensor Networks , 2012, 2012 18th IEEE International Conference on Networks (ICON).

[4]  S.A. Khan,et al.  Analyzing & Enhancing energy Efficient Communication Protocol for Wireless Micro-sensor Networks , 2005, 2005 International Conference on Information and Communication Technologies.

[5]  Joongseok Park,et al.  Maximum Lifetime Routing In Wireless Sensor Networks ∗ , 2005 .

[6]  Minghao Tang,et al.  LEACH-B: An Improved LEACH Protocol for Wireless Sensor Network , 2010, 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).

[7]  Muneer O. Bani Yassein,et al.  Improvement on LEACH Protocol of Wireless Sensor Network (VLEACH) , 2009, J. Digit. Content Technol. its Appl..

[8]  B. Shanthi,et al.  A Survey on Energy Efficient Protocols for Wireless Sensor Networks , 2010 .

[9]  Fan Xiangning,et al.  Improvement on LEACH Protocol of Wireless Sensor Network , 2007, 2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007).

[10]  Hu Han-ying,et al.  An Improved LEACH Protocol for Data Gathering and Aggregation in Wireless Sensor Networks , 2008, 2008 International Conference on Computer and Electrical Engineering.

[11]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[12]  Hu Junping,et al.  A Time-based Cluster-Head Selection Algorithm for LEACH , 2008, 2008 IEEE Symposium on Computers and Communications.

[13]  S. Deng,et al.  Mobility-based clustering protocol for wireless sensor networks with mobile nodes , 2011, IET Wirel. Sens. Syst..

[14]  David E. Culler,et al.  System architecture for wireless sensor networks , 2003 .

[15]  M. R. Tripathy,et al.  Routing Protocols in Wireless Sensor Networks: A Survey , 2012, 2012 Second International Conference on Advanced Computing & Communication Technologies.

[16]  Nitin Gupta,et al.  Application based Study on Wireless Sensor Network , 2011 .

[17]  M. N. Giriprasad,et al.  Challenges in maximizing the life of Wireless Sensor Network , 2011 .

[18]  Jasbir Kaur,et al.  Improved LEACH Protocol for Wireless Sensor Networks , 2011, 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing.

[19]  Bahman Abolhassani,et al.  An energy efficient algorithm for cluster-head selection in WSNs , 2010, 2010 5th International Symposium on Telecommunications.

[20]  Jiang Chunfeng,et al.  Research about improvement of LEACH protocol , 2010, The 2nd International Conference on Information Science and Engineering.

[21]  Guillermo A. Francia.  A Wireless Sensor Network , 2003, International Conference on Wireless Networks.

[22]  Joohwan Kim,et al.  Minimizing Delay and Maximizing Lifetime for Wireless Sensor Networks With Anycast , 2010, IEEE/ACM Transactions on Networking.

[23]  Ossama Younis,et al.  Node clustering in wireless sensor networks: recent developments and deployment challenges , 2006, IEEE Network.

[24]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[25]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

引用
Detection of Clone Attack in Mobile Wireless Sensor Network
2015
High-level abstractions in wireless sensor networks: Status, taxonomy, challenges, and future directions
Proceedings of the 2014 Zone 1 Conference of the American Society for Engineering Education
2014
Dynamic Clustering and Cluster Head Selection for Energy Optimization under Wireless Sensor Network
2018
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)
Int. J. Networked Distributed Comput.
2014
WSN-DS: A Dataset for Intrusion Detection Systems in Wireless Sensor Networks
J. Sensors
2016
A Review on Various Approaches of Data Sensing and Transmission in WSN
2017
Intrusion Detection System in Wireless Sensor Networks - A Comprehensive Survey
2019 Second International Conference on Latest trends in Electrical Engineering and Computing Technologies (INTELLECT)
2019
A Highly Reliable, Low Power Consumption, Low-Cost Multisensory Based System For Autonomous Navigational Mobile Robot
2016
Analysis and detection of Byzantine attack in wireless sensor network
2016 3rd International Conference on Computing for Sustainable Global Development (INDIACom)
2016
Environment Monitoring of an Enclosed Place Like Underground Mines with ANSYS Software and Sensors Based Technology
2014
An Improved BAT-Optimized Cluster-Based Routing for Wireless Sensor Networks
2015
An Efficient Distance-Energy-based Minimum Spanning Tree (DE-MST) for Wireless Sensor Networks
2015
A New Programming Model to Simulate Wireless Sensor Networks : Finding The Best Routing Path
2013
Survey of different Clustering Algorithms used to Increase the Lifetime of Wireless Sensor Networks
2014
Increase the Lifetime of Wireless Sensor Network using Clustering and Compression
2015
Performance evaluation of energy efficient routing in wireless sensor networks
2016 International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES)
2016
Sleep Wake Scheduling Algorithm Using Enegy Efficient And Secure Data Transmission
2019
A Reserve Path based Black Hole Detection and Prevention Algorithm in Wireless Sensor Network
2017
Classification of DoS Attacks in Wireless Sensor Network with Artificial Neural Network
Int. J. Netw. Secur.
2020
Classification of DoS Attacks in Smart Underwater Wireless Sensor Network
Wireless Personal Communications
2019