A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …

The second volume of “Advancing Uncertain Combinatorics through Graphization,
Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” …

Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …

Develo** algorithms for sensor networks-and proving their correctness and performance-
requires simplifying but still realistic models. This paper surveys various models in use today …

Examining important results and analytical techniques, this graduate-level textbook is a step-
by-step presentation of the structure and function of complex networks. Using a range of …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters
deployed around strategic locations and base-stations (BSs) whose locations are relatively …

Graph theory is a fundamental branch of mathematics that examines networks composed of
nodes (vertices) and connections (edges). This paper explores the concepts of permutation …

We consider the problem of throughput-optimal scheduling in wireless networks subject to
interference constraints. We model the interference using a family of K-hop interference …

Geographic routing has been widely hailed as the most promising approach to generally
scalable wireless routing. However, the correctness of all currently proposed geographic …