We consider scheduling policies for maxmin fair allocation of bandwidth in wireless ad hoc networks. formalize the objective under constraints. propose a which assigns dynamic weights to flows such that depend on congestion neighborhood and schedule constitute maximum weighted matching. It is possible prove analytically this policy attains both short term long fairness. more generalized fairness notions, suggest mechanisms attain these objectives.

Multirate multicasting, where the receivers of a multicast group can receive service at different rates, is an efficient mode data delivery for many real-time applications. We address problem achieving rates that maximize total receiver utility multirate sessions. This not only takes into account heterogeneity in user requirements, but also provides unified framework diverse fairness objectives. propose two algorithms and prove they converge to optimal this problem. The are distributed...

We address the problem of attaining proportionally fair rates using Aloha protocols at medium access layer. consider a wireless network where all nodes need not be in transmission ranges each other. show how attempt probabilities should set so that achieved are globally fair. For both slotted and unslotted Aloha, we argue node can compute its optimal probability just by knowing some minimal information about topology two-hop radius.

The present study investigates the complex vortex interactions in two-dimensional flow-field behind a symmetric NACA0012 airfoil undergoing prescribed periodic pitching-plunging motion low Reynolds number regime. transitions from to chaotic through quasi-periodic route as plunge amplitude is gradually increased. This unravels role of that take place among main structures making unsteady transition periodicity chaos. leading-edge separation plays key providing very first trigger for...

Cellular systems have hitherto been modeled mostly by graphs for the purpose of channel assignment. However, hypergraph modeling cellular offers a significant advantage over graph in terms total traffic carried system. For example, we show that 37-cell system when carries around 30% more than graph. We study performance channelized hypergraphs comparison with those graphs. this purpose, evaluated capacities these networks defined McEliece and Sivarajan (1994). Evaluation capacity...

In multirate multicasting, different users (receivers) within the same multicast group can receive service at rates, depending on user requirements and network congestion level. Compared with unirate this provides more flexibility to allows efficient usage of resources. We address rate control problem for sessions, objective maximizing total receiver utility. This aggregate utility maximization not only takes into account heterogeneity in requirements, but also a unified framework diverse...

We propose a new multicast routing and scheduling algorithm called multipurpose (MMRS). The policy load balances among various possible routes between the source destinations, basing its decisions on message queue lengths at node. is such that flow of session depends congestion next hop links. MMRS throughput optimal. In addition, it has several other attractive features. It computationally simple can be implemented in distributed, asynchronous manner. parameters which suitably modified to...

We design transmission strategies for medium access control (MAC) layer multicast that maximize the utilization of available bandwidth. Bandwidth efficiency wireless can be improved substantially by exploiting feature a single intercepted several receivers at MAC layer. The nature transmissions, however, changes fundamental relations between quality service (QoS) parameters, throughput, stability, and loss, e.g., strategy maximizes throughput does not necessarily stability region or minimize...

We investigate from an algorithmic perspective the maxmin fair allocation of bandwidth in wireless ad hoc networks. formalize objective under scheduling constraints, and present a necessary sufficient condition for fairness allocation. propose algorithm that assigns weights to sessions dynamically such depend on congestion neighborhood, schedules constitute maximum weighted matching. prove this attains rates, even though it does not use any information about statistics packet arrival process.

We consider ad hoc networks with multiple, mobile intruders. investigate the placement of intrusion detection modules for misuse-based strategy. Our goal is to maximize rate subject limited availability communication and computational resources. mathematically formulate this problem, show that computing optimal solution NP-hard. Thereafter, we propose two approximation algorithms approximate within a constant factor, prove they attain best possible ratios. The though require recomputation...

We consider a scenario with multiple independent microgrids close to each other in region that are connected and the central grid (macrogrid). In time slot, given microgrid may produce more than, less than or as much power it needs, there is uncertainty on which of these events occur. The excess power, those deficit macrogrid trade an electricity market, quotes price for buy from who quote lowest prices. This results competition among this has several distinguishing features not normally...

This study investigates the transitional wake dynamics of a simultaneously pitching– heaving airfoil in low Reynolds number regime. The transition from Kármán to reverse wakes and subsequent deflection are known take place entirely periodic regime as dynamic heave velocity $\kappa h$ (proportionally, amplitude-based Strouhal $St_A$ ) is gradually increased. However, further increase may result loss stability deflected vortex street an eventual chaos. phenomenon has largely remained...

We study fairness when receivers in a multicast network can not subscribe to fractional layers. This case arises the source hierarchically encodes its signal and hierarchical structure is predetermined. Unlike of layer allocation, which has been studied extensively (Sarkar Tassiulas, 1999), bandwidth be allocated discrete chunks only. Fairness issues become vastly different. Computation lexicographic optimal rate allocation becomes NP-hard this case, while polynomial complexity computable...

We investigate from an algorithmic perspective the maxmin fair allocation of bandwidth in wireless ad hoc networks. formalize objective under scheduling constraints, and present a necessary sufficient condition for fairness allocation. propose algorithm that assigns weights to sessions dynamically such depend on congestion neighborhood, schedules constitute maximum weighted matching. prove this attains rates, even though it does not use any information about statistics packet arrival process.

Sensor networks have increasingly become the subject of intense scientific interest over past few years. In this work, we focus on intrusion detection in sensor networks. The community has been focusing mainly wired But techniques geared towards wire line would not suffice for a environment because constraints associated with such paper, consider arbitrary sized and propose algorithms to improve rates by intelligently enabling functionality particular nodes. proposed algorithms, based...