Routing techniques in Wireless Sensor Network has always been important area of exploration due to change in demands of various applications such as Area monitoring, Environmental/Earth monitoring, passive localization and tracking, Industrial monitoring etc. Energy efficiency is crucial issue in WSN because sensor nodes in WSN are with limited battery power/Resources .This results in rapid cha...

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

Routing in MANETs (Mobile Ad-hoc Networks) is a very hard task due to their dynamic topology and their decentralized nature. Moreover, limited-energy resources make both nodes and network lifetime among the main issues to be considered in MANETs’ routing protocols design. This paper discusses many aspects related to routing in MANETs and presents MEA-DSR, a new energy-aware routing protocol. A ...

We pursue an analytical approach to energy consumption characterization of large scale mobile ad hoc networks. An energy aware hybrid routing strategy is proposed and analyzed. Referred to as Energy Aware GEo-location aided Routing (EAGER), this protocol optimally blends proactive and reactive routing strategies for energy efficiency. Specifically, EAGER partitions the network into cells and pe...

In engineering, flood routing is an important technique necessary for the solution of a floodcontrol problem and for the satisfactory operation of a flood-prediction service. A simple conceptual model like the Muskingum model is very effective for the flood routing process. One challenge in application of the Muskingum model is that its parameters cannot be measured physically. In this article ...

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...