Message ferrying for constrained scenarios

@article{Viswanathan2005MessageFF,
  title={Message ferrying for constrained scenarios},
  author={Ramesh Viswanathan and Tiffany Jing Li and Mooi Choo Chuah},
  journal={Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks},
  year={2005},
  pages={487-489}
}
Message ferrying (MF) (Wenrui Zhao and Ammar, M.H., Proc. IEEE Workshop on Future Trends in Distrib. Computing Syst., 2003), a viable solution for routing in highly partitioned ad-hoc networks, exploits message ferries to transfer packets between disconnected nodes. The paper studies the delivery quality of service (QoS) for certain urgent messages in the constrained and the relaxed constrained MF systems. Efficient algorithms to compute near-optimal ferry routes are proposed, delay analysis is… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 21 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Fast algorithms for geometric traveling salesman problems

  • J. Bentley
  • ORSA Journal on Computing, 4:387-411, .
  • 1992
2 Excerpts

Similar Papers

Loading similar papers…