A growing number of smart items are entering our daily lives as the Internet of Things becomes increasingly prevalent. ICT device miniaturization introduces a brand-new material type called Communicating Material (CM). The term “communications material” refers to a single system that includes a material equipped with communication devices. In this paper, the main limitation of CM was studied - the issue of energy consumption. Due to the limited battery capacity of sensor nodes, the issue of network lifetime comes to the fore, emphasizing the importance of power management and optimization for each sensor node. The first and most important step in tackling this problem is to precisely estimate and calculate each node's power usage. In addition, the WSN's embeddedness in the material makes it challenging to replace batteries and measure network power consumption, necessitating the development of a different approach to power consumption estimation. Thus, our work explores all the different approaches to energy estimation in WSN and tries to choose the best method that fits our WSN platform.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

No / A two-tiered architecture with resource-rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier is expected to be adopted in large scale sensor networks. In a hostile environment, adversaries are more motivated to compromise the master nodes to break the authenticity and completeness of query results, whereas it is lack of light and secure query processing protocol in tiered sensor networks at present. In this paper, we study the problem of verifiable fine-grained top- queries in two-tiered sensor networks, and propose a novel verification scheme, which is named Verification Scheme for Fine-grained Top- Queries (VSFTQ). To make top- query results verifiable, VSFTQ establishes relationships among data items of each sensor node using their orders, which are encrypted together with the scores of the data items and the interested time epoch number using distinct symmetric keys kept by each sensor node and the network owner. Both theoretical analysis and simulation results show that VSFTQ can not only ensure high probability of detecting forged and/or incomplete query results, but also significantly decrease the amount of verification information when compared with existing schemes.

In order to save energy consumption in idle states, low duty-cycled operation is widely used in Wireless Sensor Networks (WSNs), where each node periodically switches between sleeping mode and awake mode. Although efficient toward saving energy, duty-cycling causes many challenges, such as difficulty in neighbor discovery due to asynchronous wakeup/sleep scheduling, time-varying transmission latencies due to varying neighbor discovery latencies, and difficulty on multihop broadcasting due to non-simultaneous wakeup in neighborhood. This dissertation focuses on this problem space. Specifically, we focus on three co-related problems in duty-cycled WSNs: wakeup scheduling, routing and broadcasting. We propose an asynchronous quorum-based wakeup scheduling scheme, which optimizes heterogenous energy saving ratio and achieves bounded neighbor discovery latency, without requiring time synchronization. Our solution is based on quorum system design. We propose two designs: cyclic quorum system pair (cqs-pair) and grid quorum system pair (gqs-pair). We also present fast offline construction algorithms for such designs. Our analytical and experimental results show that cqs-pair and gqs-pair achieve better trade-off between the average discovery delay and energy consumption ratio. We also study asymmetric quorum-based wakeup scheduling for two-tiered network topologies for further improving energy efficiency. Heterogenous duty-cycling causes transmission latencies to be time-varying. Hence, the routing problem becomes more complex when the time domain must be considered for data delivery in duty-cycled WSNs. We formulate the routing problem as time-dependent Bellman-Ford problem, and use vector representation for time-varying link costs and end-to-end (E2E) distances. We present efficient algorithms for route construction and maintenance, which have bounded time and message complexities in the worst case by ameliorating with beta-synchronizer. Multihop broadcast is complex in duty-cycled WSNs due to non simultaneous wakeup in neighborhoods. We present Hybrid-cast, an asynchronous multihop broadcast protocol, which can be applied to low duty-cycling or quorum-based duty-cycling schedules, where nodes send out a beacon message at the beginning of wakeup slots. Hybrid-cast achieves better tradeoff between broadcast latency and broadcast count compared to previous broadcast solutions. It adopts opportunistic data delivery in order to reduce the broadcast latency. Meanwhile, it reduces redundant transmission via delivery deferring and online forwarder selection. We analytically establish the upper bound of broadcast count and the broadcast latency under Hybrid-cast. To verify the feasibility, effectiveness, and performance of our solutions for asynchronous wakeup scheduling, we developed a prototype implementation using Telosb and TinyOS 2.0 WSN platforms. We integrated our algorithms with the existing protocol stack in TinyOS, and compared them with the CSMA mechanism. Our implementation measurements illustrate the feasibility, performance trade-off, and effectiveness of the proposed solutions for low duty-cycled WSNs. / Ph. D.

With the progression of computer networks extending boundaries and joining distant locations, wireless sensor networks (WSNs) emerge as the new frontier in developing opportunities to collect and process data from remote locations. WSNs rely on hardware simplicity to make sensor field deployments both affordable and long-lasting without maintenance support. WSN designers strive to extend network lifetimes while meeting application-specific throughput and latency requirements. Effective power management places sensor nodes into one of the available energy-saving modes based upon the sleep period duration and the current state of the radio. This research investigates energy-efficient medium access control (MAC) protocols designed to extend both the lifetime and range of wireless sensor networks. These networks are deployed in remote locations with limited processor capabilities, memory capacities, and battery supplies. The purpose of this research is to develop a new medium access control protocol which performs both cluster management and inter-network gateway functions in an energy-efficient manner. This new protocol, Gateway MAC (GMAC), improves on existing sensor MAC protocols by not only creating additional opportunities to place the sensor platforms into lower power-saving modes, but also by establishing a traffic rhythm which extends the sleep duration to minimize power mode transition costs. Additionally, this research develops a radio power management (RPM) algorithm to provide a new mechanism for all WSN MAC protocols to optimize sleep transition decisions based upon the power and response characteristics of the sensor platform's transceiver. Finally, to extend access to sensor data in remote locations, this research also validates an innovative wireless distribution system which integrates wireless sensor networks, mobile ad hoc networks (MANET), and the Internet. This research makes two significant contributions to the state-of-the-art wireless sensor networks. First, GMAC's centralized network management function offers significant energy savings and network lifetime extensions over existing wireless sensor network protocols. The second contribution is the introduction of a wireless sensor radio power management algorithm designed to exploit additional power-saving opportunities introduced with the newest generation of faster sensor platform transceivers. / Ph. D.