Khaled Almiani

Learn More
Several studies in recent years have considered the use of mobile elements for data gathering in wireless sensor networks, so as to reduce the need for multi-hop forwarding among the sensor nodes and thereby prolong the network lifetime. Since, typically, practical constraints preclude a mobile element from visiting all nodes in the sensor network, the(More)
Wireless sensor networks (WSNs) consist of miniature devices with sensing, computation and wireless communication capabilities. They are typically designed for hostile environments, where recharging a node is impractical. Thus, energy efficiency is vital. For substantial energy savings, cross-layer information sharing and in-network processing among sensors(More)
We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need to be delivered to a predefined sink within a given time interval from the time the measurement takes place. Mobile elements travel the network in predefined paths, collect the data(More)
Recently, using mobile gateway(s) as a mechanical data carries emerges as a promising approach to prolong sensor network lifetime and relaying information in partitioned network. These mobile gateways, which move in pre-determined paths, visit the sensors to upload their data. As the sensors data generation rate for different sensors may vary based on their(More)
In sensor network applications, data gathering mechanisms, which are based on multi-hop forwarding, can be expensive in terms of energy. This limitation challenges the use of sensor networks for applications that demand a predefined operational-lifetime. To avoid this problem, using of Mobile Element (ME) as a mechanical data carrier has emerged as a(More)
We consider the problem of planning a set of tours (closed paths) through a network such that every node is at most l-hops away from at least one tour, and all tours are connected. A set of tours is called connected in this work, if there exists a path between any two nodes on the tour that is completely within the set of tours. In other words, in a(More)
We consider a variant of the data gathering problem in sensor networks using multiple mobile elements, where each sensor must be visited with a given minimum frequency. We will construct solutions to this problem where the network is partitioned to possibly several regions, so that a single mobile element visits every node within each region. Therefore we(More)
In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node(More)