نتایج جستجو برای: locating routing

تعداد نتایج: 66239  

2002
Matthias Grossglauser Martin Vetterli

Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations’ geographic coordinates. However, geographic routing still requires an efficient location service, i.e., a distributed database recording the location of ever...

ژورنال: محاسبات نرم 2017

are a subset of MANETs in which vehicles are considered as network clients. These networks have been created to communicate between vehicles and traffic control on the roads. have similar features to MANETs and their main special property is the high-speed node mobility which makes a quick change of the network. The rapid change of network topology is a major challenge in routing. One of the we...

2012
Ola A. Al-Sonosy Mohammed A. Hashem Nagwa Badr

Information System Department, Faculty of Computer and Information Science, Ain Shams University, Cairo, Egypt Abstract A Wireless Sensor Network (WSN) is ad hoc dense wireless network of small, low-cost sensor nodes (SN), which collect and disseminate sensed data with limited power sources. WSNs can be used in many applications, such as environmental monitoring and object tracking. Organizing ...

Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...

By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...

Journal: :international journal of electrical and electronics engineering 0
vahid zangeneh shahriar mohammadi

in recent years, routing has been the most focused area in ad hoc networks research. on-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. most proposed on-demand routing protocols are built and relied on single route for each data session. whenever there is a link disconnection on the active ro...

Journal: :Ingénierie des Systèmes d'Information 2008
Rabab Hayek Guillaume Raschia Patrick Valduriez Noureddine Mouaddib

In this paper, we propose managing data summaries in unstructured P2P systems. Our summaries are intelligible views with two main virtues. First, they can be directly queried and used to approximately answer a query. Second, as semantic indexes, they support locating relevant nodes based on data content. The performance evaluation of our proposal shows that the cost of query routing is minimize...

2009
Mucheol KIM Sunhong KIM Hyungjin BYUN Sangyong HAN

Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions including computation capability and battery capacity. Topology control is an important issue for achieving a balanced placement of sensor nodes. The clustering scheme is a widely known and efficient means of topology control for transmitting information to the base station in two hops. ...

2002
Anna Antola Mariagiovanna Sami Vincenzo Piuri

Fault tolerance is becoming an important issue for the effective use of FPGA-based architectures in missioncritical applications. This paper introduces an innovative approach to design FPGA systems with on-line diagnosis and reconfiguration, at a limited cost in terms of FPGA redundant resources and interconnections. The technique is based on high-level synthesis of the self-checking datapath t...

2004
Enrique Alba Bernabé Dorronsoro

Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overlapped neighborhoods. Such a kind of structured algorithms is specially well suited for complex problems. In this paper we propose the utilization of some cGAs with and without including local search techniques for solv...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید