Daru Pan

Learn More
—Opportunistic networks are sparse multi-hop ad hoc networks in which nodes exploit any pair-wise contact opportunities to share and forward messages. The main challenge for this environment is that conventional routing schemes do not work properly. Among the existing Opportunistic Networks routing algorithms, the epidemic routing and probabilistic routing(More)
This paper is concerned with the problem of channel estimation for amplify-and-forward (AF) cooperative relay networks with orthogonal frequency division multiplexing (OFDM) modulation. The algorithm is based on both the least square (LS) and minimum mean square error (MMSE) technique with a superimposed training strategy. Specifically, both the source and(More)
As a preprocessing step of chest Computed Tomography (CT) images, lung segmentation is significant for the diagnosis of lung disease. The traditional watershed algorithm is sensitive to the noise and has the drawback of over-segmentation problem. This paper presents a novel image segmentation method to improve Watershed segmentation algorithm with the(More)
Due to the features of long connection delays, frequent network partitions, and topology unsteadiness, the design of opportunistic networks faces the challenge of how to effectively deliver data based only on occasional encountering of nodes, where the conventional routing schemes do not work properly. This paper proposes a hybrid probability choice routing(More)