1677 search results - page 211 / 336 » Traffic Models for Wireless Communication Networks |
130
click to vote
MONET
2006
15 years 3 months ago
2006
We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objec...
121
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
143
click to vote
NAS
2010
IEEE
15 years 2 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
115
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Due to the real time nature and buddy list presence information of Instant Messaging (IM) systems worms can spread over IM networks rapidly, causing severe damages, however, it...