Recently, geographic routing in wireless networks has gained attention due to several advantages of location information. Location information eliminates the necessity to set up and maintain explicit routes, which reduces communication overhead and routing table size. These advantages allow scalability especially in dynamic and unstable wireless networks. However, no matter which technologies o...

Due to increase of the mining of compressed data from various types of applications. Clustering is the process for resolving that type of applications. Traditionally we are using different clustering applications for grouping elements with equal priority. And we represent single clustering process with multi dimensional data grouping using clustering but the only problem is performance of group...

Since ancient times, men had the necessity to catch, model and store information. An important part of the information field is the one concerned with geographical and spatial matters. In general, geographic (or geospatial) information is created by manipulating geographic (or spatial) data. Nowadays, geospatial information can be stored, manipulated and queried within special informatics syste...

In this paper we propose a new scheduling algorithm called Real Time Scheduling (RTS) which uses virtual nodes for self stabilization. This algorithm deals with all the contributing components of the end-to-end travelling delay of data packets in sensor network and with virtual nodes algorithm achieves QoS in terms of packet delivery, multiple connections, better power management and stable rou...

The authors propose three variants of distributed and stateless forwarding strategies for wireless sensor networks, namely greedy minimum energy consumption forwarding protocol (GMFP), lifetime maximising GMFP (LM-GMFP) and variance minimising GMFP (VAR-GMFP), which aim at maximising the network lifetime while achieving a high forwarding success rate. GMFP selects a forwarding node that minimis...

Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been prop...

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

Throughout history, humankind has segmented and structured the spatial environment in various ways to support administrative, political and economic activities. To date, the majority of spatial boundaries have been constructed in an uncoordinated manner with individual organisations generating individual boundaries to meet individual needs. This practice has resulted in boundary layers that eve...

In this paper, an efficient dynamic resource allocation scheme for multiuser orthogonal frequency division multiplexing (OFDM) systems is investigated. There have been many researches to maximize total system throughput with only limited transmission power. In addition to the limited power, we add required minimum transmission bits for each user as another constraint for the quality of service ...