Security architectures in wireless sensor network

Welcome to IPSN 2012, the Eleventh ACM/IEEE Conference on Information Processing in Sensing Networks! This year marks the first time IPSN is held in Asia, recognizing the region's growing interest and activities in the areas of sensor networks, Internet-of-Things (IoT), and Cyber-Physical Systems (CPS). We hope that you will enjoy this diverse conference that is a leading venue for publications and idea exchange on sensor networks. IPSN is unique in its broad coverage of the field, ranging from foundations to system implementation and platforms. It is a meeting point of theory and practice, as embodied in its two tracks: Information Processing (IP) and Sensor Platforms, Tools and Design Methods (SPOTS). In an effort to further unify the conference this year, we formed a joint technical program committee (TPC) and held a single TPC meeting. Authors could select the IP or the SPOTS track for their submissions and TPC members were able to provide their review preferences across all papers submitted to the conference. We believe that in this way, each paper received the most relevant and useful set of reviews. The field of sensor networks has shown a continuing strength over the years as indicated by the number and the quality of submissions this year: 53 in the SPOTS track and 94 in the IP track, for a total of 147 submissions. These submissions underwent a two-stage review process during which each paper received at least three reviews and occasionally up to seven reviews. An online discussion followed the review process during which the set of papers that were discussed in the TPC meeting were selected. The set of accepted papers were decided during a face-to-face TPC meeting. 22 papers were selected for publication out of which 12 were in the IP track and 10 in the SPOTS track. As in the past, the exciting demo and poster session provides an opportunity for attendees to examine and discuss the latest in sensing devices, systems and applications, following a special session with a rapid-fire series of short "pitch" talks from the authors of posters and demos. A new addition to the program this year is the PhD Forum where students working in the field present their dissertation ideas and get critical feedback from a panel of experts. The main conference is complemented by a number of workshops and tutorials in emerging or adjacent areas of sensor networks such as mobile, IoT, and smart objects.

The k nearest neighbor (KNN) query, an essential query for information processing in sensor networks, has not received sufficient attention in the research community of sensor networks. In this paper, we examine in-network processing of KNN queries by proposing two alternative algorithms, namely the GeoRouting Tree (GRT) and the KNN Boundary Tree (KBT). The former is based on a distributed spatial index structure and prunes off the irrelevant nodes during query propagation. The latter is based upon ad-hoc geographic routing and first obtains a region within which at least k nearest sensor nodes are enclosed and then decides the k nearest nodes to the query point. We provide an extensive performance evaluation to study the impact of various system factors and protocol parameters. Our results show that GRT yields a good tradeoff between energy consumption and query accuracy in static scenarios. On the other hand, KBT achieves better energy efficiency while being more tolerant to network dynamics.

Wireless sensor networks(WSN) are a kind of communication networks with in-dependent sensor nodes which could construct multi-hop ad hoc network to trans-fer data. The transport protocols for Wireless Sensor Network play an important role to promote the performance of the whole systems. This paper proposes a modified transport layer protocol for heterogeneous Wireless Sensor Networks(HWSN). As TCP is not suitable to use in HWSN directly, we design a modified transport protocol(named mTCP) based on TCP by a six-state finite state machine. Experimental results illustrate that our design can improve the communication capability of the transmission layer in heterogeneous wireless sensor networks significantly.

QoSNET: An integrated QoS network for routing protocols in large scale wireless sensor networks

2020 19th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)

SummaryDue to the energy scarcity that the wireless sensor networks currently face, many energy‐efficient protocols have been developed and proposed in different layers, especially in the data link and network layers, as a large amount of energy consumed by the transceiver, idle‐listening, collision, selecting the correct nodes to act as routers, long‐distance transmission, etc., which are the responsibility of data link and network layers. Since these protocols address the reasons for energy loss in one layer and neglect the treatment of energy loss in other layers, as each layer of the TCP/IP module has its own features and has no control over the other layers. Therefore, there was a need for a cross‐layer design. In this paper, an energy‐efficient cross‐layer between MAC layer and network layer has been proposed using slotted ALOHA based p‐persistent CSMA MAC protocol and Enhance Energy Conservation based on Residual Energy and Distance (EECRED) in order to reduce energy consumption and increase the network lifetime. The performance of the proposed cross‐layer protocol is evaluated by simulating the protocol using the MATLAB simulation. The simulation results are compared with the Fuzzy and Ant Colony Optimization (ACO) based MAC/Routing cross‐layer protocol (FAMACRO), FAMACRO for wireless sensor networks (FAMACROW), fuzzy cross‐layer LEACH, routing‐MAC, and Energy‐efficient Cross‐layer‐sensing Clustering Method (ECCM) protocols to ensure the efficiency of the proposed cross‐layer. The simulation results show that the proposed cross‐layer protocol is very energy efficient, provides stable networks, consumes little energy, and significantly increases the life of the network compared to the single‐layer protocols where the improvement rate was 45%, 53%, 37%, 91%, and 28.72% compared to FAMACRO, FAMAROW, fuzzy cross‐layer LEACH, routing‐MAC, and ECCM protocols respectively in terms of the number of alive nodes or residual energy.

Using wireless sensor networks (WSNs) in delay and reliability critical environments is highly desired due to their unique advantages such as low cost, ease of deployment, and redundancy. However, successful deployment of resource-limited WSNs in such applications requires strict quality-of-service (QoS) provisioning techniques to meet the desired latency and reliability targets of those applications. Implementation of QoS techniques in WSNs is significantly challenging since WSNs have been initially devised for low-data-rate non-real-time applications. Therefore, WSN designers and developers resort to different cross-layer interaction and optimization techniques to provision QoS in WSNs. In this paper, we present a survey on the state of the art of cross-layer QoS approaches in wireless terrestrial sensor networks to achieve delay and reliability bounds in critical applications. Our paper provides a unique classification of cross-layer QoS approaches in WSNs that allows surveying a large amount of studies with utmost clarity. Furthermore, we highlight the main challenges of implementing QoS protocols in WSNs and present an overview of QoS-aware WSN applications.

Wireless sensor networks are a new emerging area where swarm intelligence can be applied with interesting implications. In fact, a strong analogy between unicellular organism colonies and wireless sensor networks can be emphasized: a sensor network can be viewed as a “colony” of simple, scarce resource nodes that, autonomously, are able only to perform simple tasks, but all together can accomplish very complex problems. In this paper we propose a routing protocol for multisink Wireless Sensor Networks with interesting properties: self organization, fault tolerance and environmental adaptation. The proposed protocol was inspired by the well known behavior (in artificial life studies) of “Slime Mold”. Such colony of unicellular organisms organizes itself in clusters by pheromone generation and evaporation mechanisms. In a similar manner our protocol manages the data traffic towards multiple sink nodes using the gradient concept and reaching high levels of autonomy and fault tolerance. We analyze the proposed protocol to examine the performances, the signalling overhead and the adaptation properties to environmental changes or nodes faults using simulation techniques.

In this paper, we propose a detailed energy survey of the physical, data link, and network layer by analytical techniques. We also show the impact of regular sleep periods on node energy consumption and present a comparison analysis of single-hop vs. multi-hop communications in the energy realm. A detailed energy expenditure analysis of not only the physical layer but also the link and network layer provides a basis for developing new energy efficient wireless sensor networks. Regular, coordinated sleeping extends the lifetime of sensor nodes, but systems can only benefit from sleeping in terms of transmitted packets if the data arrival rate to the system is low. Energy efficiency is the driving motivation for it can be considered the most important factor for wireless sensor networks because of the power constraints set by battery operation. Radio solutions in the lower ISM bands are attractive because of their relatively easy implementation and low power consumption. However, the data rates of these commercial radios are also relatively low, limiting transmittable frame sizes to a few tens of octets along with strict duty cycle requirements. From the analysis we extract key parameters of selected MAC protocols and show that some traditional mechanisms, such as binary exponential backoff, have some inherent problems. We also argue that single-hop communications has up todo% lower energy consumption than multi-hop forwarding within the feasible transmission distances of an ISM radio. Index Terms-Energy efficiency, Wireless sensor net- works, Medium access control (MAC) protocols, multi-hop communications a duty cycIe (Z), (3), which is normally 10% for the 434MHz band and 1% for the 868MHz band. The duty cycle is defined as the ratio, expressed as a percentage, of the maximum transmitter on-time, relative to a one hour period. When a sensor network is expected to work continuously, this duty cycle has to be taken into account and it can affect the energy efficiency of a network. In this paper we perform cross-layer analysis by pre- senting topology, medium access control (MAC) and ra- dio transceiver energy consumption models that work in unison. The hear topology model represents a common network after network layer route discovery has been accomplished. We use an energy consumption model for the transmission and reception of MAC frames originally presented in (4), develop a coordinated sleep group energy consumption model, and analytically investigate the effect of sleep on sensor networks using three MAC protocols. From the analysis we show that although in an ideal scenario multi-hop communications perform better than single-hop communications, realistic energy models and especially the MAC protocol design have a significant impact. We propose a multi-group sleep model for our nanoMAC protocol, and show that reg- ular sleep periods have a significant, energy reducing impact on node energy consumption with low traf!fic rates. The radio transceiver energy model takes into account several important radio parameters and we use the RFM TRlOOO and RFM radio designers guide (5) for realistic transceiver parameters. The main metric used is absolute energy, consumption per useful transmitted bit. This means only the MAC or thc network protocol data unit (PDU) will be considered and all the other communicated bits, headers, control frames, preambles, etc. are considered as overhead. The rest of the paper is organized as follows. Some related work is discussed in Section IT and in Section 111 we look at the radio propagation energy model. Section TV presents the network topology and energy

Wireless sensor networks, a distributed network of sensor nodes perform critical tasks in many application areas such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. The routing protocols developed for these distributed sensor networks need to be energy efficient and scalable. To create a better understanding of the performance of various routing protocols proposed it is very important to perform a detailed analysis of them. Network simulators enable us to study the performance and behavior of these protocols on various network topologies. Many Sensor Network frameworks were developed to explore both the networking issues and the distributed computing aspects of wireless sensor networks. The current work of simulation study of routing protocols is done on SensorSimulator, a discrete event simulation framework developed at Sensor Networks Research Laboratory, LSU and on a popular event driven network simulator ns2 developed at UC Berkeley. SensorSimulator is a discrete event simulation framework for sensor networks built over OMNeT++ (Objective Modular Network Test-bed in C++). This framework allows the user to debug and test software for distributed sensor networks. SensorSimulator allows developers and researchers in the area of Sensor Networks to investigate topological, phenomenological, networking, robustness and scaling issues, to explore arbitrary algorithms for distributed sensors, and to defeat those algorithms through simulated failure. The framework has modules for all the layers of a Sensor Network Protocol stack. This thesis is focused on the simulation and performance evaluation of various routing protocols on SensorSimulator and ns2. The performance of the simulator is validated with a comparative study of Directed Diffusion Routing Protocol on both ns2 and SensorSimulator. Then the simulations are done to evaluate the performance of Optimized Broadcast Protocols for Sensor Networks, Efficient Coordination Protocol for Wireless Sensor Networks on SensorSimulator. Also a performance study of Random Asynchronous Wakeup protocol for Sensor Networks is done on ns2.

Wireless Sensor Networks (WSNs) play a necessary position in todays actual world applications. WSNs are a team of autonomous sensor nodes that are geographically distributed to accumulate information and monitor events. WSNs are similarly sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor information can be transported via wireless. Sometimes called dust network, minute sensors as small as dust referring to smart dust. WSNs are spatially distributed two to screen or bodily temperature, sound, pressure, etc. and to cooperatively ignore their data via the network to different locations. Each such sensor network node has typically various parts. Routing in WSNs in one of the important technique, because all node executes its battery power, if may be one node failure it collapse entire networks. Routing in WSNs is in reality difficult due to the intrinsic characteristics that differentiate these networks from different networks. The plan of routing protocols in WSN is affected via number of exigent factors. In this paper, a review on routing protocols for Wireless Sensor Networks (WSNs) and performance of its execution.

The appearance of wireless sensor networks has attracted worldwide attention. Wireless Sensor Networks (WSNs) and Wireless Multimedia Sensor Networks (WMSNs) consist of wirelessly interconnected sensor nodes organised arbitrarily or deterministically in an environmental area which can gather, distribute and route information in different application areas. Power consumption in these networks is the foremost problem. WSNs are a recent generation of sensor networks, have an ample range of applications, their expansion and application will convey about extensive impact in human life and construction of all areas. Some of the applications include disaster management, landslide detection, glacial monitoring, wildlife tracking, healthcare, military applications, environmental monitoring, security surveillance, industrial process control and a large number of applications to robotics and Internet of Things (IOT) projects. This paper will demonstrate the elementary description of WSN followed by different energy-efficient power consumption protocols. Here we have performed the comparative performance analysis of different energy-efficient protocols. In our work we have compared MODLEACH with TSEP followed by TSEP with RELSEP.

Wireless sensor networks (WSNs) abiding a huge quantity of inexpensive, low consumption and intense sensor nodes and sole or additional decline or base stations. Those nodes are tiny in dimension and can carry out numerous significant affairs, as well as event sensing, in order processing, and data communication. Owed to different compensation such as simplicity of consumption, comprehensive transmission range, and identity association, WSNs have been interchanging the conventional networks. The promising and innovative network of wirelessly connected devices, which consist of video, audio streams, scalar sensor data and others, is Wireless Multimedia Sensor Network (WMSN). The multimedia data depends on superiority to overhaul (Qos) parameters, like await, channel utilization, network life time throughput and distortion etc is the main aim to optimized delivery of these networks. In multimedia network each packets are communicated with each other so not on time incoming packets and lots of packets are evenly. In WMSNs challenging task to guarantee resource constrained, high data rate, and soft delay limit beside with energy reduced. In this paper, we provide Survey on comparison of different protocol of Wireless sensor network and wirelesss multimedia sensor network like Greedy Perimeter Stateless Routing for Wireless Networks (GPSR), Real-time and Energy Aware Qos routing protocol (REAR), Temporary ordered routing Algorithm (TORA) and Dynamic source routing (DSR). This different protocols with WMSN are compared in requisites of throughput, end-to-end delay, network life time.

Wireless sensor networks (WSNs) use sensors to monitor phenomena such as temperature, humidity, groundwater levels and transmit this information to a base station using wireless channels. WSNs find applications in military, ecological, and health-related areas. A hybrid wireless sensor network includes two networks: an ad hoc wireless network and a wireless sensor network. The nodes in the ad hoc network act as base stations conducting surveillance on the WSN. In this dissertation, we focus on the key management issues in hybrid wireless sensor networks. The key management issues in hybrid wireless sensor networks can be divided into three categories according to which layer they affect: ad hoc network layer, wireless sensor network layer, and integrated cross layer. At the ad hoc network layer, we propose two elliptic curve discrete logarithm problem (ECDLP) based schemes for secure group communication (SGC). Unlike the vast majority of secure group communication protocols using the discrete logarithm problem (DLP) based Diffie-Hellman as the basic key agreement protocol, our solutions use the ECDLP-based Diffie-Hellman protocol. We also extend our research on secure group communication to the wireless sensor network layer. We formally define the grouping and secure group communication problems in WSNs. We further propose and evaluate four centralized group rekeying (CGK) schemes for SGC in WSNs. Our proposed key management protocol at the integrated cross layer, mKeying, includes two schemes, a key distribution scheme, KeyDist, supporting multiple base stations in the network, and a centralized key revocation scheme, KeyRev, for removing compromised sensor nodes from the sensor network. Through these protocols for key distribution, key revocation, and group communication, we present an integrated approach to provide security in hybrid wireless sensor networks.

Wireless sensor networks (WSNs) are quickly becoming an essential part of today's modern infrastructure, and it is becoming crucial to consider time synchronisation problems in WSNs. Furthermore, one of the main design issues in WSN time synchronisation is the efficient use of energy at each sensor node to prolong the lifespan of the network. This paper describes a new energy-efficient time protocol based on the spanning tree of the network model graph in a WSN. Three major cases are discussed: 1) time synchronisation using the energy-efficient spanning tree (EST) protocol in a WSN with approximately 300 sensors; 2) an improved EST protocol in large-scale WSNs; 3) an improved EST protocol under weighted graph. Additionally, a series of practical algorithms are proposed in this paper, where both energy and time efficient can be clearly shown through a number of simulated examples along with their comparative results.