[show abstract][hide abstract] ABSTRACT: A novel and rapidly growing area of research concerns data-intensive applications and the technical challenges that accompany it. One of those challenges is developing approaches and mechanisms that render high performance in processing and storing data. We joined this research effort by proposing a reconfigurable active solid state drives (RASSD) system that deals with such applications, through employing basic hardware, namely FPGA's connected to SSD's, to service the above applications as processing nodes, and take advantage of the close proximity between storage and processing. In this paper, we propose an intelligent middleware system for interfacing workstation-based and mobile applications to the distributed RASSD system. In order to provide high performance in terms of time and functionality, the middleware manages the data processing on the RASSD nodes through special pieces of code that we call drivelets, along with FPGA configuration files (bitstreams). Another important responsibility of the proposed middleware architecture lies in the unguided management of applications' flows, where it uses an intelligent script-parsing mechanism to turn one general request from the client into a sequence of operations needed to generate the required results. The middleware design allows for the integration of mobile applications into the overall architecture of the RASSD system, and allowing them to run data intensive applications that otherwise it is unfeasible for them to execute. We validate our design by comparing it to an existing middleware architecture, and present two use-cases with their results and discussion.
2013 22nd International Conference on Computer Communications and Networks (ICCCN),, Nassau, Bahamas; 07/2013
[show abstract][hide abstract] ABSTRACT: Data Acquisition and delivery in Vehicular Ad hoc Networks (VANETs) is an important topic that has received very little attention. In ,we proposed a system in which roadside units (RSUs) were exploited to satisfy the various requests of VANET users. Our approach uses RSUs as delegates to acquire services from service providers without the users connecting to them. Users' interests range from email messages, news, web downloading, business transactions, multimedia sharing, traffic or weather information, etc… Depending on RSUs to obtain users' data puts a huge load on the RSU network and might lead to a scalability problem, especially with the large number of users in VANETs. In this paper, we build on the approach in  and propose an RSU scheduling mechanism in which an RSU builds a schedule that is divided into time-slots (TSs). In each TS, all users that are expected to connect to the VANET are specified. Hence, an RSU prepares users' data and caches them during a free TS before the users connect. The users' connection times are derived from observing their actual connections. Our approach was tested using ns2 to assess its efficiency.
[show abstract][hide abstract] ABSTRACT: Vehicular Ad hoc Networks, also known as VANETs, enable vehicles that are not necessarily within the same radio transmission range to communicate with each other. VANETs also allow vehicles to connect to Roadside Units (RSUs). The latter are connected to the Internet, forming a fixed infrastructure that offers them the capability of communicating with each other and with roaming vehicles. RSUs support cooperative and distributed applications in which vehicles and RSUs work together to coordinate actions and to share and process several types of information. RSUs have so far been used for different roles such as data disseminators, traffic directories, location servers, security managers, and service proxies. In this paper, we focus on routing; namely we exploit RSUs to route packets between any source and destination in the VANET. To our knowledge, this is the first attempt to use the RSU backbone to efficiently route packets to very far locations in VANETs by using geographic forwarding. We evaluate the RSU backbone routing performance via the ns2 simulation platform. We compare our scheme to existing solutions and prove the feasibility and efficiency of our scheme in terms of query delay, packet success delivery ratio, and total generated traffic.
[show abstract][hide abstract] ABSTRACT: Vehicular ad hoc networks (VANETs) enable vehicles that are not necessarily within the same radio transmission range to communicate with each other and with roadside units (RSUs). The success of data acquisition and delivery systems in VANETs depends on their ability to defend against the different types of security and privacy attacks. The security of safety messages (like emergency and traffic information) has been the concern of VANET security researchers, and very few works dealt with the security of data messages exchanged between users and the infrastructure. This paper introduces a system that takes advantage of the RSUs that are connected to the internet and provide various types of information to VANET users. We provide a suite of novel security and privacy mechanisms in our proposed system, and evaluate its performance using the ns2 software. We demonstrate through comparing its results to those of another system its feasibility and efficiency.
Wireless and Mobile Computing, Networking and Communications (WiMob), 2011 IEEE 7th International Conference on; 11/2011
[show abstract][hide abstract] ABSTRACT: In the near future vehicular networks (VANETs) based on wireless technology will be part of our daily lives. VANETs enable vehicles that are not necessarily within the same transmission range to communicate with each other. They also allow vehicles to connect to Roadside Units (RSUs), which are connected to the Internet, forming a backbone mesh that offers the capability of communicating with each other and with roaming vehicles. In this paper, we exploit the RSU network to efficiently route packets between far away vehicles in the VANET. We evaluate our system using ns2 simulation, and compare it to existing solutions. The results demonstrate the feasibility and efficiency of our proposed scheme in terms of query delay, packet delivery ratio, and generated traffic.
ITS Telecommunications (ITST), 2011 11th International Conference on; 09/2011
[show abstract][hide abstract] ABSTRACT: In wireless mobile ad hoc networks (MANETs), a mobile node would normally acquire data from a data server through an access point by sending the server a request each time it needs data. To reduce the high costs normally associated with accessing remote servers (i.e., outside the MANET), data caching by the mobile nodes can be employed. Several caching techniques for MANETs have been proposed and implemented, including a cooperative scheme that we recently introduced. It employs a directory-based approach in which submitted queries are cached in the MANET to be used subsequently as indexes to corresponding data items (results). When a request is issued, nodes cooperate to find its answer (if it exists) and send it to the requesting node. In this paper, we extend this scheme by semantically comparing each submitted request with all cached queries. The semantic analysis process includes trimming the request into fragments and joining the answers of these fragments to produce the answer of the request. We study the performance of the proposed system both analytically and experimentally, and prove the advantageous features of the system relative to others in terms of query response time, generated traffic, and hit ratio.
[show abstract][hide abstract] ABSTRACT: Vehicular ad hoc networks, also known as VANETs, enable vehicles which are not necessarily within the same radio transmission range to communicate with each other. In addition to allowing direct communication between vehicles, VANETs also enable vehicles to connect to Roadside Units (RSUs) which are inexpensive infrastructure that have the capability of communicating with each others and with passing by vehicles. RSUs have so far been used for various purposes such as information disseminators, traffic directories, security providers, and service directories that store information about service providers. In this paper, we propose a system that uses RSUs as delegates of users in a VANET to acquire services from service providers without the users directly connecting to them. Since some of these services may require user authentication with the corresponding service providers, the system implements a method for allowing RSUs to use the user's credentials to get the requested services without jeopardizing the user's privacy. We evaluated the performance of the proposed system using the ns2 simulation software and demonstrated through comparing the results to those of an existing system the feasibility and efficiency of the new system in terms of query delay and traffic generation.
Telecommunications (ICT), 2010 IEEE 17th International Conference on; 05/2010
[show abstract][hide abstract] ABSTRACT: This paper proposes a cache consistency scheme based on a previously proposed architecture for caching database data in MANETs. The original scheme for data caching stores the queries that are submitted by requesting nodes in special nodes, called query directories (QDs), and uses these queries to locate the data (responses) that are stored in the nodes that requested them, called caching nodes (CNs). The consistency scheme is server-based in which control mechanisms are implemented to adapt the process of caching a data item and updating it by the server to its popularity and its data update rate at the server. The system implements methods to handle disconnections of QD and CN nodes from the network and to control how the cache of each node is updated or discarded when it returns to the network. Estimates for the average response time of node requests and the average node bandwidth utilization are derived in order to determine the gains (or costs) of employing our scheme in the MANET. Moreover, ns2 simulations were performed to measure several parameters, like the average data request response time, cache update delay, hit ratio, and bandwidth utilization. The results demonstrate the advantage of the proposed scheme over existing systems.
[show abstract][hide abstract] ABSTRACT: This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data. Numerical analysis and experimental evaluations using the network simulation software ns2 were performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF). The results agreed with the numerical analysis results and demonstrated that MDPF offers significant hop count savings and smaller delays when compared to RPF and MSTF.
[show abstract][hide abstract] ABSTRACT: Service discovery is indispensable to ad hoc networking where establishing a stand-alone and self-configurable communication environment is the main objective. This paper concentrates on designing a distributed service discovery model for service sharing among diverse mobile devices in mobile ad hoc networks. This model is built on top of the network layer of the TCP/IP stack and benefits from the up-to-date routing information enabled by proactive routing protocols that attempt to keep the information in the routing tables of the mobile nodes current. The designed system is based on storing service descriptions in selected nodes that are searched in accordance to a proposed Minimum Distance Packet Forwarding (MDPF) algorithm. In addition to identifying and analyzing the design parameters of the system, this paper studies the delay and traffic performance using analytical derivations and experimental evaluation based on the ns-2 network simulation software. The system is intended to be used in a collaborative mobile ad hoc network environment whereby a mobile node can consume services, share them, or facilitate such sharing by helping other nodes find them.
IEEE Transactions on Parallel and Distributed Systems 10/2008; 19(9):1224-1236. · 1.80 Impact Factor
[show abstract][hide abstract] ABSTRACT: This paper introduces a cooperation-based database caching system for Mobile Ad Hoc Networks (MANETs). The heart of the system is the nodes that cache submitted queries. The queries are used as indices to data cached in nodes that previously requested them. We discuss how the system is formed and how requested data is found if cached, or retrieved from the external database and then cached. Analysis is performed and expressions are derived for the different parameters, including upper and lower bounds for the number of query caching nodes as well as the average load they experience, generated network traffic, node bandwidth consumption, and other performance-related measures. Simulations with the ns-2 software were used to study the performance of the system in terms of average delay and hit ratio, and to compare it with the performance of two other caching schemes for MANETs, namely CachePath and CacheData. The results demonstrate the effectiveness of the proposed system in terms of achieved hit ratio and low delay.
IEEE Transactions on Mobile Computing 09/2008; 7(8):961-977. · 2.40 Impact Factor
[show abstract][hide abstract] ABSTRACT: Mobile ad hoc networks, as a typical example of self-organized networks, represent an emerging and promising communication paradigm. Not only the variety of devices but also the diversity of services is continuously increasing. Such services must be provisioned in a flexible and distributed way without a central infrastructure. The discovery of such services is an involved task since it must cope with the high level of mobile device heterogeneity, degree of mobility, and take the limited device resources into account. In this paper, we propose a decentralized and scalable service discovery and invocation framework for ad hoc networks of clustered mobile devices. The basic idea is to use the clusterheads as service directory nodes to assist mobile nodes in the network in finding desired services. In addition to storing the descriptions of services that fall in their clusters, clusterheads also cache descriptions of services that are retrieved from other clusters as they are requested. Experimental analyses are conducted to study the performance of the proposed architecture and to compare it with the broadcast-based model that has been extensively studied in the literature.
Wireless and Mobile Computing, Networking and Communications, 2007. WiMOB 2007. Third IEEE International Conference on; 11/2007