The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Driven by environmental concerns, electric vehicles (EVs) have been used in last-mile delivery in some areas. Limited cruising range, long recharge time and insufficient number of recharging stations have to be considered in route planning to avoid unnecessary detours. In this paper we present a vehicle routing problem for battery electric vehicles with time window constraints. Both driving costs...
This paper compares two valid mathematical formulations for solving a routing problem related to Personal Rapid Transit(PRT). The PRT is an innovative automated transportation system that provides an on-demand transportation service for its users. This is made possible by the use of small electric driverless vehicles. Our objective is to determine the mathematical formulation that minimizes the total...
Low power and lossy networks (LLNs) require efficient routing protocols that should meet the requirements of the critical applications, such as real-time, reliability and high availability. RPL has been recently proposed by the ROLL working group as a tree routing protocol specifically designed for LLNs. It relies on objective functions to construct routes that optimize or constrain a routing metric...
The Routing Protocol for Low power and Lossy Networks (RPL) has recently been considered as the standard routing protocol for wireless sensor networks (WSN). RPL builds routes between nodes based on specific metrics that reflect arbitrary optimization objectives through the RPL Objective Functions (OFs). In this paper, we propose a Context-Aware Objective Function (CAOF) that takes into account the...
In wireless sensor network most of the devices operate on batteries. These devices or nodes have limited amount of initial energy that are consumed at different rates, depending on the power level and intended receiver. In this paper different type of energy efficient routing algorithms are discussed and approach of these algorithms provide the maximum system lifetime. Most of the algorithms formulate...
Solar powered wireless mesh nodes must be provisioned with a solar panel and battery combination that is sufficient to prevent node outage. When such a network is deployed, there are usually restrictions in the way the nodes can be positioned, and this results in a time-varying and node-dependent attenuation of the available solar energy. Unfortunately, conventional resource provisioning methodologies...
This paper discusses the energy saving control problem in ad hoc wireless networks. The problem inputs are given as a set of nodes in a plane, end-to-end traffic demands, and delay bounds between node pairs. The problem is to find an optimized routing that can meet the Quality of Service requirements and the minimized total consumed power of nodes. In addition to that, the network life time must be...
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 promising approach. However, practical considerations...
Wireless mesh nodes must often be upgraded so that the network can accommodate evolving user demands. When some of the nodes are operated using a sustainable solar energy source, these upgrades must take into account the cost of updating the node energy resource configurations. This is required so that the new network configuration can properly accommodate the updated energy workloads of the re-provisioned...
Wireless Sensor Networks (WSNs) are composed of autonomous and resource-constrained (power, sensing, radios, and processors) nodes. These networks are conceived to have a large number of nodes working on monitoring phenomena in an area. So, a major challenge for this networks is to provide solutions that maximize quality of service (QoS) requirements, such as coverage and data routing, and minimize...
Summary form only given. In hierarchical two-tiered sensor networks, higher-powered relay nodes have recently been proposed to be used as cluster heads for designing scalable sensor networks.The assignment of sensor nodes to clusters in an energy-efficient way is known to improve the lifetime of such networks. In this paper we have proposed two efficient distributed algorithms for assigning sensor...
In this paper we consider the differentiated coverage problem for heterogeneous sensor networks over a finite planning horizon consisting of discrete time intervals. The goal is to determine optimal locations of sensors and sinks, activity schedules of the deployed sensors, and sensor-to-sink data routes subject to coverage, flow conservation, energy consumption and budget constraints with the objective...
This paper presents a distributed fermat-point range estimation strategy, which is important in the moving sensor localization applications. The fermat-point is defined as a point which minimizes the sum of distances from three sensors inside a triangle. This point is indeed at the trianglepsilas center of gravity. We solve the problems of large errors and poor performance in the bounding box algorithm...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.