In this paper, we propose a new geographic routing algorithm that alleviates the effect of location errors on routing in wireless ad hoc networks. In most previous work, geographic routing has been studied assuming perfect location information. However, in practice there could be significant errors in obtaining location estimates, even when nodes use GPS. Hence, existing geographic routing sche...

Ad hoc wireless networks perform the difficult task of multi-hop communication in an environment without a dedicated infrastructure, with mobile nodes and changing network topology. Different deployments exhibit various constraints, such as energy limitations, opportunities, such as the knowledge of the physical location of the nodes in certain scenarios, and requirements, such as real-time or ...

0

We know that channel routing is very important problem in VLSI physical design. The main objective of a channel routing algorithm is the reduction of the area of a IC chip. In this paper, we just do a survey on some impotent multi-layer routing algorithms. Here we analyze The Efficient Routing algorithm and resolve horizontal constraints and minimize the net wirelength in a particular model of ...

This paper presents a wide-range routing method for multiple rovers deployed lunar polar exploration mission. In the mission scenario considered in this paper, points are divided into several sets of to be assigned rovers. Subsequently, routes between generated each rover. assignment and problems well known as Traveling Salesman Problem (mTSP). The aims minimize two objective functions: sum sta...