The main theorem states that if K is a finite CW-complex with finite fundamental group G and universal cover homotopy equivalent to a product of spheres X, then G acts smoothly and freely on X×Sn for any n greater than or equal to the dimension of X. If the G-action on the universal cover of K is homologically trivial, then so is the action on X × Sn. Ünlü and Yalçın recently showed that any fi...

This paper investigates the disaster area communication system using relay-assisted wireless network for first responders as mobile nodes (MNs). Firstly, a novel mobility model is proposed to describe the movement pattern of MNs within a large disaster area. Secondly, we study the relay management problem of finding a minimum number of relay nodes (RNs) and their dynamic locations to cover all ...

Using mobile chargers in wireless rechargeable sensor networks is an option for charging the nodes due to the high cost of power chargers. In order to achieve some performance requirement such as coverage, it is necessary to effectively schedule the mobile chargers to serve every node in the network. We notice that nearly all previous works on mobile charger scheduling assume that the mobile ch...

This thesis is a part of a bigger research vision called Progress which aims at providing component based techniques for the development of realtime embedded systems. It starts research of the runtime structures of the Progress component model. The thesis aims at identifying necessary questions about the internal structure of virtual nodes and about the supporting mechanisms needed to run virtu...

Wireless sensor network [1] generally consists of large number of sensor nodes. The wireless sensor network can be defined as large number of small sensing self powered nodes which gather the information from the geographical area and communicate in wireless fashion with the goal of handing their processed data to the base station. These sensor nodes consist of sensing, processing and communica...

-Wireless sensor network [1] generally consists of large number of sensor nodes. The wireless sensor network can be defined as large number of small sensing self powered nodes which gather the information from the geographical area and communicate in wireless fashion with the goal of handing their processed data to the base station. These sensor nodes consist of sensing, processing and communic...

Test case generators and computational results for the maximum clique problem. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles. A strong cutting plane/branch-and-bound algorithm for node packing. A probabilistic heuristic for a computa-tionally diicult set covering problem. Two computation-ally diicult set covering problems that arise in computing t...

The problem of nding the minimum topology of multipro-cessing substrates supporting parallel execution of any given neighbourhood constrained system is proposed and possible optimal strategies are investigated based on the relationship between Barbosa's scheduling by edge reversal-SER-distributed algorithm and the minimum clique covering problem. It is shown that from any given clique covering ...

Wireless sensor nodes have the characteristics of small size, light weight, simple structure, and limited energy. They are random during deployment in monitoring area, location is uncertain after deployment. It easy to uneven node distribution, resulting dense some areas sparse areas. In area with nodes, covered repeatedly due distance between which too close. problem covering blind appears far...