This page has only limited features, please log in for full access.
Under present-day practices, the vehicles on our roadways and city streets are mere spectators that witness traffic-related events without being able to participate in the mitigation of their effect. This paper lays the theoretical foundations of a framework for harnessing the on-board computational resources in vehicles stuck in urban congestion in order to assist transportation agencies with preventing or dissipating congestion through large-scale signal re-timing. Our framework is called VACCS: Vehicular Crowdsourcing for Congestion Support in Smart Cities. What makes this framework unique is that we suggest that in such situations the vehicles have the potential to cooperate with various transportation authorities to solve problems that otherwise would either take an inordinate amount of time to solve or cannot be solved for lack for adequate municipal resources. VACCS offers direct benefits to both the driving public and the Smart City. By developing timing plans that respond to current traffic conditions, overall traffic flow will improve, carbon emissions will be reduced, and economic impacts of congestion on citizens and businesses will be lessened. It is expected that drivers will be willing to donate under-utilized on-board computing resources in their vehicles to develop improved signal timing plans in return for the direct benefits of time savings and reduced fuel consumption costs. VACCS allows the Smart City to dynamically respond to traffic conditions while simultaneously reducing investments in the computational resources that would be required for traditional adaptive traffic signal control systems.
Stephan Olariu. Vehicular Crowdsourcing for Congestion Support in Smart Cities. Smart Cities 2021, 4, 662 -685.
AMA StyleStephan Olariu. Vehicular Crowdsourcing for Congestion Support in Smart Cities. Smart Cities. 2021; 4 (2):662-685.
Chicago/Turabian StyleStephan Olariu. 2021. "Vehicular Crowdsourcing for Congestion Support in Smart Cities." Smart Cities 4, no. 2: 662-685.
The Internet of Things (IoT) has come of age, and complex solutions can now be implemented seamlessly within urban governance and management frameworks and processes. For cities, growing rates of car ownership are rendering parking availability a challenge and lowering the quality of life through increased carbon emissions. The development of smart parking solutions is thus necessary to reduce the time spent looking for parking and to reduce greenhouse gas emissions. The principal role of this research paper is to analyze smart parking solutions from a technical perspective, underlining the systems and sensors that are available, as documented in the literature. The review seeks to provide comprehensive insights into the building of smart parking solutions. A holistic survey of the current state of smart parking systems should incorporate the classification of such systems as big vehicular detection technologies. Finally, communication modules are presented with clarity.
Can Biyik; Zaheer Allam; Gabriele Pieri; Davide Moroni; Muftah O’Fraifer; Eoin O’Connell; Stephan Olariu; Muhammad Khalid. Smart Parking Systems: Reviewing the Literature, Architecture and Ways Forward. Smart Cities 2021, 4, 623 -642.
AMA StyleCan Biyik, Zaheer Allam, Gabriele Pieri, Davide Moroni, Muftah O’Fraifer, Eoin O’Connell, Stephan Olariu, Muhammad Khalid. Smart Parking Systems: Reviewing the Literature, Architecture and Ways Forward. Smart Cities. 2021; 4 (2):623-642.
Chicago/Turabian StyleCan Biyik; Zaheer Allam; Gabriele Pieri; Davide Moroni; Muftah O’Fraifer; Eoin O’Connell; Stephan Olariu; Muhammad Khalid. 2021. "Smart Parking Systems: Reviewing the Literature, Architecture and Ways Forward." Smart Cities 4, no. 2: 623-642.
In 2016, the Japanese Government publicized an initiative and a call to action for the implementation of a “Super Smart Society” announced as Society 5.0. The stated goal of Society 5.0 is to meet the various needs of the members of society through the provisioning of goods and services to those who require them, when they are required and in the amount required, thus enabling the citizens to live an active and comfortable life. In spite of its genuine appeal, details of a feasible path to Society 5.0 are conspicuously missing. The first main goal of this survey is to suggest such an implementation path. Specifically, we define a Smart Community as a human-centric entity where technology is used to equip the citizenry with information and services that they can use to inform their decisions. The arbiter of this ecosystem of services is a Marketplace of Services that will reward services aligned with the wants and needs of the citizens, while discouraging the proliferation of those that are not. In the limit, the Smart Community we defined will morph into Society 5.0. At that point, the Marketplace of Services will become a platform for the co-creation of services by a close cooperation between the citizens and their government. The second objective and contribution of this survey paper is to review known technologies that, in our opinion, will play a significant role in the transition to Society 5.0. These technologies will be surveyed in chronological order, as newer technologies often extend old technologies while avoiding their limitations.
Amna Iqbal; Stephan Olariu. A Survey of Enabling Technologies for Smart Communities. Smart Cities 2020, 4, 54 -77.
AMA StyleAmna Iqbal, Stephan Olariu. A Survey of Enabling Technologies for Smart Communities. Smart Cities. 2020; 4 (1):54-77.
Chicago/Turabian StyleAmna Iqbal; Stephan Olariu. 2020. "A Survey of Enabling Technologies for Smart Communities." Smart Cities 4, no. 1: 54-77.
Traffic state estimation is a fundamental task of Intelligent Transportation Systems (ITS). Recent advances in sensor technology and emerging computer and vehicular communications paradigms have brought the task of estimating traffic state parameters in real time within reach. Recognizing this, the US-DOT started promoting the Connected Vehicles (CV) initiative. By using wireless connectivity between the vehicles participating in the traffic, the CV initiative aims to promote an increased awareness of real-time traffic conditions and, as a result, to reduce the number and severity of crashes. A number of recent papers have proposed CV-based approaches to estimating traffic state parameters including density and flow. However, virtually all the CV-based approaches for density estimation also rely on communication with stationary detectors and other pre-deployed roadside infrastructure. This assumption is problematic since such infrastructure is often not available. The main contribution of this paper is to propose a simple and easy to implement real-time traffic density estimation method that uses only vehicle-to-vehicle communications and the on-board sensing capabilities of present-day vehicles. In our method, using their on-board devices, vehicles maintain a tally that keeps track of the difference between the number of times other vehicles pass them and the number of times they pass other vehicles. Notice that since vehicles may vary their speed as they please, they may pass and be passed by the same vehicle multiple times and, consequently, maintaining a correct tally is a non-trivial task. We show that the tallies computed by vehicles relate, in an interesting way, to traffic density. We provide a detailed proof of our method using techniques that avoid the use of common simplifications inherent to visual time-space traffic diagrams. Furthermore, we demonstrate the accuracy of our method through extensive simulations using real NGSIM traffic traces along with SUMO-generated synthetic traffic traces.
Ryan Florin; Stephan Olariu. Towards real-time density estimation using vehicle-to-vehicle communications. Transportation Research Part B: Methodological 2020, 138, 435 -456.
AMA StyleRyan Florin, Stephan Olariu. Towards real-time density estimation using vehicle-to-vehicle communications. Transportation Research Part B: Methodological. 2020; 138 ():435-456.
Chicago/Turabian StyleRyan Florin; Stephan Olariu. 2020. "Towards real-time density estimation using vehicle-to-vehicle communications." Transportation Research Part B: Methodological 138, no. : 435-456.
In a recent paper, Ghazizadeh et al. have studied vehicular clouds running on top of the vehicles in the parking lot of a major airport. The defining difference between vehicular clouds and their conventional counterparts is the unpredictable availability of computational resources. Indeed, as vehicles enter the parking lot, fresh compute resources become available; when vehicles depart, their compute resources leave with them. In such a volatile environment, the task of promoting reliability becomes quite challenging. To solve the reliability problem, Ghazizadeh et al. suggested employing redundancy-based job assignment strategies. They derived analytical expressions for the mean time to failure of these strategies. Their expressions require full knowledge of the distribution of vehicle residency times and of the time it takes to recruit a vehicle into the vehicular cloud. In a practical context, the datacenter manager does not know these distribution functions. Instead, using accumulated empirical evidence, she may know the first and perhaps the second moment of these random variables. With this in mind, this paper derives easy-to-compute approximations of the mean time to failure of the job assignment strategies proposed by Ghazizadeh et al.. A comprehensive set of simulations have shown that our approximations are very close to the analytical predictions by Ghazizadeh et al. even if the exact distribution functions are not known.
Ryan Florin; Aida Ghazi Zadeh; Puya Ghazizadeh; Stephan Olariu. Towards Approximating the Mean Time to Failure in Vehicular Clouds. IEEE Transactions on Intelligent Transportation Systems 2017, 19, 2045 -2054.
AMA StyleRyan Florin, Aida Ghazi Zadeh, Puya Ghazizadeh, Stephan Olariu. Towards Approximating the Mean Time to Failure in Vehicular Clouds. IEEE Transactions on Intelligent Transportation Systems. 2017; 19 (7):2045-2054.
Chicago/Turabian StyleRyan Florin; Aida Ghazi Zadeh; Puya Ghazizadeh; Stephan Olariu. 2017. "Towards Approximating the Mean Time to Failure in Vehicular Clouds." IEEE Transactions on Intelligent Transportation Systems 19, no. 7: 2045-2054.
One of the significant research challenges in the realm of vehicular clouds is to identify conditions under which these clouds can support big data applications. It is clear that big data applications, with stringent data-processing requirements, cannot be supported by ephemeral vehicular clouds, where the residency time of vehicles in the cloud is too short for supporting virtual machine setup and migration. Similarly, it turns out that vehicular cloud implementations relying on bandwidth-constricted interconnection topologies are not suitable for big data applications. Unfortunately, this is the case of the vast majority of vehicular clouds proposed thus far in the literature that rely on a wireless interconnection fabric. Our main contribution is to identify sufficient conditions under which big data applications can be effectively supported by datacenters built on top of vehicles in a parking lot. This is pioneering work: to the best of our knowledge, this is the first time researchers are looking at evaluating the feasibility of the vehicular cloud concept and its suitability for supporting big data applications. One of our main findings is that (1) if the residency times of the vehicles are sufficiently long and (2) if the interconnection fabric has a sufficient amount of bandwidth, then big data applications can be supported effectively by such datacenters.
Ryan Florin; Syedmeysam Abolghasemi; Aida Ghazi Zadeh; Stephan Olariu. Big Data in the Parking Lot. Big Data Management and Processing 2017, 425 -450.
AMA StyleRyan Florin, Syedmeysam Abolghasemi, Aida Ghazi Zadeh, Stephan Olariu. Big Data in the Parking Lot. Big Data Management and Processing. 2017; ():425-450.
Chicago/Turabian StyleRyan Florin; Syedmeysam Abolghasemi; Aida Ghazi Zadeh; Stephan Olariu. 2017. "Big Data in the Parking Lot." Big Data Management and Processing , no. : 425-450.
Traffic congestion is an ever increasing problem on our roadways and city streets. The main contribution of this survey is a taxonomy of adaptive traffic signal control strategies achieved through various levels of vehicular communications.Strategies to optimize traffic signals fall into three categories based on the level of vehicle involvement. The first category involves those strategies that utilize legacy devices with no vehicular involvement. The second category comprises those strategies that utilize vehicles on the road to wirelessly transmit data about themselves (e.g. location, velocity). The third category involves strategies that utilize the vehicles' on-board computation power to help optimize traffic signals. The bulk of this survey deals with the second category as it appears to be the most prevalent in the research literature. We are however, quick to point out that the third category seems to be gaining momentum, as the prevalence of smartphones has suggested supplementing legacy traffic monitoring with traffic-related reports submitted by the driving public.
Ryan Florin; Stephan Olariu. A survey of vehicular communications for traffic signal optimization. Vehicular Communications 2015, 2, 70 -79.
AMA StyleRyan Florin, Stephan Olariu. A survey of vehicular communications for traffic signal optimization. Vehicular Communications. 2015; 2 (2):70-79.
Chicago/Turabian StyleRyan Florin; Stephan Olariu. 2015. "A survey of vehicular communications for traffic signal optimization." Vehicular Communications 2, no. 2: 70-79.
This paper provides a way to think formally about the aggregation processes that take place in networks where individual actors (whether sensors, robots, or people) possess data whose value may decay over time. The various actors use data to make decisions: the larger the value, the better (i.e. more informed) the decision. At every moment, individual actors have the choice of making a decision or else to defer the decision to a later time. However, the longer they wait, the lower the value of the data they hold. To counter-balance the effect of time discounting, we define an algebraic operation that we call aggregation, whereby two or more actors integrate their data in the hope of increasing its value. Our main contribution is a formal look at the value of time-discounted information and at the algebra of its aggregation. We allow aggregation of time-discounted information to proceed in an arbitrary, not necessarily pairwise, manner. Our model relates aggregation decisions to the ensuing value of information and suggests natural thresholding strategies for the aggregation of the information collected by sets of network actors. Extensive simulations have confirmed the accuracy of our theoretical predictions.
Stephan Olariu; Shahram Mohrehkesh; Xianping Wang; Michele C. Weigle. On aggregating information in actor networks. ACM SIGMOBILE Mobile Computing and Communications Review 2014, 18, 85 -96.
AMA StyleStephan Olariu, Shahram Mohrehkesh, Xianping Wang, Michele C. Weigle. On aggregating information in actor networks. ACM SIGMOBILE Mobile Computing and Communications Review. 2014; 18 (1):85-96.
Chicago/Turabian StyleStephan Olariu; Shahram Mohrehkesh; Xianping Wang; Michele C. Weigle. 2014. "On aggregating information in actor networks." ACM SIGMOBILE Mobile Computing and Communications Review 18, no. 1: 85-96.
In numerous applications of wireless sensor networks, the reliability of the data collected by sensors is cast as specific QoS requirements expressed in terms of the minimum number of sensors needed to perform various tasks. Designing a long-lived sensor network with reliable performance has always been challenging due to the modest non-renewable energy budget of individual sensors. In order to promote network longevity, this chapter looks at two energy-aware task management protocols: the first protocol is centralized, while the second one is fully distributed. Both protocols assign sensors to tasks based on their remaining energy so that energy expenditure among neighboring sensors is as even as possible. We compare the network longevity, i.e., the functional lifetime of the sensor network, achieved by assigning tasks to sensors using the proposed protocols against an optimal task assignment and also against energy-oblivious protocols. Extensive simulation results have revealed that the performance of the proposed protocols is very close to that of the optimal task assignment. Furthermore, our simulations have shown that the proposed protocols can increase the functional longevity of the network by about 16 %.
Hady S. Abdelsalam; Stephan Olariu. Energy-Efficient Task Management. Digital Signal Processing with Field Programmable Gate Arrays 2013, 385 -425.
AMA StyleHady S. Abdelsalam, Stephan Olariu. Energy-Efficient Task Management. Digital Signal Processing with Field Programmable Gate Arrays. 2013; ():385-425.
Chicago/Turabian StyleHady S. Abdelsalam; Stephan Olariu. 2013. "Energy-Efficient Task Management." Digital Signal Processing with Field Programmable Gate Arrays , no. : 385-425.
Shahram Mohrehkesh; Stephan Olariu; Michele C. Weigle. A framework for assessing the quality of event detection in sensor networks. the 2nd annual international workshop 2013, 1 .
AMA StyleShahram Mohrehkesh, Stephan Olariu, Michele C. Weigle. A framework for assessing the quality of event detection in sensor networks. the 2nd annual international workshop. 2013; ():1.
Chicago/Turabian StyleShahram Mohrehkesh; Stephan Olariu; Michele C. Weigle. 2013. "A framework for assessing the quality of event detection in sensor networks." the 2nd annual international workshop , no. : 1.
In a series of recent papers, Prof. Olariu and his co-workers have promoted the vision of vehicular clouds (VCs), a nontrivial extension, along several dimensions, of conventional cloud computing. In a VC, underutilized vehicular resources including computing power, storage, and Internet connectivity can be shared between drivers or rented out over the Internet to various customers. Clearly, if the VC concept is to see a wide adoption and to have significant societal impact, security and privacy issues need to be addressed. The main contribution of this work is to identify and analyze a number of security challenges and potential privacy threats in VCs. Although security issues have received attention in cloud computing and vehicular networks, we identify security challenges that are specific to VCs, e.g., challenges of authentication of high-mobility vehicles, scalability and single interface, tangled identities and locations, and the complexity of establishing trust relationships among multiple players caused by intermittent short-range communications. Additionally, we provide a security scheme that addresses several of the challenges discussed.
Gongjun Yan; Ding Wen; Stephan Olariu; Michele Weigle. Security challenges in vehicular cloud computing. IEEE Transactions on Intelligent Transportation Systems 2012, 14, 284 -294.
AMA StyleGongjun Yan, Ding Wen, Stephan Olariu, Michele Weigle. Security challenges in vehicular cloud computing. IEEE Transactions on Intelligent Transportation Systems. 2012; 14 (1):284-294.
Chicago/Turabian StyleGongjun Yan; Ding Wen; Stephan Olariu; Michele Weigle. 2012. "Security challenges in vehicular cloud computing." IEEE Transactions on Intelligent Transportation Systems 14, no. 1: 284-294.
One of the side-effects of the climate changes that are upon us is that infectious diseases are adapting, evolving and spreading to new geographic regions. It is, therefore, imperious to develop epidemic models that shed light on the interplay between the dynamics of the spread of infectious diseases and the combined effects of various vaccination and prevention regimens. With this in mind, in this work we propose a epidemic model operating on a large population; we restrict our attention to strains of infectious diseases that resist treatment. The time-dependent epidemic accounts, among others, for the effects of improved sanitation, education and vaccination. Our first main contribution is to derive the time-dependent probability mass function of the number of infected individuals in such a system. Our derivation does not use probability generating functions and partial differential equations. Instead, we develop an iterative solution that is conceptually simple and easy to implement. Somewhat surprisingly, the epidemic model also provides insight into various stochastic phenomena noticed in sociology, macroeconomics, marketing, transportation and computer science. Our second main contribution is to show, by extensive simulations, that suitably instantiated, our epidemic model be used to model phenomena describing the adoption of durable consumer goods, the spread of AIDS and the dissemination of mobile worm spread.
Samiur Arif; Stephan Olariu. Efficient solution of a stochastic SI epidemic system. The Journal of Supercomputing 2012, 62, 1385 -1403.
AMA StyleSamiur Arif, Stephan Olariu. Efficient solution of a stochastic SI epidemic system. The Journal of Supercomputing. 2012; 62 (3):1385-1403.
Chicago/Turabian StyleSamiur Arif; Stephan Olariu. 2012. "Efficient solution of a stochastic SI epidemic system." The Journal of Supercomputing 62, no. 3: 1385-1403.
Recently, Olariu et al. [3], [7], [18], [19], [20] proposed to refer to a dynamic group of vehicles whose excess computing, sensing, communication, and storage resources can be coordinated and dynamically allocated to authorized users, as a vehicular cloud. One of the characteristics that distinguishes vehicular clouds from conventional clouds is the dynamically changing amount of available resources that, in some cases, may fluctuate rather abruptly. In this work, we envision a vehicular cloud involving cars in the long-term parking lot of a typical international airport. The patrons of such a parking lot are typically on travel for several days, providing a pool of cars that can serve as the basis for a datacenter at the airport. We anticipate a park and plug scenario where the cars that participate in the vehicular cloud are plugged into a standard power outlet and are provided Ethernet connection to a central server at the airport. In order to be able to schedule resources and to assign computational tasks to the various cars in the vehicular cloud, a fundamental prerequisite is to have an accurate picture of the number of vehicles that are expected to be present in the parking lot as a function of time. What makes the problem difficult is the time-varying nature of the arrival and departure rates. In this work, we concern ourselves with predicting the parking occupancy given time-varying arrival and departure rates. Our main contribution is to provide closed forms for the probability distribution of the parking lot occupancy as a function of time, for the expected number of cars in the parking lot and its variance, and for the limiting behavior of these parameters as time increases. In addition to analytical results, we have obtained a series of empirical results that confirm the accuracy of our analytical predictions.
Samiur Arif; Stephan Olariu; Jin Wang; Gongjun Yan; Weiming Yang; Ismail Khalil. Datacenter at the Airport: Reasoning about Time-Dependent Parking Lot Occupancy. IEEE Transactions on Parallel and Distributed Systems 2012, 23, 2067 -2080.
AMA StyleSamiur Arif, Stephan Olariu, Jin Wang, Gongjun Yan, Weiming Yang, Ismail Khalil. Datacenter at the Airport: Reasoning about Time-Dependent Parking Lot Occupancy. IEEE Transactions on Parallel and Distributed Systems. 2012; 23 (11):2067-2080.
Chicago/Turabian StyleSamiur Arif; Stephan Olariu; Jin Wang; Gongjun Yan; Weiming Yang; Ismail Khalil. 2012. "Datacenter at the Airport: Reasoning about Time-Dependent Parking Lot Occupancy." IEEE Transactions on Parallel and Distributed Systems 23, no. 11: 2067-2080.
The 16 full papers and 7 technical notes in this special issue focus on wireless sensor and actuator networks. The full papers in this issue can be broadly organized into three main categories: (i) control with WSANS, (ii) control of WSANS, and (iii) WSAN node placement/deployment.
Jiming Chen; Karl H. Johansson; Stephan Olariu; Ioannis Ch. Paschalidis; Ivan Stojmenovic. Guest Editorial Special Issue on Wireless Sensor and Actuator Networks. IEEE Transactions on Automatic Control 2011, 56, 2244 -2246.
AMA StyleJiming Chen, Karl H. Johansson, Stephan Olariu, Ioannis Ch. Paschalidis, Ivan Stojmenovic. Guest Editorial Special Issue on Wireless Sensor and Actuator Networks. IEEE Transactions on Automatic Control. 2011; 56 (10):2244-2246.
Chicago/Turabian StyleJiming Chen; Karl H. Johansson; Stephan Olariu; Ioannis Ch. Paschalidis; Ivan Stojmenovic. 2011. "Guest Editorial Special Issue on Wireless Sensor and Actuator Networks." IEEE Transactions on Automatic Control 56, no. 10: 2244-2246.
The dawn of the 21st century has seen a growing interest in vehicular networking and its myriad potential applications. The initial view of practitioners and researchers was that radio-equipped vehicles could keep the drivers informed about potential safety risks and increase their awareness of road conditions. The view then expanded to include access to the Internet and associated services. This position paper proposes and promotes a novel and more comprehensive vision namely, that advances in vehicular networks, embedded devices and cloud computing will enable the formation of autonomous clouds of vehicular computing, communication, sensing, power and physical resources. Hence, we coin the term, autonomous vehicular clouds (AVCs). A key feature distinguishing AVCs from conventional cloud computing is that mobile AVC resources can be pooled dynamically to serve authorized users and to enable autonomy in real-time service sharing and management on terrestrial, aerial, or aquatic pathways or theaters of operations. In addition to general-purpose AVCs, we also envision the emergence of specialized AVCs such as mobile analytics laboratories. Furthermore, we envision that the integration of AVCs with ubiquitous smart infrastructures including intelligent transportation systems, smart cities and smart electric power grids will have an enormous societal impact enabling ubiquitous utility cyber-physical services at the right place, right time and with right-sized resources
Stephan Olariu; Mohamed Eltoweissy; Mohamed Younis. Towards autonomous vehicular clouds. ICST Transactions on Mobile Communications and Applications 2011, 11, 1 .
AMA StyleStephan Olariu, Mohamed Eltoweissy, Mohamed Younis. Towards autonomous vehicular clouds. ICST Transactions on Mobile Communications and Applications. 2011; 11 (1):1.
Chicago/Turabian StyleStephan Olariu; Mohamed Eltoweissy; Mohamed Younis. 2011. "Towards autonomous vehicular clouds." ICST Transactions on Mobile Communications and Applications 11, no. 1: 1.
In this work, we assume a geographic area populated by tiny sensors, each perhaps no larger than a dime. In order to save their energy, the sensors spend most of their lifetime in sleep mode and wake up for short periods of time to participate in various tasks supportive of the overall mission of the network. We assume that the tasks to be performed stipulate QoS parameters expressed in terms of the minimum number of sensors that need to monitor their sensing area. Since only awake sensors participate in tasks, the Effective Sensor Density (ESD), defined as the density of awake sensors, is an important network parameter that obviously depends on the sleep schedules adopted in the network. The first main contribution of this work is to provide a mathematical analysis of ESD from the perspective of the monitored events. We also provide design guidelines to determine deployment-time sensor density and an associated sleep schedule that probabilistically keeps the ESD at a level needed by QoS requirements. We also propose a fully distributed sleep schedule which adaptively adjusts the duty cycles of sensors within the same sensing area based on the relative difference in their remaining energy budget. The main advantage of the proposed adaptive scheme is to balance energy consumption among sensors, thus promoting the functional longevity of the sensor network without adversely affecting the ESD.
Hady S. Abdelsalam; Stephan Olariu. Toward Adaptive Sleep Schedules for Balancing Energy Consumption in Wireless Sensor Networks. IEEE Transactions on Computers 2011, 61, 1443 -1458.
AMA StyleHady S. Abdelsalam, Stephan Olariu. Toward Adaptive Sleep Schedules for Balancing Energy Consumption in Wireless Sensor Networks. IEEE Transactions on Computers. 2011; 61 (10):1443-1458.
Chicago/Turabian StyleHady S. Abdelsalam; Stephan Olariu. 2011. "Toward Adaptive Sleep Schedules for Balancing Energy Consumption in Wireless Sensor Networks." IEEE Transactions on Computers 61, no. 10: 1443-1458.
The past decade has witnessed a phenomenal market penetration of wireless communications and a steady increase in the number of mobile users. Unlike wired networks, where communication links are inherently stable, in wireless networks, the lifetime of a link is a random variable whose probability distribution depends on mobility, transmission range, and various impairments of radio communications. Because of the very dynamic nature of Vehicular Ad hoc NETworks (VANETs) and the short transmission range mandated by the Federal Communications Commission (FCC), individual communication links come into existence and vanish unpredictably, making the task of establishing and maintaining routing paths between fast-moving vehicles very challenging. The main contribution of this work is to investigate the probability distribution of the lifetime of individual links in a VANET under the combined assumptions of a realistic radio transmission model and a realistic probability distribution model of intervehicle headway distance. Our analytical results were validated and confirmed by extensive simulation.
Gongjun Yan; Stephan Olariu. A Probabilistic Analysis of Link Duration in Vehicular Ad Hoc Networks. IEEE Transactions on Intelligent Transportation Systems 2011, 12, 1227 -1236.
AMA StyleGongjun Yan, Stephan Olariu. A Probabilistic Analysis of Link Duration in Vehicular Ad Hoc Networks. IEEE Transactions on Intelligent Transportation Systems. 2011; 12 (4):1227-1236.
Chicago/Turabian StyleGongjun Yan; Stephan Olariu. 2011. "A Probabilistic Analysis of Link Duration in Vehicular Ad Hoc Networks." IEEE Transactions on Intelligent Transportation Systems 12, no. 4: 1227-1236.
Syed R. Rizvi; Stephan Olariu; Cristina M. Pinotti; Shaharuddin Salleh; Mona E. Rizvi; Zainab Zaidi. Vehicular Ad Hoc Networks. International Journal of Vehicular Technology 2011, 2011, 1 -2.
AMA StyleSyed R. Rizvi, Stephan Olariu, Cristina M. Pinotti, Shaharuddin Salleh, Mona E. Rizvi, Zainab Zaidi. Vehicular Ad Hoc Networks. International Journal of Vehicular Technology. 2011; 2011 ():1-2.
Chicago/Turabian StyleSyed R. Rizvi; Stephan Olariu; Cristina M. Pinotti; Shaharuddin Salleh; Mona E. Rizvi; Zainab Zaidi. 2011. "Vehicular Ad Hoc Networks." International Journal of Vehicular Technology 2011, no. : 1-2.
The objective of this chapter is to introduce the reader to a general architectural framework for a broad array of retrievals of multimedia data required by various applications. This framework contains more than the traditional client/server architecture and even more than the existing three-tier architectures. This chapter introduces the reader to many critical issues involved in multimedia retrieval over the Internet. A new architectural framework is proposed to cover a variety of multimedia applications over the Internet and the World Wide Web. This framework has the three main objectives of (1) proposing a layered architecture to facilitated design and separate different issues, (2) covering a large number of multimedia applications, and finally, (3) making use of existing and well-established technology, such as Mobile Agents, SQL databases, and cache managements schemes. The proposed architectural framework separates issues involved in multimedia retrieval into five layers, namely: keyword searching and data servers, proxy servers, domain and department archives, mobile user agents, and the users. Through these five layers, various customized solutions to a large array of problems will be proposed and applied. The chapter offers, but is not limited to, solutions for different problems that arise in retrieval of multimedia data. A list of important open problems is identified at the end of the chapter.
Mohammed A. Moharrum; Stephan Olariu; Hussein Abdel-Wahab. Retrieval of Multimedia Data on the Web. Architectural Issues of Web-Enabled Electronic Business 2011, 170 -183.
AMA StyleMohammed A. Moharrum, Stephan Olariu, Hussein Abdel-Wahab. Retrieval of Multimedia Data on the Web. Architectural Issues of Web-Enabled Electronic Business. 2011; ():170-183.
Chicago/Turabian StyleMohammed A. Moharrum; Stephan Olariu; Hussein Abdel-Wahab. 2011. "Retrieval of Multimedia Data on the Web." Architectural Issues of Web-Enabled Electronic Business , no. : 170-183.
Parking is costly and limited in almost every major city in the world. Innovative parking systems for meeting near-term parking demand are needed. This paper proposes a novel, secure, and intelligent parking system (SmartParking) based on secured wireless network and sensor communication. From the point of users' view, SmartParking is a secure and intelligent parking service. The parking reservation is safe and privacy preserved. The parking navigation is convenient and efficient. The whole parking process will be a non-stop service. From the point of management's view, SmartParking is an intelligent parking system. The parking process can be modeled as birth-death stochastic process and the prediction of revenues can be made. Based on the prediction, new business promotion can be made, for example, on-sale prices and new parking fees. In SmartParking, new promotions can be published through wireless network. We address hardware/software architecture, implementations, and analytical models and results. The evaluation of this proposed system proves its efficiency.
Gongjun Yan; Weiming Yang; Danda B. Rawat; Stephan Olariu. SmartParking: A Secure and Intelligent Parking System. IEEE Intelligent Transportation Systems Magazine 2011, 3, 18 -30.
AMA StyleGongjun Yan, Weiming Yang, Danda B. Rawat, Stephan Olariu. SmartParking: A Secure and Intelligent Parking System. IEEE Intelligent Transportation Systems Magazine. 2011; 3 (1):18-30.
Chicago/Turabian StyleGongjun Yan; Weiming Yang; Danda B. Rawat; Stephan Olariu. 2011. "SmartParking: A Secure and Intelligent Parking System." IEEE Intelligent Transportation Systems Magazine 3, no. 1: 18-30.