One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be `understood' using a hierarchical coordinate system. Here ...
An ad hoc wireless network (AWN) is a collection of mobile hosts forming a temporary network on the fly, without using any fixed infrastructure. Characteristics of AWNs such as la...
Tamma Bheemarjuna Reddy, I. Karthigeyan, B. S. Man...
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...