Optimization-Based Channel Constrained Data Aggregation Routing Algorithms in Multi-Radio Wireless Sensor Networks

Abstract

In wireless sensor networks, data aggregation routing could reduce the number of data transmissions so as to achieve energy efficient transmission. However, data aggregation introduces data retransmission that is caused by co-channel interference from neighboring sensor nodes. This kind of co-channel interference could result in extra energy consumption and significant latency from retransmission. This will jeopardize the benefits of data aggregation. One possible solution to circumvent data retransmission caused by co-channel interference is to assign different channels to every sensor node that is within each other's interference range on the data aggregation tree. By associating each radio with a different channel, a sensor node could receive data from all the children nodes on the data aggregation tree simultaneously. This could reduce the latency from the data source nodes back to the sink so as to meet the user's delay QoS. Since the number of radios on each sensor node and the number of non-overlapping channels are all limited resources in wireless sensor networks, a challenging question here is to minimize the total transmission cost under limited number of non-overlapping channels in multi-radio wireless sensor networks. This channel constrained data aggregation routing problem in multi-radio wireless sensor networks is an NP-hard problem. I first model this problem as a mixed integer and linear programming problem where the objective is to minimize the total transmission subject to the data aggregation routing, channel and radio resources constraints. The solution approach is based on the Lagrangean relaxation technique to relax some constraints into the objective function and then to derive a set of independent subproblems. By optimally solving these subproblems, it can not only calculate the lower bound of the original primal problem but also provide useful information to get the primal feasible solutions. By incorporating these Lagrangean multipliers as the link arc weight, the optimization-based heuristics are proposed to get energy-efficient data aggregation tree with better resource (channel and radio) utilization. From the computational experiments, the proposed optimization-based approach is superior to existing heuristics under all tested cases.

Research on Payload Aggregation of Packets in WSNs

“…In paper (Vuran and Akyildiz 2008) and (Vuran and Akyildiz 2006), FEC schemes are evaluated for multi-hop communication. The benefits of packet aggregation is also investigated in (Galluccio and Palazzo 2009), (Yen 2008) and (Geibig and Bradler 2010).…”

Wireless Sensor Network Optimization: Multi-Objective Paradigm

“…Due to the limited on-board resources, the designing, deployment and the operations of WSNs become challenging, while simultaneously providing the quality of service requirements [ 21 , 22 ]. Researchers have proposed and adopted various techniques in order to utilize the resource constrained WSNs efficiently [ 23 – 27 ]. For example, [ 26 ] has proposed a multi-objective hybrid optimization algorithm to solve the coverage and connectivity problem and to enhance the performance of the WSNs in terms of network life time, by joining a multi-objective on-demand algorithm employing Genetic Algorithm (GA) and a local on line algorithm.…”

Combining Wireless Sensor Networks and Semantic Middleware for an Internet of Things-Based Sportsman/Woman Monitoring Application

“…Among the many classifications of applications in WSNs suggested by the research community, Yen's, distinguishing among event-driven and random-source applications, is one of the most suitable for our semantic middleware architecture [7]—despite being at the middleware level rather than at the application one since the ubiquitous middleware architecture that is mounted on the WSN in the context of our research project is a random-source application mixing a periodic scenario–where data is requested by an internal node every fixed period of time- and a query- based one where the final human user will request services to the system making use of the Wireless Sensor Network—along with having some elements of non-simultaneous data aggregation routing.…”