Energy consumption is a crucial issue of mobile surveillance cameras owing to limited battery capacity. The lifetime of the system is significantly extended by the event-driven operation; the system mostly stays in sleep mode and wakes up only when an event is detected. In this paper, we propose a design of a low-energy surveillance camera that records events such as the abnormal movement of objects, or physical damage to the camera itself. Unlike conventional event-driven approaches, the proposed system records video from 10 seconds before the event detection because the most critical information is often before or at the moment of event detection, not after the detection. Two different encoders, a low-power encoder and a high-compression encoder, are employed together to implement the low-energy surveillance camera. Experimental results show that the energy consumption of the whole system is reduced by up to 74.9% (by 66.8% on average) compared with conventional always-on system.

An increasing number of recent experimental works have demonstrated that the supposedly secure channels in the Internet are prone to privacy breaking under many respects, due to packet traffic features leaking information on the user activity and traffic content. We aim at understanding if and how complex it is to obfuscate the information leaked by packet traffic features, namely packet lengths, directions, and times: we call this technique traffic masking. We define a security model that points out what the ideal target of masking is, and then define the optimized traffic masking algorithm that removes any leaking (full masking). Further, we investigate the tradeoff between traffic privacy protection and masking cost, namely required amount of overhead and realization complexity/feasibility. Numerical results are based on measured Internet traffic traces. Major findings are that: 1) optimized full masking achieves similar overhead values with padding only and in case fragmentation is allowed, and 2) if practical realizability is accounted for, optimized statistical masking attains only moderately better overhead than simple fixed pattern masking does, while still leaking correlation information that can be exploited by the adversary.

The ZigBee tree routing is widely used in many resource-limited devices and applications, since it does not require any routing table and route discovery overhead to send a packet to the destination. However, the ZigBee tree routing has the fundamental limitation that a packet follows the tree topology; thus, it cannot provide the optimal routing path. In this paper, we propose the shortcut tree routing (STR) protocol that provides the near optimal routing path as well as maintains the advantages of the ZigBee tree routing such as no route discovery overhead and low memory consumption. The main idea of the shortcut tree routing is to calculate remaining hops from an arbitrary source to the destination using the hierarchical addressing scheme in ZigBee, and each source or intermediate node forwards a packet to the neighbor node with the smallest remaining hops in its neighbor table. The shortcut tree routing is fully distributed and compatible with ZigBee standard in that it only utilizes addressing scheme and neighbor table without any changes of the specification. The mathematical analysis proves that the 1-hop neighbor information improves overall network performances by providing an efficient routing path and distributing the traffic load concentrated on the tree links. In the performance evaluation, we show that the shortcut tree routing achieves the comparable performance to AODV with limited overhead of neighbor table maintenance as well as overwhelms the ZigBee tree routing in all the network conditions such as network density, network configurations, traffic type, and the network traffic.

In wireless sensor networks, a periodic broadcast message or a beacon with strict time requirement can be con- tinuously collided when there are multiple nodes with the same period in the same space. This type of collision prevents a network from operating normally: a node is unable to join a network, and a network topology breaks if the periodic message contains critical information such as network and timing parameters as in IEEE 802.15.4. We show that the affected area by the collision occupies significant percentage of an original service area. This paper proposes a new algorithm to solve the permanent collision problem in periodic broadcasting or beaconing. The proposed stochastic beacon algorithm avoids the collision by incorporating randomness in beacon transmission while main- taining a fixed beacon period. The algorithm is evaluated by analysis and simulation based on IEEE 802.15.4, and compared with other 7 methods. The results show that our algorithm can avoid permanent beacon collision and reduces substantially the collision probability with very low added complexity.