Fast algorithm for FIR filtering in the transform domain

A more efficient algorithm than the overlap-and-add (or overlap-and-save) method is developed for quickly computing the convolution involving very long impulse response. By dividing the input and the impulse response into segments of proper length, the algorithm requires fewer multiplications than the existing methods and therefore reduces the complexity of the filtering process     

Resource Reuse for D2D Communication in LTE Networks by Efficient Grouping

Wireless Personal Communications - Device to device (D2D) communication is a key technology of 5G mobile communications. It allows devices to communicate by using direct links, rather than...     

A Proxy Mobile IPv6 Based Global Mobility Management Architecture and Protocol

This paper specifies a global mobility management architecture and protocol procedure called GPMIP, which is based on Proxy Mobile IPv6. In GPMIP, mobility management is performed by the network entity rather than individual mobile nodes. The benefit is the elimination of the wireless link data delivery tunnel overhead between a mobile node and the access router. To compare with the well known Hierarchical Mobile IPv6 mobility management protocol, the location update, packet delivery, and total cost functions generated by a mobile node during its average domain residence time are formulated for each protocol based on fluid flow mobility model. Then, the impacts of various system parameters on the cost functions are analyzed. The analytical results indicate that the proposed global mobility management protocol can guarantee lower total costs. Furthermore, a qualitative comparison between GPMIP and some other global management protocols is also investigated.     

Multicoloring of grid-structured PDE solvers on shared-memorymultiprocessors

In order to execute a parallel PDE (partial differential equation) solver on a shared-memory multiprocessor, we have to avoid memory conflicts in accessing multidimensional data grids. A new multicoloring technique is proposed for speeding sparse matrix operations. The new technique enables parallel access of grid-structured data elements in the shared memory without causing conflicts. The coloring scheme is formulated as an algebraic mapping which can be easily implemented with low overhead on commercial multiprocessors. The proposed multicoloring scheme bas been tested on an Alliant FX/80 multiprocessor for solving 2D and 3D problems using the CGNR method. Compared to the results reported by Saad (1989) on an identical Alliant system, our results show a factor of 30 times higher performance in Mflops. Multicoloring transforms sparse matrices into ones with a diagonal diagonal block (DDB) structure, enabling parallel LU decomposition in solving PDE problems. The multicoloring technique can also be extended to solve other scientific problems characterized by sparse matrices     

Revisiting relative neighborhood graph-based broadcasting algorithms for multimedia ad hoc wireless networks

Multimedia broadcasting is a popular application in an ad hoc wireless network, itself composed of battery-operated nodes. Hence, energy conservation and avoidance of frequent re-construction of broadcast paths are crucial to ensure robust and uninterrupted service of multimedia broadcasting applications. This paper introduces a class of distributed broadcast algorithms based on variations of Relative Neighborhood Graphs (RNG). In contrast to the original RNG-based algorithms, the proposed algorithms consider the remaining battery energy of nodes and the distance between nodes as criteria for determining the relative neighborhood of a node. This approach is intended to boost the resiliency of the broadcast path by avoiding the choice of nodes with low remaining battery capacity as rebroadcast nodes. Extensive simulations are conducted, demonstrating that the proposed algorithms improve over the original RNG in several aspects, including the reduction of broadcast storms, longer path lifetime, and shorter broadcast latency.     

Design of Two-Step Random Access Procedure for URLLC Applications

The idea of Smart City incorporates a few ideas being technology, economy, governance, people, management, and infrastructure. This implies a Smart City can have distinctive communication needs. Wireless technologies, for example, WiFi, Zig Bee, Bluetooth, WiMax, 4G or LTE have introduced themselves as a solution for the communication in Smart City activities. Nonetheless, as the majority of them utilize unlicensed interference, coexistence and bands issues are increasing. So to solve the problem IoT is used in smart cities. This paper addresses the issues of both resource allocation and routing to propose an energy efficient, congestion aware resource allocation and routing protocol (ECRR) for IoT network based on hybrid optimization techniques. The first contribution of proposed ECRR technique is to employ the data clustering and metaheuristic algorithm for allocate the large-scale devices and gateways of IoT to reduce the total congestion between them. The second contribution is to propose a queue based swarm optimization algorithm for select a better route for future route based on multiple constraints, which improves the route discovering mechanism. The proposed ECRR technique is implemented in Network Simulator (NS-2) tool and the simulation results are compared with the existing state-of-art techniques in terms of energy consumption, node lifetime, throughput, end-to-end delay, packet delivery ratio and packet overheads.