Abstract: A data transmission method in an ad-hoc network includes: a determining step in which a data sink node determines information of a route from a source node to the data sink node and a kind of data collected by the source node; a selecting step in which the data sink node selects a target node to compress data from the source node and a relay node with respect to the source node to minimize estimated total energy consumption of the network and a kind of a compression algorithm to be used by the target node using the information of the route and the kind of data; an informing step in which the data sink node informs the target node of data compression information including the kind of a compression algorithm depending on the information of the route and the kind of data; and a compressing and transmitting step in which the target node compresses collected or received data according to the data compression information and transmits the data.

Abstract: A data transmission method in an ad-hoc network includes: a determining step in which a data sink node determines information of a route from a source node to the data sink node and a kind of data collected by the source node; a selecting step in which the data sink node selects a target node to compress data from the source node and a relay node with respect to the source node to minimize estimated total energy consumption of the network and a kind of a compression algorithm to be used by the target node using the information of the route and the kind of data; an informing step in which the data sink node informs the target node of data compression information including the kind of a compression algorithm depending on the information of the route and the kind of data; and a compressing and transmitting step in which the target node compresses collected or received data according to the data compression information and transmits the data.

Abstract: According to one disclosed embodiment, a method for efficiently scheduling short-range wireless data transmissions is described. This method may include providing beacon intervals for timed data transmission, receiving a plurality of requests for data, delaying allocation of any of the plurality of requests for data into one of the beacon intervals until a number of admitted requests for data exceeds a threshold. The method may also include allocating timeslots for pseudo-static service periods before allocating timeslots for non-pseudo static service periods and allocating timeslots for non-pseudo static service periods in descending order of relative time urgency.

Abstract: A technique to send service period allocation from a network control point to a plurality of stations using an Announce frame of a 60 GHz DBand specification. The use of the Announce frame ensures that the control point receives confirmation of the service period allocation assigned to the stations before data transfer is permitted between the stations.

Abstract: A technique to send service period allocation from a network control point to a plurality of stations using an Announce frame of a 60 GHz DBand specification. The use of the Announce frame ensures that the control point receives confirmation of the service period allocation assigned to the stations before data transfer is permitted between the stations.

Abstract: According to one disclosed embodiment, a method for efficiently scheduling short-range wireless data transmissions is described. This method may include providing beacon intervals for timed data transmission, receiving a plurality of requests for data, delaying allocation of any of the plurality of requests for data into one of the beacon intervals until a number of admitted requests for data exceeds a threshold. The method may also include allocating timeslots for pseudo-static service periods before allocating timeslots for non-pseudo static service periods and allocating timeslots for non-pseudo static service periods in descending order of relative time urgency.