{"action":"opened","issue":{"url":"https://api.github.com/repos/inet-framework/inet/issues/158","labels_url":"https://api.github.com/repos/inet-framework/inet/issues/158/labels{/name}","comments_url":"https://api.github.com/repos/inet-framework/inet/issues/158/comments","events_url":"https://api.github.com/repos/inet-framework/inet/issues/158/events","html_url":"https://github.com/inet-framework/inet/issues/158","id":93307137,"number":158,"title":"Feature request: Random stationary mobility with constrains","user":{"login":"esterl","id":1454535,"avatar_url":"https://avatars.githubusercontent.com/u/1454535?v=3","gravatar_id":"","url":"https://api.github.com/users/esterl","html_url":"https://github.com/esterl","followers_url":"https://api.github.com/users/esterl/followers","following_url":"https://api.github.com/users/esterl/following{/other_user}","gists_url":"https://api.github.com/users/esterl/gists{/gist_id}","starred_url":"https://api.github.com/users/esterl/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/esterl/subscriptions","organizations_url":"https://api.github.com/users/esterl/orgs","repos_url":"https://api.github.com/users/esterl/repos","events_url":"https://api.github.com/users/esterl/events{/privacy}","received_events_url":"https://api.github.com/users/esterl/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-07-06T15:29:20Z","updated_at":"2015-07-06T15:29:20Z","closed_at":null,"body":"Add the possibility of adding some constrains to the Stationary mobility model, e.g. establish a min and max distance between a pair of nodes. That way, one could ensure that the resulting network is connected.\r\n\r\nOther possible constrains could be:\r\n- The max number of nodes within another node's radius (to limit the network density)\r\n- The \"algorithm\" to grow the network, e.g. one could use preferential attachment, so that when adding a new node, the probability of choosing a previous node to be close to (within that max distance)  is derived by the number of connected nodes. Something like \"graph generating algorithms\"."}}