A letter soup for the quality of information in sensor networks
Chatschik Bisdikian, Joel Branch, et al.
PerCom 2009
We consider a token ring local area network (LAN) with an infinite number of nodes uniformly distributed around the ring. A token that circulates around the ring at a constant speed stops to “serve” fixed length packets that are generated by the nodes. We assume that the cumulative arrival process of packets constitutes a two-dimensional Poisson process. Given a fixed point on the ring, called the origin, we obtain the first-order statistics of the interarrival times of packets at the origin in the form of their Laplace—Stieltjes transform. © 1992 IEEE
Chatschik Bisdikian, Joel Branch, et al.
PerCom 2009
Yanfeng Zhu, Qian Ma, et al.
IM 2009
Chatschik Bisdikian, Isaac Boamah, et al.
International Workshop on Mobile Commerce 2002
Mark D. Corner, Jörg Liebeherr, et al.
IEEE/ACM Transactions on Networking