—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
Mohammad A. (Amir) Khojastepour, Alireza Keshavarz...
Communication neighborhood in wireless sensor networks changes often as links break or appear. Therefore, monitoring link quality and (logical) network topology is necessary. As no...
Abstract-- `mDNS' - a hierarchical multicast session directory service architecture, which has been recently submitted to IETF editorial board for publication under Best Curre...
Network services play an important role in the Internet today. They serve as data caches for websites, servers for multiplayer games and relay nodes for Voice over IP (VoIP) conver...