In this paper, we propose a new distributed routing protocol designed for multi-channel wireless networks. The proposed routing method consists of two major parts, relay and sub-channel assignment to find the largest spectral efficiency, and relay selection in each hop, using a probability base scheme. The PBS improves the accessibility by reducing the number of hops and traversed distance in t...

This paper studies a new decode-and-forward relaying scheme for a cooperative wireless network composed of one source, K relays, and one destination and with binary frequency-shift keying modulation. A single threshold is employed to select retransmitting relays as follows: a relay retransmits to the destination if its decision variable is larger than the threshold; otherwise, it remains silent...

A sensor network is nothing but the collection of number of wireless mobile nodes. Each node route the packet as well as forward the packet until the destination. Many routing protocol have been developed in mobile networks. Protocol selection is the main purpose of the wireless network and selected protocol must be best in all aspects of the mobile network. In this paper, simulation performanc...

We propose a novel avenue for state space reduction in time domain Liouville space spin dynamics simulations, using detectability as a selection criterion--only those states that evolve into or affect other detectable states are kept in the simulation. This basis reduction procedure (referred to as destination state screening) is formally exact and can be applied on top of the existing state sp...

In cooperative transmission users are allowed to share antennas to transmit their messages to a common destination. Users employ either amplify-and-forward or decodeand-forward strategies to forward each others’ messages. In network-coding-based cooperative transmission schemes, users are allowed to combine their own and their partner’s message by a network-coding operation. This work analysis ...

In order to move away from more formal route-choice models and to avoid calibration issues, visually guided agent-based models have recently been introduced to microscopic urban models of pedestrian behavior. Although the new models produce good correlation between the agents and observed pedestrian movement, there are two problems with them. Firstly, the implementations have lacked an origin-d...

Multiple addresses within an OSPF area can be aggregated and advertised together to other areas. This process is known as address aggregation and is used to reduce router computational overheads and memory requirements and to reduce the network bandwidth consumed by OSPF messages. The downside of address aggregation is that it leads to information loss and consequently sub-optimal (non-shortest...

We consider a discrete-time multi-channel network where the destination collects time-sensitive packets from multiple sources with sided channel information. The popular metric, Age of Information (AoI), is applied to measure data freshness at destination. Due interference constraint, only disjoint source-channel pairs can be chosen for transmission in each time slot, and decision maker should ...

In December 1996, TIME magazine published an article titled ‘‘Finding God on the Web,’’ which projected how the Internet would shape information seeking on faith and religion. A decade later, the Web has become a popular tool for gathering religious information as well as information and imagery related to religious travel. Yet there is little research on religious destination imagery online. I...

We derive the capacity of the state-dependent half-duplex relay channel without source-destination link. The output of the state-dependent half-duplex relay channel depends on the randomly varying channel states of the source-relay and relay-destination links, which are known causally at all three nodes. For this channel, we prove a converse and show the achievability of the capacity based on a...