نتایج جستجو برای: greedy geographic forwarding based on geospatial division algorithm
تعداد نتایج: 9405019 فیلتر نتایج به سال:
Vehicular Ad Hoc Networks (VANETs) have attracted the interest of the scientific community, since many issues remain open, especially in the research area of routing techniques. In this work we propose a new position-based routing algorithm called Junction-Based Routing (or JBR). The algorithm makes use of selective greedy forwarding up to the node that is located at a junction and is closer to...
Recent vehicular routing proposals use real-time road traffic density estimates to dynamically select forwarding paths. Estimating the traffic density in vehicular ad hoc networks requires the transmission of additional dedicated messages increasing the communications load. These proposals are generally based on unicast sender-based forwarding schemes. The greedy nature of sender-based forwardi...
Liability in data, products, and services related to geographic information systems, spatial data infrastructure, location based services and web mapping services, is complicated by the complexities and uncertainties in liability for information system products and services generally, as well as by legal theory uncertainties surrounding liability for maps. Each application of geospatial technol...
Underwater wireless sensor networks (UWSN), similar to the terrestrial sensor networks, have different challenges such as limited bandwidth, low battery power, defective underwater channels, and high variable propagation delay. A crucial problem in UWSN is finding an efficient route between a source and a destination. Consequently, great efforts have been made for designing efficient protocols ...
The high-level contribution of this paper is an energy-aware version of the well-known position-based Greedy Perimeter Stateless Routing (GPSR) protocol for mobile ad hoc networks (MANETs). In the proposed energy-aware GPSR protocol, referred to as E-GPSR, we optimize the greedy forwarding mode as follows: a forwarding node first determines a candidate set of neighbor nodes – the nodes that lie...
Geographic routing is a promising routing scheme in wireless sensor networks (WSNs), is shifting toward duty-cycled WSNs in which sensors are sleep scheduled to reduce energy consumption. However, except the connected-k neighborhood (CKN) sleep scheduling algorithm and the geographic routing oriented sleep scheduling (GSS) algorithm, nearly all research work about geographic routing in duty-cyc...
In this work, we propose a cross-layer design strategy based on a joint successive interference cancellation (SIC) detection technique and a multi-relay selection algorithm for the uplink of cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We devise a low-cost greedy list-based SIC (GL-SIC) strategy with RAKE receivers as the front-end that can approach the maximum l...
In this work, we propose a cross-layer design strategy based on the parallel interference cancellation (PIC) detection technique and a multi-relay selection algorithm for the uplink of cooperative directsequence code-division multiple access (DS-CDMA) systems. We devise a low-cost greedy list-based PIC (GL-PIC) strategy with RAKE receivers as the front-end that can approach the maximum likeliho...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید