Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Computer Engineering
Snail Algorithm For Task Allocation In Mesh Networks, Bartosz Duszel
Snail Algorithm For Task Allocation In Mesh Networks, Bartosz Duszel
UNLV Theses, Dissertations, Professional Papers, and Capstones
Topic of this master's thesis is connected with task allocation algorithms and mesh networks. Author of this work has already graduated from Wroclaw, University of Technology (Poland) where during his studies he created software simulation environment for two different task allocation algorithms for mesh networks:Adaptive ScanandFrame Sliding. Those algorithms were compared by two, main parame- ters: simulation time and average mesh fulfillment (utilization level). All simulations were done in software environment which was developed specially for that research. This application was based on few, different types of objects: task (width, height, processing time), task queue (different number of tasks), task …
Approximate Techniques In Solving Optimal Camera Placement Problems, Jian Zhao, Ruriko Yoshida, Sen-Ching Samson Cheung, David Haws
Approximate Techniques In Solving Optimal Camera Placement Problems, Jian Zhao, Ruriko Yoshida, Sen-Ching Samson Cheung, David Haws
Statistics Faculty Publications
While the theoretical foundation of the optimal camera placement problem has been studied for decades, its practical implementation has recently attracted significant research interest due to the increasing popularity of visual sensor networks. The most flexible formulation of finding the optimal camera placement is based on a binary integer programming (BIP) problem. Despite the flexibility, most of the resulting BIP problems are NP-hard and any such formulations of reasonable size are not amenable to exact solutions. There exists a myriad of approximate algorithms for BIP problems, but their applications, efficiency, and scalability in solving camera placement are poorly understood. Thus, …
Energy Efficiency Performance Improvements For Ant-Based Routing Algorithm In Wireless Sensor Networks, A. M. Zungeru, Kah Phooi Seng, Li-Minn Ang, W.C. Chia
Energy Efficiency Performance Improvements For Ant-Based Routing Algorithm In Wireless Sensor Networks, A. M. Zungeru, Kah Phooi Seng, Li-Minn Ang, W.C. Chia
Research outputs 2013
The main problem for event gathering in wireless sensor networks (WSNs) is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR) algorithm, based on the ant colony optimization (ACO) metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1) a new scheme to intelligently initialize …