Label Coloring Based Beaconing Schedule in Duty-Cycled Multihop Wireless Networks

Chen, Quan; Gao, Hong; Cheng, Lianglun; Li, Yingshu

doi:10.1109/tmc.2019.2907956

Cited by 13 publications

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Otherwise, the VNFs implementation cost of node v must be taken into account. Let cap(v) denote the computing resources of the server node v ∈ V M to hold VNFs, B e represent the bandwidth resources of each link e ∈ E, and c e denote the usage costs of one unit of bandwidth at each edge e ∈ E. When data is transmitted on a link, the traffic delivery cost and transmission delay will be incurred on the link e ∈ E. In G, there is an SDN controller in charge of managing the allocation of resources for each admitted unicast request, and the above properties of each switch can be obtained by the controller by the methods as in [26], [27]. Fig.…”

Section: A Network Modelmentioning

confidence: 99%

Towards Efficient and Delay-Aware NFV-Enabled Unicasting With Adjustable Service Function Chains

Zheng

Chen

et al. 2022

IEEE Open J. Comput. Soc.

View full text Add to dashboard Cite

Section: A Network Modelmentioning

confidence: 99%

Towards Efficient and Delay-Aware NFV-Enabled Unicasting With Adjustable Service Function Chains

Zheng

Chen

et al. 2022

IEEE Open J. Comput. Soc.

View full text Add to dashboard Cite

“…We assume in this work that each node can obtain its own location information by GPS [25] or localization schemes [26,27]. By periodically exchanging beacon messages [28,29], every node can determine its one-hop neighbor nodes, and obtain their locations and data relay speeds. When a source detects an event, it generates data with the desired time deadline T setdeadline of the event.…”

Section: Network Modelmentioning

confidence: 99%

Expected Area-Based Real-Time Routing Protocol for Supporting Mobile Sinks in Wireless Sensor Networks

et al. 2022

View full text Add to dashboard Cite

To deliver real-time data within a desired time deadline, a spatiotemporal approach has been proposed in wireless sensor networks. In the approach, real-time data can be delivered with a delivery speed calculated by both the distance from a source to a static sink and the desired time deadline. In the case of a mobile sink, because the distance from a source to the sink would be dynamically changed due to its movement, real-time data cannot be delivered due to the inability to calculate a delivery speed. Thus, we propose a novel real-time routing protocol, called EAR2 (expected area-based real-time routing) for mobile sinks. Instead of the immediate distance, EAR2 considers the static distance to the expected area of a mobile sink’s location using its movement speed. To satisfy the desired time deadline, EAR2 guarantees that the total summation of the unicasting time to the expected area and the flooding time within the expected area can be smaller than the deadline. To do this, EAR2 calculates a data delivery speed by using the static distance and the unicasting time and exploits the flooding time observed from various network environments. Because EAR2 has a high flooding time and data loss problems due to a single flooding point, we propose a protocol called EAR2M with multiple flooding points, which reduces the flooding time and enhances the reliability of data transmission. We also propose two extensions of EAR2M, called EAR2M_R and EAR2M_E for efficient data transmission from a source to multiple flooding points. They aim to reduce the transmission delay and the energy consumption for efficient data transmission among multiple flooding points, respectively. Simulation results show that EAR2 improves the deadline miss ratio and the energy consumption, with averages improvements of 47.17% and 29.99% over the existing schemes, respectively. Furthermore, EAR2M with four flooding points enhances the deadline miss ratio and the energy consumption by an average of 12.69% and 131.86% over EAR2.

show abstract

Minimizing the Embedding Cost of Service Function Chains with Adjustable Order

Zheng

Chen

Wang

et al. 2022

Communications in Computer and Information Science

View full text Add to dashboard Cite

Label Coloring Based Beaconing Schedule in Duty-Cycled Multihop Wireless Networks

Cited by 13 publications

References 30 publications

Towards Efficient and Delay-Aware NFV-Enabled Unicasting With Adjustable Service Function Chains

Towards Efficient and Delay-Aware NFV-Enabled Unicasting With Adjustable Service Function Chains

Expected Area-Based Real-Time Routing Protocol for Supporting Mobile Sinks in Wireless Sensor Networks

Minimizing the Embedding Cost of Service Function Chains with Adjustable Order

Contact Info

Product

Resources

About