This study aims to develop an efficient method to extract mangrove forests at a regional scale using remote sensing data and Geographic Information Systems (GIS) technique. A regional mangrove forests mapping method was developed based on the spectral characteristics and the topographic existence condition of mangrove forests. Landsat Enhanced Thematic Mapper plus (ETM+) and digital elevation model (DEM) were used to enhance the discrimination between mangrove forests and other different kinds of forests and vegetations to achieve the purpose of this study in the southern part of Japan. The maximum likelihood supervised classification technique was applied to map mangrove forests. The resultant mangrove forests map were further validated by using aerial photographs, topographic maps and other local vegetation maps. This study revealed that mangrove forests in the study area could be accurately mapped from integration of spectral data derived from Landsat ETM+ together with topographic information.

We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly different mobility patterns. We introduce and study the notion of relay throughput, i.e. the maximum rate at which a node can relay data from the source to the destination. Our findings include the results that the relay throughput depends on the node mobility pattern only via its (stationary) node position distribution and that a node mobility pattern that results in a uniform steady-state distribution for all nodes achieves the lowest relay throughput. Random Waypoint and Random Direction mobility models in both one and in two dimensions are studied and approximate simple expressions for the relay throughput are provided. Finally, the behavior of the relay buffer occupancy is examined for the one-dimensional Random Walk, and an explicit form of its mean value is provided in the heavy-traffic case.

Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay nodes are assumed to have a limited lifetime in the network. All nodes are moving inside a bounded region according to some random mobility model. Both closed-form expressions, and asymptotic results are provided for the packet delivery delay and the energy needed to transmit a packet from the source to its destination. Our model is validated through simulations for two mobility models (random waypoint and random direction mobility models), numerical results for the two-hop relay protocols are reported, and the performance of the two-hop routing and of the epidemic routing protocols are compared.