In a recent work, we published the Location Prediction Based Routing (LPBR) protocol for mobile ad hoc networks (MANET). LPBR is the first such beaconless MANET protocol to simultaneously minimize the hop count of the paths as well as the routing control overhead measured in terms of the number of control messages received during an on-demand broadcast discovery. LPBR works as follows: If the m...

Cognitive radio is an enabling technology of dynamic spectrum access (DSA) networking. In DSA, unlicensed secondary users can coexist with primary licensed users and can share the radio spectrum opportunistically. Broadcasting is an important networking primitive that is useful for many CRN applications such as control information dissemination, warning notification, etc. Unfortunately, the spo...

In this paper, we study a broadcast problem in directed trees. This problem is motivated by the task of implementing broadcast and multicast requests in computer systems with networks that utilize circuit routing schemes such as wormhole routing or virtual cut through routing as opposed to store and forward routing. Examples of such systems include the Intel Paragon and the NCUBE-2. The problem...

It has been shown that the problem of finding a broadcast routing tree with minimum total transmit power is NPhard. Hence, developing a heuristic power-efficient algorithm is crucial. The seminal work in this area is the well-known Broadcast Incremental Power (BIP) algorithm with a recent addition called Embedded Wireless Multicast Advantage (EWMA) algorithm. In this paper, we present yet anoth...

Broadcast is a common communication means in mobile ad hoc network or wireless sensor network. In directed diffusion protocol, broadcast is used to disseminate interest, discover routing path and repair the routing path. However, straightforward broadcast scheme (such as flooding) may result in serious broadcast storm problem, especially with respect to large densely deployed wireless sensor ne...

One-to-all or broadcast communication is one of the most important communication patterns and occurs in many important applications in parallel computing. In this paper, we propose a fault tolerant, local-information-based, and distributed broadcast routing algorithm based on the concept of -submesh connectivity in all-port mesh networks. We analyze the fault tolerance of our algorithm in terms...

Due to node mobility, the ad hoc network topology is dynamical so that on-demand routing protocols are more fit than other routing protocols. Most secure on-demand routing protocols are designed that the destination or source is able to detect the attacks on routing paths after accepting routing requests or routing replies. In this paper, we present a secure on-demand source routing protocol wi...

Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of network security algorithms and system infrastructures, we will propose a dynamic broadcast routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols...

We investigate the relative computational powers of a mesh with static buses and a mesh with unidirectional wrap-mounds. A mesh with unidirectional wraparounds is a torus with the restriction that any wraparoundlink of the architecture can only transmit data in one of the two directions at any clock tick. We show that the problem of packet routing can be solved as efficiently on a linear array ...

Routing packets in multi-hop ad hoc wireless networks poses a great challenge mainly due to the unreliability of the wireless links and the inherent interference of the wireless medium [13]. Due to these characteristics, traditional wired routing schemes that select the best path towards a destination and forward the packet to a specific next hop, have proven ill-suited for networks utilizing t...