Dynamic Task Allocation in Multi-Hop Multimedia Wireless Sensor Networks with Low Mobility

Yichao Jin; Vural, Serdar; Gluhak, Alexander; Moessner, Klaus
October 2013
Sensors (14248220);Oct2013, Vol. 13 Issue 10, p13998
Academic Journal
This paper presents a task allocation-oriented framework to enable efficient in-network processing and cost-effective multi-hop resource sharing for dynamic multi-hop multimedia wireless sensor networks with low node mobility, e.g., pedestrian speeds. The proposed system incorporates a fast task reallocation algorithm to quickly recover from possible network service disruptions, such as node or link failures. An evolutional self-learning mechanism based on a genetic algorithm continuously adapts the system parameters in order to meet the desired application delay requirements, while also achieving a sufficiently long network lifetime. Since the algorithm runtime incurs considerable time delay while updating task assignments, we introduce an adaptive window size to limit the delay periods and ensure an up-to-date solution based on node mobility patterns and device processing capabilities. To the best of our knowledge, this is the first study that yields multi-objective task allocation in a mobile multi-hop wireless environment under dynamic conditions. Simulations are performed in various settings, and the results show considerable performance improvement in extending network lifetime compared to heuristic mechanisms. Furthermore, the proposed framework provides noticeable reduction in the frequency of missing application deadlines.


Related Articles

  • Target Localization in Wireless Sensor Networks for Industrial Control with Selected Sensors. Zhenxing Luo; Paul S. Min; Shu-Jun Liu // International Journal of Distributed Sensor Networks;2013, p1 

    This paper presents a novel energy-based target localization method in wireless sensor networks with selected sensors. In this method, sensors use Turbo Product Code (TPC) to transmit decisions to the fusion center. TPC can reduce bit error probability if communication channel errors exist....

  • Trust-based Relay Selection in Relay-based Networks. Di Wu; Gang Zhu; Li Zhu; Bo Ai // KSII Transactions on Internet & Information Systems;Oct2012, Vol. 6 Issue 10, p2587 

    It has been demonstrated that choosing an appropriate relay node can improve the transmission rate for the system. However, such system improvement brought by the relay selection may be degraded with the presence of the malicious relay nodes, which are selected but refuse to cooperate for...

  • Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information. Baoqi Huang; Wei Wu; Guanglai Gao; Tao Zhang // International Journal of Distributed Sensor Networks;2014, p1 

    This paper develops an efficient and distributed boundary detection algorithm to precisely recognize wireless sensor network (WSN) boundaries using only local connectivity information. Specifically, given any node in a WSN, the proposed algorithm constructs its 2-hop isocontour and locally makes...

  • Minimum Data Aggregation Schedule in Wireless Sensor Networks. Min Kyung An; Lam, Nhat X.; Huynh, D. T.; Nguyen, Trac N. // International Journal for Computers & Their Applications;Dec2011, Vol. 18 Issue 4, p254 

    Data aggregation is one of the crucial applications in Wireless Sensor Networks (WSNs). It therefore has been the focus of many researchers. An important issue concerning data aggregation is how to assign appropriate time slots to the nodes so that data transmission in the network is free of any...

  • Heuristic Algorithms for Constructing Interference-Free and Delay-Constrained Multicast Trees for Wireless Mesh Networks. Wen-Lin Yang; Chi-Chou Kao; Cheng-Huang Tung // KSII Transactions on Internet & Information Systems;Feb2011, Vol. 5 Issue 2, p269 

    In this paper, we study a problem that is concerning how to construct a delay-constrained multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is maximized. In order to support high-quality and concurrent interference-free transmission streams, multiple radios...

  • Coordinated dual-homing in designing hierarchical wireless access network with a genetic algorithm based approach. Hasan, Mohammad M.; Huang, Xiaodong; Jue, Jason P. // Telecommunication Systems;Dec2013, Vol. 54 Issue 4, p417 

    With the growth of mobile users and the increasing deployment of wireless access network infrastructures, the issue of fault tolerance is becoming an important component of efficient wireless access network design. In this work, we study a survivable hierarchical network design problem. Given...

  • Minimizing tardiness in data aggregation scheduling with due date consideration for single-hop wireless sensor networks. Su, Sheng; Yu, Haijie // Wireless Networks (10220038);May2015, Vol. 21 Issue 4, p1259 

    Due date of data delivery is a key factor in timeliness-crucial wireless sensor networks (e.g. battlefield sensor networks, cyber-physical systems, and wireless multimedia sensor networks). Data aggregation is a well-known methodology to reduce transmission time. However, the decrease of...

  • An approach for near-optimal distributed data fusion in wireless sensor networks. Gavalas, Damianos; Mpitziopoulos, Aristides; Pantziou, Grammati; Konstantopoulos, Charalampos // Wireless Networks (10220038);Jul2010, Vol. 16 Issue 5, p1407 

    In wireless sensor networks (WSNs), a lot of sensory traffic with redundancy is produced due to massive node density and their diverse placement. This causes the decline of scarce network resources such as bandwidth and energy, thus decreasing the lifetime of sensor network. Recently, the mobile...

  • On the Deployment of a Connected Sensor Network for Confident Information Coverage. Huping Xu; Jiajun Zhu; Bang Wang // Sensors (14248220);2015, Vol. 15 Issue 5, p11277 

    Coverage and connectivity are two important performance metrics in wireless sensor networks. In this paper, we study the sensor placement problem to achieve both coverage and connectivity. Instead of using the simplistic disk coverage model, we use our recently proposed confident information...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics