International Conference Papers
Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/4
Browse
2 results
Search Results
Item Energy-Delay Constrained Minimal Relay Placement in Low Duty-Cycled Sensor Networks Under Anycast Forwarding(IEEE, 2016-09-04) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Garcia-Vidal, JorgeA constrained relay placement problem satisfying application requirements in terms of network lifetime and end-to-end (e2e) delay in Wireless Sensor Networks (WSN) is investigated in this paper. The network and the traffic are adequately modeled considering uniform node deployment and low data rate periodic traffic generation. An optimization problem is defined to obtain the minimum number of relays to be deployed, at each level of the network, in order to fulfil network duty-cycle and e2e delay constraints under anycast forwarding based on the wakeup period parameter of the duty-cycle MAC protocol. Since the optimization problem is non-convex, an alternative and efficient algorithm for relay node placement called EDC-RP (Energy-Delay Constrained Relay Placement) is introduced. The comparison of the proposed node deployment strategy with state-of-the-art relay placement methods demonstrates the gain of the heuristic in terms of deployment cost (number of relays) over other solutions while fulfilling the application constraints.Item Game Theoretical Approach for Energy-Delay Balancing in Distributed Duty-Cycled MAC Protocols of Wireless Networks(ACM, 2014-07-15) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Garcia-Vidal, Jorge; Badache, NadjibOptimizing energy consumption and end-to-end (e2e) packet delay in energy constrained distributed wireless networks is a conflicting multi-objective optimization problem. This paper investigates this trade-off from a game-theoretic perspective, where the two optimization objectives are considered as virtual game players that attempt to optimize their utility values. The cost model of each player is mapped through a generalized optimization framework onto protocol specific MAC parameters. From the optimization framework, a cooperative game is defined in which the Nash Bargaining solution assures the balance between energy consumption and e2e packet delay. For illustration, this formulation is applied to three state-of-the-art wireless sensor network MAC protocols; X-MAC, DMAC, and LMAC as representatives of preamble sampling, slotted contention-based, and frame-based MAC categories, respectively. The paper shows the effectiveness of such framework in optimizing protocol parameters that achieve a fair energy-delay performance trade-off under the application requirements in terms of initial energy budget and maximum e2e packet delay. The proposed framework is scalable with the increase in the number of nodes, as the players represent the optimization metrics instead of nodes.