This paper presents an energy-efficient and coverage-preserving communication protocol which distributes a uniform energy load to the sensors in a wireless microsensor network. This protocol, called Distance-based Segmentation (DBS), is a cluster-based protocol that divides the entire network into equal-area segments and applies different clustering policies to each segment to (1) reduce total ...

Several real problems in telecommunication, transportation, and distribution industries can be well analyzed by network flow models. In revenue management, pricing plays a primary role which increases the profit generated from a limited supply of assets. Pricing decision directly affects the amount of service or product demand. Hence, in traditional maximum flow problem, we assume that the dema...

This paper provides an economic explanation of the frequent rule changes in the Formula One (F1) motor racing series. In a two-stage model, the FIA (as the organizer of the F1) rst decides whether to change the rules or not, and then the racing teams compete in a contest. It turns out that a rule change reduces the teams' performances, but also improves competitive balance between the teams. Th...

Device-to-Device (D2D) communication has recently emerged as a promising technology to improve the capacity and coverage of cellular systems. To successfully implement D2D communications underlaying a cellular network, resource allocation for D2D links plays a critical role. While most of prior resource allocation mechanisms for D2D communications have focused on interference within a single-ce...

land- phone, like mobile, internet and fax is a communication device and has network externality effect. thus as the penetration coefficient increases, the network effect improves. the transmission of information via the word of mouth is the main source of enhancing the network externalities coefficient. in this article we have investigated the factors affecting the network externality coeffici...

In this talk we present item pricing algorithms and mechanisms for revenue maximization in combinatorial auctions. We start by considering the unlimitedsupply combinatorial auction setting and present a simple algorithm [1] which achieves an O(k) approximation for the case of single-minded bidders who each want at most k items, improving on the O(k2) bound of Briest and Krysta [3]. We then show...