Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

Greedy Perimeter Stateless Routing (GPSR) is a proven efficient geographical routing protocol for wireless sensor network. It provides routing support for Wireless Sensor Network. However, Greedy Perimeter Stateless Routing is designed for the symmetric links usually bidirectional in nature, but sensor networks are often asymmetric in nature. In Wireless Sensor Network the nodes are not designa...

Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the network coordinates with every other node in forwarding their packets to reach the destination. Since these nodes operate in a physically insecure environment; they are vulnerable to different types of attacks such as s...

Evolutionary Location Intelligence on implementing a position based routing, that make forwarding decision based on the geographical position of a packet's destination is concentrated in this paper. One distinct advantage of this model is not necessary to maintain explicit routes. Position based routing does scale well even if the network is highly dynamic. We use greedy forwarding approach wit...

Geographical routing protocols have been received serious attention due to their advantages as compared to conventional routing protocols. They require information about the physical position of nodes to be available. Commonly, each node determines its own position through the use of Global Positioning System (GPS) or some other type of positioning service. Greedy Perimeter Stateless Routing (G...

We consider beacons, an analog of geographical greedy routing, motivated by sensor network applications. A beacon b is a point that can be activated to create a ‘magnetic pull’ towards itself everywhere in a polygonal domain P . We explore the properties of beacons and their effect on points in polygons, as well as demonstrate polynomial-time algorithms to compute a variety of structures define...

Several applications of mobile ad hoc networks select geographical routing especially the Greedy Perimeter Stateless Routing (GPSR) protocol due to its scalability, efficiency, and ability to support location based applications. However, there are many security issues in protecting location information, which can easily be abused by attackers. Location based adversarial activities affect the op...

MANET (Mobile Ad Hoc Network) is a network of mobile devices that communicates through wireless links without the use of any existing network infrastructure or centralized administration [1]. There is no fixed topology of the nodes because of the high mobility of the nodes within network. Many routing protocols for mobile ad hoc networks (MANETs) rely on additional information such as geographi...

We give a unified view to greedy geometric routing algorithms in ad hoc networks. For this, we first present a general form of greedy routing algorithm using a class of objective functions which are invariant under congruent transformations of a point set. We show that several known greedy routing algorithms such as Greedy Routing, Compass Routing, and Midpoint Routing can be regarded as specia...

The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour ...