The protocols used in mobile ad-hoc networks are based on the layered architecture. The layered approach is highly rigid and strict since each layer of the architecture is only concerned about the layers immediately above it or below it. Recent wireless protocols rely on significant interactions among various layers of the network stack. A cross-layer design (CLD) introduces stack wide layer in...

This paper investigates the use of an efficient bandwidth management scheme by implementing cross-layer M/M/1 queuing model. Strict Open System Interconnection (OSI) layer to layer communication problem is solved by introducing a common database that automatically synchronizes the status of each OSI layer to all the other layers. First-In-First-Out (FIFO) queuing data structure and Priority Que...

This paper investigates the use of an efficient bandwidth management scheme by implementing cross-layer M/M/1 queuing model. Strict Open System Interconnection (OSI) layer to layer communication problem is solved by introducing a common database that automatically synchronizes the status of each OSI layer to all the other layers. First-In-First-Out (FIFO) queuing data structure and Priority Que...

Wireless Multimedia Sensor Networks (WMSNs), is a network of sensors, which are limited in terms of memory, computing, bandwidth, and battery lifetime. Multimedia transmission over WSN requires certain QoS guarantees such as huge amount of bandwidth, strict delay and lower loss ratio that makes transmitting multimedia is a complicated task. However, adopting cross-layer approach in WMSNs improv...

After 3.3: Ordinary differential equations . . . . . . . . . . . . . . . . . . . . . . 2 Before 5.1.3: Extinction and invariance under imitative dynamics . . . . . . . . . 3 With 5.1.3: Monotone percentage growth rates and positive correlation . . . . . . 3 With 5.1.3: Rest points and restricted equilibria . . . . . . . . . . . . . . . . . . . . 5 With 5.2.2: Construction of solutions of the be...

Using Gärdenfors’s notion of epistemic entrenchment, we develop the semantics of a logic which accounts for the following points. It explains why we may generally infer If ¬A then B if all we know is A∨B while must not generally infer If ¬A then B if all we know is {A∨B,A}. More generally, it explains the nonmonotonic nature of the consequence relation governing languages which contain conditio...