Wireless Communication

S. Gowthami ¹, B. Arunkumar ¹

Affiliations
1 Karpagam University, IN

Abstract

For data collection in various environments the wireless sensor networks (WSNs) is used. In that the sensor nodes are randomly deployed in large quantity, there is a broad range of applications supporting manual deployment. The sensors collect the raw data and forward to a remote base station (the sink) through a series of relay nodes. In the wireless communication environment, the operation time of a relay node depends on its traffic volume and communication range. Relay nodes are battery-limited. To get the maximum network lifetime, the location of the relay node have to be carefully planned. The deployment is ensure connectivity between the data sources and the sink, and also hold the heterogeneous traffic flows from different sources and the dominating many-to-one traffic pattern. For the simple case of one source node, both with single and multiple traffic flows produce the optimal solutions. However, the general form of the deployment problem is difficult, and the existing connectivity-guaranteed solutions cannot be directly applied here. The problem is then transformed into a generalized version of the Euclidean Steiner Minimum Tree problem (ESMT). Solution is in continuous space and may yield fractional numbers of relay nodes, where simple rounding of the solution can lead to poor performance. Thus the algorithms are developed for discrete relay node assignment, together with local adjustments. It yields the high-quality practical solutions. The solution has been evaluated through both numerical analysis and ns-2 simulations and compared with state-ofthe- art approaches. Traffic unaware strategies achieves up to 6 to 14 times improvement on the network lifetime.

Keywords

Heuristic Algorithm, Relay Node Lifetime, Relay Node Placement, Wireless Sensor Networks.

Full Text

     

E. J. Yamini ¹, B. Arunkumar ¹

Affiliations
1 Karpagam University, IN

Abstract

Geocasting is done for the packet transmission within a particular region called geocast region. Geoaddressing and retransmissions are based on some local decision rules especially in Manets. In this paper, along with central distance calculation and priority queuing, the region based location routing method is introduced for scalability and drop rate reduction purposes. Here the automatic updating of location is done by individual nodes when it has a change in its location. The GPSN technology with node elevated repositioning is utilised here to improve the network scalability and deals with the node mobility problems and irregular topology. In previous works, the central region alone is considered for transmitting packets and the nodes are not much aware of all mobile neighbouring nodes location since each node follows the greedy transmission method leads to complexity in large networks. This method overcomes, when a node need not flows through central region and if every node knows well about their neighbour's location.

Keywords

Central Distance, Greedy Technique, Location Update, Reposition.

Full Text