Abstract: Conceiving and developing routing protocols for
wireless sensor networks requires considerations on constraints such
as network lifetime and energy consumption. In this paper, we propose
a hybrid hierarchical routing protocol named HHRP combining both
clustering mechanism and multipath optimization taking into account
residual energy and RSSI measures. HHRP consists of classifying
dynamically nodes into clusters where coordinators nodes with extra
privileges are able to manipulate messages, aggregate data and ensure
transmission between nodes according to TDMA and CDMA
schedules. The reconfiguration of the network is carried out
dynamically based on a threshold value which is associated with the
number of nodes belonging to the smallest cluster. To show the
effectiveness of the proposed approach HHRP, a comparative study
with LEACH protocol is illustrated in simulations.
Abstract: In this paper, we present a matrix game-theoretic cross-layer optimization formulation to maximize the network lifetime in wireless ad hoc networks with network coding. To this end, we introduce a cross-layer formulation of general NUM (network utility maximization) that accommodates routing, scheduling, and stream control from different layers in the coded networks. Specifically, for the scheduling problem and then the objective function involved, we develop a matrix game with the strategy sets of the players corresponding to hyperlinks and transmission modes, and design the payoffs specific to the lifetime. In particular, with the inherit merit that matrix game can be solved with linear programming, our cross-layer programming formulation can benefit from both game-based and NUM-based approaches at the same time by cooperating the programming model for the matrix game with that for the other layers in a consistent framework. Finally, our numerical example demonstrates its performance results on a well-known wireless butterfly network to verify the cross-layer optimization scheme.
Abstract: Wireless sensor network can be applied to both abominable
and military environments. A primary goal in the design of
wireless sensor networks is lifetime maximization, constrained by
the energy capacity of batteries. One well-known method to reduce
energy consumption in such networks is data aggregation. Providing
efcient data aggregation while preserving data privacy is a challenging
problem in wireless sensor networks research. In this paper,
we present privacy-preserving data aggregation scheme for additive
aggregation functions. The Cluster-based Private Data Aggregation
(CPDA)leverages clustering protocol and algebraic properties of
polynomials. It has the advantage of incurring less communication
overhead. The goal of our work is to bridge the gap between
collaborative data collection by wireless sensor networks and data
privacy. We present simulation results of our schemes and compare
their performance to a typical data aggregation scheme TAG, where
no data privacy protection is provided. Results show the efficacy and
efficiency of our schemes.