Combinatorial (or discrete) optimization is one of the most active fields in the interface of
operations research, computer science, and applied math ematics. Combinatorial …

Recently developed classes of wireless networks have blurred the distinction between the
network infrastructure and network clients. Sensor networks, for example, consist of one or …

In this paper an ant colony optimization (ACO) algorithm for the minimum connected
dominating set problem (MCDSP) is presented. The MCDSP become increasingly important …

Considering post-disaster scenarios for intelligent traffic management and damage
assessment where communication infrastructure may not be available, we advocate a …

The minimum connected dominating set (MCDS) problem is a very significant NP-hard
combinatorial optimization problem, and it has been used in many fields such as wireless …

The minimum connected dominating set problem, a variant of the classical minimum
dominating set problem, is a very significant NP-hard combinatorial optimization problem …

The minimum weighted connected dominating set problem is a significant NP-hard problem
with wide applications, and is an extension of the classical minimum dominating set …

In this dissertation, we present SALAM, a scalable anchor-free protocol for localization in
wireless sensor networks. SALAM can determine the positions of sensor nodes without any …

A wireless ad-hoc network is a combination of nodes, connected in a wireless manner and
has freedom of random movement, which spontaneously arranges its components with …

Clustering is a standard approach for achieving efficient and scalable performance in
wireless sensor networks. Clustering algorithms are mostly heuristic in nature and aim at …