D. Arivudainambi

Learn More
We consider a batch arrival queueing system with two phases of service, feedback and K optional vacations under a classical retrial policy. At the arrival epoch, if the server is busy the whole batch joins the orbit. Whereas if the server is free, then one of the arriving customer starts its service immediately and the rest joins the orbit. For each(More)
A critical aspect of applications in wireless sensor network (WSN) is its lifetime. This issue has received increased attention due to the recent advances in affordable and efficient integrated electronic devices. One approach to extend the wireless sensor network lifetime is to divide the deployed set of all sensors into disjoint subsets of sensor covers,(More)
A technical challenge in successful deployment and utilization of wireless multihop networks (WMN) are to make effective use of the limited channel bandwidth. One method to solve this challenge is broadcast scheduling of channel usage by the way of time division multiple access (TDMA). Three evolutionary algorithms, namely genetic algorithm (GA), immune(More)
Wireless sensor networks are employed in diverse range and are growing area of research and development due to the importance and necessity of applications. Wireless sensor networks depend on batteries with limited power and cannot be recharged or replaced often. Extending the lifetime of wireless sensor networks is a key issue that is being discussed in(More)
The problem of finding a broadcast tree with minimum power consumption has received much attention due to two reasons. They are (a) the limited bandwidth of wireless networks and (b) the nodes are battery operated. This work proposes heuristic memetic algorithm to find minimum energy broadcast tree in wireless ad hoc networks. The simulation results on(More)
In recent days, wireless sensor network has been playing a significant role in various applications. Sensor placement imposes a real challenge when the number of sensors is limited. For a target coverage problem, the critical part is achieving maximum quality of coverage with limited sensors. The quality of coverage can be improved by placing the sensors in(More)
In this paper, we introduce a single server retrial queue with general retrial times, two phases of service, balking and Bernoulli vacation. We assume that the arriving customers who find the server busy are queued in the orbit in accordance with an first come first served (FCFS) discipline and only the customer at the head of the queue is allowed for(More)
Broadcast scheduling problem in wireless multihop network is to avoid interference while keeping the frame length to a minimum. In addition, the task is determination of a collision free broadcast schedule with the minimum length TDMA frame and the maximum slot utilization by efficient distribution of slots among stations. To solve the problem more(More)
Many retail service are concerned with queueing theory problems, particularly ones which involve optimization. When a worker is being switched from one room to another, he has to move. In some cases this distance is very small, so it can be neglected. In the front room, workers serve customers who may be delayed in a queue. When the back room is(More)