This paper proposes a novel hybrid cryptographic scheme for the generation of pair-wise network topology authenticated (TAK) keys in a Wireless sensor Network (WSN) using vector algebra in GF(q). The proposed scheme i...
详细信息
ISBN:
(纸本)9781424425747
This paper proposes a novel hybrid cryptographic scheme for the generation of pair-wise network topology authenticated (TAK) keys in a Wireless sensor Network (WSN) using vector algebra in GF(q). The proposed scheme is deterministic, pair-wise keys are not pre-distributed but generated starting from partial key components, keys management exploits benefits from both symmetric and asymmetric schemes (hybrid cryptography) and each key in a pair node can be generated only if nodes have been authenticated (key authentication). Network topology authentication, and hybrid key cryptography are the building blocks for this proposal: the former means that a cryptographic key can be generated if and only if the current network topology is compliant to the "planned network topology", which acts as the authenticated reference;the latter means that the proposed scheme is a combination of features from symmetric (for the ciphering and authentication model) and asymmetric cryptography (for the key generation model). The proposal fits the security requirement of a cryptographic scheme for WSN in a limited computing resource. A deep quantitative security analysis has been carried out. Moreover the cost analysis of the scheme in terms of computational time and memory usage for each node has been carried on and reported for the case of a 128-bit key.
Wireless sensor networks, like other computing platforms, require software updates from time to time due to software bugs, new functionality, better understanding of the surrounding environment or new applications. Ph...
详细信息
ISBN:
(纸本)9781424423675
Wireless sensor networks, like other computing platforms, require software updates from time to time due to software bugs, new functionality, better understanding of the surrounding environment or new applications. Physically connecting to and reprogramming each node is usually not feasible and often impossible. A number of wireless code distribution and reprogramming techniques have been presented in recent years. In this paper we present a novel technique to efficiently update any nodes that were lost during programming periods. Our experiments demonstrate a 57% decrease of bytes sent over the air when updating nodes that previously missed updates.
Contour maps, showing topological distribution of extracted features, are crucial for many applications. Building a dynamic contour map in a wireless sensor network is a challenging task due to the constrained network...
详细信息
Most papers on sensing in wireless sensor networks use only very simple sensors, e.g. humidity or temperature, to illustrate their concepts. However, in a large number of scenarios including structural health monitori...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
Most papers on sensing in wireless sensor networks use only very simple sensors, e.g. humidity or temperature, to illustrate their concepts. However, in a large number of scenarios including structural health monitoring, more complex sensors that usually employ medium to high frequency sampling and post-processing are required. Additionally, to capture an event completely several sensors of different types are needed which have to be in range of the event and used in a timely manner. We study the problem of time-bounded and space-bounded sensing where parallel use of different sensors on the same node is impossible and not all nodes possess all required sensors. We provide a model formalizing the requirements and present algorithms for spatial grouping and temporal scheduling to tackle these problems.
We compare the performance of standard data compression techniques in the presence of communication failures. Their performance is inferior to sending data without compression when the packet loss rate of a link is ab...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
We compare the performance of standard data compression techniques in the presence of communication failures. Their performance is inferior to sending data without compression when the packet loss rate of a link is above 10%. We have developed fault-tolerant compression algorithms for sensor networks that are robust against packet loss and achieve low delays in data decoding, thus being particularly suitable for time-critical applications. We show the advantage of our technique by providing results from our extensive experimental evaluation using real sensor datasets.
Wireless sensor networks have many applications. In this paper, we are particularly interested in a sensor network which is used for monitoring a field to detect intrusion objects such as enemy tanks, enemy cars, etc....
详细信息
Reputation and Trust-based Monitoring systems (RTMSs) have provided a ubiquitous framework for secure Wireless sensor Network (WSN) computing. Employing sensors for neighborhood monitoring, which is secondary to their...
详细信息
sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make optimizing query processing particula...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make optimizing query processing particularly important. This paper addresses for the first time, multi-root, multi-query optimization for long duration aggregation queries. The paper formulates three algorithms - naive algorithm (NMQ), which does not exploit any query result sharing, and two proposed new algorithms: an optimal algorithm (OMQ) and a heuristic (zone-based) algorithm (ZMQ). The heuristic algorithm is based on sharing the partially aggregated results of pre-configured geographic regions and exploits the novel idea of applying a grouping technique by using the location attribute of sensor nodes as the grouping criterion. Extensive simulations indicate that the proposed algorithms provide significant energy savings under a wide range of sensor network deployments and query region options.
Location-dependent spatial query in the wireless environment is that mobile users query the spatial objects dependent on their current location. The window query is one of the essential spatial queries, which finds sp...
详细信息
The proceedings contain 102 papers. The topics discussed include: computer science as a lens on the sciences;real-time detection of clone attacks in wireless sensor networks;comparing symmetric-key and public-key base...
详细信息
ISBN:
(纸本)9780769531724
The proceedings contain 102 papers. The topics discussed include: computer science as a lens on the sciences;real-time detection of clone attacks in wireless sensor networks;comparing symmetric-key and public-key based security schemes in sensor networks: a case study of user access control;securing wireless data networks against eavesdropping using smart antennas;on security vulnerabilities of null data frames in ieee 802.11 based WLANs;identifying frequent items in P2P systems;on the impact of mobile hosts in peer-to-peer data networks;is random scheduling sufficient in P2P video streaming?;circumventing server bottlenecks;indirect large-scale P2P data collection;detecting click fraud in pay-per-click streams of online advertising networks;exploring anti-spam models in large scale VoIP systems;distributed divide-and-conquer techniques for effective DDoS attack defenses;and mobility-assisted spatiotemporal detection in wireless sensor networks.
暂无评论