Waleed Alsalih
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Waleed Alsalih has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hossam S. Hassanein
School of Computing, Queens University, Kingston, ON, Canada
2 shared publications - Selim G. Akl
Queen’s University
2 shared publications Hossam Hassanein
Room 627, Goodwin Hall, Queen's University, Kingston, Ontario K7L 3N6, Canada
1 shared publicationSelim Akl
Room 627, Goodwin Hall, Queen's University, Kingston, Ontario K7L 3N6, Canada
1 shared publication
Latest Publications
- 23 July 2008
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 8 (8) , 1011-1022
Placement of multiple mobile data collectors in underwater acoustic sensor networks
- 23 July 2008
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 8 (8) , 1011-1022
Placement of multiple mobile data collectors in underwater acoustic sensor networks
- 16 January 2008
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 23 (1) , 59-79
Cooperativead hoccomputing: towards enabling cooperative processing in wireless environments
Mobile applications are becoming more popular as they provide the convenience of accessing services and information anywhere and at anytime. However, due to size and weight restrictions, mobile computing devices are limited in terms of battery energy and processing power. Running complex applications on resource-limited mobile computing devices is a real challenge. This paper proposes a cooperative paradigm for ad hoc computing in which a set of heterogeneous computing devices form a cooperative system on the fly, and whenever a resource-limited computing device in such a system has a resource-consuming application to be run, it uses resources of other devices to surmount the problem of resource limitation. To study the potential capability of this paradigm, we have designed energy-aware allocation and scheduling algorithms to make the most of all available resources in such a cooperative environment. These algorithms are static in the sense that they are based on discrete snapshots of the system topology. Although we consider these algorithms as preliminary work towards our objective of enabling cooperative computing, they have shown exciting results that encourage us to pursue our study. The main contributions of this paper are the novel allocation and scheduling algorithms which form a pioneering work towards enabling energy-aware cooperative processing in mobile computing environments.
- 16 January 2008
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 23 (1) , 59-79
Cooperativead hoccomputing: towards enabling cooperative processing in wireless environments
Mobile applications are becoming more popular as they provide the convenience of accessing services and information anywhere and at anytime. However, due to size and weight restrictions, mobile computing devices are limited in terms of battery energy and processing power. Running complex applications on resource-limited mobile computing devices is a real challenge. This paper proposes a cooperative paradigm for ad hoc computing in which a set of heterogeneous computing devices form a cooperative system on the fly, and whenever a resource-limited computing device in such a system has a resource-consuming application to be run, it uses resources of other devices to surmount the problem of resource limitation. To study the potential capability of this paradigm, we have designed energy-aware allocation and scheduling algorithms to make the most of all available resources in such a cooperative environment. These algorithms are static in the sense that they are based on discrete snapshots of the system topology. Although we consider these algorithms as preliminary work towards our objective of enabling cooperative computing, they have shown exciting results that encourage us to pursue our study. The main contributions of this paper are the novel allocation and scheduling algorithms which form a pioneering work towards enabling energy-aware cooperative processing in mobile computing environments.
- 1 December 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21627843,p. 229-233
Placement of multiple mobile base stations in wireless sensor networks
Due to energy constraints in individual sensor nodes, extending the lifetime is an essential objective in wireless sensor networks (WSNs). Several proposals have aimed at that objective by designing energy efficient protocols at the physical, medium access, and network layers. While the proposed protocols achieve significant energy savings for individual sensor nodes, they fail to solve topology-related problems; an example of such problems is that sensor nodes around the base station become bottlenecks and deplete their battery energy much faster than other nodes. A natural solution to such a problem is to have multiple mobile base stations so that the load is distributed evenly among all nodes. Only few proposals have followed that direction. In this paper we propose a mobile base station placement scheme for extending the lifetime of the network. In our scheme the life of the network is divided into rounds and base stations are moved to new locations at the beginning of each round. While previous work has focused on placing the base stations at predefined spots (e.g., the work in [1]) or at the boundary of the network (e.g., the work in [2]), we define and solve a more general problem in which a base station can be placed anywhere in the sensing field. We formulate the problem as an Integer Linear Program (ILP) and use an ILP solver (with a constant time limit) to find a near-optimal placement of the base stations and to find routing patterns to deliver collected data to base stations. Our experiments show that our scheme makes significant extension to the lifetime of the network.
- 1 December 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21627843,p. 229-233
Placement of multiple mobile base stations in wireless sensor networks
Due to energy constraints in individual sensor nodes, extending the lifetime is an essential objective in wireless sensor networks (WSNs). Several proposals have aimed at that objective by designing energy efficient protocols at the physical, medium access, and network layers. While the proposed protocols achieve significant energy savings for individual sensor nodes, they fail to solve topology-related problems; an example of such problems is that sensor nodes around the base station become bottlenecks and deplete their battery energy much faster than other nodes. A natural solution to such a problem is to have multiple mobile base stations so that the load is distributed evenly among all nodes. Only few proposals have followed that direction. In this paper we propose a mobile base station placement scheme for extending the lifetime of the network. In our scheme the life of the network is divided into rounds and base stations are moved to new locations at the beginning of each round. While previous work has focused on placing the base stations at predefined spots (e.g., the work in [1]) or at the boundary of the network (e.g., the work in [2]), we define and solve a more general problem in which a base station can be placed anywhere in the sensing field. We formulate the problem as an Integer Linear Program (ILP) and use an ILP solver (with a constant time limit) to find a near-optimal placement of the base stations and to find routing patterns to deliver collected data to base stations. Our experiments show that our scheme makes significant extension to the lifetime of the network.